/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/openssl/s3_srvr.blast.10.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 11:42:32,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:42:32,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:42:32,727 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:42:32,728 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:42:32,728 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:42:32,729 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:42:32,730 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:42:32,735 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:42:32,739 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:42:32,740 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:42:32,742 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:42:32,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:42:32,744 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:42:32,745 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:42:32,746 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:42:32,747 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:42:32,747 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:42:32,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:42:32,756 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:42:32,758 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:42:32,759 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:42:32,760 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:42:32,762 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:42:32,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:42:32,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:42:32,770 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:42:32,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:42:32,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:42:32,771 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:42:32,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:42:32,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:42:32,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:42:32,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:42:32,774 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:42:32,774 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:42:32,774 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:42:32,775 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:42:32,775 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:42:32,775 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:42:32,776 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:42:32,777 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:42:32,778 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 11:42:32,786 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:42:32,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:42:32,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:42:32,787 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:42:32,787 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:42:32,787 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:42:32,787 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:42:32,787 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:42:32,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:42:32,788 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:42:32,788 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:42:32,788 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:42:32,789 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:42:32,789 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:42:32,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:42:32,789 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:42:32,789 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:42:32,789 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:42:32,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:42:32,789 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:42:32,789 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:42:32,789 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:42:32,789 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:42:32,789 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:42:32,790 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:42:32,790 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 11:42:32,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:42:33,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:42:33,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:42:33,011 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:42:33,012 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:42:33,013 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.10.i.cil-1.c [2022-04-15 11:42:33,076 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0271156fe/c390aa5a02834bd3bdd5b74891b3fd3a/FLAG23c6ba2a9 [2022-04-15 11:42:33,496 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:42:33,497 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.10.i.cil-1.c [2022-04-15 11:42:33,512 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0271156fe/c390aa5a02834bd3bdd5b74891b3fd3a/FLAG23c6ba2a9 [2022-04-15 11:42:33,816 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0271156fe/c390aa5a02834bd3bdd5b74891b3fd3a [2022-04-15 11:42:33,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:42:33,819 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:42:33,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:42:33,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:42:33,824 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:42:33,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:42:33" (1/1) ... [2022-04-15 11:42:33,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@be0119f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:42:33, skipping insertion in model container [2022-04-15 11:42:33,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:42:33" (1/1) ... [2022-04-15 11:42:33,830 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:42:33,886 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:42:34,198 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.10.i.cil-1.c[73581,73594] [2022-04-15 11:42:34,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:42:34,216 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:42:34,322 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.10.i.cil-1.c[73581,73594] [2022-04-15 11:42:34,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:42:34,348 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:42:34,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:42:34 WrapperNode [2022-04-15 11:42:34,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:42:34,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:42:34,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:42:34,350 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:42:34,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:42:34" (1/1) ... [2022-04-15 11:42:34,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:42:34" (1/1) ... [2022-04-15 11:42:34,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:42:34" (1/1) ... [2022-04-15 11:42:34,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:42:34" (1/1) ... [2022-04-15 11:42:34,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:42:34" (1/1) ... [2022-04-15 11:42:34,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:42:34" (1/1) ... [2022-04-15 11:42:34,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:42:34" (1/1) ... [2022-04-15 11:42:34,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:42:34,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:42:34,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:42:34,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:42:34,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:42:34" (1/1) ... [2022-04-15 11:42:34,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:42:34,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:42:34,483 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 11:42:34,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 11:42:34,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:42:34,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:42:34,514 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:42:34,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-15 11:42:34,514 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-15 11:42:34,514 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:42:34,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-15 11:42:34,514 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-15 11:42:34,514 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 11:42:34,514 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-15 11:42:34,514 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:42:34,515 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:42:34,515 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:42:34,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:42:34,516 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 11:42:34,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 11:42:34,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:42:34,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 11:42:34,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 11:42:34,516 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 11:42:34,516 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-15 11:42:34,516 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-15 11:42:34,516 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-15 11:42:34,516 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-15 11:42:34,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-15 11:42:34,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 11:42:34,516 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:42:34,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 11:42:34,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:42:34,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 11:42:34,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:42:34,517 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 11:42:34,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 11:42:34,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:42:34,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:42:34,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:42:34,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 11:42:34,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 11:42:34,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 11:42:34,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 11:42:34,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:42:34,680 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:42:34,681 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:42:35,445 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:42:36,028 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-15 11:42:36,028 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-15 11:42:36,038 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:42:36,044 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:42:36,044 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:42:36,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:42:36 BoogieIcfgContainer [2022-04-15 11:42:36,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:42:36,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:42:36,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:42:36,049 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:42:36,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:42:33" (1/3) ... [2022-04-15 11:42:36,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33acf676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:42:36, skipping insertion in model container [2022-04-15 11:42:36,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:42:34" (2/3) ... [2022-04-15 11:42:36,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33acf676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:42:36, skipping insertion in model container [2022-04-15 11:42:36,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:42:36" (3/3) ... [2022-04-15 11:42:36,051 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.10.i.cil-1.c [2022-04-15 11:42:36,054 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:42:36,054 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:42:36,082 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:42:36,086 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 11:42:36,087 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:42:36,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 156 states, 148 states have (on average 1.7027027027027026) internal successors, (252), 149 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 11:42:36,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 11:42:36,109 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:42:36,109 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:42:36,110 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:42:36,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:42:36,113 INFO L85 PathProgramCache]: Analyzing trace with hash -159635105, now seen corresponding path program 1 times [2022-04-15 11:42:36,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:36,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1020203730] [2022-04-15 11:42:36,125 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:42:36,126 INFO L85 PathProgramCache]: Analyzing trace with hash -159635105, now seen corresponding path program 2 times [2022-04-15 11:42:36,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:42:36,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079775086] [2022-04-15 11:42:36,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:42:36,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:42:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:36,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:42:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:36,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {166#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {159#true} is VALID [2022-04-15 11:42:36,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#true} assume true; {159#true} is VALID [2022-04-15 11:42:36,586 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {159#true} {159#true} #678#return; {159#true} is VALID [2022-04-15 11:42:36,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {159#true} call ULTIMATE.init(); {166#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:42:36,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {166#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {159#true} is VALID [2022-04-15 11:42:36,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {159#true} assume true; {159#true} is VALID [2022-04-15 11:42:36,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159#true} {159#true} #678#return; {159#true} is VALID [2022-04-15 11:42:36,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {159#true} call #t~ret161 := main(); {159#true} is VALID [2022-04-15 11:42:36,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {159#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; {159#true} is VALID [2022-04-15 11:42:36,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {159#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {159#true} is VALID [2022-04-15 11:42:36,590 INFO L272 TraceCheckUtils]: 7: Hoare triple {159#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {159#true} is VALID [2022-04-15 11:42:36,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {159#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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {164#(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; {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {164#(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; {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {164#(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)))); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {164#(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; {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,613 INFO L290 TraceCheckUtils]: 28: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,615 INFO L290 TraceCheckUtils]: 32: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,615 INFO L290 TraceCheckUtils]: 33: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,616 INFO L290 TraceCheckUtils]: 34: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,617 INFO L290 TraceCheckUtils]: 35: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,617 INFO L290 TraceCheckUtils]: 36: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,618 INFO L290 TraceCheckUtils]: 37: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,618 INFO L290 TraceCheckUtils]: 38: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,619 INFO L290 TraceCheckUtils]: 39: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,619 INFO L290 TraceCheckUtils]: 40: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,620 INFO L290 TraceCheckUtils]: 41: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,621 INFO L290 TraceCheckUtils]: 42: Hoare triple {164#(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); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:36,621 INFO L290 TraceCheckUtils]: 43: Hoare triple {164#(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); {165#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-15 11:42:36,622 INFO L290 TraceCheckUtils]: 44: Hoare triple {165#(not (= |ssl3_accept_#t~mem75| 8640))} assume 8640 == #t~mem75;havoc #t~mem75; {160#false} is VALID [2022-04-15 11:42:36,622 INFO L290 TraceCheckUtils]: 45: Hoare triple {160#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {160#false} is VALID [2022-04-15 11:42:36,625 INFO L290 TraceCheckUtils]: 46: Hoare triple {160#false} assume !(4 == ~blastFlag~0); {160#false} is VALID [2022-04-15 11:42:36,625 INFO L290 TraceCheckUtils]: 47: Hoare triple {160#false} assume 7 == ~blastFlag~0; {160#false} is VALID [2022-04-15 11:42:36,626 INFO L290 TraceCheckUtils]: 48: Hoare triple {160#false} assume !false; {160#false} is VALID [2022-04-15 11:42:36,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:42:36,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:42:36,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079775086] [2022-04-15 11:42:36,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079775086] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:36,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:36,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:42:36,638 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:42:36,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1020203730] [2022-04-15 11:42:36,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1020203730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:36,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:36,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:42:36,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704827600] [2022-04-15 11:42:36,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:42:36,643 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-15 11:42:36,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:42:36,646 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-15 11:42:36,701 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-15 11:42:36,702 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:42:36,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:36,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:42:36,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:42:36,726 INFO L87 Difference]: Start difference. First operand has 156 states, 148 states have (on average 1.7027027027027026) internal successors, (252), 149 states have internal predecessors, (252), 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 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-15 11:42:40,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:40,580 INFO L93 Difference]: Finished difference Result 424 states and 714 transitions. [2022-04-15 11:42:40,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:42:40,581 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-15 11:42:40,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:42:40,582 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-15 11:42:40,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 714 transitions. [2022-04-15 11:42:40,603 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-15 11:42:40,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 714 transitions. [2022-04-15 11:42:40,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 714 transitions. [2022-04-15 11:42:41,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 714 edges. 714 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:41,129 INFO L225 Difference]: With dead ends: 424 [2022-04-15 11:42:41,130 INFO L226 Difference]: Without dead ends: 257 [2022-04-15 11:42:41,132 INFO L912 BasicCegarLoop]: 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-15 11:42:41,135 INFO L913 BasicCegarLoop]: 154 mSDtfsCounter, 150 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:42:41,136 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 451 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-15 11:42:41,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-15 11:42:41,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 180. [2022-04-15 11:42:41,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:42:41,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand has 180 states, 175 states have (on average 1.6) internal successors, (280), 175 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:41,168 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand has 180 states, 175 states have (on average 1.6) internal successors, (280), 175 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:41,168 INFO L87 Difference]: Start difference. First operand 257 states. Second operand has 180 states, 175 states have (on average 1.6) internal successors, (280), 175 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:41,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:41,178 INFO L93 Difference]: Finished difference Result 257 states and 391 transitions. [2022-04-15 11:42:41,178 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 391 transitions. [2022-04-15 11:42:41,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:41,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:41,180 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 175 states have (on average 1.6) internal successors, (280), 175 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 257 states. [2022-04-15 11:42:41,181 INFO L87 Difference]: Start difference. First operand has 180 states, 175 states have (on average 1.6) internal successors, (280), 175 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 257 states. [2022-04-15 11:42:41,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:41,190 INFO L93 Difference]: Finished difference Result 257 states and 391 transitions. [2022-04-15 11:42:41,190 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 391 transitions. [2022-04-15 11:42:41,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:41,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:41,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:42:41,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:42:41,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 175 states have (on average 1.6) internal successors, (280), 175 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:41,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 284 transitions. [2022-04-15 11:42:41,198 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 284 transitions. Word has length 49 [2022-04-15 11:42:41,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:42:41,199 INFO L478 AbstractCegarLoop]: Abstraction has 180 states and 284 transitions. [2022-04-15 11:42:41,199 INFO L479 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-15 11:42:41,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 180 states and 284 transitions. [2022-04-15 11:42:41,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 284 edges. 284 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:41,382 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 284 transitions. [2022-04-15 11:42:41,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 11:42:41,383 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:42:41,383 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:42:41,384 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:42:41,384 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:42:41,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:42:41,384 INFO L85 PathProgramCache]: Analyzing trace with hash -855203969, now seen corresponding path program 1 times [2022-04-15 11:42:41,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:41,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [449149876] [2022-04-15 11:42:41,385 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:42:41,385 INFO L85 PathProgramCache]: Analyzing trace with hash -855203969, now seen corresponding path program 2 times [2022-04-15 11:42:41,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:42:41,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468081374] [2022-04-15 11:42:41,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:42:41,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:42:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:41,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:42:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:41,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {1900#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {1893#true} is VALID [2022-04-15 11:42:41,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {1893#true} assume true; {1893#true} is VALID [2022-04-15 11:42:41,532 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1893#true} {1893#true} #678#return; {1893#true} is VALID [2022-04-15 11:42:41,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {1893#true} call ULTIMATE.init(); {1900#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:42:41,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {1900#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {1893#true} is VALID [2022-04-15 11:42:41,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {1893#true} assume true; {1893#true} is VALID [2022-04-15 11:42:41,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1893#true} {1893#true} #678#return; {1893#true} is VALID [2022-04-15 11:42:41,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {1893#true} call #t~ret161 := main(); {1893#true} is VALID [2022-04-15 11:42:41,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {1893#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; {1893#true} is VALID [2022-04-15 11:42:41,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {1893#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1893#true} is VALID [2022-04-15 11:42:41,534 INFO L272 TraceCheckUtils]: 7: Hoare triple {1893#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1893#true} is VALID [2022-04-15 11:42:41,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {1893#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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {1898#(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; {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {1898#(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; {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {1898#(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)))); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {1898#(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; {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,542 INFO L290 TraceCheckUtils]: 21: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,543 INFO L290 TraceCheckUtils]: 23: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,544 INFO L290 TraceCheckUtils]: 25: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,544 INFO L290 TraceCheckUtils]: 26: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,544 INFO L290 TraceCheckUtils]: 27: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,545 INFO L290 TraceCheckUtils]: 28: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,545 INFO L290 TraceCheckUtils]: 29: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,546 INFO L290 TraceCheckUtils]: 30: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,546 INFO L290 TraceCheckUtils]: 31: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,546 INFO L290 TraceCheckUtils]: 32: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,547 INFO L290 TraceCheckUtils]: 34: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,548 INFO L290 TraceCheckUtils]: 35: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,548 INFO L290 TraceCheckUtils]: 36: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,548 INFO L290 TraceCheckUtils]: 37: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,549 INFO L290 TraceCheckUtils]: 38: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,549 INFO L290 TraceCheckUtils]: 39: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,550 INFO L290 TraceCheckUtils]: 40: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,550 INFO L290 TraceCheckUtils]: 41: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,553 INFO L290 TraceCheckUtils]: 42: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,553 INFO L290 TraceCheckUtils]: 43: Hoare triple {1898#(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); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:41,554 INFO L290 TraceCheckUtils]: 44: Hoare triple {1898#(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); {1899#(not (= |ssl3_accept_#t~mem76| 8641))} is VALID [2022-04-15 11:42:41,556 INFO L290 TraceCheckUtils]: 45: Hoare triple {1899#(not (= |ssl3_accept_#t~mem76| 8641))} assume 8641 == #t~mem76;havoc #t~mem76; {1894#false} is VALID [2022-04-15 11:42:41,556 INFO L290 TraceCheckUtils]: 46: Hoare triple {1894#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {1894#false} is VALID [2022-04-15 11:42:41,556 INFO L290 TraceCheckUtils]: 47: Hoare triple {1894#false} assume !(4 == ~blastFlag~0); {1894#false} is VALID [2022-04-15 11:42:41,556 INFO L290 TraceCheckUtils]: 48: Hoare triple {1894#false} assume 7 == ~blastFlag~0; {1894#false} is VALID [2022-04-15 11:42:41,556 INFO L290 TraceCheckUtils]: 49: Hoare triple {1894#false} assume !false; {1894#false} is VALID [2022-04-15 11:42:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:42:41,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:42:41,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468081374] [2022-04-15 11:42:41,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468081374] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:41,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:41,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:42:41,557 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:42:41,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [449149876] [2022-04-15 11:42:41,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [449149876] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:41,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:41,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:42:41,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228973202] [2022-04-15 11:42:41,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:42:41,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-15 11:42:41,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:42:41,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:41,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:41,594 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:42:41,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:41,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:42:41,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:42:41,595 INFO L87 Difference]: Start difference. First operand 180 states and 284 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:46,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:46,002 INFO L93 Difference]: Finished difference Result 461 states and 729 transitions. [2022-04-15 11:42:46,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:42:46,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-15 11:42:46,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:42:46,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:46,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2022-04-15 11:42:46,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:46,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2022-04-15 11:42:46,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 583 transitions. [2022-04-15 11:42:46,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 583 edges. 583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:46,422 INFO L225 Difference]: With dead ends: 461 [2022-04-15 11:42:46,422 INFO L226 Difference]: Without dead ends: 296 [2022-04-15 11:42:46,423 INFO L912 BasicCegarLoop]: 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-15 11:42:46,424 INFO L913 BasicCegarLoop]: 123 mSDtfsCounter, 117 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:42:46,424 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 350 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-15 11:42:46,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-04-15 11:42:46,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 220. [2022-04-15 11:42:46,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:42:46,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 296 states. Second operand has 220 states, 215 states have (on average 1.6465116279069767) internal successors, (354), 215 states have internal predecessors, (354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:46,440 INFO L74 IsIncluded]: Start isIncluded. First operand 296 states. Second operand has 220 states, 215 states have (on average 1.6465116279069767) internal successors, (354), 215 states have internal predecessors, (354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:46,441 INFO L87 Difference]: Start difference. First operand 296 states. Second operand has 220 states, 215 states have (on average 1.6465116279069767) internal successors, (354), 215 states have internal predecessors, (354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:46,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:46,454 INFO L93 Difference]: Finished difference Result 296 states and 463 transitions. [2022-04-15 11:42:46,454 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 463 transitions. [2022-04-15 11:42:46,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:46,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:46,455 INFO L74 IsIncluded]: Start isIncluded. First operand has 220 states, 215 states have (on average 1.6465116279069767) internal successors, (354), 215 states have internal predecessors, (354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 296 states. [2022-04-15 11:42:46,456 INFO L87 Difference]: Start difference. First operand has 220 states, 215 states have (on average 1.6465116279069767) internal successors, (354), 215 states have internal predecessors, (354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 296 states. [2022-04-15 11:42:46,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:46,469 INFO L93 Difference]: Finished difference Result 296 states and 463 transitions. [2022-04-15 11:42:46,470 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 463 transitions. [2022-04-15 11:42:46,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:46,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:46,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:42:46,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:42:46,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 215 states have (on average 1.6465116279069767) internal successors, (354), 215 states have internal predecessors, (354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:46,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 358 transitions. [2022-04-15 11:42:46,487 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 358 transitions. Word has length 50 [2022-04-15 11:42:46,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:42:46,488 INFO L478 AbstractCegarLoop]: Abstraction has 220 states and 358 transitions. [2022-04-15 11:42:46,488 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:46,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 220 states and 358 transitions. [2022-04-15 11:42:46,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 358 edges. 358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:46,724 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 358 transitions. [2022-04-15 11:42:46,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-15 11:42:46,726 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:42:46,726 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:42:46,726 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:42:46,726 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:42:46,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:42:46,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1284051237, now seen corresponding path program 1 times [2022-04-15 11:42:46,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:46,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1586154599] [2022-04-15 11:42:46,775 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:42:46,775 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:42:46,775 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:42:46,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1284051237, now seen corresponding path program 2 times [2022-04-15 11:42:46,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:42:46,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24447976] [2022-04-15 11:42:46,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:42:46,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:42:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:46,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:42:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:46,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {3866#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {3859#true} is VALID [2022-04-15 11:42:46,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {3859#true} assume true; {3859#true} is VALID [2022-04-15 11:42:46,921 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3859#true} {3859#true} #678#return; {3859#true} is VALID [2022-04-15 11:42:46,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {3859#true} call ULTIMATE.init(); {3866#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:42:46,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {3866#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {3859#true} is VALID [2022-04-15 11:42:46,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {3859#true} assume true; {3859#true} is VALID [2022-04-15 11:42:46,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3859#true} {3859#true} #678#return; {3859#true} is VALID [2022-04-15 11:42:46,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {3859#true} call #t~ret161 := main(); {3859#true} is VALID [2022-04-15 11:42:46,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {3859#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; {3859#true} is VALID [2022-04-15 11:42:46,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {3859#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {3859#true} is VALID [2022-04-15 11:42:46,924 INFO L272 TraceCheckUtils]: 7: Hoare triple {3859#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3859#true} is VALID [2022-04-15 11:42:46,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {3859#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); {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:46,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {3864#(= 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; {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:46,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {3864#(= 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; {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:46,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {3864#(= 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)))); {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:46,936 INFO L290 TraceCheckUtils]: 12: Hoare triple {3864#(= 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); {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:46,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {3864#(= 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; {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:46,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:46,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {3864#(= 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); {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:46,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {3864#(= 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); {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:46,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {3864#(= 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); {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:46,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {3864#(= 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); {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:46,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {3864#(= 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); {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:46,941 INFO L290 TraceCheckUtils]: 20: Hoare triple {3864#(= 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); {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:46,941 INFO L290 TraceCheckUtils]: 21: Hoare triple {3864#(= 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); {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:46,942 INFO L290 TraceCheckUtils]: 22: Hoare triple {3864#(= 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); {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:46,950 INFO L290 TraceCheckUtils]: 23: Hoare triple {3864#(= 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); {3865#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-15 11:42:46,951 INFO L290 TraceCheckUtils]: 24: Hoare triple {3865#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,951 INFO L290 TraceCheckUtils]: 25: Hoare triple {3860#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,951 INFO L290 TraceCheckUtils]: 26: Hoare triple {3860#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,951 INFO L290 TraceCheckUtils]: 27: Hoare triple {3860#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,952 INFO L290 TraceCheckUtils]: 28: Hoare triple {3860#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,952 INFO L290 TraceCheckUtils]: 29: Hoare triple {3860#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,952 INFO L290 TraceCheckUtils]: 30: Hoare triple {3860#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,952 INFO L290 TraceCheckUtils]: 31: Hoare triple {3860#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,952 INFO L290 TraceCheckUtils]: 32: Hoare triple {3860#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,952 INFO L290 TraceCheckUtils]: 33: Hoare triple {3860#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,952 INFO L290 TraceCheckUtils]: 34: Hoare triple {3860#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,952 INFO L290 TraceCheckUtils]: 35: Hoare triple {3860#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,952 INFO L290 TraceCheckUtils]: 36: Hoare triple {3860#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,953 INFO L290 TraceCheckUtils]: 37: Hoare triple {3860#false} assume 8448 == #t~mem68;havoc #t~mem68; {3860#false} is VALID [2022-04-15 11:42:46,953 INFO L290 TraceCheckUtils]: 38: Hoare triple {3860#false} assume !(~num1~0 > 0); {3860#false} is VALID [2022-04-15 11:42:46,953 INFO L290 TraceCheckUtils]: 39: Hoare triple {3860#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; {3860#false} is VALID [2022-04-15 11:42:46,953 INFO L290 TraceCheckUtils]: 40: Hoare triple {3860#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); {3860#false} is VALID [2022-04-15 11:42:46,953 INFO L290 TraceCheckUtils]: 41: Hoare triple {3860#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {3860#false} is VALID [2022-04-15 11:42:46,953 INFO L290 TraceCheckUtils]: 42: Hoare triple {3860#false} ~skip~0 := 0; {3860#false} is VALID [2022-04-15 11:42:46,953 INFO L290 TraceCheckUtils]: 43: Hoare triple {3860#false} assume !false; {3860#false} is VALID [2022-04-15 11:42:46,953 INFO L290 TraceCheckUtils]: 44: Hoare triple {3860#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); {3860#false} is VALID [2022-04-15 11:42:46,954 INFO L290 TraceCheckUtils]: 45: Hoare triple {3860#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,954 INFO L290 TraceCheckUtils]: 46: Hoare triple {3860#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,954 INFO L290 TraceCheckUtils]: 47: Hoare triple {3860#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,954 INFO L290 TraceCheckUtils]: 48: Hoare triple {3860#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,954 INFO L290 TraceCheckUtils]: 49: Hoare triple {3860#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,954 INFO L290 TraceCheckUtils]: 50: Hoare triple {3860#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,954 INFO L290 TraceCheckUtils]: 51: Hoare triple {3860#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,954 INFO L290 TraceCheckUtils]: 52: Hoare triple {3860#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,954 INFO L290 TraceCheckUtils]: 53: Hoare triple {3860#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,954 INFO L290 TraceCheckUtils]: 54: Hoare triple {3860#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,955 INFO L290 TraceCheckUtils]: 55: Hoare triple {3860#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,955 INFO L290 TraceCheckUtils]: 56: Hoare triple {3860#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,955 INFO L290 TraceCheckUtils]: 57: Hoare triple {3860#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,955 INFO L290 TraceCheckUtils]: 58: Hoare triple {3860#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,955 INFO L290 TraceCheckUtils]: 59: Hoare triple {3860#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,955 INFO L290 TraceCheckUtils]: 60: Hoare triple {3860#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,955 INFO L290 TraceCheckUtils]: 61: Hoare triple {3860#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,955 INFO L290 TraceCheckUtils]: 62: Hoare triple {3860#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,955 INFO L290 TraceCheckUtils]: 63: Hoare triple {3860#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,956 INFO L290 TraceCheckUtils]: 64: Hoare triple {3860#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,956 INFO L290 TraceCheckUtils]: 65: Hoare triple {3860#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,956 INFO L290 TraceCheckUtils]: 66: Hoare triple {3860#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,956 INFO L290 TraceCheckUtils]: 67: Hoare triple {3860#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,956 INFO L290 TraceCheckUtils]: 68: Hoare triple {3860#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,956 INFO L290 TraceCheckUtils]: 69: Hoare triple {3860#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,956 INFO L290 TraceCheckUtils]: 70: Hoare triple {3860#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,956 INFO L290 TraceCheckUtils]: 71: Hoare triple {3860#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,956 INFO L290 TraceCheckUtils]: 72: Hoare triple {3860#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-15 11:42:46,956 INFO L290 TraceCheckUtils]: 73: Hoare triple {3860#false} assume 8640 == #t~mem75;havoc #t~mem75; {3860#false} is VALID [2022-04-15 11:42:46,957 INFO L290 TraceCheckUtils]: 74: Hoare triple {3860#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {3860#false} is VALID [2022-04-15 11:42:46,957 INFO L290 TraceCheckUtils]: 75: Hoare triple {3860#false} assume !(4 == ~blastFlag~0); {3860#false} is VALID [2022-04-15 11:42:46,957 INFO L290 TraceCheckUtils]: 76: Hoare triple {3860#false} assume 7 == ~blastFlag~0; {3860#false} is VALID [2022-04-15 11:42:46,957 INFO L290 TraceCheckUtils]: 77: Hoare triple {3860#false} assume !false; {3860#false} is VALID [2022-04-15 11:42:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-15 11:42:46,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:42:46,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24447976] [2022-04-15 11:42:46,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24447976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:46,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:46,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:42:46,958 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:42:46,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1586154599] [2022-04-15 11:42:46,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1586154599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:46,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:46,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:42:46,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243885680] [2022-04-15 11:42:46,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:42:46,959 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 78 [2022-04-15 11:42:46,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:42:46,959 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-15 11:42:47,001 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-15 11:42:47,001 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:42:47,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:47,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:42:47,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:42:47,002 INFO L87 Difference]: Start difference. First operand 220 states and 358 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-15 11:42:52,384 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:42:53,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:53,272 INFO L93 Difference]: Finished difference Result 453 states and 738 transitions. [2022-04-15 11:42:53,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:42:53,273 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 78 [2022-04-15 11:42:53,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:42:53,273 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-15 11:42:53,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 444 transitions. [2022-04-15 11:42:53,276 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-15 11:42:53,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 444 transitions. [2022-04-15 11:42:53,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 444 transitions. [2022-04-15 11:42:53,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 444 edges. 444 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:53,560 INFO L225 Difference]: With dead ends: 453 [2022-04-15 11:42:53,560 INFO L226 Difference]: Without dead ends: 248 [2022-04-15 11:42:53,561 INFO L912 BasicCegarLoop]: 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-15 11:42:53,562 INFO L913 BasicCegarLoop]: 182 mSDtfsCounter, 22 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:42:53,562 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 469 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:42:53,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-04-15 11:42:53,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 231. [2022-04-15 11:42:53,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:42:53,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 248 states. Second operand has 231 states, 226 states have (on average 1.6504424778761062) internal successors, (373), 226 states have internal predecessors, (373), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:53,571 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand has 231 states, 226 states have (on average 1.6504424778761062) internal successors, (373), 226 states have internal predecessors, (373), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:53,572 INFO L87 Difference]: Start difference. First operand 248 states. Second operand has 231 states, 226 states have (on average 1.6504424778761062) internal successors, (373), 226 states have internal predecessors, (373), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:53,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:53,577 INFO L93 Difference]: Finished difference Result 248 states and 398 transitions. [2022-04-15 11:42:53,577 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 398 transitions. [2022-04-15 11:42:53,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:53,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:53,578 INFO L74 IsIncluded]: Start isIncluded. First operand has 231 states, 226 states have (on average 1.6504424778761062) internal successors, (373), 226 states have internal predecessors, (373), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 248 states. [2022-04-15 11:42:53,579 INFO L87 Difference]: Start difference. First operand has 231 states, 226 states have (on average 1.6504424778761062) internal successors, (373), 226 states have internal predecessors, (373), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 248 states. [2022-04-15 11:42:53,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:53,584 INFO L93 Difference]: Finished difference Result 248 states and 398 transitions. [2022-04-15 11:42:53,584 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 398 transitions. [2022-04-15 11:42:53,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:53,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:53,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:42:53,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:42:53,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 226 states have (on average 1.6504424778761062) internal successors, (373), 226 states have internal predecessors, (373), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 377 transitions. [2022-04-15 11:42:53,590 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 377 transitions. Word has length 78 [2022-04-15 11:42:53,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:42:53,590 INFO L478 AbstractCegarLoop]: Abstraction has 231 states and 377 transitions. [2022-04-15 11:42:53,590 INFO L479 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-15 11:42:53,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 231 states and 377 transitions. [2022-04-15 11:42:53,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 377 edges. 377 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:53,845 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 377 transitions. [2022-04-15 11:42:53,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 11:42:53,846 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:42:53,846 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:42:53,846 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:42:53,846 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:42:53,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:42:53,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1385756996, now seen corresponding path program 1 times [2022-04-15 11:42:53,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:53,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [202825917] [2022-04-15 11:42:53,891 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:42:53,892 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:42:53,892 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:42:53,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1385756996, now seen corresponding path program 2 times [2022-04-15 11:42:53,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:42:53,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472598253] [2022-04-15 11:42:53,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:42:53,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:42:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:54,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:42:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:54,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {5742#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {5735#true} is VALID [2022-04-15 11:42:54,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {5735#true} assume true; {5735#true} is VALID [2022-04-15 11:42:54,039 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5735#true} {5735#true} #678#return; {5735#true} is VALID [2022-04-15 11:42:54,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {5735#true} call ULTIMATE.init(); {5742#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:42:54,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {5742#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {5735#true} is VALID [2022-04-15 11:42:54,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {5735#true} assume true; {5735#true} is VALID [2022-04-15 11:42:54,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5735#true} {5735#true} #678#return; {5735#true} is VALID [2022-04-15 11:42:54,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {5735#true} call #t~ret161 := main(); {5735#true} is VALID [2022-04-15 11:42:54,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {5735#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; {5735#true} is VALID [2022-04-15 11:42:54,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {5735#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {5735#true} is VALID [2022-04-15 11:42:54,040 INFO L272 TraceCheckUtils]: 7: Hoare triple {5735#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5735#true} is VALID [2022-04-15 11:42:54,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {5735#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); {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:54,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:54,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:54,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:54,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:54,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:54,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:54,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {5740#(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); {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:54,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {5740#(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); {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:54,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {5740#(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); {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:54,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {5740#(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); {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:54,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {5740#(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); {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:54,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {5740#(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); {5741#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-15 11:42:54,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {5741#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {5736#false} is VALID [2022-04-15 11:42:54,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {5736#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; {5736#false} is VALID [2022-04-15 11:42:54,048 INFO L290 TraceCheckUtils]: 23: Hoare triple {5736#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); {5736#false} is VALID [2022-04-15 11:42:54,048 INFO L290 TraceCheckUtils]: 24: Hoare triple {5736#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); {5736#false} is VALID [2022-04-15 11:42:54,048 INFO L290 TraceCheckUtils]: 25: Hoare triple {5736#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {5736#false} is VALID [2022-04-15 11:42:54,048 INFO L290 TraceCheckUtils]: 26: Hoare triple {5736#false} ~skip~0 := 0; {5736#false} is VALID [2022-04-15 11:42:54,048 INFO L290 TraceCheckUtils]: 27: Hoare triple {5736#false} assume !false; {5736#false} is VALID [2022-04-15 11:42:54,048 INFO L290 TraceCheckUtils]: 28: Hoare triple {5736#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); {5736#false} is VALID [2022-04-15 11:42:54,049 INFO L290 TraceCheckUtils]: 29: Hoare triple {5736#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,049 INFO L290 TraceCheckUtils]: 30: Hoare triple {5736#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,049 INFO L290 TraceCheckUtils]: 31: Hoare triple {5736#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {5736#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,049 INFO L290 TraceCheckUtils]: 33: Hoare triple {5736#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,049 INFO L290 TraceCheckUtils]: 34: Hoare triple {5736#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,049 INFO L290 TraceCheckUtils]: 35: Hoare triple {5736#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,049 INFO L290 TraceCheckUtils]: 36: Hoare triple {5736#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,049 INFO L290 TraceCheckUtils]: 37: Hoare triple {5736#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,049 INFO L290 TraceCheckUtils]: 38: Hoare triple {5736#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,049 INFO L290 TraceCheckUtils]: 39: Hoare triple {5736#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,050 INFO L290 TraceCheckUtils]: 40: Hoare triple {5736#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,050 INFO L290 TraceCheckUtils]: 41: Hoare triple {5736#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,050 INFO L290 TraceCheckUtils]: 42: Hoare triple {5736#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,050 INFO L290 TraceCheckUtils]: 43: Hoare triple {5736#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,050 INFO L290 TraceCheckUtils]: 44: Hoare triple {5736#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,050 INFO L290 TraceCheckUtils]: 45: Hoare triple {5736#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,050 INFO L290 TraceCheckUtils]: 46: Hoare triple {5736#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,050 INFO L290 TraceCheckUtils]: 47: Hoare triple {5736#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,050 INFO L290 TraceCheckUtils]: 48: Hoare triple {5736#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,050 INFO L290 TraceCheckUtils]: 49: Hoare triple {5736#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,051 INFO L290 TraceCheckUtils]: 50: Hoare triple {5736#false} assume 8448 == #t~mem68;havoc #t~mem68; {5736#false} is VALID [2022-04-15 11:42:54,051 INFO L290 TraceCheckUtils]: 51: Hoare triple {5736#false} assume !(~num1~0 > 0); {5736#false} is VALID [2022-04-15 11:42:54,051 INFO L290 TraceCheckUtils]: 52: Hoare triple {5736#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; {5736#false} is VALID [2022-04-15 11:42:54,051 INFO L290 TraceCheckUtils]: 53: Hoare triple {5736#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); {5736#false} is VALID [2022-04-15 11:42:54,051 INFO L290 TraceCheckUtils]: 54: Hoare triple {5736#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {5736#false} is VALID [2022-04-15 11:42:54,051 INFO L290 TraceCheckUtils]: 55: Hoare triple {5736#false} ~skip~0 := 0; {5736#false} is VALID [2022-04-15 11:42:54,051 INFO L290 TraceCheckUtils]: 56: Hoare triple {5736#false} assume !false; {5736#false} is VALID [2022-04-15 11:42:54,051 INFO L290 TraceCheckUtils]: 57: Hoare triple {5736#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); {5736#false} is VALID [2022-04-15 11:42:54,051 INFO L290 TraceCheckUtils]: 58: Hoare triple {5736#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,051 INFO L290 TraceCheckUtils]: 59: Hoare triple {5736#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,052 INFO L290 TraceCheckUtils]: 60: Hoare triple {5736#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,052 INFO L290 TraceCheckUtils]: 61: Hoare triple {5736#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,052 INFO L290 TraceCheckUtils]: 62: Hoare triple {5736#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,052 INFO L290 TraceCheckUtils]: 63: Hoare triple {5736#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,052 INFO L290 TraceCheckUtils]: 64: Hoare triple {5736#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,052 INFO L290 TraceCheckUtils]: 65: Hoare triple {5736#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,052 INFO L290 TraceCheckUtils]: 66: Hoare triple {5736#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,052 INFO L290 TraceCheckUtils]: 67: Hoare triple {5736#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,052 INFO L290 TraceCheckUtils]: 68: Hoare triple {5736#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,052 INFO L290 TraceCheckUtils]: 69: Hoare triple {5736#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,052 INFO L290 TraceCheckUtils]: 70: Hoare triple {5736#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,053 INFO L290 TraceCheckUtils]: 71: Hoare triple {5736#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,053 INFO L290 TraceCheckUtils]: 72: Hoare triple {5736#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,053 INFO L290 TraceCheckUtils]: 73: Hoare triple {5736#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,053 INFO L290 TraceCheckUtils]: 74: Hoare triple {5736#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,053 INFO L290 TraceCheckUtils]: 75: Hoare triple {5736#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,053 INFO L290 TraceCheckUtils]: 76: Hoare triple {5736#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,053 INFO L290 TraceCheckUtils]: 77: Hoare triple {5736#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,053 INFO L290 TraceCheckUtils]: 78: Hoare triple {5736#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,053 INFO L290 TraceCheckUtils]: 79: Hoare triple {5736#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,053 INFO L290 TraceCheckUtils]: 80: Hoare triple {5736#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,053 INFO L290 TraceCheckUtils]: 81: Hoare triple {5736#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,054 INFO L290 TraceCheckUtils]: 82: Hoare triple {5736#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,054 INFO L290 TraceCheckUtils]: 83: Hoare triple {5736#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,054 INFO L290 TraceCheckUtils]: 84: Hoare triple {5736#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,054 INFO L290 TraceCheckUtils]: 85: Hoare triple {5736#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-15 11:42:54,054 INFO L290 TraceCheckUtils]: 86: Hoare triple {5736#false} assume 8640 == #t~mem75;havoc #t~mem75; {5736#false} is VALID [2022-04-15 11:42:54,054 INFO L290 TraceCheckUtils]: 87: Hoare triple {5736#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {5736#false} is VALID [2022-04-15 11:42:54,054 INFO L290 TraceCheckUtils]: 88: Hoare triple {5736#false} assume !(4 == ~blastFlag~0); {5736#false} is VALID [2022-04-15 11:42:54,054 INFO L290 TraceCheckUtils]: 89: Hoare triple {5736#false} assume 7 == ~blastFlag~0; {5736#false} is VALID [2022-04-15 11:42:54,054 INFO L290 TraceCheckUtils]: 90: Hoare triple {5736#false} assume !false; {5736#false} is VALID [2022-04-15 11:42:54,055 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:42:54,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:42:54,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472598253] [2022-04-15 11:42:54,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472598253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:54,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:54,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:42:54,055 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:42:54,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [202825917] [2022-04-15 11:42:54,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [202825917] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:54,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:54,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:42:54,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356772283] [2022-04-15 11:42:54,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:42:54,056 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 91 [2022-04-15 11:42:54,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:42:54,057 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-15 11:42:54,103 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-15 11:42:54,104 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:42:54,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:54,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:42:54,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:42:54,104 INFO L87 Difference]: Start difference. First operand 231 states and 377 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-15 11:42:55,691 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:42:57,052 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-15 11:43:01,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:01,606 INFO L93 Difference]: Finished difference Result 552 states and 894 transitions. [2022-04-15 11:43:01,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:43:01,606 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 91 [2022-04-15 11:43:01,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:43:01,607 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-15 11:43:01,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 582 transitions. [2022-04-15 11:43:01,611 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-15 11:43:01,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 582 transitions. [2022-04-15 11:43:01,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 582 transitions. [2022-04-15 11:43:01,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 582 edges. 582 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:02,012 INFO L225 Difference]: With dead ends: 552 [2022-04-15 11:43:02,012 INFO L226 Difference]: Without dead ends: 347 [2022-04-15 11:43:02,012 INFO L912 BasicCegarLoop]: 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-15 11:43:02,013 INFO L913 BasicCegarLoop]: 252 mSDtfsCounter, 140 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:43:02,013 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 608 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-15 11:43:02,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-04-15 11:43:02,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 247. [2022-04-15 11:43:02,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:43:02,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 347 states. Second operand has 247 states, 242 states have (on average 1.640495867768595) internal successors, (397), 242 states have internal predecessors, (397), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:02,027 INFO L74 IsIncluded]: Start isIncluded. First operand 347 states. Second operand has 247 states, 242 states have (on average 1.640495867768595) internal successors, (397), 242 states have internal predecessors, (397), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:02,027 INFO L87 Difference]: Start difference. First operand 347 states. Second operand has 247 states, 242 states have (on average 1.640495867768595) internal successors, (397), 242 states have internal predecessors, (397), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:02,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:02,033 INFO L93 Difference]: Finished difference Result 347 states and 552 transitions. [2022-04-15 11:43:02,033 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 552 transitions. [2022-04-15 11:43:02,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:02,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:02,034 INFO L74 IsIncluded]: Start isIncluded. First operand has 247 states, 242 states have (on average 1.640495867768595) internal successors, (397), 242 states have internal predecessors, (397), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 347 states. [2022-04-15 11:43:02,034 INFO L87 Difference]: Start difference. First operand has 247 states, 242 states have (on average 1.640495867768595) internal successors, (397), 242 states have internal predecessors, (397), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 347 states. [2022-04-15 11:43:02,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:02,044 INFO L93 Difference]: Finished difference Result 347 states and 552 transitions. [2022-04-15 11:43:02,044 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 552 transitions. [2022-04-15 11:43:02,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:02,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:02,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:43:02,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:43:02,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 242 states have (on average 1.640495867768595) internal successors, (397), 242 states have internal predecessors, (397), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:02,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 401 transitions. [2022-04-15 11:43:02,049 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 401 transitions. Word has length 91 [2022-04-15 11:43:02,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:43:02,049 INFO L478 AbstractCegarLoop]: Abstraction has 247 states and 401 transitions. [2022-04-15 11:43:02,049 INFO L479 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-15 11:43:02,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 247 states and 401 transitions. [2022-04-15 11:43:02,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 401 edges. 401 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:02,308 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 401 transitions. [2022-04-15 11:43:02,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-15 11:43:02,309 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:43:02,309 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:43:02,309 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:43:02,309 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:43:02,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:43:02,310 INFO L85 PathProgramCache]: Analyzing trace with hash 754171252, now seen corresponding path program 1 times [2022-04-15 11:43:02,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:02,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1983177905] [2022-04-15 11:43:02,364 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:43:02,364 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:43:02,364 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:43:02,364 INFO L85 PathProgramCache]: Analyzing trace with hash 754171252, now seen corresponding path program 2 times [2022-04-15 11:43:02,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:43:02,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939799266] [2022-04-15 11:43:02,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:43:02,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:43:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:02,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:43:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:02,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {8046#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {8039#true} is VALID [2022-04-15 11:43:02,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {8039#true} assume true; {8039#true} is VALID [2022-04-15 11:43:02,496 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8039#true} {8039#true} #678#return; {8039#true} is VALID [2022-04-15 11:43:02,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {8039#true} call ULTIMATE.init(); {8046#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:43:02,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {8046#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {8039#true} is VALID [2022-04-15 11:43:02,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {8039#true} assume true; {8039#true} is VALID [2022-04-15 11:43:02,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8039#true} {8039#true} #678#return; {8039#true} is VALID [2022-04-15 11:43:02,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {8039#true} call #t~ret161 := main(); {8039#true} is VALID [2022-04-15 11:43:02,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {8039#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; {8039#true} is VALID [2022-04-15 11:43:02,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {8039#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {8039#true} is VALID [2022-04-15 11:43:02,497 INFO L272 TraceCheckUtils]: 7: Hoare triple {8039#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {8039#true} is VALID [2022-04-15 11:43:02,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {8039#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); {8044#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:02,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {8044#(= 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; {8044#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:02,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {8044#(= 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; {8044#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:02,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {8044#(= 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)))); {8044#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:02,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {8044#(= 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); {8044#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:02,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {8044#(= 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; {8044#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:02,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {8044#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {8044#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:02,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {8044#(= 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); {8045#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-15 11:43:02,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {8045#(= 8464 |ssl3_accept_#t~mem47|)} assume 12292 == #t~mem47;havoc #t~mem47; {8040#false} is VALID [2022-04-15 11:43:02,502 INFO L290 TraceCheckUtils]: 17: Hoare triple {8040#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,503 INFO L290 TraceCheckUtils]: 18: Hoare triple {8040#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {8040#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {8040#false} is VALID [2022-04-15 11:43:02,504 INFO L290 TraceCheckUtils]: 20: Hoare triple {8040#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {8040#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); {8040#false} is VALID [2022-04-15 11:43:02,505 INFO L290 TraceCheckUtils]: 22: Hoare triple {8040#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {8040#false} is VALID [2022-04-15 11:43:02,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {8040#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); {8040#false} is VALID [2022-04-15 11:43:02,505 INFO L290 TraceCheckUtils]: 24: Hoare triple {8040#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); {8040#false} is VALID [2022-04-15 11:43:02,505 INFO L290 TraceCheckUtils]: 25: Hoare triple {8040#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); {8040#false} is VALID [2022-04-15 11:43:02,505 INFO L290 TraceCheckUtils]: 26: Hoare triple {8040#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {8040#false} is VALID [2022-04-15 11:43:02,506 INFO L290 TraceCheckUtils]: 27: Hoare triple {8040#false} ~skip~0 := 0; {8040#false} is VALID [2022-04-15 11:43:02,506 INFO L290 TraceCheckUtils]: 28: Hoare triple {8040#false} assume !false; {8040#false} is VALID [2022-04-15 11:43:02,506 INFO L290 TraceCheckUtils]: 29: Hoare triple {8040#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); {8040#false} is VALID [2022-04-15 11:43:02,506 INFO L290 TraceCheckUtils]: 30: Hoare triple {8040#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,506 INFO L290 TraceCheckUtils]: 31: Hoare triple {8040#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,506 INFO L290 TraceCheckUtils]: 32: Hoare triple {8040#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,506 INFO L290 TraceCheckUtils]: 33: Hoare triple {8040#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,506 INFO L290 TraceCheckUtils]: 34: Hoare triple {8040#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,506 INFO L290 TraceCheckUtils]: 35: Hoare triple {8040#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,506 INFO L290 TraceCheckUtils]: 36: Hoare triple {8040#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,506 INFO L290 TraceCheckUtils]: 37: Hoare triple {8040#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,506 INFO L290 TraceCheckUtils]: 38: Hoare triple {8040#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,507 INFO L290 TraceCheckUtils]: 39: Hoare triple {8040#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,507 INFO L290 TraceCheckUtils]: 40: Hoare triple {8040#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,507 INFO L290 TraceCheckUtils]: 41: Hoare triple {8040#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,507 INFO L290 TraceCheckUtils]: 42: Hoare triple {8040#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,507 INFO L290 TraceCheckUtils]: 43: Hoare triple {8040#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,507 INFO L290 TraceCheckUtils]: 44: Hoare triple {8040#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,507 INFO L290 TraceCheckUtils]: 45: Hoare triple {8040#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,507 INFO L290 TraceCheckUtils]: 46: Hoare triple {8040#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,507 INFO L290 TraceCheckUtils]: 47: Hoare triple {8040#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,507 INFO L290 TraceCheckUtils]: 48: Hoare triple {8040#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,507 INFO L290 TraceCheckUtils]: 49: Hoare triple {8040#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,508 INFO L290 TraceCheckUtils]: 50: Hoare triple {8040#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,508 INFO L290 TraceCheckUtils]: 51: Hoare triple {8040#false} assume 8448 == #t~mem68;havoc #t~mem68; {8040#false} is VALID [2022-04-15 11:43:02,508 INFO L290 TraceCheckUtils]: 52: Hoare triple {8040#false} assume !(~num1~0 > 0); {8040#false} is VALID [2022-04-15 11:43:02,508 INFO L290 TraceCheckUtils]: 53: Hoare triple {8040#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; {8040#false} is VALID [2022-04-15 11:43:02,512 INFO L290 TraceCheckUtils]: 54: Hoare triple {8040#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); {8040#false} is VALID [2022-04-15 11:43:02,512 INFO L290 TraceCheckUtils]: 55: Hoare triple {8040#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {8040#false} is VALID [2022-04-15 11:43:02,512 INFO L290 TraceCheckUtils]: 56: Hoare triple {8040#false} ~skip~0 := 0; {8040#false} is VALID [2022-04-15 11:43:02,512 INFO L290 TraceCheckUtils]: 57: Hoare triple {8040#false} assume !false; {8040#false} is VALID [2022-04-15 11:43:02,513 INFO L290 TraceCheckUtils]: 58: Hoare triple {8040#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); {8040#false} is VALID [2022-04-15 11:43:02,513 INFO L290 TraceCheckUtils]: 59: Hoare triple {8040#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,513 INFO L290 TraceCheckUtils]: 60: Hoare triple {8040#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,513 INFO L290 TraceCheckUtils]: 61: Hoare triple {8040#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,513 INFO L290 TraceCheckUtils]: 62: Hoare triple {8040#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,513 INFO L290 TraceCheckUtils]: 63: Hoare triple {8040#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,513 INFO L290 TraceCheckUtils]: 64: Hoare triple {8040#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,513 INFO L290 TraceCheckUtils]: 65: Hoare triple {8040#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,513 INFO L290 TraceCheckUtils]: 66: Hoare triple {8040#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,513 INFO L290 TraceCheckUtils]: 67: Hoare triple {8040#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,513 INFO L290 TraceCheckUtils]: 68: Hoare triple {8040#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,514 INFO L290 TraceCheckUtils]: 69: Hoare triple {8040#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,514 INFO L290 TraceCheckUtils]: 70: Hoare triple {8040#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,514 INFO L290 TraceCheckUtils]: 71: Hoare triple {8040#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,514 INFO L290 TraceCheckUtils]: 72: Hoare triple {8040#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,514 INFO L290 TraceCheckUtils]: 73: Hoare triple {8040#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,514 INFO L290 TraceCheckUtils]: 74: Hoare triple {8040#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,514 INFO L290 TraceCheckUtils]: 75: Hoare triple {8040#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,514 INFO L290 TraceCheckUtils]: 76: Hoare triple {8040#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,514 INFO L290 TraceCheckUtils]: 77: Hoare triple {8040#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,514 INFO L290 TraceCheckUtils]: 78: Hoare triple {8040#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,514 INFO L290 TraceCheckUtils]: 79: Hoare triple {8040#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,514 INFO L290 TraceCheckUtils]: 80: Hoare triple {8040#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,515 INFO L290 TraceCheckUtils]: 81: Hoare triple {8040#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,515 INFO L290 TraceCheckUtils]: 82: Hoare triple {8040#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,515 INFO L290 TraceCheckUtils]: 83: Hoare triple {8040#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,515 INFO L290 TraceCheckUtils]: 84: Hoare triple {8040#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,515 INFO L290 TraceCheckUtils]: 85: Hoare triple {8040#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,515 INFO L290 TraceCheckUtils]: 86: Hoare triple {8040#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-15 11:43:02,515 INFO L290 TraceCheckUtils]: 87: Hoare triple {8040#false} assume 8640 == #t~mem75;havoc #t~mem75; {8040#false} is VALID [2022-04-15 11:43:02,515 INFO L290 TraceCheckUtils]: 88: Hoare triple {8040#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {8040#false} is VALID [2022-04-15 11:43:02,515 INFO L290 TraceCheckUtils]: 89: Hoare triple {8040#false} assume !(4 == ~blastFlag~0); {8040#false} is VALID [2022-04-15 11:43:02,515 INFO L290 TraceCheckUtils]: 90: Hoare triple {8040#false} assume 7 == ~blastFlag~0; {8040#false} is VALID [2022-04-15 11:43:02,519 INFO L290 TraceCheckUtils]: 91: Hoare triple {8040#false} assume !false; {8040#false} is VALID [2022-04-15 11:43:02,520 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:43:02,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:43:02,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939799266] [2022-04-15 11:43:02,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939799266] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:02,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:02,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:02,521 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:43:02,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1983177905] [2022-04-15 11:43:02,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1983177905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:02,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:02,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:02,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948475960] [2022-04-15 11:43:02,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:43:02,522 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 92 [2022-04-15 11:43:02,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:43:02,523 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-15 11:43:02,564 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-15 11:43:02,564 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:43:02,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:02,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:43:02,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:43:02,565 INFO L87 Difference]: Start difference. First operand 247 states and 401 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-15 11:43:05,147 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:43:12,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:12,590 INFO L93 Difference]: Finished difference Result 484 states and 785 transitions. [2022-04-15 11:43:12,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:43:12,590 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 92 [2022-04-15 11:43:12,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:43:12,591 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-15 11:43:12,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 441 transitions. [2022-04-15 11:43:12,593 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-15 11:43:12,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 441 transitions. [2022-04-15 11:43:12,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 441 transitions. [2022-04-15 11:43:12,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 441 edges. 441 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:12,884 INFO L225 Difference]: With dead ends: 484 [2022-04-15 11:43:12,884 INFO L226 Difference]: Without dead ends: 263 [2022-04-15 11:43:12,885 INFO L912 BasicCegarLoop]: 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-15 11:43:12,885 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 28 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:43:12,886 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 473 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-15 11:43:12,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-04-15 11:43:12,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 247. [2022-04-15 11:43:12,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:43:12,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 states. Second operand has 247 states, 242 states have (on average 1.6363636363636365) internal successors, (396), 242 states have internal predecessors, (396), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:12,894 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand has 247 states, 242 states have (on average 1.6363636363636365) internal successors, (396), 242 states have internal predecessors, (396), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:12,895 INFO L87 Difference]: Start difference. First operand 263 states. Second operand has 247 states, 242 states have (on average 1.6363636363636365) internal successors, (396), 242 states have internal predecessors, (396), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:12,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:12,898 INFO L93 Difference]: Finished difference Result 263 states and 420 transitions. [2022-04-15 11:43:12,899 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 420 transitions. [2022-04-15 11:43:12,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:12,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:12,899 INFO L74 IsIncluded]: Start isIncluded. First operand has 247 states, 242 states have (on average 1.6363636363636365) internal successors, (396), 242 states have internal predecessors, (396), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 263 states. [2022-04-15 11:43:12,900 INFO L87 Difference]: Start difference. First operand has 247 states, 242 states have (on average 1.6363636363636365) internal successors, (396), 242 states have internal predecessors, (396), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 263 states. [2022-04-15 11:43:12,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:12,904 INFO L93 Difference]: Finished difference Result 263 states and 420 transitions. [2022-04-15 11:43:12,904 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 420 transitions. [2022-04-15 11:43:12,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:12,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:12,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:43:12,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:43:12,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 242 states have (on average 1.6363636363636365) internal successors, (396), 242 states have internal predecessors, (396), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:12,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 400 transitions. [2022-04-15 11:43:12,909 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 400 transitions. Word has length 92 [2022-04-15 11:43:12,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:43:12,909 INFO L478 AbstractCegarLoop]: Abstraction has 247 states and 400 transitions. [2022-04-15 11:43:12,909 INFO L479 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-15 11:43:12,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 247 states and 400 transitions. [2022-04-15 11:43:13,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 400 edges. 400 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:13,186 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 400 transitions. [2022-04-15 11:43:13,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-15 11:43:13,187 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:43:13,187 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:43:13,187 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:43:13,188 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:43:13,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:43:13,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1601811464, now seen corresponding path program 1 times [2022-04-15 11:43:13,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:13,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1239120478] [2022-04-15 11:43:13,356 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 18 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:43:13,357 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:43:13,357 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:43:13,358 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:43:13,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1961708251, now seen corresponding path program 1 times [2022-04-15 11:43:13,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:43:13,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081938495] [2022-04-15 11:43:13,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:43:13,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:43:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:13,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:43:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:13,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {10045#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {10039#true} is VALID [2022-04-15 11:43:13,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {10039#true} assume true; {10039#true} is VALID [2022-04-15 11:43:13,450 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10039#true} {10039#true} #678#return; {10039#true} is VALID [2022-04-15 11:43:13,451 INFO L272 TraceCheckUtils]: 0: Hoare triple {10039#true} call ULTIMATE.init(); {10045#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:43:13,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {10045#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {10039#true} is VALID [2022-04-15 11:43:13,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {10039#true} assume true; {10039#true} is VALID [2022-04-15 11:43:13,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10039#true} {10039#true} #678#return; {10039#true} is VALID [2022-04-15 11:43:13,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {10039#true} call #t~ret161 := main(); {10039#true} is VALID [2022-04-15 11:43:13,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {10039#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; {10039#true} is VALID [2022-04-15 11:43:13,452 INFO L290 TraceCheckUtils]: 6: Hoare triple {10039#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {10039#true} is VALID [2022-04-15 11:43:13,452 INFO L272 TraceCheckUtils]: 7: Hoare triple {10039#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {10039#true} is VALID [2022-04-15 11:43:13,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {10039#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); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {10044#(= 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; {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,453 INFO L290 TraceCheckUtils]: 10: Hoare triple {10044#(= 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; {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {10044#(= 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)))); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} [684] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem85_10| |v_ssl3_accept_#t~mem85_8|)) (.cse1 (= |v_ssl3_accept_#t~mem47_20| |v_ssl3_accept_#t~mem47_16|)) (.cse2 (= |v_ssl3_accept_#t~mem150.base_18| |v_ssl3_accept_#t~mem150.base_14|)) (.cse3 (= |v_ssl3_accept_#t~mem46_10| |v_ssl3_accept_#t~mem46_8|)) (.cse4 (= v_ssl3_accept_~state~0_12 v_ssl3_accept_~state~0_10)) (.cse5 (= |v_ssl3_accept_#t~mem88.base_5| |v_ssl3_accept_#t~mem88.base_4|)) (.cse6 (= |v_ssl3_accept_#t~mem88.offset_5| |v_ssl3_accept_#t~mem88.offset_4|)) (.cse7 (= |v_ssl3_accept_#t~mem89_5| |v_ssl3_accept_#t~mem89_4|)) (.cse8 (= |v_ssl3_accept_#t~mem82_10| |v_ssl3_accept_#t~mem82_8|)) (.cse9 (= |v_ssl3_accept_#t~mem150.offset_18| |v_ssl3_accept_#t~mem150.offset_14|))) (or (and (= |v_#memory_$Pointer$.offset_276| |v_#memory_$Pointer$.offset_268|) .cse0 (= |v_ssl3_accept_#t~mem151_20| |v_ssl3_accept_#t~mem151_16|) .cse1 .cse2 .cse3 (= |v_ssl3_accept_#t~mem48_18| |v_ssl3_accept_#t~mem48_14|) (= |v_#memory_int_276| |v_#memory_int_269|) .cse4 (= |v_ssl3_accept_#t~mem83.base_10| |v_ssl3_accept_#t~mem83.base_8|) (= |v_#memory_$Pointer$.base_276| |v_#memory_$Pointer$.base_268|) .cse5 (= v_ssl3_accept_~skip~0_20 v_ssl3_accept_~skip~0_18) .cse6 .cse7 .cse8 (= |v_ssl3_accept_#t~mem83.offset_10| |v_ssl3_accept_#t~mem83.offset_8|) .cse9) (and .cse0 (= |v_#memory_$Pointer$.base_268| |v_#memory_$Pointer$.base_276|) (= |v_ssl3_accept_#t~mem83.offset_8| |v_ssl3_accept_#t~mem83.offset_10|) (= |v_#memory_$Pointer$.offset_268| |v_#memory_$Pointer$.offset_276|) .cse1 .cse2 (= |v_#memory_int_269| |v_#memory_int_276|) .cse3 .cse4 (= |v_ssl3_accept_#t~mem151_16| |v_ssl3_accept_#t~mem151_20|) .cse5 .cse6 (= |v_ssl3_accept_#t~mem48_14| |v_ssl3_accept_#t~mem48_18|) .cse7 .cse8 (= |v_ssl3_accept_#t~mem83.base_8| |v_ssl3_accept_#t~mem83.base_10|) (= v_ssl3_accept_~skip~0_18 v_ssl3_accept_~skip~0_20) .cse9))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_10|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_276|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_10|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_10|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_20|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_18|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_5|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_10|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_18|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_18|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_20|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_10|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_20, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_5|, #memory_int=|v_#memory_int_276|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_5|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_276|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_12} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_8|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_268|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_8|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_8|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_16|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_14|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_4|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_8|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_14|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_14|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_16|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_8|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_18, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_4|, #memory_int=|v_#memory_int_269|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_268|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_10} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} [685] L1168_primed-->L1167-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} [686] L1167-2-->L1168_primed: Formula: (or (and (= |v_#memory_$Pointer$.base_275| |v_#memory_$Pointer$.base_274|) (= |v_#memory_$Pointer$.offset_275| |v_#memory_$Pointer$.offset_274|) (= v_ssl3_accept_~s.base_108 v_ssl3_accept_~s.base_108) (= v_ssl3_accept_~s.offset_108 v_ssl3_accept_~s.offset_108) (= |v_#memory_int_275| |v_#memory_int_274|) (= v_ssl3_accept_~num1~0_10 v_ssl3_accept_~num1~0_10)) (let ((.cse0 (select |v_#memory_int_275| v_ssl3_accept_~s.base_108)) (.cse1 (+ 52 v_ssl3_accept_~s.offset_108))) (let ((.cse4 (select |v_#memory_$Pointer$.offset_275| v_ssl3_accept_~s.base_108)) (.cse6 (select |v_#memory_$Pointer$.offset_274| v_ssl3_accept_~s.base_108)) (.cse3 (+ 84 v_ssl3_accept_~s.offset_108)) (.cse2 (select |v_#memory_$Pointer$.base_275| v_ssl3_accept_~s.base_108)) (.cse7 (select |v_#memory_$Pointer$.base_274| v_ssl3_accept_~s.base_108)) (.cse5 (select .cse0 .cse1))) (and (= (store |v_#memory_int_275| v_ssl3_accept_~s.base_108 (store .cse0 .cse1 (select (select |v_#memory_int_275| (select .cse2 .cse3)) (+ (select .cse4 .cse3) 844)))) |v_#memory_int_274|) (not (= 8560 .cse5)) (= |v_#memory_$Pointer$.offset_274| (store |v_#memory_$Pointer$.offset_275| v_ssl3_accept_~s.base_108 (store .cse4 .cse1 (select .cse6 .cse1)))) (= v_ssl3_accept_~skip~0_19 0) (not (< 0 v_ssl3_accept_~num1~0_10)) (not (= .cse5 8195)) (not (= 8497 .cse5)) (not (= .cse5 8529)) (not (= .cse5 8482)) (not (= 8496 .cse5)) (= 8448 .cse5) (not (= .cse5 8544)) (not (= .cse5 8528)) (not (= 8466 .cse5)) (= .cse5 v_ssl3_accept_~state~0_11) (not (= .cse5 8545)) (not (= 8513 .cse5)) (not (= (select (select |v_#memory_int_274| (select .cse7 .cse3)) (+ (select .cse6 .cse3) 848)) 0)) (= (store |v_#memory_$Pointer$.base_275| v_ssl3_accept_~s.base_108 (store .cse2 .cse1 (select .cse7 .cse1))) |v_#memory_$Pointer$.base_274|) (not (= 8464 .cse5)) (not (= 24576 .cse5)) (not (= 12292 .cse5)) (not (= .cse5 8512)) (not (= .cse5 8480)) (not (= .cse5 8481)) (not (= 8192 .cse5)) (not (= .cse5 8465)) (not (= .cse5 16384)) (not (= .cse5 8561)))))) InVars {ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_108, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_275|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_10, #memory_int=|v_#memory_int_275|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_108, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_275|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_274|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_10, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_18|, ssl3_accept_#t~mem52=|v_ssl3_accept_#t~mem52_14|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_14|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_14|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_16|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_19, ssl3_accept_#t~mem53=|v_ssl3_accept_#t~mem53_12|, ssl3_accept_#t~mem54=|v_ssl3_accept_#t~mem54_12|, ssl3_accept_#t~mem55=|v_ssl3_accept_#t~mem55_12|, ssl3_accept_#t~mem133=|v_ssl3_accept_#t~mem133_6|, ssl3_accept_#t~mem56=|v_ssl3_accept_#t~mem56_12|, ssl3_accept_#t~mem57=|v_ssl3_accept_#t~mem57_12|, ssl3_accept_#t~mem132.offset=|v_ssl3_accept_#t~mem132.offset_6|, ssl3_accept_#t~mem58=|v_ssl3_accept_#t~mem58_12|, ssl3_accept_#t~mem59=|v_ssl3_accept_#t~mem59_12|, ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_108, ssl3_accept_#t~mem60=|v_ssl3_accept_#t~mem60_12|, ssl3_accept_#t~mem61=|v_ssl3_accept_#t~mem61_12|, ssl3_accept_#t~mem62=|v_ssl3_accept_#t~mem62_12|, ssl3_accept_#t~mem132.base=|v_ssl3_accept_#t~mem132.base_6|, ssl3_accept_#t~mem63=|v_ssl3_accept_#t~mem63_12|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_16|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_14|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_16|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_18|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_9|, #memory_int=|v_#memory_int_274|, ssl3_accept_#t~mem64=|v_ssl3_accept_#t~mem64_12|, ssl3_accept_#t~mem65=|v_ssl3_accept_#t~mem65_12|, ssl3_accept_#t~mem66=|v_ssl3_accept_#t~mem66_12|, ssl3_accept_#t~mem67=|v_ssl3_accept_#t~mem67_12|, ssl3_accept_#t~mem68=|v_ssl3_accept_#t~mem68_12|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_108, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_274|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_11} AuxVars[] AssignedVars[#memory_$Pointer$.base, ssl3_accept_#t~mem151, ssl3_accept_#t~mem52, ssl3_accept_#t~mem51, ssl3_accept_#t~mem50, ssl3_accept_#t~mem150.offset, ssl3_accept_~skip~0, ssl3_accept_#t~mem53, ssl3_accept_#t~mem54, ssl3_accept_#t~mem55, ssl3_accept_#t~mem133, ssl3_accept_#t~mem56, ssl3_accept_#t~mem57, ssl3_accept_#t~mem132.offset, ssl3_accept_#t~mem58, ssl3_accept_#t~mem59, ssl3_accept_#t~mem60, ssl3_accept_#t~mem61, ssl3_accept_#t~mem62, ssl3_accept_#t~mem132.base, ssl3_accept_#t~mem63, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, #memory_int, ssl3_accept_#t~mem64, ssl3_accept_#t~mem65, ssl3_accept_#t~mem66, ssl3_accept_#t~mem67, ssl3_accept_#t~mem68, #memory_$Pointer$.offset, ssl3_accept_~state~0] {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} [683] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {10044#(= 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); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,456 INFO L290 TraceCheckUtils]: 19: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,456 INFO L290 TraceCheckUtils]: 20: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,457 INFO L290 TraceCheckUtils]: 23: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,457 INFO L290 TraceCheckUtils]: 24: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,458 INFO L290 TraceCheckUtils]: 26: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,458 INFO L290 TraceCheckUtils]: 27: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,458 INFO L290 TraceCheckUtils]: 28: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,458 INFO L290 TraceCheckUtils]: 29: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,459 INFO L290 TraceCheckUtils]: 30: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,459 INFO L290 TraceCheckUtils]: 31: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,459 INFO L290 TraceCheckUtils]: 32: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,459 INFO L290 TraceCheckUtils]: 33: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,460 INFO L290 TraceCheckUtils]: 34: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,460 INFO L290 TraceCheckUtils]: 35: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,460 INFO L290 TraceCheckUtils]: 36: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,461 INFO L290 TraceCheckUtils]: 37: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,461 INFO L290 TraceCheckUtils]: 38: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,461 INFO L290 TraceCheckUtils]: 39: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,461 INFO L290 TraceCheckUtils]: 40: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,462 INFO L290 TraceCheckUtils]: 41: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,462 INFO L290 TraceCheckUtils]: 42: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,462 INFO L290 TraceCheckUtils]: 43: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,462 INFO L290 TraceCheckUtils]: 44: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,463 INFO L290 TraceCheckUtils]: 45: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,463 INFO L290 TraceCheckUtils]: 46: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,463 INFO L290 TraceCheckUtils]: 47: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,464 INFO L290 TraceCheckUtils]: 48: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,464 INFO L290 TraceCheckUtils]: 49: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:13,464 INFO L290 TraceCheckUtils]: 50: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume 7 == ~blastFlag~0; {10040#false} is VALID [2022-04-15 11:43:13,464 INFO L290 TraceCheckUtils]: 51: Hoare triple {10040#false} assume !false; {10040#false} is VALID [2022-04-15 11:43:13,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 11:43:13,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:43:13,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081938495] [2022-04-15 11:43:13,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081938495] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:13,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:13,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:43:17,083 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:43:17,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1239120478] [2022-04-15 11:43:17,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1239120478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:17,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:17,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 11:43:17,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759535240] [2022-04-15 11:43:17,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:43:17,084 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 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 92 [2022-04-15 11:43:17,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:43:17,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 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-15 11:43:17,160 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-15 11:43:17,160 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 11:43:17,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:17,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 11:43:17,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-15 11:43:17,161 INFO L87 Difference]: Start difference. First operand 247 states and 400 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 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-15 11:43:21,904 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-15 11:43:25,743 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-15 11:43:27,752 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:43:30,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:30,438 INFO L93 Difference]: Finished difference Result 671 states and 1101 transitions. [2022-04-15 11:43:30,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 11:43:30,438 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 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 92 [2022-04-15 11:43:30,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:43:30,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 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-15 11:43:30,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 595 transitions. [2022-04-15 11:43:30,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 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-15 11:43:30,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 595 transitions. [2022-04-15 11:43:30,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 595 transitions. [2022-04-15 11:43:30,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 595 edges. 595 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:30,845 INFO L225 Difference]: With dead ends: 671 [2022-04-15 11:43:30,846 INFO L226 Difference]: Without dead ends: 450 [2022-04-15 11:43:30,846 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-15 11:43:30,847 INFO L913 BasicCegarLoop]: 336 mSDtfsCounter, 142 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 220 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:43:30,847 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 1132 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 971 Invalid, 1 Unknown, 220 Unchecked, 7.4s Time] [2022-04-15 11:43:30,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-04-15 11:43:30,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 445. [2022-04-15 11:43:30,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:43:30,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 450 states. Second operand has 445 states, 440 states have (on average 1.6318181818181818) internal successors, (718), 440 states have internal predecessors, (718), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:30,861 INFO L74 IsIncluded]: Start isIncluded. First operand 450 states. Second operand has 445 states, 440 states have (on average 1.6318181818181818) internal successors, (718), 440 states have internal predecessors, (718), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:30,862 INFO L87 Difference]: Start difference. First operand 450 states. Second operand has 445 states, 440 states have (on average 1.6318181818181818) internal successors, (718), 440 states have internal predecessors, (718), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:30,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:30,870 INFO L93 Difference]: Finished difference Result 450 states and 728 transitions. [2022-04-15 11:43:30,871 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 728 transitions. [2022-04-15 11:43:30,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:30,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:30,872 INFO L74 IsIncluded]: Start isIncluded. First operand has 445 states, 440 states have (on average 1.6318181818181818) internal successors, (718), 440 states have internal predecessors, (718), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 450 states. [2022-04-15 11:43:30,873 INFO L87 Difference]: Start difference. First operand has 445 states, 440 states have (on average 1.6318181818181818) internal successors, (718), 440 states have internal predecessors, (718), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 450 states. [2022-04-15 11:43:30,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:30,881 INFO L93 Difference]: Finished difference Result 450 states and 728 transitions. [2022-04-15 11:43:30,881 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 728 transitions. [2022-04-15 11:43:30,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:30,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:30,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:43:30,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:43:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 440 states have (on average 1.6318181818181818) internal successors, (718), 440 states have internal predecessors, (718), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:30,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 722 transitions. [2022-04-15 11:43:30,894 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 722 transitions. Word has length 92 [2022-04-15 11:43:30,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:43:30,894 INFO L478 AbstractCegarLoop]: Abstraction has 445 states and 722 transitions. [2022-04-15 11:43:30,894 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 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-15 11:43:30,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 445 states and 722 transitions. [2022-04-15 11:43:31,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 722 edges. 722 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:31,431 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 722 transitions. [2022-04-15 11:43:31,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-15 11:43:31,432 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:43:31,432 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:43:31,432 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:43:31,432 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:43:31,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:43:31,433 INFO L85 PathProgramCache]: Analyzing trace with hash -309231094, now seen corresponding path program 1 times [2022-04-15 11:43:31,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:31,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2068317456] [2022-04-15 11:43:31,506 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:43:31,506 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:43:31,506 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:43:31,506 INFO L85 PathProgramCache]: Analyzing trace with hash -309231094, now seen corresponding path program 2 times [2022-04-15 11:43:31,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:43:31,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834650472] [2022-04-15 11:43:31,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:43:31,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:43:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:31,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:43:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:31,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {13196#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {13189#true} is VALID [2022-04-15 11:43:31,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {13189#true} assume true; {13189#true} is VALID [2022-04-15 11:43:31,623 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13189#true} {13189#true} #678#return; {13189#true} is VALID [2022-04-15 11:43:31,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {13189#true} call ULTIMATE.init(); {13196#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:43:31,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {13196#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {13189#true} is VALID [2022-04-15 11:43:31,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {13189#true} assume true; {13189#true} is VALID [2022-04-15 11:43:31,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13189#true} {13189#true} #678#return; {13189#true} is VALID [2022-04-15 11:43:31,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {13189#true} call #t~ret161 := main(); {13189#true} is VALID [2022-04-15 11:43:31,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {13189#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; {13189#true} is VALID [2022-04-15 11:43:31,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {13189#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {13189#true} is VALID [2022-04-15 11:43:31,625 INFO L272 TraceCheckUtils]: 7: Hoare triple {13189#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {13189#true} is VALID [2022-04-15 11:43:31,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {13189#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); {13194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:31,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {13194#(= 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; {13194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:31,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {13194#(= 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; {13194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:31,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {13194#(= 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)))); {13194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:31,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {13194#(= 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); {13194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:31,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {13194#(= 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; {13194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:31,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {13194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {13194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:31,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {13194#(= 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); {13194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:31,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {13194#(= 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); {13195#(= 8464 |ssl3_accept_#t~mem48|)} is VALID [2022-04-15 11:43:31,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {13195#(= 8464 |ssl3_accept_#t~mem48|)} assume 16384 == #t~mem48;havoc #t~mem48; {13190#false} is VALID [2022-04-15 11:43:31,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {13190#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {13190#false} assume !(0 != (~cb~0.base + ~cb~0.offset) % 4294967296); {13190#false} is VALID [2022-04-15 11:43:31,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {13190#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {13190#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); {13190#false} is VALID [2022-04-15 11:43:31,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {13190#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {13190#false} is VALID [2022-04-15 11:43:31,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {13190#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); {13190#false} is VALID [2022-04-15 11:43:31,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {13190#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); {13190#false} is VALID [2022-04-15 11:43:31,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {13190#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); {13190#false} is VALID [2022-04-15 11:43:31,631 INFO L290 TraceCheckUtils]: 26: Hoare triple {13190#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {13190#false} is VALID [2022-04-15 11:43:31,631 INFO L290 TraceCheckUtils]: 27: Hoare triple {13190#false} ~skip~0 := 0; {13190#false} is VALID [2022-04-15 11:43:31,631 INFO L290 TraceCheckUtils]: 28: Hoare triple {13190#false} assume !false; {13190#false} is VALID [2022-04-15 11:43:31,631 INFO L290 TraceCheckUtils]: 29: Hoare triple {13190#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); {13190#false} is VALID [2022-04-15 11:43:31,631 INFO L290 TraceCheckUtils]: 30: Hoare triple {13190#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,631 INFO L290 TraceCheckUtils]: 31: Hoare triple {13190#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,631 INFO L290 TraceCheckUtils]: 32: Hoare triple {13190#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,631 INFO L290 TraceCheckUtils]: 33: Hoare triple {13190#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,631 INFO L290 TraceCheckUtils]: 34: Hoare triple {13190#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {13190#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,631 INFO L290 TraceCheckUtils]: 36: Hoare triple {13190#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,631 INFO L290 TraceCheckUtils]: 37: Hoare triple {13190#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,632 INFO L290 TraceCheckUtils]: 38: Hoare triple {13190#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,632 INFO L290 TraceCheckUtils]: 39: Hoare triple {13190#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,632 INFO L290 TraceCheckUtils]: 40: Hoare triple {13190#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,632 INFO L290 TraceCheckUtils]: 41: Hoare triple {13190#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,632 INFO L290 TraceCheckUtils]: 42: Hoare triple {13190#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,632 INFO L290 TraceCheckUtils]: 43: Hoare triple {13190#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,632 INFO L290 TraceCheckUtils]: 44: Hoare triple {13190#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,632 INFO L290 TraceCheckUtils]: 45: Hoare triple {13190#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,632 INFO L290 TraceCheckUtils]: 46: Hoare triple {13190#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,632 INFO L290 TraceCheckUtils]: 47: Hoare triple {13190#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,632 INFO L290 TraceCheckUtils]: 48: Hoare triple {13190#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,632 INFO L290 TraceCheckUtils]: 49: Hoare triple {13190#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,632 INFO L290 TraceCheckUtils]: 50: Hoare triple {13190#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,633 INFO L290 TraceCheckUtils]: 51: Hoare triple {13190#false} assume 8448 == #t~mem68;havoc #t~mem68; {13190#false} is VALID [2022-04-15 11:43:31,633 INFO L290 TraceCheckUtils]: 52: Hoare triple {13190#false} assume !(~num1~0 > 0); {13190#false} is VALID [2022-04-15 11:43:31,633 INFO L290 TraceCheckUtils]: 53: Hoare triple {13190#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; {13190#false} is VALID [2022-04-15 11:43:31,633 INFO L290 TraceCheckUtils]: 54: Hoare triple {13190#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); {13190#false} is VALID [2022-04-15 11:43:31,633 INFO L290 TraceCheckUtils]: 55: Hoare triple {13190#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {13190#false} is VALID [2022-04-15 11:43:31,633 INFO L290 TraceCheckUtils]: 56: Hoare triple {13190#false} ~skip~0 := 0; {13190#false} is VALID [2022-04-15 11:43:31,633 INFO L290 TraceCheckUtils]: 57: Hoare triple {13190#false} assume !false; {13190#false} is VALID [2022-04-15 11:43:31,633 INFO L290 TraceCheckUtils]: 58: Hoare triple {13190#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); {13190#false} is VALID [2022-04-15 11:43:31,633 INFO L290 TraceCheckUtils]: 59: Hoare triple {13190#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,633 INFO L290 TraceCheckUtils]: 60: Hoare triple {13190#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,633 INFO L290 TraceCheckUtils]: 61: Hoare triple {13190#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,633 INFO L290 TraceCheckUtils]: 62: Hoare triple {13190#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,633 INFO L290 TraceCheckUtils]: 63: Hoare triple {13190#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,634 INFO L290 TraceCheckUtils]: 64: Hoare triple {13190#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,634 INFO L290 TraceCheckUtils]: 65: Hoare triple {13190#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,634 INFO L290 TraceCheckUtils]: 66: Hoare triple {13190#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,634 INFO L290 TraceCheckUtils]: 67: Hoare triple {13190#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,635 INFO L290 TraceCheckUtils]: 68: Hoare triple {13190#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,636 INFO L290 TraceCheckUtils]: 69: Hoare triple {13190#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,636 INFO L290 TraceCheckUtils]: 70: Hoare triple {13190#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,637 INFO L290 TraceCheckUtils]: 71: Hoare triple {13190#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,637 INFO L290 TraceCheckUtils]: 72: Hoare triple {13190#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,637 INFO L290 TraceCheckUtils]: 73: Hoare triple {13190#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,637 INFO L290 TraceCheckUtils]: 74: Hoare triple {13190#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,637 INFO L290 TraceCheckUtils]: 75: Hoare triple {13190#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,637 INFO L290 TraceCheckUtils]: 76: Hoare triple {13190#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,637 INFO L290 TraceCheckUtils]: 77: Hoare triple {13190#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,641 INFO L290 TraceCheckUtils]: 78: Hoare triple {13190#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,641 INFO L290 TraceCheckUtils]: 79: Hoare triple {13190#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,641 INFO L290 TraceCheckUtils]: 80: Hoare triple {13190#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,642 INFO L290 TraceCheckUtils]: 81: Hoare triple {13190#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,642 INFO L290 TraceCheckUtils]: 82: Hoare triple {13190#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,642 INFO L290 TraceCheckUtils]: 83: Hoare triple {13190#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,642 INFO L290 TraceCheckUtils]: 84: Hoare triple {13190#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,642 INFO L290 TraceCheckUtils]: 85: Hoare triple {13190#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,642 INFO L290 TraceCheckUtils]: 86: Hoare triple {13190#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-15 11:43:31,642 INFO L290 TraceCheckUtils]: 87: Hoare triple {13190#false} assume 8640 == #t~mem75;havoc #t~mem75; {13190#false} is VALID [2022-04-15 11:43:31,642 INFO L290 TraceCheckUtils]: 88: Hoare triple {13190#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {13190#false} is VALID [2022-04-15 11:43:31,642 INFO L290 TraceCheckUtils]: 89: Hoare triple {13190#false} assume !(4 == ~blastFlag~0); {13190#false} is VALID [2022-04-15 11:43:31,642 INFO L290 TraceCheckUtils]: 90: Hoare triple {13190#false} assume 7 == ~blastFlag~0; {13190#false} is VALID [2022-04-15 11:43:31,642 INFO L290 TraceCheckUtils]: 91: Hoare triple {13190#false} assume !false; {13190#false} is VALID [2022-04-15 11:43:31,643 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:43:31,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:43:31,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834650472] [2022-04-15 11:43:31,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834650472] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:31,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:31,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:31,643 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:43:31,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2068317456] [2022-04-15 11:43:31,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2068317456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:31,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:31,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:31,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541858416] [2022-04-15 11:43:31,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:43:31,644 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 92 [2022-04-15 11:43:31,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:43:31,645 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-15 11:43:31,695 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-15 11:43:31,695 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:43:31,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:31,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:43:31,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:43:31,696 INFO L87 Difference]: Start difference. First operand 445 states and 722 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-15 11:43:39,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:39,272 INFO L93 Difference]: Finished difference Result 689 states and 1114 transitions. [2022-04-15 11:43:39,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:43:39,272 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 92 [2022-04-15 11:43:39,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:43:39,273 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-15 11:43:39,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2022-04-15 11:43:39,275 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-15 11:43:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2022-04-15 11:43:39,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 439 transitions. [2022-04-15 11:43:39,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:39,575 INFO L225 Difference]: With dead ends: 689 [2022-04-15 11:43:39,575 INFO L226 Difference]: Without dead ends: 461 [2022-04-15 11:43:39,576 INFO L912 BasicCegarLoop]: 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-15 11:43:39,576 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 25 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:43:39,576 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 473 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-15 11:43:39,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-04-15 11:43:39,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 445. [2022-04-15 11:43:39,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:43:39,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 461 states. Second operand has 445 states, 440 states have (on average 1.6295454545454546) internal successors, (717), 440 states have internal predecessors, (717), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:39,590 INFO L74 IsIncluded]: Start isIncluded. First operand 461 states. Second operand has 445 states, 440 states have (on average 1.6295454545454546) internal successors, (717), 440 states have internal predecessors, (717), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:39,591 INFO L87 Difference]: Start difference. First operand 461 states. Second operand has 445 states, 440 states have (on average 1.6295454545454546) internal successors, (717), 440 states have internal predecessors, (717), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:39,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:39,600 INFO L93 Difference]: Finished difference Result 461 states and 740 transitions. [2022-04-15 11:43:39,600 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 740 transitions. [2022-04-15 11:43:39,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:39,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:39,602 INFO L74 IsIncluded]: Start isIncluded. First operand has 445 states, 440 states have (on average 1.6295454545454546) internal successors, (717), 440 states have internal predecessors, (717), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 461 states. [2022-04-15 11:43:39,602 INFO L87 Difference]: Start difference. First operand has 445 states, 440 states have (on average 1.6295454545454546) internal successors, (717), 440 states have internal predecessors, (717), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 461 states. [2022-04-15 11:43:39,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:39,611 INFO L93 Difference]: Finished difference Result 461 states and 740 transitions. [2022-04-15 11:43:39,611 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 740 transitions. [2022-04-15 11:43:39,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:39,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:39,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:43:39,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:43:39,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 440 states have (on average 1.6295454545454546) internal successors, (717), 440 states have internal predecessors, (717), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:39,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 721 transitions. [2022-04-15 11:43:39,623 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 721 transitions. Word has length 92 [2022-04-15 11:43:39,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:43:39,624 INFO L478 AbstractCegarLoop]: Abstraction has 445 states and 721 transitions. [2022-04-15 11:43:39,624 INFO L479 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-15 11:43:39,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 445 states and 721 transitions. [2022-04-15 11:43:40,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 721 edges. 721 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 721 transitions. [2022-04-15 11:43:40,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-15 11:43:40,152 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:43:40,152 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:43:40,152 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:43:40,152 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:43:40,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:43:40,152 INFO L85 PathProgramCache]: Analyzing trace with hash -304912275, now seen corresponding path program 1 times [2022-04-15 11:43:40,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:40,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1511346137] [2022-04-15 11:43:40,201 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:43:40,201 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:43:40,201 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:43:40,201 INFO L85 PathProgramCache]: Analyzing trace with hash -304912275, now seen corresponding path program 2 times [2022-04-15 11:43:40,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:43:40,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252451070] [2022-04-15 11:43:40,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:43:40,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:43:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:40,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:43:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:40,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {16398#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {16391#true} is VALID [2022-04-15 11:43:40,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {16391#true} assume true; {16391#true} is VALID [2022-04-15 11:43:40,326 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16391#true} {16391#true} #678#return; {16391#true} is VALID [2022-04-15 11:43:40,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {16391#true} call ULTIMATE.init(); {16398#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:43:40,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {16398#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {16391#true} is VALID [2022-04-15 11:43:40,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {16391#true} assume true; {16391#true} is VALID [2022-04-15 11:43:40,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16391#true} {16391#true} #678#return; {16391#true} is VALID [2022-04-15 11:43:40,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {16391#true} call #t~ret161 := main(); {16391#true} is VALID [2022-04-15 11:43:40,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {16391#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; {16391#true} is VALID [2022-04-15 11:43:40,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {16391#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {16391#true} is VALID [2022-04-15 11:43:40,327 INFO L272 TraceCheckUtils]: 7: Hoare triple {16391#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16391#true} is VALID [2022-04-15 11:43:40,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {16391#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); {16396#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:40,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {16396#(not (= 8192 (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; {16396#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:40,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {16396#(not (= 8192 (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; {16396#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:40,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {16396#(not (= 8192 (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)))); {16396#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:40,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {16396#(not (= 8192 (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); {16396#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:40,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {16396#(not (= 8192 (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; {16396#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:40,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {16396#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {16396#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:40,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {16396#(not (= 8192 (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); {16396#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:40,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {16396#(not (= 8192 (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); {16396#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:40,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {16396#(not (= 8192 (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); {16397#(not (= 8192 |ssl3_accept_#t~mem49|))} is VALID [2022-04-15 11:43:40,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {16397#(not (= 8192 |ssl3_accept_#t~mem49|))} assume 8192 == #t~mem49;havoc #t~mem49; {16392#false} is VALID [2022-04-15 11:43:40,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {16392#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {16392#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {16392#false} is VALID [2022-04-15 11:43:40,333 INFO L290 TraceCheckUtils]: 21: Hoare triple {16392#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {16392#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); {16392#false} is VALID [2022-04-15 11:43:40,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {16392#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {16392#false} is VALID [2022-04-15 11:43:40,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {16392#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); {16392#false} is VALID [2022-04-15 11:43:40,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {16392#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); {16392#false} is VALID [2022-04-15 11:43:40,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {16392#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); {16392#false} is VALID [2022-04-15 11:43:40,333 INFO L290 TraceCheckUtils]: 27: Hoare triple {16392#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16392#false} is VALID [2022-04-15 11:43:40,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {16392#false} ~skip~0 := 0; {16392#false} is VALID [2022-04-15 11:43:40,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {16392#false} assume !false; {16392#false} is VALID [2022-04-15 11:43:40,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {16392#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); {16392#false} is VALID [2022-04-15 11:43:40,334 INFO L290 TraceCheckUtils]: 31: Hoare triple {16392#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,334 INFO L290 TraceCheckUtils]: 32: Hoare triple {16392#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,334 INFO L290 TraceCheckUtils]: 33: Hoare triple {16392#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,334 INFO L290 TraceCheckUtils]: 34: Hoare triple {16392#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,334 INFO L290 TraceCheckUtils]: 35: Hoare triple {16392#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,334 INFO L290 TraceCheckUtils]: 36: Hoare triple {16392#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {16392#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,334 INFO L290 TraceCheckUtils]: 38: Hoare triple {16392#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,334 INFO L290 TraceCheckUtils]: 39: Hoare triple {16392#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {16392#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,334 INFO L290 TraceCheckUtils]: 41: Hoare triple {16392#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,334 INFO L290 TraceCheckUtils]: 42: Hoare triple {16392#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,335 INFO L290 TraceCheckUtils]: 43: Hoare triple {16392#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,335 INFO L290 TraceCheckUtils]: 44: Hoare triple {16392#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,335 INFO L290 TraceCheckUtils]: 45: Hoare triple {16392#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,335 INFO L290 TraceCheckUtils]: 46: Hoare triple {16392#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,335 INFO L290 TraceCheckUtils]: 47: Hoare triple {16392#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,335 INFO L290 TraceCheckUtils]: 48: Hoare triple {16392#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,335 INFO L290 TraceCheckUtils]: 49: Hoare triple {16392#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,335 INFO L290 TraceCheckUtils]: 50: Hoare triple {16392#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,335 INFO L290 TraceCheckUtils]: 51: Hoare triple {16392#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,335 INFO L290 TraceCheckUtils]: 52: Hoare triple {16392#false} assume 8448 == #t~mem68;havoc #t~mem68; {16392#false} is VALID [2022-04-15 11:43:40,335 INFO L290 TraceCheckUtils]: 53: Hoare triple {16392#false} assume !(~num1~0 > 0); {16392#false} is VALID [2022-04-15 11:43:40,335 INFO L290 TraceCheckUtils]: 54: Hoare triple {16392#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; {16392#false} is VALID [2022-04-15 11:43:40,335 INFO L290 TraceCheckUtils]: 55: Hoare triple {16392#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); {16392#false} is VALID [2022-04-15 11:43:40,336 INFO L290 TraceCheckUtils]: 56: Hoare triple {16392#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16392#false} is VALID [2022-04-15 11:43:40,336 INFO L290 TraceCheckUtils]: 57: Hoare triple {16392#false} ~skip~0 := 0; {16392#false} is VALID [2022-04-15 11:43:40,336 INFO L290 TraceCheckUtils]: 58: Hoare triple {16392#false} assume !false; {16392#false} is VALID [2022-04-15 11:43:40,336 INFO L290 TraceCheckUtils]: 59: Hoare triple {16392#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); {16392#false} is VALID [2022-04-15 11:43:40,336 INFO L290 TraceCheckUtils]: 60: Hoare triple {16392#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,336 INFO L290 TraceCheckUtils]: 61: Hoare triple {16392#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,336 INFO L290 TraceCheckUtils]: 62: Hoare triple {16392#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,336 INFO L290 TraceCheckUtils]: 63: Hoare triple {16392#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,336 INFO L290 TraceCheckUtils]: 64: Hoare triple {16392#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,336 INFO L290 TraceCheckUtils]: 65: Hoare triple {16392#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,336 INFO L290 TraceCheckUtils]: 66: Hoare triple {16392#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,336 INFO L290 TraceCheckUtils]: 67: Hoare triple {16392#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,336 INFO L290 TraceCheckUtils]: 68: Hoare triple {16392#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,336 INFO L290 TraceCheckUtils]: 69: Hoare triple {16392#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,337 INFO L290 TraceCheckUtils]: 70: Hoare triple {16392#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,337 INFO L290 TraceCheckUtils]: 71: Hoare triple {16392#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,337 INFO L290 TraceCheckUtils]: 72: Hoare triple {16392#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,337 INFO L290 TraceCheckUtils]: 73: Hoare triple {16392#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,337 INFO L290 TraceCheckUtils]: 74: Hoare triple {16392#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,337 INFO L290 TraceCheckUtils]: 75: Hoare triple {16392#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,337 INFO L290 TraceCheckUtils]: 76: Hoare triple {16392#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,337 INFO L290 TraceCheckUtils]: 77: Hoare triple {16392#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,337 INFO L290 TraceCheckUtils]: 78: Hoare triple {16392#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,337 INFO L290 TraceCheckUtils]: 79: Hoare triple {16392#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,337 INFO L290 TraceCheckUtils]: 80: Hoare triple {16392#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,337 INFO L290 TraceCheckUtils]: 81: Hoare triple {16392#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,337 INFO L290 TraceCheckUtils]: 82: Hoare triple {16392#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,338 INFO L290 TraceCheckUtils]: 83: Hoare triple {16392#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,338 INFO L290 TraceCheckUtils]: 84: Hoare triple {16392#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,338 INFO L290 TraceCheckUtils]: 85: Hoare triple {16392#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,338 INFO L290 TraceCheckUtils]: 86: Hoare triple {16392#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,338 INFO L290 TraceCheckUtils]: 87: Hoare triple {16392#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-15 11:43:40,338 INFO L290 TraceCheckUtils]: 88: Hoare triple {16392#false} assume 8640 == #t~mem75;havoc #t~mem75; {16392#false} is VALID [2022-04-15 11:43:40,338 INFO L290 TraceCheckUtils]: 89: Hoare triple {16392#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {16392#false} is VALID [2022-04-15 11:43:40,338 INFO L290 TraceCheckUtils]: 90: Hoare triple {16392#false} assume !(4 == ~blastFlag~0); {16392#false} is VALID [2022-04-15 11:43:40,338 INFO L290 TraceCheckUtils]: 91: Hoare triple {16392#false} assume 7 == ~blastFlag~0; {16392#false} is VALID [2022-04-15 11:43:40,338 INFO L290 TraceCheckUtils]: 92: Hoare triple {16392#false} assume !false; {16392#false} is VALID [2022-04-15 11:43:40,338 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:43:40,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:43:40,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252451070] [2022-04-15 11:43:40,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252451070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:40,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:40,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:40,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:43:40,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1511346137] [2022-04-15 11:43:40,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1511346137] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:40,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:40,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:40,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287015408] [2022-04-15 11:43:40,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:43:40,340 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 93 [2022-04-15 11:43:40,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:43:40,340 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-15 11:43:40,386 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-15 11:43:40,386 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:43:40,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:40,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:43:40,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:43:40,388 INFO L87 Difference]: Start difference. First operand 445 states and 721 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-15 11:43:48,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:48,672 INFO L93 Difference]: Finished difference Result 811 states and 1282 transitions. [2022-04-15 11:43:48,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:43:48,672 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 93 [2022-04-15 11:43:48,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:43:48,672 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-15 11:43:48,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 582 transitions. [2022-04-15 11:43:48,675 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-15 11:43:48,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 582 transitions. [2022-04-15 11:43:48,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 582 transitions. [2022-04-15 11:43:49,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 582 edges. 582 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:49,061 INFO L225 Difference]: With dead ends: 811 [2022-04-15 11:43:49,061 INFO L226 Difference]: Without dead ends: 590 [2022-04-15 11:43:49,061 INFO L912 BasicCegarLoop]: 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-15 11:43:49,062 INFO L913 BasicCegarLoop]: 123 mSDtfsCounter, 143 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:43:49,062 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 350 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-15 11:43:49,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2022-04-15 11:43:49,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 445. [2022-04-15 11:43:49,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:43:49,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 590 states. Second operand has 445 states, 440 states have (on average 1.615909090909091) internal successors, (711), 440 states have internal predecessors, (711), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:49,078 INFO L74 IsIncluded]: Start isIncluded. First operand 590 states. Second operand has 445 states, 440 states have (on average 1.615909090909091) internal successors, (711), 440 states have internal predecessors, (711), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:49,078 INFO L87 Difference]: Start difference. First operand 590 states. Second operand has 445 states, 440 states have (on average 1.615909090909091) internal successors, (711), 440 states have internal predecessors, (711), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:49,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:49,090 INFO L93 Difference]: Finished difference Result 590 states and 912 transitions. [2022-04-15 11:43:49,090 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 912 transitions. [2022-04-15 11:43:49,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:49,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:49,092 INFO L74 IsIncluded]: Start isIncluded. First operand has 445 states, 440 states have (on average 1.615909090909091) internal successors, (711), 440 states have internal predecessors, (711), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 590 states. [2022-04-15 11:43:49,093 INFO L87 Difference]: Start difference. First operand has 445 states, 440 states have (on average 1.615909090909091) internal successors, (711), 440 states have internal predecessors, (711), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 590 states. [2022-04-15 11:43:49,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:49,104 INFO L93 Difference]: Finished difference Result 590 states and 912 transitions. [2022-04-15 11:43:49,104 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 912 transitions. [2022-04-15 11:43:49,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:49,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:49,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:43:49,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:43:49,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 440 states have (on average 1.615909090909091) internal successors, (711), 440 states have internal predecessors, (711), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:49,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 715 transitions. [2022-04-15 11:43:49,115 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 715 transitions. Word has length 93 [2022-04-15 11:43:49,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:43:49,115 INFO L478 AbstractCegarLoop]: Abstraction has 445 states and 715 transitions. [2022-04-15 11:43:49,115 INFO L479 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-15 11:43:49,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 445 states and 715 transitions. [2022-04-15 11:43:49,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 715 edges. 715 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:49,678 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 715 transitions. [2022-04-15 11:43:49,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-15 11:43:49,679 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:43:49,679 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:43:49,679 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:43:49,679 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:43:49,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:43:49,679 INFO L85 PathProgramCache]: Analyzing trace with hash 756487789, now seen corresponding path program 1 times [2022-04-15 11:43:49,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:49,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [900792840] [2022-04-15 11:43:49,837 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 20 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:43:49,838 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:43:49,838 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:43:49,838 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:43:49,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1254691877, now seen corresponding path program 1 times [2022-04-15 11:43:49,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:43:49,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464778454] [2022-04-15 11:43:49,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:43:49,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:43:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:49,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:43:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:49,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {20101#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {20095#true} is VALID [2022-04-15 11:43:49,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {20095#true} assume true; {20095#true} is VALID [2022-04-15 11:43:49,928 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20095#true} {20095#true} #678#return; {20095#true} is VALID [2022-04-15 11:43:49,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {20095#true} call ULTIMATE.init(); {20101#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:43:49,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {20101#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {20095#true} is VALID [2022-04-15 11:43:49,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {20095#true} assume true; {20095#true} is VALID [2022-04-15 11:43:49,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20095#true} {20095#true} #678#return; {20095#true} is VALID [2022-04-15 11:43:49,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {20095#true} call #t~ret161 := main(); {20095#true} is VALID [2022-04-15 11:43:49,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {20095#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; {20095#true} is VALID [2022-04-15 11:43:49,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {20095#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {20095#true} is VALID [2022-04-15 11:43:49,929 INFO L272 TraceCheckUtils]: 7: Hoare triple {20095#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {20095#true} is VALID [2022-04-15 11:43:49,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {20095#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); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {20100#(= 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; {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {20100#(= 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; {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {20100#(= 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)))); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} [688] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= v_ssl3_accept_~state~0_22 v_ssl3_accept_~state~0_20)) (.cse1 (= v_ssl3_accept_~skip~0_30 v_ssl3_accept_~skip~0_28)) (.cse2 (= |v_ssl3_accept_#t~mem151_36| |v_ssl3_accept_#t~mem151_32|)) (.cse3 (= |v_ssl3_accept_#t~mem89_12| |v_ssl3_accept_#t~mem89_11|)) (.cse4 (= |v_ssl3_accept_#t~mem48_35| |v_ssl3_accept_#t~mem48_31|)) (.cse5 (= |v_ssl3_accept_#t~mem88.base_12| |v_ssl3_accept_#t~mem88.base_11|)) (.cse6 (= |v_ssl3_accept_#t~mem85_21| |v_ssl3_accept_#t~mem85_19|)) (.cse7 (= |v_ssl3_accept_#t~mem49_26| |v_ssl3_accept_#t~mem49_22|)) (.cse8 (= |v_ssl3_accept_#t~mem150.base_34| |v_ssl3_accept_#t~mem150.base_30|)) (.cse9 (= |v_ssl3_accept_#t~mem50_24| |v_ssl3_accept_#t~mem50_20|)) (.cse10 (= |v_ssl3_accept_#t~mem150.offset_34| |v_ssl3_accept_#t~mem150.offset_30|)) (.cse11 (= |v_ssl3_accept_#t~mem88.offset_12| |v_ssl3_accept_#t~mem88.offset_11|))) (or (and (= |v_#memory_$Pointer$.base_329| |v_#memory_$Pointer$.base_321|) .cse0 (= |v_ssl3_accept_#t~mem83.base_21| |v_ssl3_accept_#t~mem83.base_19|) .cse1 .cse2 (= |v_#memory_int_324| |v_#memory_int_317|) (= |v_ssl3_accept_#t~mem83.offset_21| |v_ssl3_accept_#t~mem83.offset_19|) .cse3 (= |v_#memory_$Pointer$.offset_329| |v_#memory_$Pointer$.offset_321|) .cse4 (= |v_ssl3_accept_#t~mem46_20| |v_ssl3_accept_#t~mem46_18|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |v_ssl3_accept_#t~mem82_21| |v_ssl3_accept_#t~mem82_19|) .cse11 (= |v_ssl3_accept_#t~mem47_37| |v_ssl3_accept_#t~mem47_33|)) (and .cse0 (= |v_ssl3_accept_#t~mem83.base_19| |v_ssl3_accept_#t~mem83.base_21|) .cse1 (= |v_#memory_$Pointer$.base_321| |v_#memory_$Pointer$.base_329|) .cse2 (= |v_ssl3_accept_#t~mem83.offset_19| |v_ssl3_accept_#t~mem83.offset_21|) .cse3 .cse4 (= |v_#memory_int_317| |v_#memory_int_324|) (= |v_#memory_$Pointer$.offset_321| |v_#memory_$Pointer$.offset_329|) (= |v_ssl3_accept_#t~mem47_33| |v_ssl3_accept_#t~mem47_37|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |v_ssl3_accept_#t~mem46_18| |v_ssl3_accept_#t~mem46_20|) (= |v_ssl3_accept_#t~mem82_19| |v_ssl3_accept_#t~mem82_21|) .cse11))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_21|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_329|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_21|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_21|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_36|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_34|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_24|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_12|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_21|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_26|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_35|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_34|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_37|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_20|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_30, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_12|, #memory_int=|v_#memory_int_324|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_12|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_329|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_22} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_19|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_321|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_19|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_19|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_32|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_30|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_20|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_11|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_19|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_22|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_31|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_30|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_33|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_18|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_28, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_11|, #memory_int=|v_#memory_int_317|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_11|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_321|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_20} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem50, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} [689] L1168_primed-->L1167-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} [690] L1167-2-->L1168_primed: Formula: (or (let ((.cse4 (select |v_#memory_int_323| v_ssl3_accept_~s.base_114)) (.cse2 (+ 52 v_ssl3_accept_~s.offset_114))) (let ((.cse1 (select |v_#memory_$Pointer$.base_328| v_ssl3_accept_~s.base_114)) (.cse6 (select |v_#memory_$Pointer$.offset_328| v_ssl3_accept_~s.base_114)) (.cse3 (select |v_#memory_$Pointer$.base_327| v_ssl3_accept_~s.base_114)) (.cse7 (select |v_#memory_$Pointer$.offset_327| v_ssl3_accept_~s.base_114)) (.cse5 (+ 84 v_ssl3_accept_~s.offset_114)) (.cse0 (select .cse4 .cse2))) (and (not (= .cse0 16384)) (not (= .cse0 8481)) (not (= .cse0 8465)) (not (= .cse0 8512)) (= .cse0 v_ssl3_accept_~state~0_21) (not (= 12292 .cse0)) (= 8448 .cse0) (not (= .cse0 8480)) (not (= 8560 .cse0)) (not (= .cse0 8195)) (not (= 8192 .cse0)) (not (= .cse0 8529)) (= (store |v_#memory_$Pointer$.base_328| v_ssl3_accept_~s.base_114 (store .cse1 .cse2 (select .cse3 .cse2))) |v_#memory_$Pointer$.base_327|) (not (= .cse0 8496)) (not (= .cse0 8528)) (not (= 8497 .cse0)) (not (= .cse0 8561)) (= v_ssl3_accept_~skip~0_29 0) (not (= .cse0 8545)) (not (< 0 v_ssl3_accept_~num1~0_13)) (= (store |v_#memory_int_323| v_ssl3_accept_~s.base_114 (store .cse4 .cse2 (select (select |v_#memory_int_323| (select .cse1 .cse5)) (+ (select .cse6 .cse5) 844)))) |v_#memory_int_322|) (= (store |v_#memory_$Pointer$.offset_328| v_ssl3_accept_~s.base_114 (store .cse6 .cse2 (select .cse7 .cse2))) |v_#memory_$Pointer$.offset_327|) (not (= 8464 .cse0)) (not (= 8513 .cse0)) (not (= .cse0 8544)) (not (= .cse0 8482)) (not (= 24576 .cse0)) (not (= (select (select |v_#memory_int_322| (select .cse3 .cse5)) (+ 848 (select .cse7 .cse5))) 0)) (not (= 8466 .cse0))))) (and (= v_ssl3_accept_~s.base_114 v_ssl3_accept_~s.base_114) (= |v_#memory_int_323| |v_#memory_int_322|) (= |v_#memory_$Pointer$.offset_328| |v_#memory_$Pointer$.offset_327|) (= |v_#memory_$Pointer$.base_328| |v_#memory_$Pointer$.base_327|) (= v_ssl3_accept_~s.offset_114 v_ssl3_accept_~s.offset_114) (= v_ssl3_accept_~num1~0_13 v_ssl3_accept_~num1~0_13))) InVars {ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_114, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_328|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_13, #memory_int=|v_#memory_int_323|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_114, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_328|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_327|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_13, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_34|, ssl3_accept_#t~mem52=|v_ssl3_accept_#t~mem52_20|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_20|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_22|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_32|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_29, ssl3_accept_#t~mem53=|v_ssl3_accept_#t~mem53_18|, ssl3_accept_#t~mem54=|v_ssl3_accept_#t~mem54_18|, ssl3_accept_#t~mem55=|v_ssl3_accept_#t~mem55_18|, ssl3_accept_#t~mem133=|v_ssl3_accept_#t~mem133_9|, ssl3_accept_#t~mem56=|v_ssl3_accept_#t~mem56_18|, ssl3_accept_#t~mem57=|v_ssl3_accept_#t~mem57_18|, ssl3_accept_#t~mem132.offset=|v_ssl3_accept_#t~mem132.offset_9|, ssl3_accept_#t~mem58=|v_ssl3_accept_#t~mem58_18|, ssl3_accept_#t~mem59=|v_ssl3_accept_#t~mem59_18|, ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_114, ssl3_accept_#t~mem60=|v_ssl3_accept_#t~mem60_18|, ssl3_accept_#t~mem61=|v_ssl3_accept_#t~mem61_18|, ssl3_accept_#t~mem62=|v_ssl3_accept_#t~mem62_18|, ssl3_accept_#t~mem132.base=|v_ssl3_accept_#t~mem132.base_9|, ssl3_accept_#t~mem63=|v_ssl3_accept_#t~mem63_18|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_32|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_24|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_33|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_35|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_19|, #memory_int=|v_#memory_int_322|, ssl3_accept_#t~mem64=|v_ssl3_accept_#t~mem64_18|, ssl3_accept_#t~mem65=|v_ssl3_accept_#t~mem65_18|, ssl3_accept_#t~mem66=|v_ssl3_accept_#t~mem66_18|, ssl3_accept_#t~mem67=|v_ssl3_accept_#t~mem67_18|, ssl3_accept_#t~mem68=|v_ssl3_accept_#t~mem68_18|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_114, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_327|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_21} AuxVars[] AssignedVars[#memory_$Pointer$.base, ssl3_accept_#t~mem151, ssl3_accept_#t~mem52, ssl3_accept_#t~mem51, ssl3_accept_#t~mem50, ssl3_accept_#t~mem150.offset, ssl3_accept_~skip~0, ssl3_accept_#t~mem53, ssl3_accept_#t~mem54, ssl3_accept_#t~mem55, ssl3_accept_#t~mem133, ssl3_accept_#t~mem56, ssl3_accept_#t~mem57, ssl3_accept_#t~mem132.offset, ssl3_accept_#t~mem58, ssl3_accept_#t~mem59, ssl3_accept_#t~mem60, ssl3_accept_#t~mem61, ssl3_accept_#t~mem62, ssl3_accept_#t~mem132.base, ssl3_accept_#t~mem63, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, #memory_int, ssl3_accept_#t~mem64, ssl3_accept_#t~mem65, ssl3_accept_#t~mem66, ssl3_accept_#t~mem67, ssl3_accept_#t~mem68, #memory_$Pointer$.offset, ssl3_accept_~state~0] {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} [687] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {20100#(= 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); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,935 INFO L290 TraceCheckUtils]: 28: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,935 INFO L290 TraceCheckUtils]: 30: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,936 INFO L290 TraceCheckUtils]: 32: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,936 INFO L290 TraceCheckUtils]: 33: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,937 INFO L290 TraceCheckUtils]: 35: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,937 INFO L290 TraceCheckUtils]: 36: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,937 INFO L290 TraceCheckUtils]: 37: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,937 INFO L290 TraceCheckUtils]: 38: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,938 INFO L290 TraceCheckUtils]: 39: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,938 INFO L290 TraceCheckUtils]: 40: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,938 INFO L290 TraceCheckUtils]: 41: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,938 INFO L290 TraceCheckUtils]: 42: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,939 INFO L290 TraceCheckUtils]: 43: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,939 INFO L290 TraceCheckUtils]: 44: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,939 INFO L290 TraceCheckUtils]: 45: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,939 INFO L290 TraceCheckUtils]: 46: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,940 INFO L290 TraceCheckUtils]: 47: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,940 INFO L290 TraceCheckUtils]: 48: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,940 INFO L290 TraceCheckUtils]: 49: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {20100#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:43:49,940 INFO L290 TraceCheckUtils]: 50: Hoare triple {20100#(= ssl3_accept_~blastFlag~0 0)} assume 7 == ~blastFlag~0; {20096#false} is VALID [2022-04-15 11:43:49,940 INFO L290 TraceCheckUtils]: 51: Hoare triple {20096#false} assume !false; {20096#false} is VALID [2022-04-15 11:43:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 11:43:49,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:43:49,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464778454] [2022-04-15 11:43:49,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464778454] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:49,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:49,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:43:53,892 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:43:53,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [900792840] [2022-04-15 11:43:53,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [900792840] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:53,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:53,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 11:43:53,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369848320] [2022-04-15 11:43:53,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:43:53,893 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-15 11:43:53,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:43:53,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:53,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:53,964 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 11:43:53,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:53,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 11:43:53,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-15 11:43:53,965 INFO L87 Difference]: Start difference. First operand 445 states and 715 transitions. Second operand has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:01,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:01,504 INFO L93 Difference]: Finished difference Result 678 states and 1092 transitions. [2022-04-15 11:44:01,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 11:44:01,504 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-15 11:44:01,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:01,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:01,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 587 transitions. [2022-04-15 11:44:01,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:01,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 587 transitions. [2022-04-15 11:44:01,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 587 transitions. [2022-04-15 11:44:01,880 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-15 11:44:01,889 INFO L225 Difference]: With dead ends: 678 [2022-04-15 11:44:01,889 INFO L226 Difference]: Without dead ends: 457 [2022-04-15 11:44:01,889 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-15 11:44:01,895 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 144 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:44:01,895 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 760 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 742 Invalid, 0 Unknown, 24 Unchecked, 1.9s Time] [2022-04-15 11:44:01,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2022-04-15 11:44:01,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 445. [2022-04-15 11:44:01,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:01,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 457 states. Second operand has 445 states, 440 states have (on average 1.615909090909091) internal successors, (711), 440 states have internal predecessors, (711), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:01,915 INFO L74 IsIncluded]: Start isIncluded. First operand 457 states. Second operand has 445 states, 440 states have (on average 1.615909090909091) internal successors, (711), 440 states have internal predecessors, (711), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:01,915 INFO L87 Difference]: Start difference. First operand 457 states. Second operand has 445 states, 440 states have (on average 1.615909090909091) internal successors, (711), 440 states have internal predecessors, (711), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:01,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:01,923 INFO L93 Difference]: Finished difference Result 457 states and 730 transitions. [2022-04-15 11:44:01,923 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 730 transitions. [2022-04-15 11:44:01,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:01,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:01,925 INFO L74 IsIncluded]: Start isIncluded. First operand has 445 states, 440 states have (on average 1.615909090909091) internal successors, (711), 440 states have internal predecessors, (711), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 457 states. [2022-04-15 11:44:01,925 INFO L87 Difference]: Start difference. First operand has 445 states, 440 states have (on average 1.615909090909091) internal successors, (711), 440 states have internal predecessors, (711), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 457 states. [2022-04-15 11:44:01,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:01,933 INFO L93 Difference]: Finished difference Result 457 states and 730 transitions. [2022-04-15 11:44:01,933 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 730 transitions. [2022-04-15 11:44:01,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:01,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:01,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:01,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:01,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 440 states have (on average 1.615909090909091) internal successors, (711), 440 states have internal predecessors, (711), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:01,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 715 transitions. [2022-04-15 11:44:01,944 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 715 transitions. Word has length 94 [2022-04-15 11:44:01,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:01,944 INFO L478 AbstractCegarLoop]: Abstraction has 445 states and 715 transitions. [2022-04-15 11:44:01,944 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:01,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 445 states and 715 transitions. [2022-04-15 11:44:02,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 715 edges. 715 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:02,802 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 715 transitions. [2022-04-15 11:44:02,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-15 11:44:02,803 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:02,803 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:44:02,804 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:44:02,804 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:02,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:02,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1154554769, now seen corresponding path program 1 times [2022-04-15 11:44:02,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:02,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1412397663] [2022-04-15 11:44:02,999 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 20 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:44:03,000 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:44:03,000 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:44:03,000 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:44:03,001 INFO L85 PathProgramCache]: Analyzing trace with hash -176124709, now seen corresponding path program 1 times [2022-04-15 11:44:03,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:03,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457064392] [2022-04-15 11:44:03,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:03,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:03,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:03,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {23281#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {23275#true} is VALID [2022-04-15 11:44:03,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {23275#true} assume true; {23275#true} is VALID [2022-04-15 11:44:03,119 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23275#true} {23275#true} #678#return; {23275#true} is VALID [2022-04-15 11:44:03,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {23275#true} call ULTIMATE.init(); {23281#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:44:03,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {23281#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {23275#true} is VALID [2022-04-15 11:44:03,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {23275#true} assume true; {23275#true} is VALID [2022-04-15 11:44:03,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23275#true} {23275#true} #678#return; {23275#true} is VALID [2022-04-15 11:44:03,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {23275#true} call #t~ret161 := main(); {23275#true} is VALID [2022-04-15 11:44:03,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {23275#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; {23275#true} is VALID [2022-04-15 11:44:03,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {23275#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {23275#true} is VALID [2022-04-15 11:44:03,121 INFO L272 TraceCheckUtils]: 7: Hoare triple {23275#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {23275#true} is VALID [2022-04-15 11:44:03,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {23275#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); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {23280#(= 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; {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {23280#(= 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; {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {23280#(= 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)))); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} [692] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem88.offset_17| |v_ssl3_accept_#t~mem88.offset_16|)) (.cse1 (= |v_ssl3_accept_#t~mem82_28| |v_ssl3_accept_#t~mem82_26|)) (.cse2 (= |v_ssl3_accept_#t~mem150.offset_42| |v_ssl3_accept_#t~mem150.offset_38|)) (.cse3 (= |v_#memory_$Pointer$.offset_352| |v_#memory_$Pointer$.offset_344|)) (.cse4 (= v_ssl3_accept_~state~0_28 v_ssl3_accept_~state~0_26)) (.cse5 (= |v_ssl3_accept_#t~mem85_28| |v_ssl3_accept_#t~mem85_26|)) (.cse6 (= |v_ssl3_accept_#t~mem47_46| |v_ssl3_accept_#t~mem47_42|)) (.cse7 (= |v_ssl3_accept_#t~mem88.base_17| |v_ssl3_accept_#t~mem88.base_16|)) (.cse8 (= |v_ssl3_accept_#t~mem50_33| |v_ssl3_accept_#t~mem50_29|)) (.cse9 (= |v_ssl3_accept_#t~mem48_44| |v_ssl3_accept_#t~mem48_40|)) (.cse10 (= |v_#memory_$Pointer$.base_352| |v_#memory_$Pointer$.base_344|)) (.cse11 (= |v_ssl3_accept_#t~mem49_35| |v_ssl3_accept_#t~mem49_31|)) (.cse12 (= v_ssl3_accept_~skip~0_36 v_ssl3_accept_~skip~0_34)) (.cse13 (= |v_ssl3_accept_#t~mem83.offset_28| |v_ssl3_accept_#t~mem83.offset_26|)) (.cse14 (= |v_ssl3_accept_#t~mem89_17| |v_ssl3_accept_#t~mem89_16|))) (or (and .cse0 .cse1 .cse2 (= |v_ssl3_accept_#t~mem83.base_26| |v_ssl3_accept_#t~mem83.base_28|) .cse3 .cse4 .cse5 (= |v_#memory_int_339| |v_#memory_int_346|) .cse6 (= |v_ssl3_accept_#t~mem46_24| |v_ssl3_accept_#t~mem46_26|) .cse7 (= |v_ssl3_accept_#t~mem151_40| |v_ssl3_accept_#t~mem151_44|) (= |v_ssl3_accept_#t~mem150.base_38| |v_ssl3_accept_#t~mem150.base_42|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 (= |v_ssl3_accept_#t~mem46_26| |v_ssl3_accept_#t~mem46_24|) .cse3 .cse4 (= |v_#memory_int_346| |v_#memory_int_339|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |v_ssl3_accept_#t~mem83.base_28| |v_ssl3_accept_#t~mem83.base_26|) .cse13 (= |v_ssl3_accept_#t~mem150.base_42| |v_ssl3_accept_#t~mem150.base_38|) (= |v_ssl3_accept_#t~mem151_44| |v_ssl3_accept_#t~mem151_40|) .cse14))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_28|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_352|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_28|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_28|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_44|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_42|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_33|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_17|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_28|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_35|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_44|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_42|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_46|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_26|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_36, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_17|, #memory_int=|v_#memory_int_346|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_17|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_352|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_28} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_26|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_344|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_26|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_26|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_40|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_38|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_29|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_16|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_26|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_31|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_40|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_38|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_42|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_24|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_34, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_16|, #memory_int=|v_#memory_int_339|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_16|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_344|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_26} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem50, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} [693] L1168_primed-->L1167-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} [694] L1167-2-->L1168_primed: Formula: (or (and (= |v_#memory_$Pointer$.base_351| |v_#memory_$Pointer$.base_350|) (= v_ssl3_accept_~s.offset_116 v_ssl3_accept_~s.offset_116) (= |v_#memory_$Pointer$.offset_351| |v_#memory_$Pointer$.offset_350|) (= v_ssl3_accept_~num1~0_14 v_ssl3_accept_~num1~0_14) (= |v_#memory_int_345| |v_#memory_int_344|) (= v_ssl3_accept_~s.base_116 v_ssl3_accept_~s.base_116)) (let ((.cse6 (select |v_#memory_int_345| v_ssl3_accept_~s.base_116)) (.cse1 (+ 52 v_ssl3_accept_~s.offset_116))) (let ((.cse0 (select |v_#memory_$Pointer$.base_351| v_ssl3_accept_~s.base_116)) (.cse4 (select |v_#memory_$Pointer$.offset_351| v_ssl3_accept_~s.base_116)) (.cse2 (select |v_#memory_$Pointer$.base_350| v_ssl3_accept_~s.base_116)) (.cse5 (select |v_#memory_$Pointer$.offset_350| v_ssl3_accept_~s.base_116)) (.cse7 (+ 84 v_ssl3_accept_~s.offset_116)) (.cse3 (select .cse6 .cse1))) (and (= (store |v_#memory_$Pointer$.base_351| v_ssl3_accept_~s.base_116 (store .cse0 .cse1 (select .cse2 .cse1))) |v_#memory_$Pointer$.base_350|) (not (= 8195 .cse3)) (not (= 8480 .cse3)) (not (= 8497 .cse3)) (not (= 8482 .cse3)) (not (= .cse3 8481)) (not (= 16384 .cse3)) (= v_ssl3_accept_~skip~0_35 0) (not (= 12292 .cse3)) (not (= 8528 .cse3)) (not (= 8466 .cse3)) (not (= 8496 .cse3)) (= (store |v_#memory_$Pointer$.offset_351| v_ssl3_accept_~s.base_116 (store .cse4 .cse1 (select .cse5 .cse1))) |v_#memory_$Pointer$.offset_350|) (not (= 24576 .cse3)) (= (store |v_#memory_int_345| v_ssl3_accept_~s.base_116 (store .cse6 .cse1 (select (select |v_#memory_int_345| (select .cse0 .cse7)) (+ 844 (select .cse4 .cse7))))) |v_#memory_int_344|) (not (= 8544 .cse3)) (not (= 8529 .cse3)) (not (= 8465 .cse3)) (not (= 8192 .cse3)) (not (< 0 v_ssl3_accept_~num1~0_14)) (not (= 8464 .cse3)) (not (= 8545 .cse3)) (not (= 8561 .cse3)) (not (= 8560 .cse3)) (not (= 8513 .cse3)) (= 8448 .cse3) (not (= (select (select |v_#memory_int_344| (select .cse2 .cse7)) (+ (select .cse5 .cse7) 848)) 0)) (not (= .cse3 8512)) (= v_ssl3_accept_~state~0_27 .cse3))))) InVars {ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_116, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_351|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_14, #memory_int=|v_#memory_int_345|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_116, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_351|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_350|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_14, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_42|, ssl3_accept_#t~mem52=|v_ssl3_accept_#t~mem52_22|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_22|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_31|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_40|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_35, ssl3_accept_#t~mem53=|v_ssl3_accept_#t~mem53_20|, ssl3_accept_#t~mem54=|v_ssl3_accept_#t~mem54_20|, ssl3_accept_#t~mem55=|v_ssl3_accept_#t~mem55_20|, ssl3_accept_#t~mem133=|v_ssl3_accept_#t~mem133_10|, ssl3_accept_#t~mem56=|v_ssl3_accept_#t~mem56_20|, ssl3_accept_#t~mem57=|v_ssl3_accept_#t~mem57_20|, ssl3_accept_#t~mem132.offset=|v_ssl3_accept_#t~mem132.offset_10|, ssl3_accept_#t~mem58=|v_ssl3_accept_#t~mem58_20|, ssl3_accept_#t~mem59=|v_ssl3_accept_#t~mem59_20|, ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_116, ssl3_accept_#t~mem60=|v_ssl3_accept_#t~mem60_20|, ssl3_accept_#t~mem61=|v_ssl3_accept_#t~mem61_20|, ssl3_accept_#t~mem62=|v_ssl3_accept_#t~mem62_20|, ssl3_accept_#t~mem132.base=|v_ssl3_accept_#t~mem132.base_10|, ssl3_accept_#t~mem63=|v_ssl3_accept_#t~mem63_20|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_40|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_33|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_42|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_44|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_25|, #memory_int=|v_#memory_int_344|, ssl3_accept_#t~mem64=|v_ssl3_accept_#t~mem64_20|, ssl3_accept_#t~mem65=|v_ssl3_accept_#t~mem65_20|, ssl3_accept_#t~mem66=|v_ssl3_accept_#t~mem66_20|, ssl3_accept_#t~mem67=|v_ssl3_accept_#t~mem67_20|, ssl3_accept_#t~mem68=|v_ssl3_accept_#t~mem68_20|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_116, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_350|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_27} AuxVars[] AssignedVars[#memory_$Pointer$.base, ssl3_accept_#t~mem151, ssl3_accept_#t~mem52, ssl3_accept_#t~mem51, ssl3_accept_#t~mem50, ssl3_accept_#t~mem150.offset, ssl3_accept_~skip~0, ssl3_accept_#t~mem53, ssl3_accept_#t~mem54, ssl3_accept_#t~mem55, ssl3_accept_#t~mem133, ssl3_accept_#t~mem56, ssl3_accept_#t~mem57, ssl3_accept_#t~mem132.offset, ssl3_accept_#t~mem58, ssl3_accept_#t~mem59, ssl3_accept_#t~mem60, ssl3_accept_#t~mem61, ssl3_accept_#t~mem62, ssl3_accept_#t~mem132.base, ssl3_accept_#t~mem63, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, #memory_int, ssl3_accept_#t~mem64, ssl3_accept_#t~mem65, ssl3_accept_#t~mem66, ssl3_accept_#t~mem67, ssl3_accept_#t~mem68, #memory_$Pointer$.offset, ssl3_accept_~state~0] {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} [691] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {23280#(= 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); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,125 INFO L290 TraceCheckUtils]: 23: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,125 INFO L290 TraceCheckUtils]: 24: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,125 INFO L290 TraceCheckUtils]: 25: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,136 INFO L290 TraceCheckUtils]: 26: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,146 INFO L290 TraceCheckUtils]: 28: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,147 INFO L290 TraceCheckUtils]: 29: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,147 INFO L290 TraceCheckUtils]: 30: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,147 INFO L290 TraceCheckUtils]: 31: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,147 INFO L290 TraceCheckUtils]: 32: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,148 INFO L290 TraceCheckUtils]: 33: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,148 INFO L290 TraceCheckUtils]: 34: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,148 INFO L290 TraceCheckUtils]: 35: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,148 INFO L290 TraceCheckUtils]: 36: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,149 INFO L290 TraceCheckUtils]: 37: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,149 INFO L290 TraceCheckUtils]: 38: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,149 INFO L290 TraceCheckUtils]: 39: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,149 INFO L290 TraceCheckUtils]: 40: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,150 INFO L290 TraceCheckUtils]: 41: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,150 INFO L290 TraceCheckUtils]: 42: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,150 INFO L290 TraceCheckUtils]: 43: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,150 INFO L290 TraceCheckUtils]: 44: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,151 INFO L290 TraceCheckUtils]: 45: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,151 INFO L290 TraceCheckUtils]: 46: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,151 INFO L290 TraceCheckUtils]: 47: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,151 INFO L290 TraceCheckUtils]: 48: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,151 INFO L290 TraceCheckUtils]: 49: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {23280#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:03,152 INFO L290 TraceCheckUtils]: 50: Hoare triple {23280#(= ssl3_accept_~blastFlag~0 0)} assume 7 == ~blastFlag~0; {23276#false} is VALID [2022-04-15 11:44:03,152 INFO L290 TraceCheckUtils]: 51: Hoare triple {23276#false} assume !false; {23276#false} is VALID [2022-04-15 11:44:03,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 11:44:03,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:03,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457064392] [2022-04-15 11:44:03,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457064392] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:03,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:03,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:44:07,386 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:07,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1412397663] [2022-04-15 11:44:07,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1412397663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:07,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:07,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 11:44:07,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564862309] [2022-04-15 11:44:07,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:07,387 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-15 11:44:07,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:07,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:07,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:07,462 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 11:44:07,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:07,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 11:44:07,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=154, Unknown=2, NotChecked=0, Total=210 [2022-04-15 11:44:07,463 INFO L87 Difference]: Start difference. First operand 445 states and 715 transitions. Second operand has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:12,797 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:44:16,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:16,651 INFO L93 Difference]: Finished difference Result 677 states and 1090 transitions. [2022-04-15 11:44:16,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 11:44:16,651 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-15 11:44:16,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:16,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:16,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 432 transitions. [2022-04-15 11:44:16,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:16,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 432 transitions. [2022-04-15 11:44:16,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 432 transitions. [2022-04-15 11:44:16,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 432 edges. 432 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:16,939 INFO L225 Difference]: With dead ends: 677 [2022-04-15 11:44:16,939 INFO L226 Difference]: Without dead ends: 456 [2022-04-15 11:44:16,940 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=54, Invalid=154, Unknown=2, NotChecked=0, Total=210 [2022-04-15 11:44:16,940 INFO L913 BasicCegarLoop]: 202 mSDtfsCounter, 8 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 269 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:44:16,940 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 703 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 374 Invalid, 0 Unknown, 269 Unchecked, 2.8s Time] [2022-04-15 11:44:16,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-04-15 11:44:16,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 447. [2022-04-15 11:44:16,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:16,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 456 states. Second operand has 447 states, 442 states have (on average 1.6153846153846154) internal successors, (714), 442 states have internal predecessors, (714), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:16,957 INFO L74 IsIncluded]: Start isIncluded. First operand 456 states. Second operand has 447 states, 442 states have (on average 1.6153846153846154) internal successors, (714), 442 states have internal predecessors, (714), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:16,958 INFO L87 Difference]: Start difference. First operand 456 states. Second operand has 447 states, 442 states have (on average 1.6153846153846154) internal successors, (714), 442 states have internal predecessors, (714), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:16,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:16,965 INFO L93 Difference]: Finished difference Result 456 states and 728 transitions. [2022-04-15 11:44:16,965 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 728 transitions. [2022-04-15 11:44:16,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:16,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:16,967 INFO L74 IsIncluded]: Start isIncluded. First operand has 447 states, 442 states have (on average 1.6153846153846154) internal successors, (714), 442 states have internal predecessors, (714), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 456 states. [2022-04-15 11:44:16,968 INFO L87 Difference]: Start difference. First operand has 447 states, 442 states have (on average 1.6153846153846154) internal successors, (714), 442 states have internal predecessors, (714), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 456 states. [2022-04-15 11:44:16,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:16,975 INFO L93 Difference]: Finished difference Result 456 states and 728 transitions. [2022-04-15 11:44:16,975 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 728 transitions. [2022-04-15 11:44:16,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:16,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:16,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:16,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:16,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 442 states have (on average 1.6153846153846154) internal successors, (714), 442 states have internal predecessors, (714), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:16,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 718 transitions. [2022-04-15 11:44:16,986 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 718 transitions. Word has length 94 [2022-04-15 11:44:16,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:16,986 INFO L478 AbstractCegarLoop]: Abstraction has 447 states and 718 transitions. [2022-04-15 11:44:16,987 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:16,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 447 states and 718 transitions. [2022-04-15 11:44:17,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 718 edges. 718 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:17,782 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 718 transitions. [2022-04-15 11:44:17,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-15 11:44:17,783 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:17,783 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:44:17,783 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:44:17,783 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:17,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:17,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1159089924, now seen corresponding path program 1 times [2022-04-15 11:44:17,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:17,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [892563097] [2022-04-15 11:44:17,860 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:44:17,861 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:44:17,861 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:44:17,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1159089924, now seen corresponding path program 2 times [2022-04-15 11:44:17,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:17,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929627604] [2022-04-15 11:44:17,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:17,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:18,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:18,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {26462#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {26455#true} is VALID [2022-04-15 11:44:18,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {26455#true} assume true; {26455#true} is VALID [2022-04-15 11:44:18,013 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26455#true} {26455#true} #678#return; {26455#true} is VALID [2022-04-15 11:44:18,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {26455#true} call ULTIMATE.init(); {26462#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:44:18,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {26462#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {26455#true} is VALID [2022-04-15 11:44:18,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {26455#true} assume true; {26455#true} is VALID [2022-04-15 11:44:18,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26455#true} {26455#true} #678#return; {26455#true} is VALID [2022-04-15 11:44:18,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {26455#true} call #t~ret161 := main(); {26455#true} is VALID [2022-04-15 11:44:18,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {26455#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; {26455#true} is VALID [2022-04-15 11:44:18,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {26455#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {26455#true} is VALID [2022-04-15 11:44:18,015 INFO L272 TraceCheckUtils]: 7: Hoare triple {26455#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {26455#true} is VALID [2022-04-15 11:44:18,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {26455#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); {26460#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:18,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {26460#(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; {26460#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:18,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {26460#(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; {26460#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:18,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {26460#(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)))); {26460#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:18,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {26460#(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); {26460#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:18,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {26460#(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; {26460#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:18,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {26460#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {26460#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:18,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {26460#(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); {26460#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:18,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {26460#(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); {26460#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:18,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {26460#(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); {26460#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:18,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {26460#(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); {26461#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-15 11:44:18,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {26461#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {26456#false} is VALID [2022-04-15 11:44:18,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {26456#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {26456#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {26456#false} is VALID [2022-04-15 11:44:18,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {26456#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {26456#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); {26456#false} is VALID [2022-04-15 11:44:18,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {26456#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {26456#false} is VALID [2022-04-15 11:44:18,021 INFO L290 TraceCheckUtils]: 25: Hoare triple {26456#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); {26456#false} is VALID [2022-04-15 11:44:18,021 INFO L290 TraceCheckUtils]: 26: Hoare triple {26456#false} assume 12292 != #t~mem85;havoc #t~mem85; {26456#false} is VALID [2022-04-15 11:44:18,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {26456#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; {26456#false} is VALID [2022-04-15 11:44:18,021 INFO L290 TraceCheckUtils]: 28: Hoare triple {26456#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); {26456#false} is VALID [2022-04-15 11:44:18,021 INFO L290 TraceCheckUtils]: 29: Hoare triple {26456#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {26456#false} is VALID [2022-04-15 11:44:18,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {26456#false} ~skip~0 := 0; {26456#false} is VALID [2022-04-15 11:44:18,022 INFO L290 TraceCheckUtils]: 31: Hoare triple {26456#false} assume !false; {26456#false} is VALID [2022-04-15 11:44:18,022 INFO L290 TraceCheckUtils]: 32: Hoare triple {26456#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); {26456#false} is VALID [2022-04-15 11:44:18,022 INFO L290 TraceCheckUtils]: 33: Hoare triple {26456#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,022 INFO L290 TraceCheckUtils]: 34: Hoare triple {26456#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,022 INFO L290 TraceCheckUtils]: 35: Hoare triple {26456#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,022 INFO L290 TraceCheckUtils]: 36: Hoare triple {26456#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,022 INFO L290 TraceCheckUtils]: 37: Hoare triple {26456#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,022 INFO L290 TraceCheckUtils]: 38: Hoare triple {26456#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,022 INFO L290 TraceCheckUtils]: 39: Hoare triple {26456#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,022 INFO L290 TraceCheckUtils]: 40: Hoare triple {26456#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,022 INFO L290 TraceCheckUtils]: 41: Hoare triple {26456#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,022 INFO L290 TraceCheckUtils]: 42: Hoare triple {26456#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,023 INFO L290 TraceCheckUtils]: 43: Hoare triple {26456#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,023 INFO L290 TraceCheckUtils]: 44: Hoare triple {26456#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,023 INFO L290 TraceCheckUtils]: 45: Hoare triple {26456#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,023 INFO L290 TraceCheckUtils]: 46: Hoare triple {26456#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,023 INFO L290 TraceCheckUtils]: 47: Hoare triple {26456#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,023 INFO L290 TraceCheckUtils]: 48: Hoare triple {26456#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,023 INFO L290 TraceCheckUtils]: 49: Hoare triple {26456#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,023 INFO L290 TraceCheckUtils]: 50: Hoare triple {26456#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,023 INFO L290 TraceCheckUtils]: 51: Hoare triple {26456#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,023 INFO L290 TraceCheckUtils]: 52: Hoare triple {26456#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,023 INFO L290 TraceCheckUtils]: 53: Hoare triple {26456#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,023 INFO L290 TraceCheckUtils]: 54: Hoare triple {26456#false} assume 8448 == #t~mem68;havoc #t~mem68; {26456#false} is VALID [2022-04-15 11:44:18,023 INFO L290 TraceCheckUtils]: 55: Hoare triple {26456#false} assume !(~num1~0 > 0); {26456#false} is VALID [2022-04-15 11:44:18,023 INFO L290 TraceCheckUtils]: 56: Hoare triple {26456#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; {26456#false} is VALID [2022-04-15 11:44:18,024 INFO L290 TraceCheckUtils]: 57: Hoare triple {26456#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); {26456#false} is VALID [2022-04-15 11:44:18,024 INFO L290 TraceCheckUtils]: 58: Hoare triple {26456#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {26456#false} is VALID [2022-04-15 11:44:18,024 INFO L290 TraceCheckUtils]: 59: Hoare triple {26456#false} ~skip~0 := 0; {26456#false} is VALID [2022-04-15 11:44:18,024 INFO L290 TraceCheckUtils]: 60: Hoare triple {26456#false} assume !false; {26456#false} is VALID [2022-04-15 11:44:18,024 INFO L290 TraceCheckUtils]: 61: Hoare triple {26456#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); {26456#false} is VALID [2022-04-15 11:44:18,024 INFO L290 TraceCheckUtils]: 62: Hoare triple {26456#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,024 INFO L290 TraceCheckUtils]: 63: Hoare triple {26456#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,024 INFO L290 TraceCheckUtils]: 64: Hoare triple {26456#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,024 INFO L290 TraceCheckUtils]: 65: Hoare triple {26456#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,024 INFO L290 TraceCheckUtils]: 66: Hoare triple {26456#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,024 INFO L290 TraceCheckUtils]: 67: Hoare triple {26456#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,024 INFO L290 TraceCheckUtils]: 68: Hoare triple {26456#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,024 INFO L290 TraceCheckUtils]: 69: Hoare triple {26456#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,025 INFO L290 TraceCheckUtils]: 70: Hoare triple {26456#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,025 INFO L290 TraceCheckUtils]: 71: Hoare triple {26456#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,025 INFO L290 TraceCheckUtils]: 72: Hoare triple {26456#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,025 INFO L290 TraceCheckUtils]: 73: Hoare triple {26456#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,025 INFO L290 TraceCheckUtils]: 74: Hoare triple {26456#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,025 INFO L290 TraceCheckUtils]: 75: Hoare triple {26456#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,025 INFO L290 TraceCheckUtils]: 76: Hoare triple {26456#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,025 INFO L290 TraceCheckUtils]: 77: Hoare triple {26456#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,025 INFO L290 TraceCheckUtils]: 78: Hoare triple {26456#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,025 INFO L290 TraceCheckUtils]: 79: Hoare triple {26456#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,025 INFO L290 TraceCheckUtils]: 80: Hoare triple {26456#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,025 INFO L290 TraceCheckUtils]: 81: Hoare triple {26456#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,025 INFO L290 TraceCheckUtils]: 82: Hoare triple {26456#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,025 INFO L290 TraceCheckUtils]: 83: Hoare triple {26456#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,026 INFO L290 TraceCheckUtils]: 84: Hoare triple {26456#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,026 INFO L290 TraceCheckUtils]: 85: Hoare triple {26456#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,026 INFO L290 TraceCheckUtils]: 86: Hoare triple {26456#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,026 INFO L290 TraceCheckUtils]: 87: Hoare triple {26456#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,026 INFO L290 TraceCheckUtils]: 88: Hoare triple {26456#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,026 INFO L290 TraceCheckUtils]: 89: Hoare triple {26456#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {26456#false} is VALID [2022-04-15 11:44:18,026 INFO L290 TraceCheckUtils]: 90: Hoare triple {26456#false} assume 8640 == #t~mem75;havoc #t~mem75; {26456#false} is VALID [2022-04-15 11:44:18,026 INFO L290 TraceCheckUtils]: 91: Hoare triple {26456#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {26456#false} is VALID [2022-04-15 11:44:18,026 INFO L290 TraceCheckUtils]: 92: Hoare triple {26456#false} assume !(4 == ~blastFlag~0); {26456#false} is VALID [2022-04-15 11:44:18,026 INFO L290 TraceCheckUtils]: 93: Hoare triple {26456#false} assume 7 == ~blastFlag~0; {26456#false} is VALID [2022-04-15 11:44:18,026 INFO L290 TraceCheckUtils]: 94: Hoare triple {26456#false} assume !false; {26456#false} is VALID [2022-04-15 11:44:18,027 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:44:18,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:18,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929627604] [2022-04-15 11:44:18,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929627604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:18,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:18,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:18,027 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:18,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [892563097] [2022-04-15 11:44:18,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [892563097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:18,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:18,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:18,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686654846] [2022-04-15 11:44:18,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:18,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2022-04-15 11:44:18,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:18,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:18,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:18,074 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:44:18,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:18,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:44:18,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:44:18,075 INFO L87 Difference]: Start difference. First operand 447 states and 718 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:20,650 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:44:28,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:28,084 INFO L93 Difference]: Finished difference Result 820 states and 1285 transitions. [2022-04-15 11:44:28,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:44:28,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2022-04-15 11:44:28,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:28,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:28,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 581 transitions. [2022-04-15 11:44:28,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:28,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 581 transitions. [2022-04-15 11:44:28,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 581 transitions. [2022-04-15 11:44:28,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 581 edges. 581 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:28,459 INFO L225 Difference]: With dead ends: 820 [2022-04-15 11:44:28,459 INFO L226 Difference]: Without dead ends: 590 [2022-04-15 11:44:28,460 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:44:28,460 INFO L913 BasicCegarLoop]: 123 mSDtfsCounter, 141 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:44:28,461 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 350 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-15 11:44:28,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2022-04-15 11:44:28,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 445. [2022-04-15 11:44:28,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:28,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 590 states. Second operand has 445 states, 440 states have (on average 1.6022727272727273) internal successors, (705), 440 states have internal predecessors, (705), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:28,490 INFO L74 IsIncluded]: Start isIncluded. First operand 590 states. Second operand has 445 states, 440 states have (on average 1.6022727272727273) internal successors, (705), 440 states have internal predecessors, (705), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:28,490 INFO L87 Difference]: Start difference. First operand 590 states. Second operand has 445 states, 440 states have (on average 1.6022727272727273) internal successors, (705), 440 states have internal predecessors, (705), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:28,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:28,502 INFO L93 Difference]: Finished difference Result 590 states and 906 transitions. [2022-04-15 11:44:28,502 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 906 transitions. [2022-04-15 11:44:28,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:28,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:28,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 445 states, 440 states have (on average 1.6022727272727273) internal successors, (705), 440 states have internal predecessors, (705), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 590 states. [2022-04-15 11:44:28,504 INFO L87 Difference]: Start difference. First operand has 445 states, 440 states have (on average 1.6022727272727273) internal successors, (705), 440 states have internal predecessors, (705), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 590 states. [2022-04-15 11:44:28,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:28,515 INFO L93 Difference]: Finished difference Result 590 states and 906 transitions. [2022-04-15 11:44:28,515 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 906 transitions. [2022-04-15 11:44:28,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:28,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:28,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:28,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:28,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 440 states have (on average 1.6022727272727273) internal successors, (705), 440 states have internal predecessors, (705), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 709 transitions. [2022-04-15 11:44:28,526 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 709 transitions. Word has length 95 [2022-04-15 11:44:28,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:28,527 INFO L478 AbstractCegarLoop]: Abstraction has 445 states and 709 transitions. [2022-04-15 11:44:28,527 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:28,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 445 states and 709 transitions. [2022-04-15 11:44:29,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 709 edges. 709 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:29,326 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 709 transitions. [2022-04-15 11:44:29,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-15 11:44:29,327 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:29,327 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:44:29,327 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:44:29,327 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:29,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:29,328 INFO L85 PathProgramCache]: Analyzing trace with hash -659554766, now seen corresponding path program 1 times [2022-04-15 11:44:29,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:29,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1317312896] [2022-04-15 11:44:29,500 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 21 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:44:29,501 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:44:29,501 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:44:29,502 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:44:29,502 INFO L85 PathProgramCache]: Analyzing trace with hash 902442459, now seen corresponding path program 1 times [2022-04-15 11:44:29,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:29,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512213032] [2022-04-15 11:44:29,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:29,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:29,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:29,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {30183#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {30177#true} is VALID [2022-04-15 11:44:29,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {30177#true} assume true; {30177#true} is VALID [2022-04-15 11:44:29,595 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30177#true} {30177#true} #678#return; {30177#true} is VALID [2022-04-15 11:44:29,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {30177#true} call ULTIMATE.init(); {30183#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:44:29,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {30183#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {30177#true} is VALID [2022-04-15 11:44:29,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {30177#true} assume true; {30177#true} is VALID [2022-04-15 11:44:29,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30177#true} {30177#true} #678#return; {30177#true} is VALID [2022-04-15 11:44:29,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {30177#true} call #t~ret161 := main(); {30177#true} is VALID [2022-04-15 11:44:29,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {30177#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; {30177#true} is VALID [2022-04-15 11:44:29,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {30177#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {30177#true} is VALID [2022-04-15 11:44:29,596 INFO L272 TraceCheckUtils]: 7: Hoare triple {30177#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {30177#true} is VALID [2022-04-15 11:44:29,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {30177#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); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {30182#(= 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; {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {30182#(= 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; {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {30182#(= 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)))); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} [696] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem85_37| |v_ssl3_accept_#t~mem85_35|)) (.cse1 (= |v_ssl3_accept_#t~mem83.offset_37| |v_ssl3_accept_#t~mem83.offset_35|)) (.cse2 (= v_ssl3_accept_~skip~0_44 v_ssl3_accept_~skip~0_42)) (.cse3 (= |v_ssl3_accept_#t~mem150.base_54| |v_ssl3_accept_#t~mem150.base_50|)) (.cse4 (= |v_ssl3_accept_#t~mem48_57| |v_ssl3_accept_#t~mem48_53|)) (.cse5 (= |v_ssl3_accept_#t~mem46_34| |v_ssl3_accept_#t~mem46_32|)) (.cse6 (= |v_ssl3_accept_#t~mem49_48| |v_ssl3_accept_#t~mem49_44|)) (.cse7 (= |v_ssl3_accept_#t~mem88.offset_22| |v_ssl3_accept_#t~mem88.offset_21|)) (.cse8 (= |v_#memory_int_381| |v_#memory_int_374|)) (.cse9 (= |v_ssl3_accept_#t~mem50_46| |v_ssl3_accept_#t~mem50_42|)) (.cse10 (= |v_ssl3_accept_#t~mem83.base_37| |v_ssl3_accept_#t~mem83.base_35|)) (.cse11 (= |v_ssl3_accept_#t~mem82_37| |v_ssl3_accept_#t~mem82_35|)) (.cse12 (= v_ssl3_accept_~state~0_36 v_ssl3_accept_~state~0_34)) (.cse13 (= |v_ssl3_accept_#t~mem89_22| |v_ssl3_accept_#t~mem89_21|)) (.cse14 (= |v_ssl3_accept_#t~mem151_56| |v_ssl3_accept_#t~mem151_52|)) (.cse15 (= |v_ssl3_accept_#t~mem150.offset_54| |v_ssl3_accept_#t~mem150.offset_50|))) (or (and .cse0 .cse1 .cse2 (= |v_ssl3_accept_#t~mem51_26| |v_ssl3_accept_#t~mem51_30|) .cse3 (= |v_#memory_$Pointer$.base_390| |v_#memory_$Pointer$.base_398|) (= |v_ssl3_accept_#t~mem88.base_21| |v_ssl3_accept_#t~mem88.base_22|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |v_ssl3_accept_#t~mem47_55| |v_ssl3_accept_#t~mem47_59|) .cse11 .cse12 .cse13 .cse14 .cse15 (= |v_#memory_$Pointer$.offset_390| |v_#memory_$Pointer$.offset_398|)) (and .cse0 .cse1 .cse2 .cse3 (= |v_ssl3_accept_#t~mem88.base_22| |v_ssl3_accept_#t~mem88.base_21|) (= |v_#memory_$Pointer$.offset_398| |v_#memory_$Pointer$.offset_390|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |v_ssl3_accept_#t~mem47_59| |v_ssl3_accept_#t~mem47_55|) .cse13 (= |v_#memory_$Pointer$.base_398| |v_#memory_$Pointer$.base_390|) .cse14 (= |v_ssl3_accept_#t~mem51_30| |v_ssl3_accept_#t~mem51_26|) .cse15))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_37|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_398|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_37|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_37|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_56|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_30|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_54|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_46|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_22|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_37|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_48|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_57|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_54|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_59|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_34|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_44, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_22|, #memory_int=|v_#memory_int_381|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_22|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_398|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_36} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_35|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_390|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_35|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_35|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_52|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_26|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_50|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_42|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_21|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_35|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_44|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_53|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_50|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_55|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_32|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_42, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_21|, #memory_int=|v_#memory_int_374|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_21|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_390|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_34} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem51, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem50, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} [697] L1168_primed-->L1167-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} [698] L1167-2-->L1168_primed: Formula: (or (and (= |v_#memory_int_380| |v_#memory_int_379|) (= v_ssl3_accept_~s.base_120 v_ssl3_accept_~s.base_120) (= v_ssl3_accept_~num1~0_16 v_ssl3_accept_~num1~0_16) (= |v_#memory_$Pointer$.base_397| |v_#memory_$Pointer$.base_396|) (= v_ssl3_accept_~s.offset_120 v_ssl3_accept_~s.offset_120) (= |v_#memory_$Pointer$.offset_397| |v_#memory_$Pointer$.offset_396|)) (let ((.cse6 (select |v_#memory_int_380| v_ssl3_accept_~s.base_120)) (.cse5 (+ 52 v_ssl3_accept_~s.offset_120))) (let ((.cse3 (select |v_#memory_$Pointer$.offset_396| v_ssl3_accept_~s.base_120)) (.cse4 (select |v_#memory_$Pointer$.offset_397| v_ssl3_accept_~s.base_120)) (.cse2 (+ 84 v_ssl3_accept_~s.offset_120)) (.cse7 (select |v_#memory_$Pointer$.base_397| v_ssl3_accept_~s.base_120)) (.cse1 (select |v_#memory_$Pointer$.base_396| v_ssl3_accept_~s.base_120)) (.cse0 (select .cse6 .cse5))) (and (= .cse0 v_ssl3_accept_~state~0_35) (not (= .cse0 8529)) (not (= .cse0 8480)) (not (= 24576 .cse0)) (not (= .cse0 8528)) (not (= .cse0 8544)) (not (= .cse0 8482)) (not (= .cse0 8481)) (not (= (select (select |v_#memory_int_379| (select .cse1 .cse2)) (+ 848 (select .cse3 .cse2))) 0)) (not (= .cse0 8545)) (not (= .cse0 8512)) (not (= .cse0 8496)) (not (= 8497 .cse0)) (not (= 8560 .cse0)) (not (= .cse0 16384)) (not (< 0 v_ssl3_accept_~num1~0_16)) (not (= .cse0 8465)) (not (= 8464 .cse0)) (= 8448 .cse0) (not (= .cse0 8561)) (= v_ssl3_accept_~skip~0_43 0) (= (store |v_#memory_$Pointer$.offset_397| v_ssl3_accept_~s.base_120 (store .cse4 .cse5 (select .cse3 .cse5))) |v_#memory_$Pointer$.offset_396|) (not (= 12292 .cse0)) (not (= 8466 .cse0)) (not (= .cse0 8195)) (= (store |v_#memory_int_380| v_ssl3_accept_~s.base_120 (store .cse6 .cse5 (select (select |v_#memory_int_380| (select .cse7 .cse2)) (+ (select .cse4 .cse2) 844)))) |v_#memory_int_379|) (not (= 8192 .cse0)) (= (store |v_#memory_$Pointer$.base_397| v_ssl3_accept_~s.base_120 (store .cse7 .cse5 (select .cse1 .cse5))) |v_#memory_$Pointer$.base_396|) (not (= 8513 .cse0)))))) InVars {ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_120, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_397|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_16, #memory_int=|v_#memory_int_380|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_120, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_397|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_396|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_16, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_54|, ssl3_accept_#t~mem52=|v_ssl3_accept_#t~mem52_26|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_28|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_44|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_52|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_43, ssl3_accept_#t~mem53=|v_ssl3_accept_#t~mem53_24|, ssl3_accept_#t~mem54=|v_ssl3_accept_#t~mem54_24|, ssl3_accept_#t~mem55=|v_ssl3_accept_#t~mem55_24|, ssl3_accept_#t~mem133=|v_ssl3_accept_#t~mem133_12|, ssl3_accept_#t~mem56=|v_ssl3_accept_#t~mem56_24|, ssl3_accept_#t~mem57=|v_ssl3_accept_#t~mem57_24|, ssl3_accept_#t~mem132.offset=|v_ssl3_accept_#t~mem132.offset_12|, ssl3_accept_#t~mem58=|v_ssl3_accept_#t~mem58_24|, ssl3_accept_#t~mem59=|v_ssl3_accept_#t~mem59_24|, ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_120, ssl3_accept_#t~mem60=|v_ssl3_accept_#t~mem60_24|, ssl3_accept_#t~mem61=|v_ssl3_accept_#t~mem61_24|, ssl3_accept_#t~mem62=|v_ssl3_accept_#t~mem62_24|, ssl3_accept_#t~mem132.base=|v_ssl3_accept_#t~mem132.base_12|, ssl3_accept_#t~mem63=|v_ssl3_accept_#t~mem63_24|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_52|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_46|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_55|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_57|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_33|, #memory_int=|v_#memory_int_379|, ssl3_accept_#t~mem64=|v_ssl3_accept_#t~mem64_24|, ssl3_accept_#t~mem65=|v_ssl3_accept_#t~mem65_24|, ssl3_accept_#t~mem66=|v_ssl3_accept_#t~mem66_24|, ssl3_accept_#t~mem67=|v_ssl3_accept_#t~mem67_24|, ssl3_accept_#t~mem68=|v_ssl3_accept_#t~mem68_24|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_120, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_396|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_35} AuxVars[] AssignedVars[#memory_$Pointer$.base, ssl3_accept_#t~mem151, ssl3_accept_#t~mem52, ssl3_accept_#t~mem51, ssl3_accept_#t~mem50, ssl3_accept_#t~mem150.offset, ssl3_accept_~skip~0, ssl3_accept_#t~mem53, ssl3_accept_#t~mem54, ssl3_accept_#t~mem55, ssl3_accept_#t~mem133, ssl3_accept_#t~mem56, ssl3_accept_#t~mem57, ssl3_accept_#t~mem132.offset, ssl3_accept_#t~mem58, ssl3_accept_#t~mem59, ssl3_accept_#t~mem60, ssl3_accept_#t~mem61, ssl3_accept_#t~mem62, ssl3_accept_#t~mem132.base, ssl3_accept_#t~mem63, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, #memory_int, ssl3_accept_#t~mem64, ssl3_accept_#t~mem65, ssl3_accept_#t~mem66, ssl3_accept_#t~mem67, ssl3_accept_#t~mem68, #memory_$Pointer$.offset, ssl3_accept_~state~0] {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} [695] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,600 INFO L290 TraceCheckUtils]: 18: Hoare triple {30182#(= 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); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,601 INFO L290 TraceCheckUtils]: 21: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,601 INFO L290 TraceCheckUtils]: 22: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,601 INFO L290 TraceCheckUtils]: 23: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,602 INFO L290 TraceCheckUtils]: 24: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,602 INFO L290 TraceCheckUtils]: 25: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,602 INFO L290 TraceCheckUtils]: 26: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,602 INFO L290 TraceCheckUtils]: 27: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,603 INFO L290 TraceCheckUtils]: 28: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,603 INFO L290 TraceCheckUtils]: 29: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,603 INFO L290 TraceCheckUtils]: 30: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,604 INFO L290 TraceCheckUtils]: 31: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,604 INFO L290 TraceCheckUtils]: 32: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,604 INFO L290 TraceCheckUtils]: 33: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,604 INFO L290 TraceCheckUtils]: 34: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,605 INFO L290 TraceCheckUtils]: 35: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,605 INFO L290 TraceCheckUtils]: 36: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,605 INFO L290 TraceCheckUtils]: 37: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,606 INFO L290 TraceCheckUtils]: 38: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,606 INFO L290 TraceCheckUtils]: 39: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,606 INFO L290 TraceCheckUtils]: 40: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,606 INFO L290 TraceCheckUtils]: 41: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,607 INFO L290 TraceCheckUtils]: 42: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,607 INFO L290 TraceCheckUtils]: 43: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,607 INFO L290 TraceCheckUtils]: 44: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,608 INFO L290 TraceCheckUtils]: 45: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,608 INFO L290 TraceCheckUtils]: 46: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,608 INFO L290 TraceCheckUtils]: 47: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,608 INFO L290 TraceCheckUtils]: 48: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,609 INFO L290 TraceCheckUtils]: 49: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {30182#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:29,609 INFO L290 TraceCheckUtils]: 50: Hoare triple {30182#(= ssl3_accept_~blastFlag~0 0)} assume 7 == ~blastFlag~0; {30178#false} is VALID [2022-04-15 11:44:29,609 INFO L290 TraceCheckUtils]: 51: Hoare triple {30178#false} assume !false; {30178#false} is VALID [2022-04-15 11:44:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 11:44:29,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:29,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512213032] [2022-04-15 11:44:29,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512213032] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:29,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:29,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:44:32,822 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:32,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1317312896] [2022-04-15 11:44:32,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1317312896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:32,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:32,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 11:44:32,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541467164] [2022-04-15 11:44:32,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:32,823 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2022-04-15 11:44:32,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:32,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:32,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:32,907 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 11:44:32,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:32,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 11:44:32,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=182, Unknown=1, NotChecked=0, Total=240 [2022-04-15 11:44:32,908 INFO L87 Difference]: Start difference. First operand 445 states and 709 transitions. Second operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:37,691 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:44:39,695 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-15 11:44:42,767 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:44:44,771 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-15 11:44:47,255 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-15 11:44:49,421 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:44:52,636 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:44:55,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:55,918 INFO L93 Difference]: Finished difference Result 678 states and 1083 transitions. [2022-04-15 11:44:55,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 11:44:55,918 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2022-04-15 11:44:55,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:55,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:55,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 587 transitions. [2022-04-15 11:44:55,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:55,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 587 transitions. [2022-04-15 11:44:55,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 587 transitions. [2022-04-15 11:44:56,305 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-15 11:44:56,314 INFO L225 Difference]: With dead ends: 678 [2022-04-15 11:44:56,314 INFO L226 Difference]: Without dead ends: 457 [2022-04-15 11:44:56,314 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=57, Invalid=182, Unknown=1, NotChecked=0, Total=240 [2022-04-15 11:44:56,315 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 139 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:44:56,315 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 959 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 939 Invalid, 2 Unknown, 134 Unchecked, 12.8s Time] [2022-04-15 11:44:56,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2022-04-15 11:44:56,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 445. [2022-04-15 11:44:56,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:56,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 457 states. Second operand has 445 states, 440 states have (on average 1.6022727272727273) internal successors, (705), 440 states have internal predecessors, (705), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:56,332 INFO L74 IsIncluded]: Start isIncluded. First operand 457 states. Second operand has 445 states, 440 states have (on average 1.6022727272727273) internal successors, (705), 440 states have internal predecessors, (705), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:56,332 INFO L87 Difference]: Start difference. First operand 457 states. Second operand has 445 states, 440 states have (on average 1.6022727272727273) internal successors, (705), 440 states have internal predecessors, (705), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:56,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:56,340 INFO L93 Difference]: Finished difference Result 457 states and 724 transitions. [2022-04-15 11:44:56,340 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 724 transitions. [2022-04-15 11:44:56,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:56,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:56,341 INFO L74 IsIncluded]: Start isIncluded. First operand has 445 states, 440 states have (on average 1.6022727272727273) internal successors, (705), 440 states have internal predecessors, (705), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 457 states. [2022-04-15 11:44:56,341 INFO L87 Difference]: Start difference. First operand has 445 states, 440 states have (on average 1.6022727272727273) internal successors, (705), 440 states have internal predecessors, (705), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 457 states. [2022-04-15 11:44:56,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:56,349 INFO L93 Difference]: Finished difference Result 457 states and 724 transitions. [2022-04-15 11:44:56,349 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 724 transitions. [2022-04-15 11:44:56,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:56,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:56,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:56,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:56,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 440 states have (on average 1.6022727272727273) internal successors, (705), 440 states have internal predecessors, (705), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:56,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 709 transitions. [2022-04-15 11:44:56,360 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 709 transitions. Word has length 95 [2022-04-15 11:44:56,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:56,360 INFO L478 AbstractCegarLoop]: Abstraction has 445 states and 709 transitions. [2022-04-15 11:44:56,360 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:56,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 445 states and 709 transitions. [2022-04-15 11:44:57,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 709 edges. 709 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:57,735 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 709 transitions. [2022-04-15 11:44:57,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-15 11:44:57,736 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:57,736 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:44:57,736 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:44:57,736 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:57,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:57,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1724369972, now seen corresponding path program 1 times [2022-04-15 11:44:57,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:57,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [760189221] [2022-04-15 11:44:57,961 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 21 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:44:57,961 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:44:57,961 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:44:57,962 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:44:57,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1981009627, now seen corresponding path program 1 times [2022-04-15 11:44:57,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:57,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512093906] [2022-04-15 11:44:57,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:57,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:58,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:58,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {33364#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {33358#true} is VALID [2022-04-15 11:44:58,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {33358#true} assume true; {33358#true} is VALID [2022-04-15 11:44:58,075 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33358#true} {33358#true} #678#return; {33358#true} is VALID [2022-04-15 11:44:58,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {33358#true} call ULTIMATE.init(); {33364#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:44:58,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {33364#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {33358#true} is VALID [2022-04-15 11:44:58,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {33358#true} assume true; {33358#true} is VALID [2022-04-15 11:44:58,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33358#true} {33358#true} #678#return; {33358#true} is VALID [2022-04-15 11:44:58,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {33358#true} call #t~ret161 := main(); {33358#true} is VALID [2022-04-15 11:44:58,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {33358#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; {33358#true} is VALID [2022-04-15 11:44:58,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {33358#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {33358#true} is VALID [2022-04-15 11:44:58,077 INFO L272 TraceCheckUtils]: 7: Hoare triple {33358#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {33358#true} is VALID [2022-04-15 11:44:58,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {33358#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); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {33363#(= 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; {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {33363#(= 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; {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {33363#(= 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)))); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} [700] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem51_39| |v_ssl3_accept_#t~mem51_35|)) (.cse1 (= |v_ssl3_accept_#t~mem50_55| |v_ssl3_accept_#t~mem50_51|)) (.cse2 (= |v_ssl3_accept_#t~mem150.offset_62| |v_ssl3_accept_#t~mem150.offset_58|)) (.cse3 (= |v_ssl3_accept_#t~mem150.base_62| |v_ssl3_accept_#t~mem150.base_58|)) (.cse4 (= |v_ssl3_accept_#t~mem48_66| |v_ssl3_accept_#t~mem48_62|)) (.cse5 (= |v_ssl3_accept_#t~mem88.base_27| |v_ssl3_accept_#t~mem88.base_26|)) (.cse6 (= |v_ssl3_accept_#t~mem82_44| |v_ssl3_accept_#t~mem82_42|)) (.cse7 (= |v_ssl3_accept_#t~mem83.offset_44| |v_ssl3_accept_#t~mem83.offset_42|)) (.cse8 (= |v_ssl3_accept_#t~mem88.offset_27| |v_ssl3_accept_#t~mem88.offset_26|)) (.cse9 (= |v_ssl3_accept_#t~mem89_27| |v_ssl3_accept_#t~mem89_26|)) (.cse10 (= |v_ssl3_accept_#t~mem49_57| |v_ssl3_accept_#t~mem49_53|)) (.cse11 (= |v_ssl3_accept_#t~mem83.base_44| |v_ssl3_accept_#t~mem83.base_42|)) (.cse12 (= |v_#memory_$Pointer$.base_421| |v_#memory_$Pointer$.base_413|)) (.cse13 (= |v_#memory_$Pointer$.offset_421| |v_#memory_$Pointer$.offset_413|)) (.cse14 (= |v_ssl3_accept_#t~mem47_68| |v_ssl3_accept_#t~mem47_64|)) (.cse15 (= v_ssl3_accept_~skip~0_50 v_ssl3_accept_~skip~0_48)) (.cse16 (= |v_ssl3_accept_#t~mem85_44| |v_ssl3_accept_#t~mem85_42|))) (or (and .cse0 .cse1 .cse2 .cse3 (= |v_#memory_int_403| |v_#memory_int_396|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= v_ssl3_accept_~state~0_42 v_ssl3_accept_~state~0_40) .cse10 (= |v_ssl3_accept_#t~mem46_40| |v_ssl3_accept_#t~mem46_38|) .cse11 .cse12 (= |v_ssl3_accept_#t~mem151_64| |v_ssl3_accept_#t~mem151_60|) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_ssl3_accept_~state~0_40 v_ssl3_accept_~state~0_42) .cse5 .cse6 (= |v_ssl3_accept_#t~mem151_60| |v_ssl3_accept_#t~mem151_64|) (= |v_#memory_int_396| |v_#memory_int_403|) .cse7 .cse8 .cse9 .cse10 (= |v_ssl3_accept_#t~mem46_38| |v_ssl3_accept_#t~mem46_40|) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_44|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_421|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_44|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_44|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_64|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_39|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_62|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_55|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_27|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_44|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_57|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_66|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_62|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_68|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_40|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_50, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_27|, #memory_int=|v_#memory_int_403|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_27|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_421|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_42} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_42|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_413|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_42|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_42|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_60|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_35|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_58|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_51|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_26|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_42|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_53|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_62|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_58|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_64|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_38|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_48, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_26|, #memory_int=|v_#memory_int_396|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_26|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_413|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_40} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem51, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem50, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} [701] L1168_primed-->L1167-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} [702] L1167-2-->L1168_primed: Formula: (or (and (= v_ssl3_accept_~s.base_122 v_ssl3_accept_~s.base_122) (= |v_#memory_int_402| |v_#memory_int_401|) (= v_ssl3_accept_~num1~0_17 v_ssl3_accept_~num1~0_17) (= v_ssl3_accept_~s.offset_122 v_ssl3_accept_~s.offset_122) (= |v_#memory_$Pointer$.offset_420| |v_#memory_$Pointer$.offset_419|) (= |v_#memory_$Pointer$.base_420| |v_#memory_$Pointer$.base_419|)) (let ((.cse4 (select |v_#memory_int_402| v_ssl3_accept_~s.base_122)) (.cse5 (+ 52 v_ssl3_accept_~s.offset_122))) (let ((.cse1 (+ 84 v_ssl3_accept_~s.offset_122)) (.cse6 (select |v_#memory_$Pointer$.base_420| v_ssl3_accept_~s.base_122)) (.cse0 (select |v_#memory_$Pointer$.base_419| v_ssl3_accept_~s.base_122)) (.cse7 (select |v_#memory_$Pointer$.offset_420| v_ssl3_accept_~s.base_122)) (.cse2 (select |v_#memory_$Pointer$.offset_419| v_ssl3_accept_~s.base_122)) (.cse3 (select .cse4 .cse5))) (and (not (= (select (select |v_#memory_int_401| (select .cse0 .cse1)) (+ 848 (select .cse2 .cse1))) 0)) (not (= 8560 .cse3)) (not (= .cse3 8464)) (not (< 0 v_ssl3_accept_~num1~0_17)) (not (= .cse3 8481)) (not (= 8497 .cse3)) (not (= 12292 .cse3)) (not (= .cse3 8482)) (not (= .cse3 8480)) (= (store |v_#memory_int_402| v_ssl3_accept_~s.base_122 (store .cse4 .cse5 (select (select |v_#memory_int_402| (select .cse6 .cse1)) (+ 844 (select .cse7 .cse1))))) |v_#memory_int_401|) (= v_ssl3_accept_~skip~0_49 0) (not (= .cse3 8465)) (not (= .cse3 24576)) (not (= .cse3 8512)) (= |v_#memory_$Pointer$.base_419| (store |v_#memory_$Pointer$.base_420| v_ssl3_accept_~s.base_122 (store .cse6 .cse5 (select .cse0 .cse5)))) (not (= 8513 .cse3)) (not (= .cse3 8544)) (not (= 8466 .cse3)) (not (= .cse3 8545)) (= .cse3 v_ssl3_accept_~state~0_41) (= (store |v_#memory_$Pointer$.offset_420| v_ssl3_accept_~s.base_122 (store .cse7 .cse5 (select .cse2 .cse5))) |v_#memory_$Pointer$.offset_419|) (= 8448 .cse3) (not (= .cse3 8195)) (not (= 8192 .cse3)) (not (= .cse3 8496)) (not (= .cse3 8561)) (not (= .cse3 8529)) (not (= .cse3 16384)) (not (= .cse3 8528)))))) InVars {ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_122, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_420|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_17, #memory_int=|v_#memory_int_402|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_122, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_420|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_419|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_17, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_62|, ssl3_accept_#t~mem52=|v_ssl3_accept_#t~mem52_28|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_37|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_53|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_60|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_49, ssl3_accept_#t~mem53=|v_ssl3_accept_#t~mem53_26|, ssl3_accept_#t~mem54=|v_ssl3_accept_#t~mem54_26|, ssl3_accept_#t~mem55=|v_ssl3_accept_#t~mem55_26|, ssl3_accept_#t~mem133=|v_ssl3_accept_#t~mem133_13|, ssl3_accept_#t~mem56=|v_ssl3_accept_#t~mem56_26|, ssl3_accept_#t~mem57=|v_ssl3_accept_#t~mem57_26|, ssl3_accept_#t~mem132.offset=|v_ssl3_accept_#t~mem132.offset_13|, ssl3_accept_#t~mem58=|v_ssl3_accept_#t~mem58_26|, ssl3_accept_#t~mem59=|v_ssl3_accept_#t~mem59_26|, ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_122, ssl3_accept_#t~mem60=|v_ssl3_accept_#t~mem60_26|, ssl3_accept_#t~mem61=|v_ssl3_accept_#t~mem61_26|, ssl3_accept_#t~mem62=|v_ssl3_accept_#t~mem62_26|, ssl3_accept_#t~mem132.base=|v_ssl3_accept_#t~mem132.base_13|, ssl3_accept_#t~mem63=|v_ssl3_accept_#t~mem63_26|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_60|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_55|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_64|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_66|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_39|, #memory_int=|v_#memory_int_401|, ssl3_accept_#t~mem64=|v_ssl3_accept_#t~mem64_26|, ssl3_accept_#t~mem65=|v_ssl3_accept_#t~mem65_26|, ssl3_accept_#t~mem66=|v_ssl3_accept_#t~mem66_26|, ssl3_accept_#t~mem67=|v_ssl3_accept_#t~mem67_26|, ssl3_accept_#t~mem68=|v_ssl3_accept_#t~mem68_26|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_122, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_419|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_41} AuxVars[] AssignedVars[#memory_$Pointer$.base, ssl3_accept_#t~mem151, ssl3_accept_#t~mem52, ssl3_accept_#t~mem51, ssl3_accept_#t~mem50, ssl3_accept_#t~mem150.offset, ssl3_accept_~skip~0, ssl3_accept_#t~mem53, ssl3_accept_#t~mem54, ssl3_accept_#t~mem55, ssl3_accept_#t~mem133, ssl3_accept_#t~mem56, ssl3_accept_#t~mem57, ssl3_accept_#t~mem132.offset, ssl3_accept_#t~mem58, ssl3_accept_#t~mem59, ssl3_accept_#t~mem60, ssl3_accept_#t~mem61, ssl3_accept_#t~mem62, ssl3_accept_#t~mem132.base, ssl3_accept_#t~mem63, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, #memory_int, ssl3_accept_#t~mem64, ssl3_accept_#t~mem65, ssl3_accept_#t~mem66, ssl3_accept_#t~mem67, ssl3_accept_#t~mem68, #memory_$Pointer$.offset, ssl3_accept_~state~0] {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} [699] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {33363#(= 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); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,081 INFO L290 TraceCheckUtils]: 22: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,082 INFO L290 TraceCheckUtils]: 24: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,082 INFO L290 TraceCheckUtils]: 26: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,083 INFO L290 TraceCheckUtils]: 28: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,083 INFO L290 TraceCheckUtils]: 29: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,084 INFO L290 TraceCheckUtils]: 31: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,084 INFO L290 TraceCheckUtils]: 32: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,084 INFO L290 TraceCheckUtils]: 33: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,085 INFO L290 TraceCheckUtils]: 34: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,085 INFO L290 TraceCheckUtils]: 35: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,085 INFO L290 TraceCheckUtils]: 36: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,085 INFO L290 TraceCheckUtils]: 37: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,086 INFO L290 TraceCheckUtils]: 38: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,086 INFO L290 TraceCheckUtils]: 39: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,086 INFO L290 TraceCheckUtils]: 40: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,087 INFO L290 TraceCheckUtils]: 41: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,087 INFO L290 TraceCheckUtils]: 42: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,087 INFO L290 TraceCheckUtils]: 43: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,087 INFO L290 TraceCheckUtils]: 44: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,088 INFO L290 TraceCheckUtils]: 45: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,088 INFO L290 TraceCheckUtils]: 46: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,088 INFO L290 TraceCheckUtils]: 47: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,088 INFO L290 TraceCheckUtils]: 48: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,089 INFO L290 TraceCheckUtils]: 49: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {33363#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:58,089 INFO L290 TraceCheckUtils]: 50: Hoare triple {33363#(= ssl3_accept_~blastFlag~0 0)} assume 7 == ~blastFlag~0; {33359#false} is VALID [2022-04-15 11:44:58,089 INFO L290 TraceCheckUtils]: 51: Hoare triple {33359#false} assume !false; {33359#false} is VALID [2022-04-15 11:44:58,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 11:44:58,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:58,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512093906] [2022-04-15 11:44:58,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512093906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:58,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:58,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:45:01,409 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:45:01,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [760189221] [2022-04-15 11:45:01,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [760189221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:01,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:01,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 11:45:01,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67577865] [2022-04-15 11:45:01,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:45:01,410 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2022-04-15 11:45:01,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:45:01,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:01,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:01,483 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 11:45:01,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:01,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 11:45:01,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=182, Unknown=1, NotChecked=0, Total=240 [2022-04-15 11:45:01,484 INFO L87 Difference]: Start difference. First operand 445 states and 709 transitions. Second operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:05,035 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-15 11:45:08,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:15,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:15,764 INFO L93 Difference]: Finished difference Result 676 states and 1080 transitions. [2022-04-15 11:45:15,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 11:45:15,765 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2022-04-15 11:45:15,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:45:15,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:15,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 430 transitions. [2022-04-15 11:45:15,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:15,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 430 transitions. [2022-04-15 11:45:15,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 430 transitions. [2022-04-15 11:45:16,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 430 edges. 430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:16,054 INFO L225 Difference]: With dead ends: 676 [2022-04-15 11:45:16,054 INFO L226 Difference]: Without dead ends: 455 [2022-04-15 11:45:16,054 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=57, Invalid=182, Unknown=1, NotChecked=0, Total=240 [2022-04-15 11:45:16,055 INFO L913 BasicCegarLoop]: 201 mSDtfsCounter, 7 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:45:16,055 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 928 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 704 Invalid, 2 Unknown, 132 Unchecked, 8.5s Time] [2022-04-15 11:45:16,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-04-15 11:45:16,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 447. [2022-04-15 11:45:16,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:45:16,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 455 states. Second operand has 447 states, 442 states have (on average 1.6018099547511313) internal successors, (708), 442 states have internal predecessors, (708), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:16,072 INFO L74 IsIncluded]: Start isIncluded. First operand 455 states. Second operand has 447 states, 442 states have (on average 1.6018099547511313) internal successors, (708), 442 states have internal predecessors, (708), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:16,072 INFO L87 Difference]: Start difference. First operand 455 states. Second operand has 447 states, 442 states have (on average 1.6018099547511313) internal successors, (708), 442 states have internal predecessors, (708), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:16,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:16,080 INFO L93 Difference]: Finished difference Result 455 states and 721 transitions. [2022-04-15 11:45:16,080 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 721 transitions. [2022-04-15 11:45:16,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:16,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:16,081 INFO L74 IsIncluded]: Start isIncluded. First operand has 447 states, 442 states have (on average 1.6018099547511313) internal successors, (708), 442 states have internal predecessors, (708), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 455 states. [2022-04-15 11:45:16,081 INFO L87 Difference]: Start difference. First operand has 447 states, 442 states have (on average 1.6018099547511313) internal successors, (708), 442 states have internal predecessors, (708), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 455 states. [2022-04-15 11:45:16,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:16,089 INFO L93 Difference]: Finished difference Result 455 states and 721 transitions. [2022-04-15 11:45:16,089 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 721 transitions. [2022-04-15 11:45:16,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:16,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:16,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:45:16,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:45:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 442 states have (on average 1.6018099547511313) internal successors, (708), 442 states have internal predecessors, (708), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:16,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 712 transitions. [2022-04-15 11:45:16,100 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 712 transitions. Word has length 95 [2022-04-15 11:45:16,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:45:16,100 INFO L478 AbstractCegarLoop]: Abstraction has 447 states and 712 transitions. [2022-04-15 11:45:16,100 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:16,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 447 states and 712 transitions. [2022-04-15 11:45:18,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 712 edges. 712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:18,229 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 712 transitions. [2022-04-15 11:45:18,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-15 11:45:18,230 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:45:18,230 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1] [2022-04-15 11:45:18,230 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 11:45:18,231 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:45:18,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:45:18,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1613927131, now seen corresponding path program 1 times [2022-04-15 11:45:18,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:18,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1695707406] [2022-04-15 11:45:18,271 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:45:18,271 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:45:18,272 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:45:18,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1613927131, now seen corresponding path program 2 times [2022-04-15 11:45:18,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:45:18,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544466507] [2022-04-15 11:45:18,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:45:18,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:45:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:18,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:45:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:18,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {36542#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {36535#true} is VALID [2022-04-15 11:45:18,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {36535#true} assume true; {36535#true} is VALID [2022-04-15 11:45:18,440 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36535#true} {36535#true} #678#return; {36535#true} is VALID [2022-04-15 11:45:18,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {36535#true} call ULTIMATE.init(); {36542#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:45:18,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {36542#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {36535#true} is VALID [2022-04-15 11:45:18,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {36535#true} assume true; {36535#true} is VALID [2022-04-15 11:45:18,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36535#true} {36535#true} #678#return; {36535#true} is VALID [2022-04-15 11:45:18,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {36535#true} call #t~ret161 := main(); {36535#true} is VALID [2022-04-15 11:45:18,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {36535#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; {36535#true} is VALID [2022-04-15 11:45:18,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {36535#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {36535#true} is VALID [2022-04-15 11:45:18,442 INFO L272 TraceCheckUtils]: 7: Hoare triple {36535#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {36535#true} is VALID [2022-04-15 11:45:18,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {36535#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); {36535#true} is VALID [2022-04-15 11:45:18,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {36535#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; {36535#true} is VALID [2022-04-15 11:45:18,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {36535#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; {36535#true} is VALID [2022-04-15 11:45:18,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {36535#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {36535#true} is VALID [2022-04-15 11:45:18,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {36535#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {36535#true} is VALID [2022-04-15 11:45:18,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {36535#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {36535#true} is VALID [2022-04-15 11:45:18,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {36535#true} assume !false; {36535#true} is VALID [2022-04-15 11:45:18,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {36535#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); {36535#true} is VALID [2022-04-15 11:45:18,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {36535#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36535#true} is VALID [2022-04-15 11:45:18,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {36535#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36535#true} is VALID [2022-04-15 11:45:18,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {36535#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36535#true} is VALID [2022-04-15 11:45:18,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {36535#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36535#true} is VALID [2022-04-15 11:45:18,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {36535#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36535#true} is VALID [2022-04-15 11:45:18,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {36535#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36535#true} is VALID [2022-04-15 11:45:18,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {36535#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36535#true} is VALID [2022-04-15 11:45:18,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {36535#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36535#true} is VALID [2022-04-15 11:45:18,443 INFO L290 TraceCheckUtils]: 24: Hoare triple {36535#true} assume 8464 == #t~mem55;havoc #t~mem55; {36535#true} is VALID [2022-04-15 11:45:18,443 INFO L290 TraceCheckUtils]: 25: Hoare triple {36535#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; {36535#true} is VALID [2022-04-15 11:45:18,443 INFO L290 TraceCheckUtils]: 26: Hoare triple {36535#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {36535#true} is VALID [2022-04-15 11:45:18,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {36535#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); {36540#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:18,445 INFO L290 TraceCheckUtils]: 28: Hoare triple {36540#(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); {36540#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:18,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {36540#(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; {36540#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:18,445 INFO L290 TraceCheckUtils]: 30: Hoare triple {36540#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {36540#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:18,446 INFO L290 TraceCheckUtils]: 31: Hoare triple {36540#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {36540#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:18,446 INFO L290 TraceCheckUtils]: 32: Hoare triple {36540#(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); {36540#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:18,446 INFO L290 TraceCheckUtils]: 33: Hoare triple {36540#(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); {36540#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:18,447 INFO L290 TraceCheckUtils]: 34: Hoare triple {36540#(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); {36540#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:18,447 INFO L290 TraceCheckUtils]: 35: Hoare triple {36540#(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); {36540#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:18,448 INFO L290 TraceCheckUtils]: 36: Hoare triple {36540#(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); {36540#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:18,448 INFO L290 TraceCheckUtils]: 37: Hoare triple {36540#(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); {36540#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:18,448 INFO L290 TraceCheckUtils]: 38: Hoare triple {36540#(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); {36540#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:18,449 INFO L290 TraceCheckUtils]: 39: Hoare triple {36540#(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); {36540#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:18,449 INFO L290 TraceCheckUtils]: 40: Hoare triple {36540#(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); {36540#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:18,449 INFO L290 TraceCheckUtils]: 41: Hoare triple {36540#(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); {36540#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:18,450 INFO L290 TraceCheckUtils]: 42: Hoare triple {36540#(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); {36540#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:18,450 INFO L290 TraceCheckUtils]: 43: Hoare triple {36540#(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); {36540#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:18,450 INFO L290 TraceCheckUtils]: 44: Hoare triple {36540#(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); {36540#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:18,451 INFO L290 TraceCheckUtils]: 45: Hoare triple {36540#(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); {36540#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:18,451 INFO L290 TraceCheckUtils]: 46: Hoare triple {36540#(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); {36540#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:18,451 INFO L290 TraceCheckUtils]: 47: Hoare triple {36540#(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); {36540#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:18,452 INFO L290 TraceCheckUtils]: 48: Hoare triple {36540#(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); {36540#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:18,452 INFO L290 TraceCheckUtils]: 49: Hoare triple {36540#(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); {36540#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:18,453 INFO L290 TraceCheckUtils]: 50: Hoare triple {36540#(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); {36540#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:18,453 INFO L290 TraceCheckUtils]: 51: Hoare triple {36540#(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); {36540#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:18,453 INFO L290 TraceCheckUtils]: 52: Hoare triple {36540#(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); {36540#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:18,454 INFO L290 TraceCheckUtils]: 53: Hoare triple {36540#(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); {36541#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-15 11:45:18,454 INFO L290 TraceCheckUtils]: 54: Hoare triple {36541#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {36536#false} is VALID [2022-04-15 11:45:18,454 INFO L290 TraceCheckUtils]: 55: Hoare triple {36536#false} assume !(~num1~0 > 0); {36536#false} is VALID [2022-04-15 11:45:18,454 INFO L290 TraceCheckUtils]: 56: Hoare triple {36536#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; {36536#false} is VALID [2022-04-15 11:45:18,454 INFO L290 TraceCheckUtils]: 57: Hoare triple {36536#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); {36536#false} is VALID [2022-04-15 11:45:18,454 INFO L290 TraceCheckUtils]: 58: Hoare triple {36536#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36536#false} is VALID [2022-04-15 11:45:18,454 INFO L290 TraceCheckUtils]: 59: Hoare triple {36536#false} ~skip~0 := 0; {36536#false} is VALID [2022-04-15 11:45:18,454 INFO L290 TraceCheckUtils]: 60: Hoare triple {36536#false} assume !false; {36536#false} is VALID [2022-04-15 11:45:18,454 INFO L290 TraceCheckUtils]: 61: Hoare triple {36536#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); {36536#false} is VALID [2022-04-15 11:45:18,455 INFO L290 TraceCheckUtils]: 62: Hoare triple {36536#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36536#false} is VALID [2022-04-15 11:45:18,455 INFO L290 TraceCheckUtils]: 63: Hoare triple {36536#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36536#false} is VALID [2022-04-15 11:45:18,455 INFO L290 TraceCheckUtils]: 64: Hoare triple {36536#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36536#false} is VALID [2022-04-15 11:45:18,455 INFO L290 TraceCheckUtils]: 65: Hoare triple {36536#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36536#false} is VALID [2022-04-15 11:45:18,455 INFO L290 TraceCheckUtils]: 66: Hoare triple {36536#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36536#false} is VALID [2022-04-15 11:45:18,455 INFO L290 TraceCheckUtils]: 67: Hoare triple {36536#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36536#false} is VALID [2022-04-15 11:45:18,455 INFO L290 TraceCheckUtils]: 68: Hoare triple {36536#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36536#false} is VALID [2022-04-15 11:45:18,455 INFO L290 TraceCheckUtils]: 69: Hoare triple {36536#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36536#false} is VALID [2022-04-15 11:45:18,455 INFO L290 TraceCheckUtils]: 70: Hoare triple {36536#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36536#false} is VALID [2022-04-15 11:45:18,455 INFO L290 TraceCheckUtils]: 71: Hoare triple {36536#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36536#false} is VALID [2022-04-15 11:45:18,455 INFO L290 TraceCheckUtils]: 72: Hoare triple {36536#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36536#false} is VALID [2022-04-15 11:45:18,455 INFO L290 TraceCheckUtils]: 73: Hoare triple {36536#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36536#false} is VALID [2022-04-15 11:45:18,455 INFO L290 TraceCheckUtils]: 74: Hoare triple {36536#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {36536#false} is VALID [2022-04-15 11:45:18,455 INFO L290 TraceCheckUtils]: 75: Hoare triple {36536#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {36536#false} is VALID [2022-04-15 11:45:18,456 INFO L290 TraceCheckUtils]: 76: Hoare triple {36536#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {36536#false} is VALID [2022-04-15 11:45:18,456 INFO L290 TraceCheckUtils]: 77: Hoare triple {36536#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {36536#false} is VALID [2022-04-15 11:45:18,456 INFO L290 TraceCheckUtils]: 78: Hoare triple {36536#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {36536#false} is VALID [2022-04-15 11:45:18,456 INFO L290 TraceCheckUtils]: 79: Hoare triple {36536#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {36536#false} is VALID [2022-04-15 11:45:18,456 INFO L290 TraceCheckUtils]: 80: Hoare triple {36536#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {36536#false} is VALID [2022-04-15 11:45:18,456 INFO L290 TraceCheckUtils]: 81: Hoare triple {36536#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {36536#false} is VALID [2022-04-15 11:45:18,456 INFO L290 TraceCheckUtils]: 82: Hoare triple {36536#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {36536#false} is VALID [2022-04-15 11:45:18,456 INFO L290 TraceCheckUtils]: 83: Hoare triple {36536#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {36536#false} is VALID [2022-04-15 11:45:18,456 INFO L290 TraceCheckUtils]: 84: Hoare triple {36536#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {36536#false} is VALID [2022-04-15 11:45:18,456 INFO L290 TraceCheckUtils]: 85: Hoare triple {36536#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {36536#false} is VALID [2022-04-15 11:45:18,456 INFO L290 TraceCheckUtils]: 86: Hoare triple {36536#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {36536#false} is VALID [2022-04-15 11:45:18,456 INFO L290 TraceCheckUtils]: 87: Hoare triple {36536#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {36536#false} is VALID [2022-04-15 11:45:18,456 INFO L290 TraceCheckUtils]: 88: Hoare triple {36536#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {36536#false} is VALID [2022-04-15 11:45:18,457 INFO L290 TraceCheckUtils]: 89: Hoare triple {36536#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {36536#false} is VALID [2022-04-15 11:45:18,457 INFO L290 TraceCheckUtils]: 90: Hoare triple {36536#false} assume 8640 == #t~mem75;havoc #t~mem75; {36536#false} is VALID [2022-04-15 11:45:18,457 INFO L290 TraceCheckUtils]: 91: Hoare triple {36536#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {36536#false} is VALID [2022-04-15 11:45:18,457 INFO L290 TraceCheckUtils]: 92: Hoare triple {36536#false} assume !(4 == ~blastFlag~0); {36536#false} is VALID [2022-04-15 11:45:18,457 INFO L290 TraceCheckUtils]: 93: Hoare triple {36536#false} assume 7 == ~blastFlag~0; {36536#false} is VALID [2022-04-15 11:45:18,457 INFO L290 TraceCheckUtils]: 94: Hoare triple {36536#false} assume !false; {36536#false} is VALID [2022-04-15 11:45:18,457 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:45:18,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:45:18,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544466507] [2022-04-15 11:45:18,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544466507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:18,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:18,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:18,458 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:45:18,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1695707406] [2022-04-15 11:45:18,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1695707406] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:18,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:18,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:18,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419602329] [2022-04-15 11:45:18,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:45:18,458 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 95 [2022-04-15 11:45:18,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:45:18,459 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-15 11:45:18,537 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-15 11:45:18,537 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:45:18,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:18,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:45:18,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:45:18,538 INFO L87 Difference]: Start difference. First operand 447 states and 712 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-15 11:45:20,750 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:24,621 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-15 11:45:26,674 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:30,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:30,717 INFO L93 Difference]: Finished difference Result 1163 states and 1857 transitions. [2022-04-15 11:45:30,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:45:30,718 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 95 [2022-04-15 11:45:30,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:45:30,718 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-15 11:45:30,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-15 11:45:30,720 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-15 11:45:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-15 11:45:30,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 576 transitions. [2022-04-15 11:45:31,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 576 edges. 576 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:31,148 INFO L225 Difference]: With dead ends: 1163 [2022-04-15 11:45:31,148 INFO L226 Difference]: Without dead ends: 744 [2022-04-15 11:45:31,149 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:45:31,150 INFO L913 BasicCegarLoop]: 250 mSDtfsCounter, 122 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:45:31,150 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 602 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-04-15 11:45:31,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2022-04-15 11:45:31,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 575. [2022-04-15 11:45:31,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:45:31,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 744 states. Second operand has 575 states, 570 states have (on average 1.6280701754385964) internal successors, (928), 570 states have internal predecessors, (928), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:31,193 INFO L74 IsIncluded]: Start isIncluded. First operand 744 states. Second operand has 575 states, 570 states have (on average 1.6280701754385964) internal successors, (928), 570 states have internal predecessors, (928), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:31,193 INFO L87 Difference]: Start difference. First operand 744 states. Second operand has 575 states, 570 states have (on average 1.6280701754385964) internal successors, (928), 570 states have internal predecessors, (928), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:31,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:31,209 INFO L93 Difference]: Finished difference Result 744 states and 1177 transitions. [2022-04-15 11:45:31,209 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1177 transitions. [2022-04-15 11:45:31,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:31,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:31,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 575 states, 570 states have (on average 1.6280701754385964) internal successors, (928), 570 states have internal predecessors, (928), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 744 states. [2022-04-15 11:45:31,211 INFO L87 Difference]: Start difference. First operand has 575 states, 570 states have (on average 1.6280701754385964) internal successors, (928), 570 states have internal predecessors, (928), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 744 states. [2022-04-15 11:45:31,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:31,227 INFO L93 Difference]: Finished difference Result 744 states and 1177 transitions. [2022-04-15 11:45:31,227 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1177 transitions. [2022-04-15 11:45:31,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:31,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:31,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:45:31,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:45:31,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 570 states have (on average 1.6280701754385964) internal successors, (928), 570 states have internal predecessors, (928), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:31,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 932 transitions. [2022-04-15 11:45:31,242 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 932 transitions. Word has length 95 [2022-04-15 11:45:31,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:45:31,242 INFO L478 AbstractCegarLoop]: Abstraction has 575 states and 932 transitions. [2022-04-15 11:45:31,242 INFO L479 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-15 11:45:31,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 575 states and 932 transitions. [2022-04-15 11:45:33,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 932 edges. 932 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:33,600 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 932 transitions. [2022-04-15 11:45:33,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-15 11:45:33,601 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:45:33,601 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:45:33,602 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 11:45:33,602 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:45:33,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:45:33,602 INFO L85 PathProgramCache]: Analyzing trace with hash -343569407, now seen corresponding path program 1 times [2022-04-15 11:45:33,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:33,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1145385802] [2022-04-15 11:45:33,647 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:45:33,647 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:45:33,647 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:45:33,647 INFO L85 PathProgramCache]: Analyzing trace with hash -343569407, now seen corresponding path program 2 times [2022-04-15 11:45:33,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:45:33,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95411182] [2022-04-15 11:45:33,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:45:33,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:45:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:33,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:45:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:33,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {41518#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {41511#true} is VALID [2022-04-15 11:45:33,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {41511#true} assume true; {41511#true} is VALID [2022-04-15 11:45:33,827 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41511#true} {41511#true} #678#return; {41511#true} is VALID [2022-04-15 11:45:33,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {41511#true} call ULTIMATE.init(); {41518#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:45:33,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {41518#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {41511#true} is VALID [2022-04-15 11:45:33,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {41511#true} assume true; {41511#true} is VALID [2022-04-15 11:45:33,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41511#true} {41511#true} #678#return; {41511#true} is VALID [2022-04-15 11:45:33,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {41511#true} call #t~ret161 := main(); {41511#true} is VALID [2022-04-15 11:45:33,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {41511#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; {41511#true} is VALID [2022-04-15 11:45:33,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {41511#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {41511#true} is VALID [2022-04-15 11:45:33,828 INFO L272 TraceCheckUtils]: 7: Hoare triple {41511#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {41511#true} is VALID [2022-04-15 11:45:33,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {41511#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); {41511#true} is VALID [2022-04-15 11:45:33,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {41511#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; {41511#true} is VALID [2022-04-15 11:45:33,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {41511#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; {41511#true} is VALID [2022-04-15 11:45:33,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {41511#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {41511#true} is VALID [2022-04-15 11:45:33,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {41511#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {41511#true} is VALID [2022-04-15 11:45:33,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {41511#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {41511#true} is VALID [2022-04-15 11:45:33,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {41511#true} assume !false; {41511#true} is VALID [2022-04-15 11:45:33,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {41511#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); {41511#true} is VALID [2022-04-15 11:45:33,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {41511#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {41511#true} is VALID [2022-04-15 11:45:33,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {41511#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {41511#true} is VALID [2022-04-15 11:45:33,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {41511#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {41511#true} is VALID [2022-04-15 11:45:33,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {41511#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {41511#true} is VALID [2022-04-15 11:45:33,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {41511#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {41511#true} is VALID [2022-04-15 11:45:33,829 INFO L290 TraceCheckUtils]: 21: Hoare triple {41511#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {41511#true} is VALID [2022-04-15 11:45:33,829 INFO L290 TraceCheckUtils]: 22: Hoare triple {41511#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {41511#true} is VALID [2022-04-15 11:45:33,829 INFO L290 TraceCheckUtils]: 23: Hoare triple {41511#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {41511#true} is VALID [2022-04-15 11:45:33,829 INFO L290 TraceCheckUtils]: 24: Hoare triple {41511#true} assume 8464 == #t~mem55;havoc #t~mem55; {41511#true} is VALID [2022-04-15 11:45:33,829 INFO L290 TraceCheckUtils]: 25: Hoare triple {41511#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; {41511#true} is VALID [2022-04-15 11:45:33,829 INFO L290 TraceCheckUtils]: 26: Hoare triple {41511#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {41511#true} is VALID [2022-04-15 11:45:33,830 INFO L290 TraceCheckUtils]: 27: Hoare triple {41511#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); {41516#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:33,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {41516#(= 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); {41516#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:33,831 INFO L290 TraceCheckUtils]: 29: Hoare triple {41516#(= 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; {41516#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:33,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {41516#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {41516#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:33,832 INFO L290 TraceCheckUtils]: 31: Hoare triple {41516#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {41516#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:33,832 INFO L290 TraceCheckUtils]: 32: Hoare triple {41516#(= 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); {41516#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:33,833 INFO L290 TraceCheckUtils]: 33: Hoare triple {41516#(= 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); {41516#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:33,833 INFO L290 TraceCheckUtils]: 34: Hoare triple {41516#(= 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); {41516#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:33,833 INFO L290 TraceCheckUtils]: 35: Hoare triple {41516#(= 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); {41516#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:33,834 INFO L290 TraceCheckUtils]: 36: Hoare triple {41516#(= 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); {41516#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:33,834 INFO L290 TraceCheckUtils]: 37: Hoare triple {41516#(= 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); {41516#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:33,835 INFO L290 TraceCheckUtils]: 38: Hoare triple {41516#(= 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); {41516#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:33,835 INFO L290 TraceCheckUtils]: 39: Hoare triple {41516#(= 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); {41516#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:33,835 INFO L290 TraceCheckUtils]: 40: Hoare triple {41516#(= 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); {41516#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:33,836 INFO L290 TraceCheckUtils]: 41: Hoare triple {41516#(= 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); {41516#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:33,836 INFO L290 TraceCheckUtils]: 42: Hoare triple {41516#(= 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); {41516#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:33,836 INFO L290 TraceCheckUtils]: 43: Hoare triple {41516#(= 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); {41517#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-15 11:45:33,837 INFO L290 TraceCheckUtils]: 44: Hoare triple {41517#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,837 INFO L290 TraceCheckUtils]: 45: Hoare triple {41512#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,837 INFO L290 TraceCheckUtils]: 46: Hoare triple {41512#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,837 INFO L290 TraceCheckUtils]: 47: Hoare triple {41512#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,837 INFO L290 TraceCheckUtils]: 48: Hoare triple {41512#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,837 INFO L290 TraceCheckUtils]: 49: Hoare triple {41512#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,837 INFO L290 TraceCheckUtils]: 50: Hoare triple {41512#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,837 INFO L290 TraceCheckUtils]: 51: Hoare triple {41512#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,837 INFO L290 TraceCheckUtils]: 52: Hoare triple {41512#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,837 INFO L290 TraceCheckUtils]: 53: Hoare triple {41512#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,837 INFO L290 TraceCheckUtils]: 54: Hoare triple {41512#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,838 INFO L290 TraceCheckUtils]: 55: Hoare triple {41512#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,838 INFO L290 TraceCheckUtils]: 56: Hoare triple {41512#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,838 INFO L290 TraceCheckUtils]: 57: Hoare triple {41512#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,838 INFO L290 TraceCheckUtils]: 58: Hoare triple {41512#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,838 INFO L290 TraceCheckUtils]: 59: Hoare triple {41512#false} assume 8608 == #t~mem73;havoc #t~mem73; {41512#false} is VALID [2022-04-15 11:45:33,838 INFO L290 TraceCheckUtils]: 60: Hoare triple {41512#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {41512#false} is VALID [2022-04-15 11:45:33,838 INFO L290 TraceCheckUtils]: 61: Hoare triple {41512#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); {41512#false} is VALID [2022-04-15 11:45:33,838 INFO L290 TraceCheckUtils]: 62: Hoare triple {41512#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); {41512#false} is VALID [2022-04-15 11:45:33,838 INFO L290 TraceCheckUtils]: 63: Hoare triple {41512#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {41512#false} is VALID [2022-04-15 11:45:33,838 INFO L290 TraceCheckUtils]: 64: Hoare triple {41512#false} ~skip~0 := 0; {41512#false} is VALID [2022-04-15 11:45:33,838 INFO L290 TraceCheckUtils]: 65: Hoare triple {41512#false} assume !false; {41512#false} is VALID [2022-04-15 11:45:33,838 INFO L290 TraceCheckUtils]: 66: Hoare triple {41512#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); {41512#false} is VALID [2022-04-15 11:45:33,838 INFO L290 TraceCheckUtils]: 67: Hoare triple {41512#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,839 INFO L290 TraceCheckUtils]: 68: Hoare triple {41512#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,839 INFO L290 TraceCheckUtils]: 69: Hoare triple {41512#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,839 INFO L290 TraceCheckUtils]: 70: Hoare triple {41512#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,839 INFO L290 TraceCheckUtils]: 71: Hoare triple {41512#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,839 INFO L290 TraceCheckUtils]: 72: Hoare triple {41512#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,839 INFO L290 TraceCheckUtils]: 73: Hoare triple {41512#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,839 INFO L290 TraceCheckUtils]: 74: Hoare triple {41512#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,839 INFO L290 TraceCheckUtils]: 75: Hoare triple {41512#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,839 INFO L290 TraceCheckUtils]: 76: Hoare triple {41512#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,839 INFO L290 TraceCheckUtils]: 77: Hoare triple {41512#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,839 INFO L290 TraceCheckUtils]: 78: Hoare triple {41512#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,839 INFO L290 TraceCheckUtils]: 79: Hoare triple {41512#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,839 INFO L290 TraceCheckUtils]: 80: Hoare triple {41512#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,840 INFO L290 TraceCheckUtils]: 81: Hoare triple {41512#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,840 INFO L290 TraceCheckUtils]: 82: Hoare triple {41512#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,840 INFO L290 TraceCheckUtils]: 83: Hoare triple {41512#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,840 INFO L290 TraceCheckUtils]: 84: Hoare triple {41512#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,840 INFO L290 TraceCheckUtils]: 85: Hoare triple {41512#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,840 INFO L290 TraceCheckUtils]: 86: Hoare triple {41512#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,840 INFO L290 TraceCheckUtils]: 87: Hoare triple {41512#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,840 INFO L290 TraceCheckUtils]: 88: Hoare triple {41512#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,840 INFO L290 TraceCheckUtils]: 89: Hoare triple {41512#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,840 INFO L290 TraceCheckUtils]: 90: Hoare triple {41512#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,840 INFO L290 TraceCheckUtils]: 91: Hoare triple {41512#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,840 INFO L290 TraceCheckUtils]: 92: Hoare triple {41512#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,840 INFO L290 TraceCheckUtils]: 93: Hoare triple {41512#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,840 INFO L290 TraceCheckUtils]: 94: Hoare triple {41512#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {41512#false} is VALID [2022-04-15 11:45:33,841 INFO L290 TraceCheckUtils]: 95: Hoare triple {41512#false} assume 8640 == #t~mem75;havoc #t~mem75; {41512#false} is VALID [2022-04-15 11:45:33,841 INFO L290 TraceCheckUtils]: 96: Hoare triple {41512#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {41512#false} is VALID [2022-04-15 11:45:33,841 INFO L290 TraceCheckUtils]: 97: Hoare triple {41512#false} assume !(4 == ~blastFlag~0); {41512#false} is VALID [2022-04-15 11:45:33,841 INFO L290 TraceCheckUtils]: 98: Hoare triple {41512#false} assume 7 == ~blastFlag~0; {41512#false} is VALID [2022-04-15 11:45:33,841 INFO L290 TraceCheckUtils]: 99: Hoare triple {41512#false} assume !false; {41512#false} is VALID [2022-04-15 11:45:33,841 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 11:45:33,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:45:33,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95411182] [2022-04-15 11:45:33,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95411182] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:33,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:33,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:33,842 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:45:33,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1145385802] [2022-04-15 11:45:33,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1145385802] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:33,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:33,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:33,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721424357] [2022-04-15 11:45:33,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:45:33,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have 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-15 11:45:33,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:45:33,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:33,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:33,904 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:45:33,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:33,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:45:33,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:45:33,904 INFO L87 Difference]: Start difference. First operand 575 states and 932 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:38,056 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:40,061 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-15 11:45:45,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:45,617 INFO L93 Difference]: Finished difference Result 903 states and 1463 transitions. [2022-04-15 11:45:45,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:45:45,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have 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-15 11:45:45,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:45:45,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:45,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-15 11:45:45,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:45,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-15 11:45:45,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 466 transitions. [2022-04-15 11:45:45,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 466 edges. 466 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:45,923 INFO L225 Difference]: With dead ends: 903 [2022-04-15 11:45:45,923 INFO L226 Difference]: Without dead ends: 618 [2022-04-15 11:45:45,924 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:45:45,924 INFO L913 BasicCegarLoop]: 235 mSDtfsCounter, 31 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:45:45,924 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 579 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 445 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2022-04-15 11:45:45,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2022-04-15 11:45:45,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 597. [2022-04-15 11:45:45,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:45:45,950 INFO L82 GeneralOperation]: Start isEquivalent. First operand 618 states. Second operand has 597 states, 592 states have (on average 1.6266891891891893) internal successors, (963), 592 states have internal predecessors, (963), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:45,950 INFO L74 IsIncluded]: Start isIncluded. First operand 618 states. Second operand has 597 states, 592 states have (on average 1.6266891891891893) internal successors, (963), 592 states have internal predecessors, (963), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:45,951 INFO L87 Difference]: Start difference. First operand 618 states. Second operand has 597 states, 592 states have (on average 1.6266891891891893) internal successors, (963), 592 states have internal predecessors, (963), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:45,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:45,964 INFO L93 Difference]: Finished difference Result 618 states and 994 transitions. [2022-04-15 11:45:45,964 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 994 transitions. [2022-04-15 11:45:45,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:45,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:45,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 597 states, 592 states have (on average 1.6266891891891893) internal successors, (963), 592 states have internal predecessors, (963), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 618 states. [2022-04-15 11:45:45,966 INFO L87 Difference]: Start difference. First operand has 597 states, 592 states have (on average 1.6266891891891893) internal successors, (963), 592 states have internal predecessors, (963), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 618 states. [2022-04-15 11:45:45,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:45,978 INFO L93 Difference]: Finished difference Result 618 states and 994 transitions. [2022-04-15 11:45:45,978 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 994 transitions. [2022-04-15 11:45:45,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:45,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:45,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:45:45,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:45:45,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 592 states have (on average 1.6266891891891893) internal successors, (963), 592 states have internal predecessors, (963), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:45,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 967 transitions. [2022-04-15 11:45:45,994 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 967 transitions. Word has length 100 [2022-04-15 11:45:45,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:45:45,994 INFO L478 AbstractCegarLoop]: Abstraction has 597 states and 967 transitions. [2022-04-15 11:45:45,995 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:45,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 597 states and 967 transitions. [2022-04-15 11:45:49,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 967 edges. 966 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:49,053 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 967 transitions. [2022-04-15 11:45:49,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-15 11:45:49,054 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:45:49,054 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:45:49,055 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 11:45:49,055 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:45:49,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:45:49,055 INFO L85 PathProgramCache]: Analyzing trace with hash 589060741, now seen corresponding path program 1 times [2022-04-15 11:45:49,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:49,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [608888170] [2022-04-15 11:45:49,101 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:45:49,101 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:45:49,101 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:45:49,101 INFO L85 PathProgramCache]: Analyzing trace with hash 589060741, now seen corresponding path program 2 times [2022-04-15 11:45:49,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:45:49,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485750403] [2022-04-15 11:45:49,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:45:49,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:45:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:49,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:45:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:49,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {45766#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {45759#true} is VALID [2022-04-15 11:45:49,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {45759#true} assume true; {45759#true} is VALID [2022-04-15 11:45:49,292 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45759#true} {45759#true} #678#return; {45759#true} is VALID [2022-04-15 11:45:49,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {45759#true} call ULTIMATE.init(); {45766#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:45:49,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {45766#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {45759#true} is VALID [2022-04-15 11:45:49,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {45759#true} assume true; {45759#true} is VALID [2022-04-15 11:45:49,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45759#true} {45759#true} #678#return; {45759#true} is VALID [2022-04-15 11:45:49,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {45759#true} call #t~ret161 := main(); {45759#true} is VALID [2022-04-15 11:45:49,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {45759#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; {45759#true} is VALID [2022-04-15 11:45:49,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {45759#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {45759#true} is VALID [2022-04-15 11:45:49,294 INFO L272 TraceCheckUtils]: 7: Hoare triple {45759#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {45759#true} is VALID [2022-04-15 11:45:49,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {45759#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); {45764#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:49,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {45764#(= 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; {45764#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:49,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {45764#(= 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; {45764#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:49,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {45764#(= 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)))); {45764#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:49,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {45764#(= 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); {45764#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:49,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {45764#(= 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; {45764#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:49,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {45764#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {45764#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:49,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {45764#(= 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); {45764#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:49,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {45764#(= 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); {45764#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:49,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {45764#(= 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); {45764#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:49,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {45764#(= 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); {45764#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:49,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {45764#(= 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); {45765#(= 8464 |ssl3_accept_#t~mem51|)} is VALID [2022-04-15 11:45:49,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {45765#(= 8464 |ssl3_accept_#t~mem51|)} assume 8195 == #t~mem51;havoc #t~mem51; {45760#false} is VALID [2022-04-15 11:45:49,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {45760#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {45760#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {45760#false} is VALID [2022-04-15 11:45:49,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {45760#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {45760#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); {45760#false} is VALID [2022-04-15 11:45:49,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {45760#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {45760#false} is VALID [2022-04-15 11:45:49,302 INFO L290 TraceCheckUtils]: 26: Hoare triple {45760#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); {45760#false} is VALID [2022-04-15 11:45:49,302 INFO L290 TraceCheckUtils]: 27: Hoare triple {45760#false} assume 12292 != #t~mem85;havoc #t~mem85; {45760#false} is VALID [2022-04-15 11:45:49,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {45760#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; {45760#false} is VALID [2022-04-15 11:45:49,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {45760#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); {45760#false} is VALID [2022-04-15 11:45:49,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {45760#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45760#false} is VALID [2022-04-15 11:45:49,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {45760#false} ~skip~0 := 0; {45760#false} is VALID [2022-04-15 11:45:49,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {45760#false} assume !false; {45760#false} is VALID [2022-04-15 11:45:49,303 INFO L290 TraceCheckUtils]: 33: Hoare triple {45760#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); {45760#false} is VALID [2022-04-15 11:45:49,303 INFO L290 TraceCheckUtils]: 34: Hoare triple {45760#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,303 INFO L290 TraceCheckUtils]: 35: Hoare triple {45760#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,303 INFO L290 TraceCheckUtils]: 36: Hoare triple {45760#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,303 INFO L290 TraceCheckUtils]: 37: Hoare triple {45760#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,303 INFO L290 TraceCheckUtils]: 38: Hoare triple {45760#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {45760#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,303 INFO L290 TraceCheckUtils]: 40: Hoare triple {45760#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,303 INFO L290 TraceCheckUtils]: 41: Hoare triple {45760#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,303 INFO L290 TraceCheckUtils]: 42: Hoare triple {45760#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,303 INFO L290 TraceCheckUtils]: 43: Hoare triple {45760#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,303 INFO L290 TraceCheckUtils]: 44: Hoare triple {45760#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,303 INFO L290 TraceCheckUtils]: 45: Hoare triple {45760#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,304 INFO L290 TraceCheckUtils]: 46: Hoare triple {45760#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,304 INFO L290 TraceCheckUtils]: 47: Hoare triple {45760#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,304 INFO L290 TraceCheckUtils]: 48: Hoare triple {45760#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,304 INFO L290 TraceCheckUtils]: 49: Hoare triple {45760#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,304 INFO L290 TraceCheckUtils]: 50: Hoare triple {45760#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,304 INFO L290 TraceCheckUtils]: 51: Hoare triple {45760#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,304 INFO L290 TraceCheckUtils]: 52: Hoare triple {45760#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,304 INFO L290 TraceCheckUtils]: 53: Hoare triple {45760#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,304 INFO L290 TraceCheckUtils]: 54: Hoare triple {45760#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,304 INFO L290 TraceCheckUtils]: 55: Hoare triple {45760#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,304 INFO L290 TraceCheckUtils]: 56: Hoare triple {45760#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,304 INFO L290 TraceCheckUtils]: 57: Hoare triple {45760#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,304 INFO L290 TraceCheckUtils]: 58: Hoare triple {45760#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,304 INFO L290 TraceCheckUtils]: 59: Hoare triple {45760#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,305 INFO L290 TraceCheckUtils]: 60: Hoare triple {45760#false} assume 8608 == #t~mem73;havoc #t~mem73; {45760#false} is VALID [2022-04-15 11:45:49,305 INFO L290 TraceCheckUtils]: 61: Hoare triple {45760#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {45760#false} is VALID [2022-04-15 11:45:49,305 INFO L290 TraceCheckUtils]: 62: Hoare triple {45760#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); {45760#false} is VALID [2022-04-15 11:45:49,305 INFO L290 TraceCheckUtils]: 63: Hoare triple {45760#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); {45760#false} is VALID [2022-04-15 11:45:49,305 INFO L290 TraceCheckUtils]: 64: Hoare triple {45760#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45760#false} is VALID [2022-04-15 11:45:49,305 INFO L290 TraceCheckUtils]: 65: Hoare triple {45760#false} ~skip~0 := 0; {45760#false} is VALID [2022-04-15 11:45:49,305 INFO L290 TraceCheckUtils]: 66: Hoare triple {45760#false} assume !false; {45760#false} is VALID [2022-04-15 11:45:49,305 INFO L290 TraceCheckUtils]: 67: Hoare triple {45760#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); {45760#false} is VALID [2022-04-15 11:45:49,305 INFO L290 TraceCheckUtils]: 68: Hoare triple {45760#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,305 INFO L290 TraceCheckUtils]: 69: Hoare triple {45760#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,305 INFO L290 TraceCheckUtils]: 70: Hoare triple {45760#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,305 INFO L290 TraceCheckUtils]: 71: Hoare triple {45760#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,305 INFO L290 TraceCheckUtils]: 72: Hoare triple {45760#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,305 INFO L290 TraceCheckUtils]: 73: Hoare triple {45760#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,306 INFO L290 TraceCheckUtils]: 74: Hoare triple {45760#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,306 INFO L290 TraceCheckUtils]: 75: Hoare triple {45760#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,306 INFO L290 TraceCheckUtils]: 76: Hoare triple {45760#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,306 INFO L290 TraceCheckUtils]: 77: Hoare triple {45760#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,306 INFO L290 TraceCheckUtils]: 78: Hoare triple {45760#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,306 INFO L290 TraceCheckUtils]: 79: Hoare triple {45760#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,306 INFO L290 TraceCheckUtils]: 80: Hoare triple {45760#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,306 INFO L290 TraceCheckUtils]: 81: Hoare triple {45760#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,306 INFO L290 TraceCheckUtils]: 82: Hoare triple {45760#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,306 INFO L290 TraceCheckUtils]: 83: Hoare triple {45760#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,306 INFO L290 TraceCheckUtils]: 84: Hoare triple {45760#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,306 INFO L290 TraceCheckUtils]: 85: Hoare triple {45760#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,306 INFO L290 TraceCheckUtils]: 86: Hoare triple {45760#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,307 INFO L290 TraceCheckUtils]: 87: Hoare triple {45760#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,307 INFO L290 TraceCheckUtils]: 88: Hoare triple {45760#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,307 INFO L290 TraceCheckUtils]: 89: Hoare triple {45760#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,307 INFO L290 TraceCheckUtils]: 90: Hoare triple {45760#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,307 INFO L290 TraceCheckUtils]: 91: Hoare triple {45760#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,307 INFO L290 TraceCheckUtils]: 92: Hoare triple {45760#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,307 INFO L290 TraceCheckUtils]: 93: Hoare triple {45760#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,307 INFO L290 TraceCheckUtils]: 94: Hoare triple {45760#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,307 INFO L290 TraceCheckUtils]: 95: Hoare triple {45760#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {45760#false} is VALID [2022-04-15 11:45:49,307 INFO L290 TraceCheckUtils]: 96: Hoare triple {45760#false} assume 8640 == #t~mem75;havoc #t~mem75; {45760#false} is VALID [2022-04-15 11:45:49,307 INFO L290 TraceCheckUtils]: 97: Hoare triple {45760#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {45760#false} is VALID [2022-04-15 11:45:49,307 INFO L290 TraceCheckUtils]: 98: Hoare triple {45760#false} assume !(4 == ~blastFlag~0); {45760#false} is VALID [2022-04-15 11:45:49,307 INFO L290 TraceCheckUtils]: 99: Hoare triple {45760#false} assume 7 == ~blastFlag~0; {45760#false} is VALID [2022-04-15 11:45:49,307 INFO L290 TraceCheckUtils]: 100: Hoare triple {45760#false} assume !false; {45760#false} is VALID [2022-04-15 11:45:49,308 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-15 11:45:49,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:45:49,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485750403] [2022-04-15 11:45:49,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485750403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:49,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:49,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:49,310 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:45:49,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [608888170] [2022-04-15 11:45:49,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [608888170] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:49,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:49,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:49,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387495733] [2022-04-15 11:45:49,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:45:49,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-15 11:45:49,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:45:49,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:49,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:49,367 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:45:49,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:49,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:45:49,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:45:49,368 INFO L87 Difference]: Start difference. First operand 597 states and 967 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:51,428 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:53,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:53,965 INFO L93 Difference]: Finished difference Result 915 states and 1482 transitions. [2022-04-15 11:45:53,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:45:53,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-15 11:45:53,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:45:53,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:53,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 423 transitions. [2022-04-15 11:45:53,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:53,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 423 transitions. [2022-04-15 11:45:53,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 423 transitions. [2022-04-15 11:45:54,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 423 edges. 423 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:54,244 INFO L225 Difference]: With dead ends: 915 [2022-04-15 11:45:54,244 INFO L226 Difference]: Without dead ends: 601 [2022-04-15 11:45:54,245 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:45:54,245 INFO L913 BasicCegarLoop]: 191 mSDtfsCounter, 12 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:45:54,246 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 487 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 340 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-04-15 11:45:54,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-04-15 11:45:54,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 595. [2022-04-15 11:45:54,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:45:54,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 601 states. Second operand has 595 states, 590 states have (on average 1.6254237288135593) internal successors, (959), 590 states have internal predecessors, (959), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:54,270 INFO L74 IsIncluded]: Start isIncluded. First operand 601 states. Second operand has 595 states, 590 states have (on average 1.6254237288135593) internal successors, (959), 590 states have internal predecessors, (959), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:54,270 INFO L87 Difference]: Start difference. First operand 601 states. Second operand has 595 states, 590 states have (on average 1.6254237288135593) internal successors, (959), 590 states have internal predecessors, (959), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:54,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:54,281 INFO L93 Difference]: Finished difference Result 601 states and 969 transitions. [2022-04-15 11:45:54,281 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 969 transitions. [2022-04-15 11:45:54,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:54,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:54,296 INFO L74 IsIncluded]: Start isIncluded. First operand has 595 states, 590 states have (on average 1.6254237288135593) internal successors, (959), 590 states have internal predecessors, (959), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 601 states. [2022-04-15 11:45:54,297 INFO L87 Difference]: Start difference. First operand has 595 states, 590 states have (on average 1.6254237288135593) internal successors, (959), 590 states have internal predecessors, (959), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 601 states. [2022-04-15 11:45:54,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:54,308 INFO L93 Difference]: Finished difference Result 601 states and 969 transitions. [2022-04-15 11:45:54,308 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 969 transitions. [2022-04-15 11:45:54,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:54,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:54,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:45:54,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:45:54,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 590 states have (on average 1.6254237288135593) internal successors, (959), 590 states have internal predecessors, (959), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:54,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 963 transitions. [2022-04-15 11:45:54,324 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 963 transitions. Word has length 101 [2022-04-15 11:45:54,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:45:54,325 INFO L478 AbstractCegarLoop]: Abstraction has 595 states and 963 transitions. [2022-04-15 11:45:54,325 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:54,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 595 states and 963 transitions. [2022-04-15 11:45:57,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 963 edges. 962 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:57,336 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 963 transitions. [2022-04-15 11:45:57,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-15 11:45:57,337 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:45:57,337 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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-15 11:45:57,337 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 11:45:57,337 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:45:57,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:45:57,337 INFO L85 PathProgramCache]: Analyzing trace with hash -854368715, now seen corresponding path program 1 times [2022-04-15 11:45:57,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:57,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1448714460] [2022-04-15 11:45:57,386 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:45:57,386 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:45:57,386 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:45:57,386 INFO L85 PathProgramCache]: Analyzing trace with hash -854368715, now seen corresponding path program 2 times [2022-04-15 11:45:57,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:45:57,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609628414] [2022-04-15 11:45:57,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:45:57,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:45:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:57,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:45:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:57,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {50000#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {49993#true} is VALID [2022-04-15 11:45:57,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {49993#true} assume true; {49993#true} is VALID [2022-04-15 11:45:57,566 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49993#true} {49993#true} #678#return; {49993#true} is VALID [2022-04-15 11:45:57,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {49993#true} call ULTIMATE.init(); {50000#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:45:57,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {50000#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {49993#true} is VALID [2022-04-15 11:45:57,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {49993#true} assume true; {49993#true} is VALID [2022-04-15 11:45:57,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49993#true} {49993#true} #678#return; {49993#true} is VALID [2022-04-15 11:45:57,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {49993#true} call #t~ret161 := main(); {49993#true} is VALID [2022-04-15 11:45:57,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {49993#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; {49993#true} is VALID [2022-04-15 11:45:57,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {49993#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {49993#true} is VALID [2022-04-15 11:45:57,568 INFO L272 TraceCheckUtils]: 7: Hoare triple {49993#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {49993#true} is VALID [2022-04-15 11:45:57,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {49993#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); {49993#true} is VALID [2022-04-15 11:45:57,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {49993#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; {49993#true} is VALID [2022-04-15 11:45:57,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {49993#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; {49993#true} is VALID [2022-04-15 11:45:57,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {49993#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {49993#true} is VALID [2022-04-15 11:45:57,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {49993#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {49993#true} is VALID [2022-04-15 11:45:57,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {49993#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {49993#true} is VALID [2022-04-15 11:45:57,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {49993#true} assume !false; {49993#true} is VALID [2022-04-15 11:45:57,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {49993#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); {49993#true} is VALID [2022-04-15 11:45:57,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {49993#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49993#true} is VALID [2022-04-15 11:45:57,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {49993#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49993#true} is VALID [2022-04-15 11:45:57,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {49993#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49993#true} is VALID [2022-04-15 11:45:57,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {49993#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49993#true} is VALID [2022-04-15 11:45:57,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {49993#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49993#true} is VALID [2022-04-15 11:45:57,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {49993#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49993#true} is VALID [2022-04-15 11:45:57,569 INFO L290 TraceCheckUtils]: 22: Hoare triple {49993#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49993#true} is VALID [2022-04-15 11:45:57,569 INFO L290 TraceCheckUtils]: 23: Hoare triple {49993#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49993#true} is VALID [2022-04-15 11:45:57,569 INFO L290 TraceCheckUtils]: 24: Hoare triple {49993#true} assume 8464 == #t~mem55;havoc #t~mem55; {49993#true} is VALID [2022-04-15 11:45:57,569 INFO L290 TraceCheckUtils]: 25: Hoare triple {49993#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; {49993#true} is VALID [2022-04-15 11:45:57,569 INFO L290 TraceCheckUtils]: 26: Hoare triple {49993#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {49993#true} is VALID [2022-04-15 11:45:57,570 INFO L290 TraceCheckUtils]: 27: Hoare triple {49993#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); {49998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:57,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {49998#(= 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); {49998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:57,571 INFO L290 TraceCheckUtils]: 29: Hoare triple {49998#(= 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; {49998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:57,572 INFO L290 TraceCheckUtils]: 30: Hoare triple {49998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {49998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:57,572 INFO L290 TraceCheckUtils]: 31: Hoare triple {49998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {49998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:57,572 INFO L290 TraceCheckUtils]: 32: Hoare triple {49998#(= 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); {49998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:57,573 INFO L290 TraceCheckUtils]: 33: Hoare triple {49998#(= 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); {49998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:57,573 INFO L290 TraceCheckUtils]: 34: Hoare triple {49998#(= 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); {49998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:57,573 INFO L290 TraceCheckUtils]: 35: Hoare triple {49998#(= 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); {49998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:57,574 INFO L290 TraceCheckUtils]: 36: Hoare triple {49998#(= 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); {49998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:57,574 INFO L290 TraceCheckUtils]: 37: Hoare triple {49998#(= 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); {49998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:57,575 INFO L290 TraceCheckUtils]: 38: Hoare triple {49998#(= 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); {49999#(= |ssl3_accept_#t~mem53| 8496)} is VALID [2022-04-15 11:45:57,575 INFO L290 TraceCheckUtils]: 39: Hoare triple {49999#(= |ssl3_accept_#t~mem53| 8496)} assume 8481 == #t~mem53;havoc #t~mem53; {49994#false} is VALID [2022-04-15 11:45:57,575 INFO L290 TraceCheckUtils]: 40: Hoare triple {49994#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; {49994#false} is VALID [2022-04-15 11:45:57,575 INFO L290 TraceCheckUtils]: 41: Hoare triple {49994#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); {49994#false} is VALID [2022-04-15 11:45:57,575 INFO L290 TraceCheckUtils]: 42: Hoare triple {49994#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); {49994#false} is VALID [2022-04-15 11:45:57,575 INFO L290 TraceCheckUtils]: 43: Hoare triple {49994#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {49994#false} is VALID [2022-04-15 11:45:57,575 INFO L290 TraceCheckUtils]: 44: Hoare triple {49994#false} ~skip~0 := 0; {49994#false} is VALID [2022-04-15 11:45:57,575 INFO L290 TraceCheckUtils]: 45: Hoare triple {49994#false} assume !false; {49994#false} is VALID [2022-04-15 11:45:57,575 INFO L290 TraceCheckUtils]: 46: Hoare triple {49994#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); {49994#false} is VALID [2022-04-15 11:45:57,576 INFO L290 TraceCheckUtils]: 47: Hoare triple {49994#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,576 INFO L290 TraceCheckUtils]: 48: Hoare triple {49994#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,576 INFO L290 TraceCheckUtils]: 49: Hoare triple {49994#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,576 INFO L290 TraceCheckUtils]: 50: Hoare triple {49994#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,576 INFO L290 TraceCheckUtils]: 51: Hoare triple {49994#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,576 INFO L290 TraceCheckUtils]: 52: Hoare triple {49994#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,576 INFO L290 TraceCheckUtils]: 53: Hoare triple {49994#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,576 INFO L290 TraceCheckUtils]: 54: Hoare triple {49994#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,576 INFO L290 TraceCheckUtils]: 55: Hoare triple {49994#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,576 INFO L290 TraceCheckUtils]: 56: Hoare triple {49994#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,576 INFO L290 TraceCheckUtils]: 57: Hoare triple {49994#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,576 INFO L290 TraceCheckUtils]: 58: Hoare triple {49994#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,576 INFO L290 TraceCheckUtils]: 59: Hoare triple {49994#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,576 INFO L290 TraceCheckUtils]: 60: Hoare triple {49994#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,577 INFO L290 TraceCheckUtils]: 61: Hoare triple {49994#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,577 INFO L290 TraceCheckUtils]: 62: Hoare triple {49994#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,577 INFO L290 TraceCheckUtils]: 63: Hoare triple {49994#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,577 INFO L290 TraceCheckUtils]: 64: Hoare triple {49994#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,577 INFO L290 TraceCheckUtils]: 65: Hoare triple {49994#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,577 INFO L290 TraceCheckUtils]: 66: Hoare triple {49994#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,577 INFO L290 TraceCheckUtils]: 67: Hoare triple {49994#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,577 INFO L290 TraceCheckUtils]: 68: Hoare triple {49994#false} assume 8448 == #t~mem68;havoc #t~mem68; {49994#false} is VALID [2022-04-15 11:45:57,577 INFO L290 TraceCheckUtils]: 69: Hoare triple {49994#false} assume !(~num1~0 > 0); {49994#false} is VALID [2022-04-15 11:45:57,577 INFO L290 TraceCheckUtils]: 70: Hoare triple {49994#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; {49994#false} is VALID [2022-04-15 11:45:57,577 INFO L290 TraceCheckUtils]: 71: Hoare triple {49994#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); {49994#false} is VALID [2022-04-15 11:45:57,577 INFO L290 TraceCheckUtils]: 72: Hoare triple {49994#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {49994#false} is VALID [2022-04-15 11:45:57,577 INFO L290 TraceCheckUtils]: 73: Hoare triple {49994#false} ~skip~0 := 0; {49994#false} is VALID [2022-04-15 11:45:57,577 INFO L290 TraceCheckUtils]: 74: Hoare triple {49994#false} assume !false; {49994#false} is VALID [2022-04-15 11:45:57,578 INFO L290 TraceCheckUtils]: 75: Hoare triple {49994#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); {49994#false} is VALID [2022-04-15 11:45:57,578 INFO L290 TraceCheckUtils]: 76: Hoare triple {49994#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,578 INFO L290 TraceCheckUtils]: 77: Hoare triple {49994#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,578 INFO L290 TraceCheckUtils]: 78: Hoare triple {49994#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,578 INFO L290 TraceCheckUtils]: 79: Hoare triple {49994#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,578 INFO L290 TraceCheckUtils]: 80: Hoare triple {49994#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,578 INFO L290 TraceCheckUtils]: 81: Hoare triple {49994#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,578 INFO L290 TraceCheckUtils]: 82: Hoare triple {49994#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,578 INFO L290 TraceCheckUtils]: 83: Hoare triple {49994#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,578 INFO L290 TraceCheckUtils]: 84: Hoare triple {49994#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,578 INFO L290 TraceCheckUtils]: 85: Hoare triple {49994#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,578 INFO L290 TraceCheckUtils]: 86: Hoare triple {49994#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,578 INFO L290 TraceCheckUtils]: 87: Hoare triple {49994#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,578 INFO L290 TraceCheckUtils]: 88: Hoare triple {49994#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,579 INFO L290 TraceCheckUtils]: 89: Hoare triple {49994#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,579 INFO L290 TraceCheckUtils]: 90: Hoare triple {49994#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,579 INFO L290 TraceCheckUtils]: 91: Hoare triple {49994#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,579 INFO L290 TraceCheckUtils]: 92: Hoare triple {49994#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,579 INFO L290 TraceCheckUtils]: 93: Hoare triple {49994#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,579 INFO L290 TraceCheckUtils]: 94: Hoare triple {49994#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,579 INFO L290 TraceCheckUtils]: 95: Hoare triple {49994#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,579 INFO L290 TraceCheckUtils]: 96: Hoare triple {49994#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,579 INFO L290 TraceCheckUtils]: 97: Hoare triple {49994#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,579 INFO L290 TraceCheckUtils]: 98: Hoare triple {49994#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,579 INFO L290 TraceCheckUtils]: 99: Hoare triple {49994#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,579 INFO L290 TraceCheckUtils]: 100: Hoare triple {49994#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,579 INFO L290 TraceCheckUtils]: 101: Hoare triple {49994#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,579 INFO L290 TraceCheckUtils]: 102: Hoare triple {49994#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,580 INFO L290 TraceCheckUtils]: 103: Hoare triple {49994#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {49994#false} is VALID [2022-04-15 11:45:57,580 INFO L290 TraceCheckUtils]: 104: Hoare triple {49994#false} assume 8640 == #t~mem75;havoc #t~mem75; {49994#false} is VALID [2022-04-15 11:45:57,580 INFO L290 TraceCheckUtils]: 105: Hoare triple {49994#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {49994#false} is VALID [2022-04-15 11:45:57,580 INFO L290 TraceCheckUtils]: 106: Hoare triple {49994#false} assume !(4 == ~blastFlag~0); {49994#false} is VALID [2022-04-15 11:45:57,580 INFO L290 TraceCheckUtils]: 107: Hoare triple {49994#false} assume 7 == ~blastFlag~0; {49994#false} is VALID [2022-04-15 11:45:57,580 INFO L290 TraceCheckUtils]: 108: Hoare triple {49994#false} assume !false; {49994#false} is VALID [2022-04-15 11:45:57,580 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:45:57,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:45:57,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609628414] [2022-04-15 11:45:57,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609628414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:57,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:57,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:57,581 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:45:57,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1448714460] [2022-04-15 11:45:57,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1448714460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:57,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:57,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:57,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655606353] [2022-04-15 11:45:57,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:45:57,581 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 109 [2022-04-15 11:45:57,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:45:57,582 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-15 11:45:57,642 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-15 11:45:57,642 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:45:57,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:57,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:45:57,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:45:57,643 INFO L87 Difference]: Start difference. First operand 595 states and 963 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-15 11:46:04,856 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:46:06,861 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-15 11:46:10,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:10,076 INFO L93 Difference]: Finished difference Result 921 states and 1491 transitions. [2022-04-15 11:46:10,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:46:10,077 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 109 [2022-04-15 11:46:10,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:46:10,077 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-15 11:46:10,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-15 11:46:10,079 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-15 11:46:10,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-15 11:46:10,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 463 transitions. [2022-04-15 11:46:10,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 463 edges. 463 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:10,393 INFO L225 Difference]: With dead ends: 921 [2022-04-15 11:46:10,393 INFO L226 Difference]: Without dead ends: 614 [2022-04-15 11:46:10,394 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:46:10,394 INFO L913 BasicCegarLoop]: 235 mSDtfsCounter, 35 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:46:10,394 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 579 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 435 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2022-04-15 11:46:10,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2022-04-15 11:46:10,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 595. [2022-04-15 11:46:10,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:46:10,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 614 states. Second operand has 595 states, 590 states have (on average 1.623728813559322) internal successors, (958), 590 states have internal predecessors, (958), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:10,418 INFO L74 IsIncluded]: Start isIncluded. First operand 614 states. Second operand has 595 states, 590 states have (on average 1.623728813559322) internal successors, (958), 590 states have internal predecessors, (958), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:10,418 INFO L87 Difference]: Start difference. First operand 614 states. Second operand has 595 states, 590 states have (on average 1.623728813559322) internal successors, (958), 590 states have internal predecessors, (958), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:10,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:10,430 INFO L93 Difference]: Finished difference Result 614 states and 987 transitions. [2022-04-15 11:46:10,430 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 987 transitions. [2022-04-15 11:46:10,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:10,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:10,432 INFO L74 IsIncluded]: Start isIncluded. First operand has 595 states, 590 states have (on average 1.623728813559322) internal successors, (958), 590 states have internal predecessors, (958), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 614 states. [2022-04-15 11:46:10,432 INFO L87 Difference]: Start difference. First operand has 595 states, 590 states have (on average 1.623728813559322) internal successors, (958), 590 states have internal predecessors, (958), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 614 states. [2022-04-15 11:46:10,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:10,444 INFO L93 Difference]: Finished difference Result 614 states and 987 transitions. [2022-04-15 11:46:10,444 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 987 transitions. [2022-04-15 11:46:10,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:10,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:10,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:46:10,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:46:10,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 590 states have (on average 1.623728813559322) internal successors, (958), 590 states have internal predecessors, (958), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:10,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 962 transitions. [2022-04-15 11:46:10,461 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 962 transitions. Word has length 109 [2022-04-15 11:46:10,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:46:10,461 INFO L478 AbstractCegarLoop]: Abstraction has 595 states and 962 transitions. [2022-04-15 11:46:10,461 INFO L479 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-15 11:46:10,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 595 states and 962 transitions. [2022-04-15 11:46:13,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 962 edges. 961 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:13,455 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 962 transitions. [2022-04-15 11:46:13,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-15 11:46:13,455 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:46:13,456 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:46:13,456 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 11:46:13,456 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:46:13,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:46:13,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1695415058, now seen corresponding path program 1 times [2022-04-15 11:46:13,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:13,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1542055296] [2022-04-15 11:46:13,531 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:46:13,531 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:46:13,531 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:46:13,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1695415058, now seen corresponding path program 2 times [2022-04-15 11:46:13,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:46:13,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774739675] [2022-04-15 11:46:13,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:46:13,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:46:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:13,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:46:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:13,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {54272#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {54265#true} is VALID [2022-04-15 11:46:13,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {54265#true} assume true; {54265#true} is VALID [2022-04-15 11:46:13,684 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54265#true} {54265#true} #678#return; {54265#true} is VALID [2022-04-15 11:46:13,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {54265#true} call ULTIMATE.init(); {54272#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:46:13,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {54272#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {54265#true} is VALID [2022-04-15 11:46:13,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {54265#true} assume true; {54265#true} is VALID [2022-04-15 11:46:13,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54265#true} {54265#true} #678#return; {54265#true} is VALID [2022-04-15 11:46:13,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {54265#true} call #t~ret161 := main(); {54265#true} is VALID [2022-04-15 11:46:13,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {54265#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; {54265#true} is VALID [2022-04-15 11:46:13,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {54265#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {54265#true} is VALID [2022-04-15 11:46:13,686 INFO L272 TraceCheckUtils]: 7: Hoare triple {54265#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {54265#true} is VALID [2022-04-15 11:46:13,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {54265#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); {54270#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:46:13,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {54270#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {54270#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:46:13,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {54270#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {54270#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:46:13,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {54270#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {54270#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:46:13,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {54270#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {54270#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:46:13,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {54270#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {54270#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:46:13,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {54270#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !false; {54270#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:46:13,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {54270#(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); {54270#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:46:13,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {54270#(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); {54270#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:46:13,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {54270#(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); {54270#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:46:13,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {54270#(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); {54270#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:46:13,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {54270#(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); {54270#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:46:13,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {54270#(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); {54270#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:46:13,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {54270#(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); {54271#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-15 11:46:13,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {54271#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {54266#false} is VALID [2022-04-15 11:46:13,694 INFO L290 TraceCheckUtils]: 23: Hoare triple {54266#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; {54266#false} is VALID [2022-04-15 11:46:13,694 INFO L290 TraceCheckUtils]: 24: Hoare triple {54266#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); {54266#false} is VALID [2022-04-15 11:46:13,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {54266#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); {54266#false} is VALID [2022-04-15 11:46:13,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {54266#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {54266#false} is VALID [2022-04-15 11:46:13,694 INFO L290 TraceCheckUtils]: 27: Hoare triple {54266#false} ~skip~0 := 0; {54266#false} is VALID [2022-04-15 11:46:13,694 INFO L290 TraceCheckUtils]: 28: Hoare triple {54266#false} assume !false; {54266#false} is VALID [2022-04-15 11:46:13,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {54266#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); {54266#false} is VALID [2022-04-15 11:46:13,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {54266#false} assume 12292 == #t~mem47;havoc #t~mem47; {54266#false} is VALID [2022-04-15 11:46:13,695 INFO L290 TraceCheckUtils]: 31: Hoare triple {54266#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,695 INFO L290 TraceCheckUtils]: 32: Hoare triple {54266#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,695 INFO L290 TraceCheckUtils]: 33: Hoare triple {54266#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {54266#false} is VALID [2022-04-15 11:46:13,695 INFO L290 TraceCheckUtils]: 34: Hoare triple {54266#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,695 INFO L290 TraceCheckUtils]: 35: Hoare triple {54266#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); {54266#false} is VALID [2022-04-15 11:46:13,695 INFO L290 TraceCheckUtils]: 36: Hoare triple {54266#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {54266#false} is VALID [2022-04-15 11:46:13,695 INFO L290 TraceCheckUtils]: 37: Hoare triple {54266#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); {54266#false} is VALID [2022-04-15 11:46:13,695 INFO L290 TraceCheckUtils]: 38: Hoare triple {54266#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); {54266#false} is VALID [2022-04-15 11:46:13,695 INFO L290 TraceCheckUtils]: 39: Hoare triple {54266#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); {54266#false} is VALID [2022-04-15 11:46:13,695 INFO L290 TraceCheckUtils]: 40: Hoare triple {54266#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {54266#false} is VALID [2022-04-15 11:46:13,695 INFO L290 TraceCheckUtils]: 41: Hoare triple {54266#false} ~skip~0 := 0; {54266#false} is VALID [2022-04-15 11:46:13,695 INFO L290 TraceCheckUtils]: 42: Hoare triple {54266#false} assume !false; {54266#false} is VALID [2022-04-15 11:46:13,696 INFO L290 TraceCheckUtils]: 43: Hoare triple {54266#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); {54266#false} is VALID [2022-04-15 11:46:13,696 INFO L290 TraceCheckUtils]: 44: Hoare triple {54266#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,696 INFO L290 TraceCheckUtils]: 45: Hoare triple {54266#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,696 INFO L290 TraceCheckUtils]: 46: Hoare triple {54266#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,696 INFO L290 TraceCheckUtils]: 47: Hoare triple {54266#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,696 INFO L290 TraceCheckUtils]: 48: Hoare triple {54266#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,696 INFO L290 TraceCheckUtils]: 49: Hoare triple {54266#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,696 INFO L290 TraceCheckUtils]: 50: Hoare triple {54266#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,696 INFO L290 TraceCheckUtils]: 51: Hoare triple {54266#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,696 INFO L290 TraceCheckUtils]: 52: Hoare triple {54266#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,696 INFO L290 TraceCheckUtils]: 53: Hoare triple {54266#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,696 INFO L290 TraceCheckUtils]: 54: Hoare triple {54266#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,696 INFO L290 TraceCheckUtils]: 55: Hoare triple {54266#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,696 INFO L290 TraceCheckUtils]: 56: Hoare triple {54266#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,697 INFO L290 TraceCheckUtils]: 57: Hoare triple {54266#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,697 INFO L290 TraceCheckUtils]: 58: Hoare triple {54266#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,697 INFO L290 TraceCheckUtils]: 59: Hoare triple {54266#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,697 INFO L290 TraceCheckUtils]: 60: Hoare triple {54266#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,697 INFO L290 TraceCheckUtils]: 61: Hoare triple {54266#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,697 INFO L290 TraceCheckUtils]: 62: Hoare triple {54266#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,697 INFO L290 TraceCheckUtils]: 63: Hoare triple {54266#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,697 INFO L290 TraceCheckUtils]: 64: Hoare triple {54266#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,697 INFO L290 TraceCheckUtils]: 65: Hoare triple {54266#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,697 INFO L290 TraceCheckUtils]: 66: Hoare triple {54266#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,697 INFO L290 TraceCheckUtils]: 67: Hoare triple {54266#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,697 INFO L290 TraceCheckUtils]: 68: Hoare triple {54266#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,697 INFO L290 TraceCheckUtils]: 69: Hoare triple {54266#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,697 INFO L290 TraceCheckUtils]: 70: Hoare triple {54266#false} assume 8608 == #t~mem73;havoc #t~mem73; {54266#false} is VALID [2022-04-15 11:46:13,698 INFO L290 TraceCheckUtils]: 71: Hoare triple {54266#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {54266#false} is VALID [2022-04-15 11:46:13,698 INFO L290 TraceCheckUtils]: 72: Hoare triple {54266#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); {54266#false} is VALID [2022-04-15 11:46:13,698 INFO L290 TraceCheckUtils]: 73: Hoare triple {54266#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); {54266#false} is VALID [2022-04-15 11:46:13,698 INFO L290 TraceCheckUtils]: 74: Hoare triple {54266#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {54266#false} is VALID [2022-04-15 11:46:13,698 INFO L290 TraceCheckUtils]: 75: Hoare triple {54266#false} ~skip~0 := 0; {54266#false} is VALID [2022-04-15 11:46:13,698 INFO L290 TraceCheckUtils]: 76: Hoare triple {54266#false} assume !false; {54266#false} is VALID [2022-04-15 11:46:13,698 INFO L290 TraceCheckUtils]: 77: Hoare triple {54266#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); {54266#false} is VALID [2022-04-15 11:46:13,698 INFO L290 TraceCheckUtils]: 78: Hoare triple {54266#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,698 INFO L290 TraceCheckUtils]: 79: Hoare triple {54266#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,698 INFO L290 TraceCheckUtils]: 80: Hoare triple {54266#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,698 INFO L290 TraceCheckUtils]: 81: Hoare triple {54266#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,698 INFO L290 TraceCheckUtils]: 82: Hoare triple {54266#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,698 INFO L290 TraceCheckUtils]: 83: Hoare triple {54266#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,698 INFO L290 TraceCheckUtils]: 84: Hoare triple {54266#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,699 INFO L290 TraceCheckUtils]: 85: Hoare triple {54266#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,699 INFO L290 TraceCheckUtils]: 86: Hoare triple {54266#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,699 INFO L290 TraceCheckUtils]: 87: Hoare triple {54266#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,699 INFO L290 TraceCheckUtils]: 88: Hoare triple {54266#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,699 INFO L290 TraceCheckUtils]: 89: Hoare triple {54266#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,699 INFO L290 TraceCheckUtils]: 90: Hoare triple {54266#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,699 INFO L290 TraceCheckUtils]: 91: Hoare triple {54266#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,699 INFO L290 TraceCheckUtils]: 92: Hoare triple {54266#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,699 INFO L290 TraceCheckUtils]: 93: Hoare triple {54266#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,699 INFO L290 TraceCheckUtils]: 94: Hoare triple {54266#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,699 INFO L290 TraceCheckUtils]: 95: Hoare triple {54266#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,699 INFO L290 TraceCheckUtils]: 96: Hoare triple {54266#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,699 INFO L290 TraceCheckUtils]: 97: Hoare triple {54266#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,699 INFO L290 TraceCheckUtils]: 98: Hoare triple {54266#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,700 INFO L290 TraceCheckUtils]: 99: Hoare triple {54266#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,700 INFO L290 TraceCheckUtils]: 100: Hoare triple {54266#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,700 INFO L290 TraceCheckUtils]: 101: Hoare triple {54266#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,700 INFO L290 TraceCheckUtils]: 102: Hoare triple {54266#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,700 INFO L290 TraceCheckUtils]: 103: Hoare triple {54266#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,700 INFO L290 TraceCheckUtils]: 104: Hoare triple {54266#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,700 INFO L290 TraceCheckUtils]: 105: Hoare triple {54266#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {54266#false} is VALID [2022-04-15 11:46:13,700 INFO L290 TraceCheckUtils]: 106: Hoare triple {54266#false} assume 8640 == #t~mem75;havoc #t~mem75; {54266#false} is VALID [2022-04-15 11:46:13,700 INFO L290 TraceCheckUtils]: 107: Hoare triple {54266#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {54266#false} is VALID [2022-04-15 11:46:13,700 INFO L290 TraceCheckUtils]: 108: Hoare triple {54266#false} assume !(4 == ~blastFlag~0); {54266#false} is VALID [2022-04-15 11:46:13,700 INFO L290 TraceCheckUtils]: 109: Hoare triple {54266#false} assume 7 == ~blastFlag~0; {54266#false} is VALID [2022-04-15 11:46:13,700 INFO L290 TraceCheckUtils]: 110: Hoare triple {54266#false} assume !false; {54266#false} is VALID [2022-04-15 11:46:13,701 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-15 11:46:13,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:46:13,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774739675] [2022-04-15 11:46:13,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774739675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:13,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:13,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:13,701 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:46:13,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1542055296] [2022-04-15 11:46:13,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1542055296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:13,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:13,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:13,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877117827] [2022-04-15 11:46:13,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:46:13,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 111 [2022-04-15 11:46:13,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:46:13,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:13,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:13,759 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:46:13,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:13,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:46:13,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:46:13,759 INFO L87 Difference]: Start difference. First operand 595 states and 962 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:25,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:25,935 INFO L93 Difference]: Finished difference Result 1307 states and 2087 transitions. [2022-04-15 11:46:25,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:46:25,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 111 [2022-04-15 11:46:25,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:46:25,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:25,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 580 transitions. [2022-04-15 11:46:25,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:25,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 580 transitions. [2022-04-15 11:46:25,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 580 transitions. [2022-04-15 11:46:26,326 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-15 11:46:26,346 INFO L225 Difference]: With dead ends: 1307 [2022-04-15 11:46:26,346 INFO L226 Difference]: Without dead ends: 738 [2022-04-15 11:46:26,347 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:46:26,348 INFO L913 BasicCegarLoop]: 113 mSDtfsCounter, 137 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:46:26,348 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 330 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-15 11:46:26,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2022-04-15 11:46:26,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 595. [2022-04-15 11:46:26,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:46:26,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 738 states. Second operand has 595 states, 590 states have (on average 1.6084745762711865) internal successors, (949), 590 states have internal predecessors, (949), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:26,373 INFO L74 IsIncluded]: Start isIncluded. First operand 738 states. Second operand has 595 states, 590 states have (on average 1.6084745762711865) internal successors, (949), 590 states have internal predecessors, (949), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:26,374 INFO L87 Difference]: Start difference. First operand 738 states. Second operand has 595 states, 590 states have (on average 1.6084745762711865) internal successors, (949), 590 states have internal predecessors, (949), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:26,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:26,388 INFO L93 Difference]: Finished difference Result 738 states and 1148 transitions. [2022-04-15 11:46:26,388 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1148 transitions. [2022-04-15 11:46:26,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:26,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:26,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 595 states, 590 states have (on average 1.6084745762711865) internal successors, (949), 590 states have internal predecessors, (949), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 738 states. [2022-04-15 11:46:26,390 INFO L87 Difference]: Start difference. First operand has 595 states, 590 states have (on average 1.6084745762711865) internal successors, (949), 590 states have internal predecessors, (949), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 738 states. [2022-04-15 11:46:26,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:26,406 INFO L93 Difference]: Finished difference Result 738 states and 1148 transitions. [2022-04-15 11:46:26,406 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1148 transitions. [2022-04-15 11:46:26,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:26,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:26,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:46:26,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:46:26,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 590 states have (on average 1.6084745762711865) internal successors, (949), 590 states have internal predecessors, (949), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:26,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 953 transitions. [2022-04-15 11:46:26,421 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 953 transitions. Word has length 111 [2022-04-15 11:46:26,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:46:26,422 INFO L478 AbstractCegarLoop]: Abstraction has 595 states and 953 transitions. [2022-04-15 11:46:26,422 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:26,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 595 states and 953 transitions. [2022-04-15 11:46:29,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 953 edges. 952 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:29,483 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 953 transitions. [2022-04-15 11:46:29,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-15 11:46:29,484 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:46:29,484 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:46:29,484 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 11:46:29,484 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:46:29,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:46:29,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1904606349, now seen corresponding path program 1 times [2022-04-15 11:46:29,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:29,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [939505736] [2022-04-15 11:46:29,536 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:46:29,536 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:46:29,536 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:46:29,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1904606349, now seen corresponding path program 2 times [2022-04-15 11:46:29,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:46:29,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879355872] [2022-04-15 11:46:29,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:46:29,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:46:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:29,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:46:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:29,694 INFO L290 TraceCheckUtils]: 0: Hoare triple {59564#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {59557#true} is VALID [2022-04-15 11:46:29,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {59557#true} assume true; {59557#true} is VALID [2022-04-15 11:46:29,695 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59557#true} {59557#true} #678#return; {59557#true} is VALID [2022-04-15 11:46:29,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {59557#true} call ULTIMATE.init(); {59564#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:46:29,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {59564#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {59557#true} is VALID [2022-04-15 11:46:29,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {59557#true} assume true; {59557#true} is VALID [2022-04-15 11:46:29,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59557#true} {59557#true} #678#return; {59557#true} is VALID [2022-04-15 11:46:29,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {59557#true} call #t~ret161 := main(); {59557#true} is VALID [2022-04-15 11:46:29,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {59557#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; {59557#true} is VALID [2022-04-15 11:46:29,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {59557#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {59557#true} is VALID [2022-04-15 11:46:29,696 INFO L272 TraceCheckUtils]: 7: Hoare triple {59557#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {59557#true} is VALID [2022-04-15 11:46:29,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {59557#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); {59562#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:29,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {59562#(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; {59562#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:29,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {59562#(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; {59562#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:29,701 INFO L290 TraceCheckUtils]: 11: Hoare triple {59562#(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)))); {59562#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:29,701 INFO L290 TraceCheckUtils]: 12: Hoare triple {59562#(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); {59562#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:29,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {59562#(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; {59562#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:29,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {59562#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {59562#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:29,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {59562#(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); {59562#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:29,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {59562#(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); {59562#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:29,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {59562#(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); {59562#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:29,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {59562#(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); {59562#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:29,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {59562#(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); {59562#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:29,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {59562#(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); {59562#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:29,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {59562#(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); {59562#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:29,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {59562#(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); {59563#(not (= |ssl3_accept_#t~mem54| 8482))} is VALID [2022-04-15 11:46:29,705 INFO L290 TraceCheckUtils]: 23: Hoare triple {59563#(not (= |ssl3_accept_#t~mem54| 8482))} assume 8482 == #t~mem54;havoc #t~mem54; {59558#false} is VALID [2022-04-15 11:46:29,705 INFO L290 TraceCheckUtils]: 24: Hoare triple {59558#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {59558#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); {59558#false} is VALID [2022-04-15 11:46:29,705 INFO L290 TraceCheckUtils]: 26: Hoare triple {59558#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {59558#false} is VALID [2022-04-15 11:46:29,705 INFO L290 TraceCheckUtils]: 27: Hoare triple {59558#false} ~skip~0 := 0; {59558#false} is VALID [2022-04-15 11:46:29,705 INFO L290 TraceCheckUtils]: 28: Hoare triple {59558#false} assume !false; {59558#false} is VALID [2022-04-15 11:46:29,705 INFO L290 TraceCheckUtils]: 29: Hoare triple {59558#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); {59558#false} is VALID [2022-04-15 11:46:29,706 INFO L290 TraceCheckUtils]: 30: Hoare triple {59558#false} assume 12292 == #t~mem47;havoc #t~mem47; {59558#false} is VALID [2022-04-15 11:46:29,706 INFO L290 TraceCheckUtils]: 31: Hoare triple {59558#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,706 INFO L290 TraceCheckUtils]: 32: Hoare triple {59558#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,706 INFO L290 TraceCheckUtils]: 33: Hoare triple {59558#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {59558#false} is VALID [2022-04-15 11:46:29,706 INFO L290 TraceCheckUtils]: 34: Hoare triple {59558#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,706 INFO L290 TraceCheckUtils]: 35: Hoare triple {59558#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); {59558#false} is VALID [2022-04-15 11:46:29,706 INFO L290 TraceCheckUtils]: 36: Hoare triple {59558#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {59558#false} is VALID [2022-04-15 11:46:29,706 INFO L290 TraceCheckUtils]: 37: Hoare triple {59558#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); {59558#false} is VALID [2022-04-15 11:46:29,706 INFO L290 TraceCheckUtils]: 38: Hoare triple {59558#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); {59558#false} is VALID [2022-04-15 11:46:29,706 INFO L290 TraceCheckUtils]: 39: Hoare triple {59558#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); {59558#false} is VALID [2022-04-15 11:46:29,706 INFO L290 TraceCheckUtils]: 40: Hoare triple {59558#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {59558#false} is VALID [2022-04-15 11:46:29,706 INFO L290 TraceCheckUtils]: 41: Hoare triple {59558#false} ~skip~0 := 0; {59558#false} is VALID [2022-04-15 11:46:29,706 INFO L290 TraceCheckUtils]: 42: Hoare triple {59558#false} assume !false; {59558#false} is VALID [2022-04-15 11:46:29,706 INFO L290 TraceCheckUtils]: 43: Hoare triple {59558#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); {59558#false} is VALID [2022-04-15 11:46:29,707 INFO L290 TraceCheckUtils]: 44: Hoare triple {59558#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,707 INFO L290 TraceCheckUtils]: 45: Hoare triple {59558#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,707 INFO L290 TraceCheckUtils]: 46: Hoare triple {59558#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,707 INFO L290 TraceCheckUtils]: 47: Hoare triple {59558#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,707 INFO L290 TraceCheckUtils]: 48: Hoare triple {59558#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,707 INFO L290 TraceCheckUtils]: 49: Hoare triple {59558#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,707 INFO L290 TraceCheckUtils]: 50: Hoare triple {59558#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,707 INFO L290 TraceCheckUtils]: 51: Hoare triple {59558#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,707 INFO L290 TraceCheckUtils]: 52: Hoare triple {59558#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,707 INFO L290 TraceCheckUtils]: 53: Hoare triple {59558#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,707 INFO L290 TraceCheckUtils]: 54: Hoare triple {59558#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,707 INFO L290 TraceCheckUtils]: 55: Hoare triple {59558#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,707 INFO L290 TraceCheckUtils]: 56: Hoare triple {59558#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,708 INFO L290 TraceCheckUtils]: 57: Hoare triple {59558#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,708 INFO L290 TraceCheckUtils]: 58: Hoare triple {59558#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,708 INFO L290 TraceCheckUtils]: 59: Hoare triple {59558#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,709 INFO L290 TraceCheckUtils]: 60: Hoare triple {59558#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,710 INFO L290 TraceCheckUtils]: 61: Hoare triple {59558#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,710 INFO L290 TraceCheckUtils]: 62: Hoare triple {59558#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,710 INFO L290 TraceCheckUtils]: 63: Hoare triple {59558#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,710 INFO L290 TraceCheckUtils]: 64: Hoare triple {59558#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,710 INFO L290 TraceCheckUtils]: 65: Hoare triple {59558#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,710 INFO L290 TraceCheckUtils]: 66: Hoare triple {59558#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,710 INFO L290 TraceCheckUtils]: 67: Hoare triple {59558#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,710 INFO L290 TraceCheckUtils]: 68: Hoare triple {59558#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,710 INFO L290 TraceCheckUtils]: 69: Hoare triple {59558#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,710 INFO L290 TraceCheckUtils]: 70: Hoare triple {59558#false} assume 8608 == #t~mem73;havoc #t~mem73; {59558#false} is VALID [2022-04-15 11:46:29,710 INFO L290 TraceCheckUtils]: 71: Hoare triple {59558#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {59558#false} is VALID [2022-04-15 11:46:29,710 INFO L290 TraceCheckUtils]: 72: Hoare triple {59558#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); {59558#false} is VALID [2022-04-15 11:46:29,710 INFO L290 TraceCheckUtils]: 73: Hoare triple {59558#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); {59558#false} is VALID [2022-04-15 11:46:29,710 INFO L290 TraceCheckUtils]: 74: Hoare triple {59558#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {59558#false} is VALID [2022-04-15 11:46:29,711 INFO L290 TraceCheckUtils]: 75: Hoare triple {59558#false} ~skip~0 := 0; {59558#false} is VALID [2022-04-15 11:46:29,711 INFO L290 TraceCheckUtils]: 76: Hoare triple {59558#false} assume !false; {59558#false} is VALID [2022-04-15 11:46:29,711 INFO L290 TraceCheckUtils]: 77: Hoare triple {59558#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); {59558#false} is VALID [2022-04-15 11:46:29,711 INFO L290 TraceCheckUtils]: 78: Hoare triple {59558#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,711 INFO L290 TraceCheckUtils]: 79: Hoare triple {59558#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,711 INFO L290 TraceCheckUtils]: 80: Hoare triple {59558#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,711 INFO L290 TraceCheckUtils]: 81: Hoare triple {59558#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,711 INFO L290 TraceCheckUtils]: 82: Hoare triple {59558#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,711 INFO L290 TraceCheckUtils]: 83: Hoare triple {59558#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,711 INFO L290 TraceCheckUtils]: 84: Hoare triple {59558#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,711 INFO L290 TraceCheckUtils]: 85: Hoare triple {59558#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,711 INFO L290 TraceCheckUtils]: 86: Hoare triple {59558#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,711 INFO L290 TraceCheckUtils]: 87: Hoare triple {59558#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,711 INFO L290 TraceCheckUtils]: 88: Hoare triple {59558#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,712 INFO L290 TraceCheckUtils]: 89: Hoare triple {59558#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,712 INFO L290 TraceCheckUtils]: 90: Hoare triple {59558#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,712 INFO L290 TraceCheckUtils]: 91: Hoare triple {59558#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,712 INFO L290 TraceCheckUtils]: 92: Hoare triple {59558#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,712 INFO L290 TraceCheckUtils]: 93: Hoare triple {59558#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,712 INFO L290 TraceCheckUtils]: 94: Hoare triple {59558#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,712 INFO L290 TraceCheckUtils]: 95: Hoare triple {59558#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,712 INFO L290 TraceCheckUtils]: 96: Hoare triple {59558#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,712 INFO L290 TraceCheckUtils]: 97: Hoare triple {59558#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,712 INFO L290 TraceCheckUtils]: 98: Hoare triple {59558#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,712 INFO L290 TraceCheckUtils]: 99: Hoare triple {59558#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,712 INFO L290 TraceCheckUtils]: 100: Hoare triple {59558#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,712 INFO L290 TraceCheckUtils]: 101: Hoare triple {59558#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,713 INFO L290 TraceCheckUtils]: 102: Hoare triple {59558#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,713 INFO L290 TraceCheckUtils]: 103: Hoare triple {59558#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,713 INFO L290 TraceCheckUtils]: 104: Hoare triple {59558#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,713 INFO L290 TraceCheckUtils]: 105: Hoare triple {59558#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {59558#false} is VALID [2022-04-15 11:46:29,713 INFO L290 TraceCheckUtils]: 106: Hoare triple {59558#false} assume 8640 == #t~mem75;havoc #t~mem75; {59558#false} is VALID [2022-04-15 11:46:29,713 INFO L290 TraceCheckUtils]: 107: Hoare triple {59558#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {59558#false} is VALID [2022-04-15 11:46:29,713 INFO L290 TraceCheckUtils]: 108: Hoare triple {59558#false} assume !(4 == ~blastFlag~0); {59558#false} is VALID [2022-04-15 11:46:29,713 INFO L290 TraceCheckUtils]: 109: Hoare triple {59558#false} assume 7 == ~blastFlag~0; {59558#false} is VALID [2022-04-15 11:46:29,713 INFO L290 TraceCheckUtils]: 110: Hoare triple {59558#false} assume !false; {59558#false} is VALID [2022-04-15 11:46:29,714 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-15 11:46:29,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:46:29,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879355872] [2022-04-15 11:46:29,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879355872] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:29,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:29,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:29,715 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:46:29,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [939505736] [2022-04-15 11:46:29,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [939505736] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:29,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:29,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:29,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806933208] [2022-04-15 11:46:29,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:46:29,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 111 [2022-04-15 11:46:29,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:46:29,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:29,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:29,786 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:46:29,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:29,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:46:29,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:46:29,787 INFO L87 Difference]: Start difference. First operand 595 states and 953 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:31,957 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-15 11:46:33,962 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-15 11:46:35,801 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-15 11:46:41,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:41,431 INFO L93 Difference]: Finished difference Result 979 states and 1557 transitions. [2022-04-15 11:46:41,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:46:41,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 111 [2022-04-15 11:46:41,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:46:41,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:41,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 578 transitions. [2022-04-15 11:46:41,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:41,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 578 transitions. [2022-04-15 11:46:41,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 578 transitions. [2022-04-15 11:46:41,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 578 edges. 578 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:41,830 INFO L225 Difference]: With dead ends: 979 [2022-04-15 11:46:41,830 INFO L226 Difference]: Without dead ends: 410 [2022-04-15 11:46:41,831 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:46:41,831 INFO L913 BasicCegarLoop]: 114 mSDtfsCounter, 135 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:46:41,831 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 332 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 470 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2022-04-15 11:46:41,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-04-15 11:46:41,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 335. [2022-04-15 11:46:41,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:46:41,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 410 states. Second operand has 335 states, 330 states have (on average 1.5787878787878789) internal successors, (521), 330 states have internal predecessors, (521), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:41,843 INFO L74 IsIncluded]: Start isIncluded. First operand 410 states. Second operand has 335 states, 330 states have (on average 1.5787878787878789) internal successors, (521), 330 states have internal predecessors, (521), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:41,843 INFO L87 Difference]: Start difference. First operand 410 states. Second operand has 335 states, 330 states have (on average 1.5787878787878789) internal successors, (521), 330 states have internal predecessors, (521), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:41,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:41,849 INFO L93 Difference]: Finished difference Result 410 states and 629 transitions. [2022-04-15 11:46:41,849 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 629 transitions. [2022-04-15 11:46:41,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:41,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:41,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 335 states, 330 states have (on average 1.5787878787878789) internal successors, (521), 330 states have internal predecessors, (521), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 410 states. [2022-04-15 11:46:41,850 INFO L87 Difference]: Start difference. First operand has 335 states, 330 states have (on average 1.5787878787878789) internal successors, (521), 330 states have internal predecessors, (521), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 410 states. [2022-04-15 11:46:41,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:41,859 INFO L93 Difference]: Finished difference Result 410 states and 629 transitions. [2022-04-15 11:46:41,859 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 629 transitions. [2022-04-15 11:46:41,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:41,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:41,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:46:41,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:46:41,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 330 states have (on average 1.5787878787878789) internal successors, (521), 330 states have internal predecessors, (521), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:41,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 525 transitions. [2022-04-15 11:46:41,865 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 525 transitions. Word has length 111 [2022-04-15 11:46:41,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:46:41,865 INFO L478 AbstractCegarLoop]: Abstraction has 335 states and 525 transitions. [2022-04-15 11:46:41,866 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:41,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 335 states and 525 transitions. [2022-04-15 11:46:42,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 525 edges. 525 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:42,274 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 525 transitions. [2022-04-15 11:46:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-15 11:46:42,275 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:46:42,275 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-15 11:46:42,275 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 11:46:42,277 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:46:42,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:46:42,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1808752530, now seen corresponding path program 1 times [2022-04-15 11:46:42,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:42,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [169905952] [2022-04-15 11:46:42,340 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:46:42,340 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:46:42,340 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:46:42,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1808752530, now seen corresponding path program 2 times [2022-04-15 11:46:42,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:46:42,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419979355] [2022-04-15 11:46:42,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:46:42,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:46:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:42,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:46:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:42,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {63024#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {63017#true} is VALID [2022-04-15 11:46:42,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {63017#true} assume true; {63017#true} is VALID [2022-04-15 11:46:42,487 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63017#true} {63017#true} #678#return; {63017#true} is VALID [2022-04-15 11:46:42,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {63017#true} call ULTIMATE.init(); {63024#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:46:42,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {63024#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {63017#true} is VALID [2022-04-15 11:46:42,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {63017#true} assume true; {63017#true} is VALID [2022-04-15 11:46:42,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63017#true} {63017#true} #678#return; {63017#true} is VALID [2022-04-15 11:46:42,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {63017#true} call #t~ret161 := main(); {63017#true} is VALID [2022-04-15 11:46:42,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {63017#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; {63017#true} is VALID [2022-04-15 11:46:42,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {63017#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {63017#true} is VALID [2022-04-15 11:46:42,488 INFO L272 TraceCheckUtils]: 7: Hoare triple {63017#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {63017#true} is VALID [2022-04-15 11:46:42,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {63017#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); {63017#true} is VALID [2022-04-15 11:46:42,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {63017#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; {63017#true} is VALID [2022-04-15 11:46:42,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {63017#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; {63017#true} is VALID [2022-04-15 11:46:42,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {63017#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {63017#true} is VALID [2022-04-15 11:46:42,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {63017#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {63017#true} is VALID [2022-04-15 11:46:42,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {63017#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {63017#true} is VALID [2022-04-15 11:46:42,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {63017#true} assume !false; {63017#true} is VALID [2022-04-15 11:46:42,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {63017#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); {63017#true} is VALID [2022-04-15 11:46:42,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {63017#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {63017#true} is VALID [2022-04-15 11:46:42,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {63017#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {63017#true} is VALID [2022-04-15 11:46:42,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {63017#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {63017#true} is VALID [2022-04-15 11:46:42,489 INFO L290 TraceCheckUtils]: 19: Hoare triple {63017#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {63017#true} is VALID [2022-04-15 11:46:42,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {63017#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {63017#true} is VALID [2022-04-15 11:46:42,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {63017#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {63017#true} is VALID [2022-04-15 11:46:42,489 INFO L290 TraceCheckUtils]: 22: Hoare triple {63017#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {63017#true} is VALID [2022-04-15 11:46:42,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {63017#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {63017#true} is VALID [2022-04-15 11:46:42,489 INFO L290 TraceCheckUtils]: 24: Hoare triple {63017#true} assume 8464 == #t~mem55;havoc #t~mem55; {63017#true} is VALID [2022-04-15 11:46:42,489 INFO L290 TraceCheckUtils]: 25: Hoare triple {63017#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; {63017#true} is VALID [2022-04-15 11:46:42,490 INFO L290 TraceCheckUtils]: 26: Hoare triple {63017#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {63017#true} is VALID [2022-04-15 11:46:42,490 INFO L290 TraceCheckUtils]: 27: Hoare triple {63017#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); {63017#true} is VALID [2022-04-15 11:46:42,490 INFO L290 TraceCheckUtils]: 28: Hoare triple {63017#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); {63017#true} is VALID [2022-04-15 11:46:42,490 INFO L290 TraceCheckUtils]: 29: Hoare triple {63017#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {63017#true} is VALID [2022-04-15 11:46:42,490 INFO L290 TraceCheckUtils]: 30: Hoare triple {63017#true} ~skip~0 := 0; {63017#true} is VALID [2022-04-15 11:46:42,490 INFO L290 TraceCheckUtils]: 31: Hoare triple {63017#true} assume !false; {63017#true} is VALID [2022-04-15 11:46:42,490 INFO L290 TraceCheckUtils]: 32: Hoare triple {63017#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); {63017#true} is VALID [2022-04-15 11:46:42,490 INFO L290 TraceCheckUtils]: 33: Hoare triple {63017#true} assume 12292 == #t~mem47;havoc #t~mem47; {63017#true} is VALID [2022-04-15 11:46:42,490 INFO L290 TraceCheckUtils]: 34: Hoare triple {63017#true} call write~int(1, ~s.base, 40 + ~s.offset, 4); {63017#true} is VALID [2022-04-15 11:46:42,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {63017#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {63017#true} is VALID [2022-04-15 11:46:42,490 INFO L290 TraceCheckUtils]: 36: Hoare triple {63017#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {63017#true} is VALID [2022-04-15 11:46:42,490 INFO L290 TraceCheckUtils]: 37: Hoare triple {63017#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {63017#true} is VALID [2022-04-15 11:46:42,490 INFO L290 TraceCheckUtils]: 38: Hoare triple {63017#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); {63017#true} is VALID [2022-04-15 11:46:42,490 INFO L290 TraceCheckUtils]: 39: Hoare triple {63017#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {63017#true} is VALID [2022-04-15 11:46:42,491 INFO L290 TraceCheckUtils]: 40: Hoare triple {63017#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); {63017#true} is VALID [2022-04-15 11:46:42,492 INFO L290 TraceCheckUtils]: 41: Hoare triple {63017#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); {63022#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:42,492 INFO L290 TraceCheckUtils]: 42: Hoare triple {63022#(= 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); {63022#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:42,492 INFO L290 TraceCheckUtils]: 43: Hoare triple {63022#(= 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; {63022#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:42,493 INFO L290 TraceCheckUtils]: 44: Hoare triple {63022#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {63022#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:42,493 INFO L290 TraceCheckUtils]: 45: Hoare triple {63022#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {63022#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:42,493 INFO L290 TraceCheckUtils]: 46: Hoare triple {63022#(= 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); {63022#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:42,494 INFO L290 TraceCheckUtils]: 47: Hoare triple {63022#(= 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); {63022#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:42,494 INFO L290 TraceCheckUtils]: 48: Hoare triple {63022#(= 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); {63022#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:42,494 INFO L290 TraceCheckUtils]: 49: Hoare triple {63022#(= 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); {63022#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:42,495 INFO L290 TraceCheckUtils]: 50: Hoare triple {63022#(= 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); {63022#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:42,495 INFO L290 TraceCheckUtils]: 51: Hoare triple {63022#(= 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); {63023#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-15 11:46:42,495 INFO L290 TraceCheckUtils]: 52: Hoare triple {63023#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,495 INFO L290 TraceCheckUtils]: 53: Hoare triple {63018#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,495 INFO L290 TraceCheckUtils]: 54: Hoare triple {63018#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,495 INFO L290 TraceCheckUtils]: 55: Hoare triple {63018#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,496 INFO L290 TraceCheckUtils]: 56: Hoare triple {63018#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,496 INFO L290 TraceCheckUtils]: 57: Hoare triple {63018#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,496 INFO L290 TraceCheckUtils]: 58: Hoare triple {63018#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,496 INFO L290 TraceCheckUtils]: 59: Hoare triple {63018#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,496 INFO L290 TraceCheckUtils]: 60: Hoare triple {63018#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,496 INFO L290 TraceCheckUtils]: 61: Hoare triple {63018#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,496 INFO L290 TraceCheckUtils]: 62: Hoare triple {63018#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,496 INFO L290 TraceCheckUtils]: 63: Hoare triple {63018#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,496 INFO L290 TraceCheckUtils]: 64: Hoare triple {63018#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,496 INFO L290 TraceCheckUtils]: 65: Hoare triple {63018#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,496 INFO L290 TraceCheckUtils]: 66: Hoare triple {63018#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,496 INFO L290 TraceCheckUtils]: 67: Hoare triple {63018#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,496 INFO L290 TraceCheckUtils]: 68: Hoare triple {63018#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,497 INFO L290 TraceCheckUtils]: 69: Hoare triple {63018#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,497 INFO L290 TraceCheckUtils]: 70: Hoare triple {63018#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,497 INFO L290 TraceCheckUtils]: 71: Hoare triple {63018#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,497 INFO L290 TraceCheckUtils]: 72: Hoare triple {63018#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,497 INFO L290 TraceCheckUtils]: 73: Hoare triple {63018#false} assume 8608 == #t~mem73;havoc #t~mem73; {63018#false} is VALID [2022-04-15 11:46:42,497 INFO L290 TraceCheckUtils]: 74: Hoare triple {63018#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {63018#false} is VALID [2022-04-15 11:46:42,497 INFO L290 TraceCheckUtils]: 75: Hoare triple {63018#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); {63018#false} is VALID [2022-04-15 11:46:42,497 INFO L290 TraceCheckUtils]: 76: Hoare triple {63018#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); {63018#false} is VALID [2022-04-15 11:46:42,497 INFO L290 TraceCheckUtils]: 77: Hoare triple {63018#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {63018#false} is VALID [2022-04-15 11:46:42,497 INFO L290 TraceCheckUtils]: 78: Hoare triple {63018#false} ~skip~0 := 0; {63018#false} is VALID [2022-04-15 11:46:42,497 INFO L290 TraceCheckUtils]: 79: Hoare triple {63018#false} assume !false; {63018#false} is VALID [2022-04-15 11:46:42,497 INFO L290 TraceCheckUtils]: 80: Hoare triple {63018#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); {63018#false} is VALID [2022-04-15 11:46:42,497 INFO L290 TraceCheckUtils]: 81: Hoare triple {63018#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,497 INFO L290 TraceCheckUtils]: 82: Hoare triple {63018#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,498 INFO L290 TraceCheckUtils]: 83: Hoare triple {63018#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,498 INFO L290 TraceCheckUtils]: 84: Hoare triple {63018#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,498 INFO L290 TraceCheckUtils]: 85: Hoare triple {63018#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,498 INFO L290 TraceCheckUtils]: 86: Hoare triple {63018#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,498 INFO L290 TraceCheckUtils]: 87: Hoare triple {63018#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,498 INFO L290 TraceCheckUtils]: 88: Hoare triple {63018#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,498 INFO L290 TraceCheckUtils]: 89: Hoare triple {63018#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,498 INFO L290 TraceCheckUtils]: 90: Hoare triple {63018#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,498 INFO L290 TraceCheckUtils]: 91: Hoare triple {63018#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,498 INFO L290 TraceCheckUtils]: 92: Hoare triple {63018#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,498 INFO L290 TraceCheckUtils]: 93: Hoare triple {63018#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,498 INFO L290 TraceCheckUtils]: 94: Hoare triple {63018#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,498 INFO L290 TraceCheckUtils]: 95: Hoare triple {63018#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,498 INFO L290 TraceCheckUtils]: 96: Hoare triple {63018#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,499 INFO L290 TraceCheckUtils]: 97: Hoare triple {63018#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,499 INFO L290 TraceCheckUtils]: 98: Hoare triple {63018#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,499 INFO L290 TraceCheckUtils]: 99: Hoare triple {63018#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,499 INFO L290 TraceCheckUtils]: 100: Hoare triple {63018#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,499 INFO L290 TraceCheckUtils]: 101: Hoare triple {63018#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,499 INFO L290 TraceCheckUtils]: 102: Hoare triple {63018#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,499 INFO L290 TraceCheckUtils]: 103: Hoare triple {63018#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,499 INFO L290 TraceCheckUtils]: 104: Hoare triple {63018#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,499 INFO L290 TraceCheckUtils]: 105: Hoare triple {63018#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,499 INFO L290 TraceCheckUtils]: 106: Hoare triple {63018#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,499 INFO L290 TraceCheckUtils]: 107: Hoare triple {63018#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,499 INFO L290 TraceCheckUtils]: 108: Hoare triple {63018#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {63018#false} is VALID [2022-04-15 11:46:42,499 INFO L290 TraceCheckUtils]: 109: Hoare triple {63018#false} assume 8640 == #t~mem75;havoc #t~mem75; {63018#false} is VALID [2022-04-15 11:46:42,500 INFO L290 TraceCheckUtils]: 110: Hoare triple {63018#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {63018#false} is VALID [2022-04-15 11:46:42,500 INFO L290 TraceCheckUtils]: 111: Hoare triple {63018#false} assume !(4 == ~blastFlag~0); {63018#false} is VALID [2022-04-15 11:46:42,500 INFO L290 TraceCheckUtils]: 112: Hoare triple {63018#false} assume 7 == ~blastFlag~0; {63018#false} is VALID [2022-04-15 11:46:42,500 INFO L290 TraceCheckUtils]: 113: Hoare triple {63018#false} assume !false; {63018#false} is VALID [2022-04-15 11:46:42,500 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 11:46:42,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:46:42,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419979355] [2022-04-15 11:46:42,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419979355] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:42,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:42,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:42,501 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:46:42,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [169905952] [2022-04-15 11:46:42,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [169905952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:42,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:42,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:42,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457416834] [2022-04-15 11:46:42,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:46:42,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-15 11:46:42,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:46:42,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:42,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:42,574 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:46:42,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:42,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:46:42,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:46:42,575 INFO L87 Difference]: Start difference. First operand 335 states and 525 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:44,541 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:46:46,550 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:46:48,597 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:46:51,521 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:46:54,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:54,357 INFO L93 Difference]: Finished difference Result 655 states and 1034 transitions. [2022-04-15 11:46:54,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:46:54,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-15 11:46:54,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:46:54,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:54,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 444 transitions. [2022-04-15 11:46:54,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:54,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 444 transitions. [2022-04-15 11:46:54,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 444 transitions. [2022-04-15 11:46:54,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 444 edges. 444 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:54,639 INFO L225 Difference]: With dead ends: 655 [2022-04-15 11:46:54,639 INFO L226 Difference]: Without dead ends: 348 [2022-04-15 11:46:54,640 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:46:54,641 INFO L913 BasicCegarLoop]: 224 mSDtfsCounter, 20 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:46:54,641 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 558 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 391 Invalid, 2 Unknown, 0 Unchecked, 7.4s Time] [2022-04-15 11:46:54,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-04-15 11:46:54,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 335. [2022-04-15 11:46:54,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:46:54,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 348 states. Second operand has 335 states, 330 states have (on average 1.5757575757575757) internal successors, (520), 330 states have internal predecessors, (520), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:54,670 INFO L74 IsIncluded]: Start isIncluded. First operand 348 states. Second operand has 335 states, 330 states have (on average 1.5757575757575757) internal successors, (520), 330 states have internal predecessors, (520), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:54,671 INFO L87 Difference]: Start difference. First operand 348 states. Second operand has 335 states, 330 states have (on average 1.5757575757575757) internal successors, (520), 330 states have internal predecessors, (520), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:54,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:54,675 INFO L93 Difference]: Finished difference Result 348 states and 540 transitions. [2022-04-15 11:46:54,675 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 540 transitions. [2022-04-15 11:46:54,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:54,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:54,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 335 states, 330 states have (on average 1.5757575757575757) internal successors, (520), 330 states have internal predecessors, (520), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 348 states. [2022-04-15 11:46:54,676 INFO L87 Difference]: Start difference. First operand has 335 states, 330 states have (on average 1.5757575757575757) internal successors, (520), 330 states have internal predecessors, (520), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 348 states. [2022-04-15 11:46:54,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:54,681 INFO L93 Difference]: Finished difference Result 348 states and 540 transitions. [2022-04-15 11:46:54,681 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 540 transitions. [2022-04-15 11:46:54,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:54,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:54,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:46:54,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:46:54,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 330 states have (on average 1.5757575757575757) internal successors, (520), 330 states have internal predecessors, (520), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:54,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 524 transitions. [2022-04-15 11:46:54,687 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 524 transitions. Word has length 114 [2022-04-15 11:46:54,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:46:54,687 INFO L478 AbstractCegarLoop]: Abstraction has 335 states and 524 transitions. [2022-04-15 11:46:54,687 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:54,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 335 states and 524 transitions. [2022-04-15 11:46:55,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 524 edges. 524 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:55,095 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 524 transitions. [2022-04-15 11:46:55,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-15 11:46:55,096 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:46:55,096 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-15 11:46:55,096 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 11:46:55,096 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:46:55,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:46:55,096 INFO L85 PathProgramCache]: Analyzing trace with hash 273525501, now seen corresponding path program 1 times [2022-04-15 11:46:55,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:55,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1357873389] [2022-04-15 11:46:55,146 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:46:55,146 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:46:55,147 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:46:55,147 INFO L85 PathProgramCache]: Analyzing trace with hash 273525501, now seen corresponding path program 2 times [2022-04-15 11:46:55,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:46:55,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633901345] [2022-04-15 11:46:55,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:46:55,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:46:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:55,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:46:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:55,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {65713#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {65705#true} is VALID [2022-04-15 11:46:55,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {65705#true} assume true; {65705#true} is VALID [2022-04-15 11:46:55,344 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65705#true} {65705#true} #678#return; {65705#true} is VALID [2022-04-15 11:46:55,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {65705#true} call ULTIMATE.init(); {65713#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:46:55,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {65713#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {65705#true} is VALID [2022-04-15 11:46:55,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {65705#true} assume true; {65705#true} is VALID [2022-04-15 11:46:55,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65705#true} {65705#true} #678#return; {65705#true} is VALID [2022-04-15 11:46:55,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {65705#true} call #t~ret161 := main(); {65705#true} is VALID [2022-04-15 11:46:55,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {65705#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; {65705#true} is VALID [2022-04-15 11:46:55,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {65705#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {65705#true} is VALID [2022-04-15 11:46:55,345 INFO L272 TraceCheckUtils]: 7: Hoare triple {65705#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {65705#true} is VALID [2022-04-15 11:46:55,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {65705#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); {65705#true} is VALID [2022-04-15 11:46:55,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {65705#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; {65705#true} is VALID [2022-04-15 11:46:55,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {65705#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; {65705#true} is VALID [2022-04-15 11:46:55,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {65705#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {65705#true} is VALID [2022-04-15 11:46:55,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {65705#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {65705#true} is VALID [2022-04-15 11:46:55,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {65705#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {65705#true} is VALID [2022-04-15 11:46:55,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {65705#true} assume !false; {65705#true} is VALID [2022-04-15 11:46:55,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {65705#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); {65705#true} is VALID [2022-04-15 11:46:55,346 INFO L290 TraceCheckUtils]: 16: Hoare triple {65705#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {65705#true} is VALID [2022-04-15 11:46:55,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {65705#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {65705#true} is VALID [2022-04-15 11:46:55,346 INFO L290 TraceCheckUtils]: 18: Hoare triple {65705#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {65705#true} is VALID [2022-04-15 11:46:55,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {65705#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {65705#true} is VALID [2022-04-15 11:46:55,346 INFO L290 TraceCheckUtils]: 20: Hoare triple {65705#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {65705#true} is VALID [2022-04-15 11:46:55,346 INFO L290 TraceCheckUtils]: 21: Hoare triple {65705#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {65705#true} is VALID [2022-04-15 11:46:55,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {65705#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {65705#true} is VALID [2022-04-15 11:46:55,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {65705#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {65705#true} is VALID [2022-04-15 11:46:55,347 INFO L290 TraceCheckUtils]: 24: Hoare triple {65705#true} assume 8464 == #t~mem55;havoc #t~mem55; {65705#true} is VALID [2022-04-15 11:46:55,347 INFO L290 TraceCheckUtils]: 25: Hoare triple {65705#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; {65705#true} is VALID [2022-04-15 11:46:55,347 INFO L290 TraceCheckUtils]: 26: Hoare triple {65705#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {65705#true} is VALID [2022-04-15 11:46:55,347 INFO L290 TraceCheckUtils]: 27: Hoare triple {65705#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); {65705#true} is VALID [2022-04-15 11:46:55,347 INFO L290 TraceCheckUtils]: 28: Hoare triple {65705#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); {65705#true} is VALID [2022-04-15 11:46:55,347 INFO L290 TraceCheckUtils]: 29: Hoare triple {65705#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {65705#true} is VALID [2022-04-15 11:46:55,347 INFO L290 TraceCheckUtils]: 30: Hoare triple {65705#true} ~skip~0 := 0; {65705#true} is VALID [2022-04-15 11:46:55,347 INFO L290 TraceCheckUtils]: 31: Hoare triple {65705#true} assume !false; {65705#true} is VALID [2022-04-15 11:46:55,355 INFO L290 TraceCheckUtils]: 32: Hoare triple {65705#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); {65710#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:55,356 INFO L290 TraceCheckUtils]: 33: Hoare triple {65710#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 12292 == #t~mem47;havoc #t~mem47; {65711#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:55,357 INFO L290 TraceCheckUtils]: 34: Hoare triple {65711#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 40 + ~s.offset, 4); {65711#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:55,357 INFO L290 TraceCheckUtils]: 35: Hoare triple {65711#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 36 + ~s.offset, 4); {65711#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:55,358 INFO L290 TraceCheckUtils]: 36: Hoare triple {65711#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {65711#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:55,358 INFO L290 TraceCheckUtils]: 37: Hoare triple {65711#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {65711#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:55,359 INFO L290 TraceCheckUtils]: 38: Hoare triple {65711#(= 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); {65711#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:55,360 INFO L290 TraceCheckUtils]: 39: Hoare triple {65711#(= 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; {65711#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:55,360 INFO L290 TraceCheckUtils]: 40: Hoare triple {65711#(= 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); {65712#(= 12292 |ssl3_accept_#t~mem85|)} is VALID [2022-04-15 11:46:55,361 INFO L290 TraceCheckUtils]: 41: Hoare triple {65712#(= 12292 |ssl3_accept_#t~mem85|)} assume 12292 != #t~mem85;havoc #t~mem85; {65706#false} is VALID [2022-04-15 11:46:55,361 INFO L290 TraceCheckUtils]: 42: Hoare triple {65706#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; {65706#false} is VALID [2022-04-15 11:46:55,361 INFO L290 TraceCheckUtils]: 43: Hoare triple {65706#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); {65706#false} is VALID [2022-04-15 11:46:55,361 INFO L290 TraceCheckUtils]: 44: Hoare triple {65706#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {65706#false} is VALID [2022-04-15 11:46:55,361 INFO L290 TraceCheckUtils]: 45: Hoare triple {65706#false} ~skip~0 := 0; {65706#false} is VALID [2022-04-15 11:46:55,361 INFO L290 TraceCheckUtils]: 46: Hoare triple {65706#false} assume !false; {65706#false} is VALID [2022-04-15 11:46:55,361 INFO L290 TraceCheckUtils]: 47: Hoare triple {65706#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); {65706#false} is VALID [2022-04-15 11:46:55,361 INFO L290 TraceCheckUtils]: 48: Hoare triple {65706#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,361 INFO L290 TraceCheckUtils]: 49: Hoare triple {65706#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,361 INFO L290 TraceCheckUtils]: 50: Hoare triple {65706#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,362 INFO L290 TraceCheckUtils]: 51: Hoare triple {65706#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,362 INFO L290 TraceCheckUtils]: 52: Hoare triple {65706#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,362 INFO L290 TraceCheckUtils]: 53: Hoare triple {65706#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,362 INFO L290 TraceCheckUtils]: 54: Hoare triple {65706#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,362 INFO L290 TraceCheckUtils]: 55: Hoare triple {65706#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,362 INFO L290 TraceCheckUtils]: 56: Hoare triple {65706#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,362 INFO L290 TraceCheckUtils]: 57: Hoare triple {65706#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,362 INFO L290 TraceCheckUtils]: 58: Hoare triple {65706#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,362 INFO L290 TraceCheckUtils]: 59: Hoare triple {65706#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,362 INFO L290 TraceCheckUtils]: 60: Hoare triple {65706#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,362 INFO L290 TraceCheckUtils]: 61: Hoare triple {65706#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,362 INFO L290 TraceCheckUtils]: 62: Hoare triple {65706#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,362 INFO L290 TraceCheckUtils]: 63: Hoare triple {65706#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,362 INFO L290 TraceCheckUtils]: 64: Hoare triple {65706#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,363 INFO L290 TraceCheckUtils]: 65: Hoare triple {65706#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,363 INFO L290 TraceCheckUtils]: 66: Hoare triple {65706#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,363 INFO L290 TraceCheckUtils]: 67: Hoare triple {65706#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,363 INFO L290 TraceCheckUtils]: 68: Hoare triple {65706#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,363 INFO L290 TraceCheckUtils]: 69: Hoare triple {65706#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,363 INFO L290 TraceCheckUtils]: 70: Hoare triple {65706#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,363 INFO L290 TraceCheckUtils]: 71: Hoare triple {65706#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,363 INFO L290 TraceCheckUtils]: 72: Hoare triple {65706#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,363 INFO L290 TraceCheckUtils]: 73: Hoare triple {65706#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,363 INFO L290 TraceCheckUtils]: 74: Hoare triple {65706#false} assume 8608 == #t~mem73;havoc #t~mem73; {65706#false} is VALID [2022-04-15 11:46:55,363 INFO L290 TraceCheckUtils]: 75: Hoare triple {65706#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {65706#false} is VALID [2022-04-15 11:46:55,363 INFO L290 TraceCheckUtils]: 76: Hoare triple {65706#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); {65706#false} is VALID [2022-04-15 11:46:55,363 INFO L290 TraceCheckUtils]: 77: Hoare triple {65706#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); {65706#false} is VALID [2022-04-15 11:46:55,364 INFO L290 TraceCheckUtils]: 78: Hoare triple {65706#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {65706#false} is VALID [2022-04-15 11:46:55,364 INFO L290 TraceCheckUtils]: 79: Hoare triple {65706#false} ~skip~0 := 0; {65706#false} is VALID [2022-04-15 11:46:55,364 INFO L290 TraceCheckUtils]: 80: Hoare triple {65706#false} assume !false; {65706#false} is VALID [2022-04-15 11:46:55,364 INFO L290 TraceCheckUtils]: 81: Hoare triple {65706#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); {65706#false} is VALID [2022-04-15 11:46:55,364 INFO L290 TraceCheckUtils]: 82: Hoare triple {65706#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,364 INFO L290 TraceCheckUtils]: 83: Hoare triple {65706#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,364 INFO L290 TraceCheckUtils]: 84: Hoare triple {65706#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,364 INFO L290 TraceCheckUtils]: 85: Hoare triple {65706#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,364 INFO L290 TraceCheckUtils]: 86: Hoare triple {65706#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,364 INFO L290 TraceCheckUtils]: 87: Hoare triple {65706#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,364 INFO L290 TraceCheckUtils]: 88: Hoare triple {65706#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,364 INFO L290 TraceCheckUtils]: 89: Hoare triple {65706#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,364 INFO L290 TraceCheckUtils]: 90: Hoare triple {65706#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,364 INFO L290 TraceCheckUtils]: 91: Hoare triple {65706#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,364 INFO L290 TraceCheckUtils]: 92: Hoare triple {65706#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,365 INFO L290 TraceCheckUtils]: 93: Hoare triple {65706#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,365 INFO L290 TraceCheckUtils]: 94: Hoare triple {65706#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,365 INFO L290 TraceCheckUtils]: 95: Hoare triple {65706#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,365 INFO L290 TraceCheckUtils]: 96: Hoare triple {65706#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,365 INFO L290 TraceCheckUtils]: 97: Hoare triple {65706#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,365 INFO L290 TraceCheckUtils]: 98: Hoare triple {65706#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,365 INFO L290 TraceCheckUtils]: 99: Hoare triple {65706#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,365 INFO L290 TraceCheckUtils]: 100: Hoare triple {65706#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,365 INFO L290 TraceCheckUtils]: 101: Hoare triple {65706#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,365 INFO L290 TraceCheckUtils]: 102: Hoare triple {65706#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,365 INFO L290 TraceCheckUtils]: 103: Hoare triple {65706#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,365 INFO L290 TraceCheckUtils]: 104: Hoare triple {65706#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,365 INFO L290 TraceCheckUtils]: 105: Hoare triple {65706#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,365 INFO L290 TraceCheckUtils]: 106: Hoare triple {65706#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,366 INFO L290 TraceCheckUtils]: 107: Hoare triple {65706#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,366 INFO L290 TraceCheckUtils]: 108: Hoare triple {65706#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,366 INFO L290 TraceCheckUtils]: 109: Hoare triple {65706#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {65706#false} is VALID [2022-04-15 11:46:55,366 INFO L290 TraceCheckUtils]: 110: Hoare triple {65706#false} assume 8640 == #t~mem75;havoc #t~mem75; {65706#false} is VALID [2022-04-15 11:46:55,366 INFO L290 TraceCheckUtils]: 111: Hoare triple {65706#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {65706#false} is VALID [2022-04-15 11:46:55,366 INFO L290 TraceCheckUtils]: 112: Hoare triple {65706#false} assume !(4 == ~blastFlag~0); {65706#false} is VALID [2022-04-15 11:46:55,366 INFO L290 TraceCheckUtils]: 113: Hoare triple {65706#false} assume 7 == ~blastFlag~0; {65706#false} is VALID [2022-04-15 11:46:55,366 INFO L290 TraceCheckUtils]: 114: Hoare triple {65706#false} assume !false; {65706#false} is VALID [2022-04-15 11:46:55,366 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-15 11:46:55,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:46:55,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633901345] [2022-04-15 11:46:55,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633901345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:55,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:55,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:46:55,367 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:46:55,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1357873389] [2022-04-15 11:46:55,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1357873389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:55,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:55,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:46:55,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074939971] [2022-04-15 11:46:55,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:46:55,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 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 115 [2022-04-15 11:46:55,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:46:55,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 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-15 11:46:55,444 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-15 11:46:55,444 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:46:55,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:55,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:46:55,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:46:55,445 INFO L87 Difference]: Start difference. First operand 335 states and 524 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 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-15 11:46:57,657 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:04,439 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:07,210 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:10,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:10,452 INFO L93 Difference]: Finished difference Result 651 states and 1028 transitions. [2022-04-15 11:47:10,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:47:10,452 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 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 115 [2022-04-15 11:47:10,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:10,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 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-15 11:47:10,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 415 transitions. [2022-04-15 11:47:10,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 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-15 11:47:10,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 415 transitions. [2022-04-15 11:47:10,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 415 transitions. [2022-04-15 11:47:10,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 415 edges. 415 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:10,718 INFO L225 Difference]: With dead ends: 651 [2022-04-15 11:47:10,718 INFO L226 Difference]: Without dead ends: 344 [2022-04-15 11:47:10,718 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 11:47:10,719 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 3 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:10,719 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 617 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 431 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2022-04-15 11:47:10,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-04-15 11:47:10,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2022-04-15 11:47:10,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:10,730 INFO L82 GeneralOperation]: Start isEquivalent. First operand 344 states. Second operand has 344 states, 339 states have (on average 1.5663716814159292) internal successors, (531), 339 states have internal predecessors, (531), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:10,731 INFO L74 IsIncluded]: Start isIncluded. First operand 344 states. Second operand has 344 states, 339 states have (on average 1.5663716814159292) internal successors, (531), 339 states have internal predecessors, (531), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:10,731 INFO L87 Difference]: Start difference. First operand 344 states. Second operand has 344 states, 339 states have (on average 1.5663716814159292) internal successors, (531), 339 states have internal predecessors, (531), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:10,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:10,735 INFO L93 Difference]: Finished difference Result 344 states and 535 transitions. [2022-04-15 11:47:10,735 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 535 transitions. [2022-04-15 11:47:10,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:10,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:10,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 339 states have (on average 1.5663716814159292) internal successors, (531), 339 states have internal predecessors, (531), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 344 states. [2022-04-15 11:47:10,736 INFO L87 Difference]: Start difference. First operand has 344 states, 339 states have (on average 1.5663716814159292) internal successors, (531), 339 states have internal predecessors, (531), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 344 states. [2022-04-15 11:47:10,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:10,754 INFO L93 Difference]: Finished difference Result 344 states and 535 transitions. [2022-04-15 11:47:10,754 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 535 transitions. [2022-04-15 11:47:10,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:10,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:10,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:10,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:10,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 339 states have (on average 1.5663716814159292) internal successors, (531), 339 states have internal predecessors, (531), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:10,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 535 transitions. [2022-04-15 11:47:10,760 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 535 transitions. Word has length 115 [2022-04-15 11:47:10,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:10,761 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 535 transitions. [2022-04-15 11:47:10,761 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 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-15 11:47:10,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 535 transitions. [2022-04-15 11:47:11,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:11,173 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 535 transitions. [2022-04-15 11:47:11,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-15 11:47:11,174 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:11,174 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-15 11:47:11,174 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 11:47:11,174 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:11,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:11,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1562206865, now seen corresponding path program 1 times [2022-04-15 11:47:11,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:11,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [722451095] [2022-04-15 11:47:11,227 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:47:11,227 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:47:11,227 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:11,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1562206865, now seen corresponding path program 2 times [2022-04-15 11:47:11,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:11,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814226059] [2022-04-15 11:47:11,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:11,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:11,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:11,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {68403#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {68396#true} is VALID [2022-04-15 11:47:11,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {68396#true} assume true; {68396#true} is VALID [2022-04-15 11:47:11,385 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68396#true} {68396#true} #678#return; {68396#true} is VALID [2022-04-15 11:47:11,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {68396#true} call ULTIMATE.init(); {68403#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:47:11,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {68403#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {68396#true} is VALID [2022-04-15 11:47:11,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {68396#true} assume true; {68396#true} is VALID [2022-04-15 11:47:11,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68396#true} {68396#true} #678#return; {68396#true} is VALID [2022-04-15 11:47:11,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {68396#true} call #t~ret161 := main(); {68396#true} is VALID [2022-04-15 11:47:11,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {68396#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; {68396#true} is VALID [2022-04-15 11:47:11,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {68396#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {68396#true} is VALID [2022-04-15 11:47:11,386 INFO L272 TraceCheckUtils]: 7: Hoare triple {68396#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {68396#true} is VALID [2022-04-15 11:47:11,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {68396#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); {68396#true} is VALID [2022-04-15 11:47:11,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {68396#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; {68396#true} is VALID [2022-04-15 11:47:11,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {68396#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; {68396#true} is VALID [2022-04-15 11:47:11,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {68396#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {68396#true} is VALID [2022-04-15 11:47:11,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {68396#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {68396#true} is VALID [2022-04-15 11:47:11,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {68396#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {68396#true} is VALID [2022-04-15 11:47:11,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {68396#true} assume !false; {68396#true} is VALID [2022-04-15 11:47:11,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {68396#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); {68396#true} is VALID [2022-04-15 11:47:11,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {68396#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {68396#true} is VALID [2022-04-15 11:47:11,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {68396#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {68396#true} is VALID [2022-04-15 11:47:11,387 INFO L290 TraceCheckUtils]: 18: Hoare triple {68396#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68396#true} is VALID [2022-04-15 11:47:11,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {68396#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68396#true} is VALID [2022-04-15 11:47:11,387 INFO L290 TraceCheckUtils]: 20: Hoare triple {68396#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68396#true} is VALID [2022-04-15 11:47:11,387 INFO L290 TraceCheckUtils]: 21: Hoare triple {68396#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68396#true} is VALID [2022-04-15 11:47:11,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {68396#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68396#true} is VALID [2022-04-15 11:47:11,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {68396#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {68396#true} is VALID [2022-04-15 11:47:11,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {68396#true} assume 8464 == #t~mem55;havoc #t~mem55; {68396#true} is VALID [2022-04-15 11:47:11,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {68396#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; {68396#true} is VALID [2022-04-15 11:47:11,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {68396#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {68396#true} is VALID [2022-04-15 11:47:11,388 INFO L290 TraceCheckUtils]: 27: Hoare triple {68396#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); {68401#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:11,389 INFO L290 TraceCheckUtils]: 28: Hoare triple {68401#(not (= 16384 (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); {68401#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:11,389 INFO L290 TraceCheckUtils]: 29: Hoare triple {68401#(not (= 16384 (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; {68401#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:11,390 INFO L290 TraceCheckUtils]: 30: Hoare triple {68401#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {68401#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:11,390 INFO L290 TraceCheckUtils]: 31: Hoare triple {68401#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {68401#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:11,390 INFO L290 TraceCheckUtils]: 32: Hoare triple {68401#(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); {68401#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:11,391 INFO L290 TraceCheckUtils]: 33: Hoare triple {68401#(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); {68402#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-15 11:47:11,391 INFO L290 TraceCheckUtils]: 34: Hoare triple {68402#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {68397#false} is VALID [2022-04-15 11:47:11,391 INFO L290 TraceCheckUtils]: 35: Hoare triple {68397#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,391 INFO L290 TraceCheckUtils]: 36: Hoare triple {68397#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {68397#false} is VALID [2022-04-15 11:47:11,391 INFO L290 TraceCheckUtils]: 37: Hoare triple {68397#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,391 INFO L290 TraceCheckUtils]: 38: Hoare triple {68397#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); {68397#false} is VALID [2022-04-15 11:47:11,391 INFO L290 TraceCheckUtils]: 39: Hoare triple {68397#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {68397#false} is VALID [2022-04-15 11:47:11,391 INFO L290 TraceCheckUtils]: 40: Hoare triple {68397#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); {68397#false} is VALID [2022-04-15 11:47:11,391 INFO L290 TraceCheckUtils]: 41: Hoare triple {68397#false} assume 12292 != #t~mem85;havoc #t~mem85; {68397#false} is VALID [2022-04-15 11:47:11,392 INFO L290 TraceCheckUtils]: 42: Hoare triple {68397#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; {68397#false} is VALID [2022-04-15 11:47:11,392 INFO L290 TraceCheckUtils]: 43: Hoare triple {68397#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); {68397#false} is VALID [2022-04-15 11:47:11,392 INFO L290 TraceCheckUtils]: 44: Hoare triple {68397#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {68397#false} is VALID [2022-04-15 11:47:11,392 INFO L290 TraceCheckUtils]: 45: Hoare triple {68397#false} ~skip~0 := 0; {68397#false} is VALID [2022-04-15 11:47:11,392 INFO L290 TraceCheckUtils]: 46: Hoare triple {68397#false} assume !false; {68397#false} is VALID [2022-04-15 11:47:11,392 INFO L290 TraceCheckUtils]: 47: Hoare triple {68397#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); {68397#false} is VALID [2022-04-15 11:47:11,392 INFO L290 TraceCheckUtils]: 48: Hoare triple {68397#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,392 INFO L290 TraceCheckUtils]: 49: Hoare triple {68397#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,392 INFO L290 TraceCheckUtils]: 50: Hoare triple {68397#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,392 INFO L290 TraceCheckUtils]: 51: Hoare triple {68397#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,392 INFO L290 TraceCheckUtils]: 52: Hoare triple {68397#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,392 INFO L290 TraceCheckUtils]: 53: Hoare triple {68397#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,392 INFO L290 TraceCheckUtils]: 54: Hoare triple {68397#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,392 INFO L290 TraceCheckUtils]: 55: Hoare triple {68397#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,392 INFO L290 TraceCheckUtils]: 56: Hoare triple {68397#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,393 INFO L290 TraceCheckUtils]: 57: Hoare triple {68397#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,393 INFO L290 TraceCheckUtils]: 58: Hoare triple {68397#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,393 INFO L290 TraceCheckUtils]: 59: Hoare triple {68397#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,393 INFO L290 TraceCheckUtils]: 60: Hoare triple {68397#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,393 INFO L290 TraceCheckUtils]: 61: Hoare triple {68397#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,393 INFO L290 TraceCheckUtils]: 62: Hoare triple {68397#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,393 INFO L290 TraceCheckUtils]: 63: Hoare triple {68397#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,393 INFO L290 TraceCheckUtils]: 64: Hoare triple {68397#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,393 INFO L290 TraceCheckUtils]: 65: Hoare triple {68397#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,393 INFO L290 TraceCheckUtils]: 66: Hoare triple {68397#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,393 INFO L290 TraceCheckUtils]: 67: Hoare triple {68397#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,393 INFO L290 TraceCheckUtils]: 68: Hoare triple {68397#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,393 INFO L290 TraceCheckUtils]: 69: Hoare triple {68397#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,393 INFO L290 TraceCheckUtils]: 70: Hoare triple {68397#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,394 INFO L290 TraceCheckUtils]: 71: Hoare triple {68397#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,394 INFO L290 TraceCheckUtils]: 72: Hoare triple {68397#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,394 INFO L290 TraceCheckUtils]: 73: Hoare triple {68397#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,394 INFO L290 TraceCheckUtils]: 74: Hoare triple {68397#false} assume 8608 == #t~mem73;havoc #t~mem73; {68397#false} is VALID [2022-04-15 11:47:11,394 INFO L290 TraceCheckUtils]: 75: Hoare triple {68397#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {68397#false} is VALID [2022-04-15 11:47:11,394 INFO L290 TraceCheckUtils]: 76: Hoare triple {68397#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); {68397#false} is VALID [2022-04-15 11:47:11,394 INFO L290 TraceCheckUtils]: 77: Hoare triple {68397#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); {68397#false} is VALID [2022-04-15 11:47:11,394 INFO L290 TraceCheckUtils]: 78: Hoare triple {68397#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {68397#false} is VALID [2022-04-15 11:47:11,394 INFO L290 TraceCheckUtils]: 79: Hoare triple {68397#false} ~skip~0 := 0; {68397#false} is VALID [2022-04-15 11:47:11,394 INFO L290 TraceCheckUtils]: 80: Hoare triple {68397#false} assume !false; {68397#false} is VALID [2022-04-15 11:47:11,394 INFO L290 TraceCheckUtils]: 81: Hoare triple {68397#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); {68397#false} is VALID [2022-04-15 11:47:11,394 INFO L290 TraceCheckUtils]: 82: Hoare triple {68397#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,394 INFO L290 TraceCheckUtils]: 83: Hoare triple {68397#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,394 INFO L290 TraceCheckUtils]: 84: Hoare triple {68397#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,394 INFO L290 TraceCheckUtils]: 85: Hoare triple {68397#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,395 INFO L290 TraceCheckUtils]: 86: Hoare triple {68397#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,395 INFO L290 TraceCheckUtils]: 87: Hoare triple {68397#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,395 INFO L290 TraceCheckUtils]: 88: Hoare triple {68397#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,395 INFO L290 TraceCheckUtils]: 89: Hoare triple {68397#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,395 INFO L290 TraceCheckUtils]: 90: Hoare triple {68397#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,395 INFO L290 TraceCheckUtils]: 91: Hoare triple {68397#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,395 INFO L290 TraceCheckUtils]: 92: Hoare triple {68397#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,395 INFO L290 TraceCheckUtils]: 93: Hoare triple {68397#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,395 INFO L290 TraceCheckUtils]: 94: Hoare triple {68397#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,395 INFO L290 TraceCheckUtils]: 95: Hoare triple {68397#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,395 INFO L290 TraceCheckUtils]: 96: Hoare triple {68397#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,395 INFO L290 TraceCheckUtils]: 97: Hoare triple {68397#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,395 INFO L290 TraceCheckUtils]: 98: Hoare triple {68397#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,395 INFO L290 TraceCheckUtils]: 99: Hoare triple {68397#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,396 INFO L290 TraceCheckUtils]: 100: Hoare triple {68397#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,396 INFO L290 TraceCheckUtils]: 101: Hoare triple {68397#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,396 INFO L290 TraceCheckUtils]: 102: Hoare triple {68397#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,396 INFO L290 TraceCheckUtils]: 103: Hoare triple {68397#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,396 INFO L290 TraceCheckUtils]: 104: Hoare triple {68397#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,396 INFO L290 TraceCheckUtils]: 105: Hoare triple {68397#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,396 INFO L290 TraceCheckUtils]: 106: Hoare triple {68397#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,396 INFO L290 TraceCheckUtils]: 107: Hoare triple {68397#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,396 INFO L290 TraceCheckUtils]: 108: Hoare triple {68397#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,396 INFO L290 TraceCheckUtils]: 109: Hoare triple {68397#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {68397#false} is VALID [2022-04-15 11:47:11,396 INFO L290 TraceCheckUtils]: 110: Hoare triple {68397#false} assume 8640 == #t~mem75;havoc #t~mem75; {68397#false} is VALID [2022-04-15 11:47:11,396 INFO L290 TraceCheckUtils]: 111: Hoare triple {68397#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {68397#false} is VALID [2022-04-15 11:47:11,396 INFO L290 TraceCheckUtils]: 112: Hoare triple {68397#false} assume !(4 == ~blastFlag~0); {68397#false} is VALID [2022-04-15 11:47:11,396 INFO L290 TraceCheckUtils]: 113: Hoare triple {68397#false} assume 7 == ~blastFlag~0; {68397#false} is VALID [2022-04-15 11:47:11,397 INFO L290 TraceCheckUtils]: 114: Hoare triple {68397#false} assume !false; {68397#false} is VALID [2022-04-15 11:47:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-15 11:47:11,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:11,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814226059] [2022-04-15 11:47:11,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814226059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:11,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:11,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:11,397 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:11,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [722451095] [2022-04-15 11:47:11,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [722451095] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:11,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:11,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:11,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817231911] [2022-04-15 11:47:11,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:11,398 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 115 [2022-04-15 11:47:11,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:11,398 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-15 11:47:11,466 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-15 11:47:11,466 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:47:11,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:11,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:47:11,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:47:11,467 INFO L87 Difference]: Start difference. First operand 344 states and 535 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-15 11:47:13,521 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-15 11:47:16,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:16,604 INFO L93 Difference]: Finished difference Result 744 states and 1153 transitions. [2022-04-15 11:47:16,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:47:16,604 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 115 [2022-04-15 11:47:16,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:16,604 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-15 11:47:16,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 577 transitions. [2022-04-15 11:47:16,607 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-15 11:47:16,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 577 transitions. [2022-04-15 11:47:16,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 577 transitions. [2022-04-15 11:47:17,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 577 edges. 577 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:17,019 INFO L225 Difference]: With dead ends: 744 [2022-04-15 11:47:17,019 INFO L226 Difference]: Without dead ends: 428 [2022-04-15 11:47:17,020 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:47:17,020 INFO L913 BasicCegarLoop]: 114 mSDtfsCounter, 141 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:17,021 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 332 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 467 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-04-15 11:47:17,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-04-15 11:47:17,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 344. [2022-04-15 11:47:17,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:17,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 428 states. Second operand has 344 states, 339 states have (on average 1.5486725663716814) internal successors, (525), 339 states have internal predecessors, (525), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:17,034 INFO L74 IsIncluded]: Start isIncluded. First operand 428 states. Second operand has 344 states, 339 states have (on average 1.5486725663716814) internal successors, (525), 339 states have internal predecessors, (525), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:17,034 INFO L87 Difference]: Start difference. First operand 428 states. Second operand has 344 states, 339 states have (on average 1.5486725663716814) internal successors, (525), 339 states have internal predecessors, (525), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:17,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:17,040 INFO L93 Difference]: Finished difference Result 428 states and 644 transitions. [2022-04-15 11:47:17,040 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 644 transitions. [2022-04-15 11:47:17,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:17,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:17,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 339 states have (on average 1.5486725663716814) internal successors, (525), 339 states have internal predecessors, (525), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 428 states. [2022-04-15 11:47:17,042 INFO L87 Difference]: Start difference. First operand has 344 states, 339 states have (on average 1.5486725663716814) internal successors, (525), 339 states have internal predecessors, (525), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 428 states. [2022-04-15 11:47:17,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:17,048 INFO L93 Difference]: Finished difference Result 428 states and 644 transitions. [2022-04-15 11:47:17,048 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 644 transitions. [2022-04-15 11:47:17,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:17,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:17,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:17,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:17,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 339 states have (on average 1.5486725663716814) internal successors, (525), 339 states have internal predecessors, (525), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:17,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 529 transitions. [2022-04-15 11:47:17,055 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 529 transitions. Word has length 115 [2022-04-15 11:47:17,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:17,055 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 529 transitions. [2022-04-15 11:47:17,055 INFO L479 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-15 11:47:17,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 529 transitions. [2022-04-15 11:47:17,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 529 edges. 529 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:17,494 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 529 transitions. [2022-04-15 11:47:17,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-15 11:47:17,495 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:17,495 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-04-15 11:47:17,495 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 11:47:17,495 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:17,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:17,495 INFO L85 PathProgramCache]: Analyzing trace with hash -210940913, now seen corresponding path program 1 times [2022-04-15 11:47:17,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:17,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1757084958] [2022-04-15 11:47:17,552 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:47:17,553 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:47:17,553 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:17,553 INFO L85 PathProgramCache]: Analyzing trace with hash -210940913, now seen corresponding path program 2 times [2022-04-15 11:47:17,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:17,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784607419] [2022-04-15 11:47:17,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:17,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:17,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:17,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {71447#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {71440#true} is VALID [2022-04-15 11:47:17,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {71440#true} assume true; {71440#true} is VALID [2022-04-15 11:47:17,712 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {71440#true} {71440#true} #678#return; {71440#true} is VALID [2022-04-15 11:47:17,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {71440#true} call ULTIMATE.init(); {71447#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:47:17,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {71447#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {71440#true} is VALID [2022-04-15 11:47:17,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {71440#true} assume true; {71440#true} is VALID [2022-04-15 11:47:17,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {71440#true} {71440#true} #678#return; {71440#true} is VALID [2022-04-15 11:47:17,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {71440#true} call #t~ret161 := main(); {71440#true} is VALID [2022-04-15 11:47:17,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {71440#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; {71440#true} is VALID [2022-04-15 11:47:17,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {71440#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {71440#true} is VALID [2022-04-15 11:47:17,713 INFO L272 TraceCheckUtils]: 7: Hoare triple {71440#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {71440#true} is VALID [2022-04-15 11:47:17,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {71440#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); {71440#true} is VALID [2022-04-15 11:47:17,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {71440#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; {71440#true} is VALID [2022-04-15 11:47:17,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {71440#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; {71440#true} is VALID [2022-04-15 11:47:17,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {71440#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {71440#true} is VALID [2022-04-15 11:47:17,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {71440#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {71440#true} is VALID [2022-04-15 11:47:17,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {71440#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {71440#true} is VALID [2022-04-15 11:47:17,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {71440#true} assume !false; {71440#true} is VALID [2022-04-15 11:47:17,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {71440#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); {71440#true} is VALID [2022-04-15 11:47:17,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {71440#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {71440#true} is VALID [2022-04-15 11:47:17,714 INFO L290 TraceCheckUtils]: 17: Hoare triple {71440#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {71440#true} is VALID [2022-04-15 11:47:17,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {71440#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {71440#true} is VALID [2022-04-15 11:47:17,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {71440#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {71440#true} is VALID [2022-04-15 11:47:17,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {71440#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {71440#true} is VALID [2022-04-15 11:47:17,714 INFO L290 TraceCheckUtils]: 21: Hoare triple {71440#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {71440#true} is VALID [2022-04-15 11:47:17,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {71440#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {71440#true} is VALID [2022-04-15 11:47:17,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {71440#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {71440#true} is VALID [2022-04-15 11:47:17,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {71440#true} assume 8464 == #t~mem55;havoc #t~mem55; {71440#true} is VALID [2022-04-15 11:47:17,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {71440#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; {71440#true} is VALID [2022-04-15 11:47:17,715 INFO L290 TraceCheckUtils]: 26: Hoare triple {71440#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {71440#true} is VALID [2022-04-15 11:47:17,716 INFO L290 TraceCheckUtils]: 27: Hoare triple {71440#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); {71445#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:17,717 INFO L290 TraceCheckUtils]: 28: Hoare triple {71445#(= 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); {71445#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:17,717 INFO L290 TraceCheckUtils]: 29: Hoare triple {71445#(= 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; {71445#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:17,717 INFO L290 TraceCheckUtils]: 30: Hoare triple {71445#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {71445#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:17,718 INFO L290 TraceCheckUtils]: 31: Hoare triple {71445#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {71445#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:17,718 INFO L290 TraceCheckUtils]: 32: Hoare triple {71445#(= 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); {71445#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:17,718 INFO L290 TraceCheckUtils]: 33: Hoare triple {71445#(= 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); {71445#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:17,719 INFO L290 TraceCheckUtils]: 34: Hoare triple {71445#(= 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); {71445#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:17,719 INFO L290 TraceCheckUtils]: 35: Hoare triple {71445#(= 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); {71445#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:17,720 INFO L290 TraceCheckUtils]: 36: Hoare triple {71445#(= 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); {71446#(= |ssl3_accept_#t~mem51| 8496)} is VALID [2022-04-15 11:47:17,720 INFO L290 TraceCheckUtils]: 37: Hoare triple {71446#(= |ssl3_accept_#t~mem51| 8496)} assume 8195 == #t~mem51;havoc #t~mem51; {71441#false} is VALID [2022-04-15 11:47:17,720 INFO L290 TraceCheckUtils]: 38: Hoare triple {71441#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,720 INFO L290 TraceCheckUtils]: 39: Hoare triple {71441#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {71441#false} is VALID [2022-04-15 11:47:17,720 INFO L290 TraceCheckUtils]: 40: Hoare triple {71441#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,720 INFO L290 TraceCheckUtils]: 41: Hoare triple {71441#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); {71441#false} is VALID [2022-04-15 11:47:17,720 INFO L290 TraceCheckUtils]: 42: Hoare triple {71441#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {71441#false} is VALID [2022-04-15 11:47:17,720 INFO L290 TraceCheckUtils]: 43: Hoare triple {71441#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); {71441#false} is VALID [2022-04-15 11:47:17,720 INFO L290 TraceCheckUtils]: 44: Hoare triple {71441#false} assume 12292 != #t~mem85;havoc #t~mem85; {71441#false} is VALID [2022-04-15 11:47:17,720 INFO L290 TraceCheckUtils]: 45: Hoare triple {71441#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; {71441#false} is VALID [2022-04-15 11:47:17,721 INFO L290 TraceCheckUtils]: 46: Hoare triple {71441#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); {71441#false} is VALID [2022-04-15 11:47:17,721 INFO L290 TraceCheckUtils]: 47: Hoare triple {71441#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {71441#false} is VALID [2022-04-15 11:47:17,721 INFO L290 TraceCheckUtils]: 48: Hoare triple {71441#false} ~skip~0 := 0; {71441#false} is VALID [2022-04-15 11:47:17,721 INFO L290 TraceCheckUtils]: 49: Hoare triple {71441#false} assume !false; {71441#false} is VALID [2022-04-15 11:47:17,721 INFO L290 TraceCheckUtils]: 50: Hoare triple {71441#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); {71441#false} is VALID [2022-04-15 11:47:17,721 INFO L290 TraceCheckUtils]: 51: Hoare triple {71441#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,721 INFO L290 TraceCheckUtils]: 52: Hoare triple {71441#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,721 INFO L290 TraceCheckUtils]: 53: Hoare triple {71441#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,721 INFO L290 TraceCheckUtils]: 54: Hoare triple {71441#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,721 INFO L290 TraceCheckUtils]: 55: Hoare triple {71441#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,721 INFO L290 TraceCheckUtils]: 56: Hoare triple {71441#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,721 INFO L290 TraceCheckUtils]: 57: Hoare triple {71441#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,721 INFO L290 TraceCheckUtils]: 58: Hoare triple {71441#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,721 INFO L290 TraceCheckUtils]: 59: Hoare triple {71441#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,722 INFO L290 TraceCheckUtils]: 60: Hoare triple {71441#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,722 INFO L290 TraceCheckUtils]: 61: Hoare triple {71441#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,722 INFO L290 TraceCheckUtils]: 62: Hoare triple {71441#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,722 INFO L290 TraceCheckUtils]: 63: Hoare triple {71441#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,722 INFO L290 TraceCheckUtils]: 64: Hoare triple {71441#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,722 INFO L290 TraceCheckUtils]: 65: Hoare triple {71441#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,722 INFO L290 TraceCheckUtils]: 66: Hoare triple {71441#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,722 INFO L290 TraceCheckUtils]: 67: Hoare triple {71441#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,722 INFO L290 TraceCheckUtils]: 68: Hoare triple {71441#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,722 INFO L290 TraceCheckUtils]: 69: Hoare triple {71441#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,722 INFO L290 TraceCheckUtils]: 70: Hoare triple {71441#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,722 INFO L290 TraceCheckUtils]: 71: Hoare triple {71441#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,722 INFO L290 TraceCheckUtils]: 72: Hoare triple {71441#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,722 INFO L290 TraceCheckUtils]: 73: Hoare triple {71441#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,723 INFO L290 TraceCheckUtils]: 74: Hoare triple {71441#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,723 INFO L290 TraceCheckUtils]: 75: Hoare triple {71441#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,723 INFO L290 TraceCheckUtils]: 76: Hoare triple {71441#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,723 INFO L290 TraceCheckUtils]: 77: Hoare triple {71441#false} assume 8608 == #t~mem73;havoc #t~mem73; {71441#false} is VALID [2022-04-15 11:47:17,723 INFO L290 TraceCheckUtils]: 78: Hoare triple {71441#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {71441#false} is VALID [2022-04-15 11:47:17,723 INFO L290 TraceCheckUtils]: 79: Hoare triple {71441#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); {71441#false} is VALID [2022-04-15 11:47:17,723 INFO L290 TraceCheckUtils]: 80: Hoare triple {71441#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); {71441#false} is VALID [2022-04-15 11:47:17,723 INFO L290 TraceCheckUtils]: 81: Hoare triple {71441#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {71441#false} is VALID [2022-04-15 11:47:17,723 INFO L290 TraceCheckUtils]: 82: Hoare triple {71441#false} ~skip~0 := 0; {71441#false} is VALID [2022-04-15 11:47:17,723 INFO L290 TraceCheckUtils]: 83: Hoare triple {71441#false} assume !false; {71441#false} is VALID [2022-04-15 11:47:17,723 INFO L290 TraceCheckUtils]: 84: Hoare triple {71441#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); {71441#false} is VALID [2022-04-15 11:47:17,723 INFO L290 TraceCheckUtils]: 85: Hoare triple {71441#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,723 INFO L290 TraceCheckUtils]: 86: Hoare triple {71441#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,723 INFO L290 TraceCheckUtils]: 87: Hoare triple {71441#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,724 INFO L290 TraceCheckUtils]: 88: Hoare triple {71441#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,724 INFO L290 TraceCheckUtils]: 89: Hoare triple {71441#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,724 INFO L290 TraceCheckUtils]: 90: Hoare triple {71441#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,724 INFO L290 TraceCheckUtils]: 91: Hoare triple {71441#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,724 INFO L290 TraceCheckUtils]: 92: Hoare triple {71441#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,724 INFO L290 TraceCheckUtils]: 93: Hoare triple {71441#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,724 INFO L290 TraceCheckUtils]: 94: Hoare triple {71441#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,724 INFO L290 TraceCheckUtils]: 95: Hoare triple {71441#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,724 INFO L290 TraceCheckUtils]: 96: Hoare triple {71441#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,724 INFO L290 TraceCheckUtils]: 97: Hoare triple {71441#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,724 INFO L290 TraceCheckUtils]: 98: Hoare triple {71441#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,724 INFO L290 TraceCheckUtils]: 99: Hoare triple {71441#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,724 INFO L290 TraceCheckUtils]: 100: Hoare triple {71441#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,725 INFO L290 TraceCheckUtils]: 101: Hoare triple {71441#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,725 INFO L290 TraceCheckUtils]: 102: Hoare triple {71441#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,725 INFO L290 TraceCheckUtils]: 103: Hoare triple {71441#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,725 INFO L290 TraceCheckUtils]: 104: Hoare triple {71441#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,725 INFO L290 TraceCheckUtils]: 105: Hoare triple {71441#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,725 INFO L290 TraceCheckUtils]: 106: Hoare triple {71441#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,725 INFO L290 TraceCheckUtils]: 107: Hoare triple {71441#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,725 INFO L290 TraceCheckUtils]: 108: Hoare triple {71441#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,725 INFO L290 TraceCheckUtils]: 109: Hoare triple {71441#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,725 INFO L290 TraceCheckUtils]: 110: Hoare triple {71441#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,725 INFO L290 TraceCheckUtils]: 111: Hoare triple {71441#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,725 INFO L290 TraceCheckUtils]: 112: Hoare triple {71441#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {71441#false} is VALID [2022-04-15 11:47:17,725 INFO L290 TraceCheckUtils]: 113: Hoare triple {71441#false} assume 8640 == #t~mem75;havoc #t~mem75; {71441#false} is VALID [2022-04-15 11:47:17,726 INFO L290 TraceCheckUtils]: 114: Hoare triple {71441#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {71441#false} is VALID [2022-04-15 11:47:17,726 INFO L290 TraceCheckUtils]: 115: Hoare triple {71441#false} assume !(4 == ~blastFlag~0); {71441#false} is VALID [2022-04-15 11:47:17,726 INFO L290 TraceCheckUtils]: 116: Hoare triple {71441#false} assume 7 == ~blastFlag~0; {71441#false} is VALID [2022-04-15 11:47:17,726 INFO L290 TraceCheckUtils]: 117: Hoare triple {71441#false} assume !false; {71441#false} is VALID [2022-04-15 11:47:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-15 11:47:17,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:17,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784607419] [2022-04-15 11:47:17,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784607419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:17,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:17,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:17,727 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:17,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1757084958] [2022-04-15 11:47:17,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1757084958] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:17,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:17,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:17,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227674214] [2022-04-15 11:47:17,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:17,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-15 11:47:17,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:17,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:17,789 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-15 11:47:17,789 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:47:17,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:17,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:47:17,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:47:17,790 INFO L87 Difference]: Start difference. First operand 344 states and 529 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:21,567 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:23,581 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:26,031 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:28,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:28,851 INFO L93 Difference]: Finished difference Result 677 states and 1048 transitions. [2022-04-15 11:47:28,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:47:28,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-15 11:47:28,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:28,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:28,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 457 transitions. [2022-04-15 11:47:28,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:28,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 457 transitions. [2022-04-15 11:47:28,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 457 transitions. [2022-04-15 11:47:29,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 457 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:29,150 INFO L225 Difference]: With dead ends: 677 [2022-04-15 11:47:29,150 INFO L226 Difference]: Without dead ends: 361 [2022-04-15 11:47:29,151 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:47:29,151 INFO L913 BasicCegarLoop]: 194 mSDtfsCounter, 33 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:29,151 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 497 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 383 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2022-04-15 11:47:29,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-04-15 11:47:29,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 344. [2022-04-15 11:47:29,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:29,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 361 states. Second operand has 344 states, 339 states have (on average 1.5457227138643068) internal successors, (524), 339 states have internal predecessors, (524), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:29,171 INFO L74 IsIncluded]: Start isIncluded. First operand 361 states. Second operand has 344 states, 339 states have (on average 1.5457227138643068) internal successors, (524), 339 states have internal predecessors, (524), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:29,172 INFO L87 Difference]: Start difference. First operand 361 states. Second operand has 344 states, 339 states have (on average 1.5457227138643068) internal successors, (524), 339 states have internal predecessors, (524), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:29,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:29,176 INFO L93 Difference]: Finished difference Result 361 states and 550 transitions. [2022-04-15 11:47:29,176 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 550 transitions. [2022-04-15 11:47:29,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:29,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:29,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 339 states have (on average 1.5457227138643068) internal successors, (524), 339 states have internal predecessors, (524), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 361 states. [2022-04-15 11:47:29,177 INFO L87 Difference]: Start difference. First operand has 344 states, 339 states have (on average 1.5457227138643068) internal successors, (524), 339 states have internal predecessors, (524), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 361 states. [2022-04-15 11:47:29,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:29,182 INFO L93 Difference]: Finished difference Result 361 states and 550 transitions. [2022-04-15 11:47:29,182 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 550 transitions. [2022-04-15 11:47:29,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:29,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:29,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:29,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:29,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 339 states have (on average 1.5457227138643068) internal successors, (524), 339 states have internal predecessors, (524), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:29,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 528 transitions. [2022-04-15 11:47:29,188 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 528 transitions. Word has length 118 [2022-04-15 11:47:29,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:29,189 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 528 transitions. [2022-04-15 11:47:29,189 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:29,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 528 transitions. [2022-04-15 11:47:29,626 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-15 11:47:29,626 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 528 transitions. [2022-04-15 11:47:29,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-15 11:47:29,627 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:29,627 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:47:29,627 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 11:47:29,627 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:29,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:29,628 INFO L85 PathProgramCache]: Analyzing trace with hash 425730527, now seen corresponding path program 1 times [2022-04-15 11:47:29,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:29,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1070021481] [2022-04-15 11:47:29,689 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:47:29,689 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:47:29,689 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:29,689 INFO L85 PathProgramCache]: Analyzing trace with hash 425730527, now seen corresponding path program 2 times [2022-04-15 11:47:29,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:29,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101321438] [2022-04-15 11:47:29,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:29,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:29,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:29,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {74223#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {74216#true} is VALID [2022-04-15 11:47:29,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {74216#true} assume true; {74216#true} is VALID [2022-04-15 11:47:29,850 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {74216#true} {74216#true} #678#return; {74216#true} is VALID [2022-04-15 11:47:29,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {74216#true} call ULTIMATE.init(); {74223#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:47:29,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {74223#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {74216#true} is VALID [2022-04-15 11:47:29,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {74216#true} assume true; {74216#true} is VALID [2022-04-15 11:47:29,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74216#true} {74216#true} #678#return; {74216#true} is VALID [2022-04-15 11:47:29,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {74216#true} call #t~ret161 := main(); {74216#true} is VALID [2022-04-15 11:47:29,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {74216#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; {74216#true} is VALID [2022-04-15 11:47:29,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {74216#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {74216#true} is VALID [2022-04-15 11:47:29,852 INFO L272 TraceCheckUtils]: 7: Hoare triple {74216#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {74216#true} is VALID [2022-04-15 11:47:29,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {74216#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); {74216#true} is VALID [2022-04-15 11:47:29,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {74216#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; {74216#true} is VALID [2022-04-15 11:47:29,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {74216#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; {74216#true} is VALID [2022-04-15 11:47:29,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {74216#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {74216#true} is VALID [2022-04-15 11:47:29,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {74216#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {74216#true} is VALID [2022-04-15 11:47:29,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {74216#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {74216#true} is VALID [2022-04-15 11:47:29,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {74216#true} assume !false; {74216#true} is VALID [2022-04-15 11:47:29,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {74216#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); {74216#true} is VALID [2022-04-15 11:47:29,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {74216#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {74216#true} is VALID [2022-04-15 11:47:29,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {74216#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {74216#true} is VALID [2022-04-15 11:47:29,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {74216#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {74216#true} is VALID [2022-04-15 11:47:29,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {74216#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {74216#true} is VALID [2022-04-15 11:47:29,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {74216#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {74216#true} is VALID [2022-04-15 11:47:29,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {74216#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {74216#true} is VALID [2022-04-15 11:47:29,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {74216#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {74216#true} is VALID [2022-04-15 11:47:29,853 INFO L290 TraceCheckUtils]: 23: Hoare triple {74216#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {74216#true} is VALID [2022-04-15 11:47:29,853 INFO L290 TraceCheckUtils]: 24: Hoare triple {74216#true} assume 8464 == #t~mem55;havoc #t~mem55; {74216#true} is VALID [2022-04-15 11:47:29,853 INFO L290 TraceCheckUtils]: 25: Hoare triple {74216#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; {74216#true} is VALID [2022-04-15 11:47:29,853 INFO L290 TraceCheckUtils]: 26: Hoare triple {74216#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {74216#true} is VALID [2022-04-15 11:47:29,854 INFO L290 TraceCheckUtils]: 27: Hoare triple {74216#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); {74221#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:29,855 INFO L290 TraceCheckUtils]: 28: Hoare triple {74221#(not (= 12292 (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); {74221#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:29,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {74221#(not (= 12292 (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; {74221#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:29,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {74221#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {74221#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:29,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {74221#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {74221#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:29,856 INFO L290 TraceCheckUtils]: 32: Hoare triple {74221#(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); {74222#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-15 11:47:29,856 INFO L290 TraceCheckUtils]: 33: Hoare triple {74222#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {74217#false} is VALID [2022-04-15 11:47:29,857 INFO L290 TraceCheckUtils]: 34: Hoare triple {74217#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,857 INFO L290 TraceCheckUtils]: 35: Hoare triple {74217#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,857 INFO L290 TraceCheckUtils]: 36: Hoare triple {74217#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {74217#false} is VALID [2022-04-15 11:47:29,857 INFO L290 TraceCheckUtils]: 37: Hoare triple {74217#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,857 INFO L290 TraceCheckUtils]: 38: Hoare triple {74217#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); {74217#false} is VALID [2022-04-15 11:47:29,857 INFO L290 TraceCheckUtils]: 39: Hoare triple {74217#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {74217#false} is VALID [2022-04-15 11:47:29,857 INFO L290 TraceCheckUtils]: 40: Hoare triple {74217#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); {74217#false} is VALID [2022-04-15 11:47:29,857 INFO L290 TraceCheckUtils]: 41: Hoare triple {74217#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); {74217#false} is VALID [2022-04-15 11:47:29,857 INFO L290 TraceCheckUtils]: 42: Hoare triple {74217#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); {74217#false} is VALID [2022-04-15 11:47:29,857 INFO L290 TraceCheckUtils]: 43: Hoare triple {74217#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74217#false} is VALID [2022-04-15 11:47:29,857 INFO L290 TraceCheckUtils]: 44: Hoare triple {74217#false} ~skip~0 := 0; {74217#false} is VALID [2022-04-15 11:47:29,857 INFO L290 TraceCheckUtils]: 45: Hoare triple {74217#false} assume !false; {74217#false} is VALID [2022-04-15 11:47:29,857 INFO L290 TraceCheckUtils]: 46: Hoare triple {74217#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); {74217#false} is VALID [2022-04-15 11:47:29,857 INFO L290 TraceCheckUtils]: 47: Hoare triple {74217#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,858 INFO L290 TraceCheckUtils]: 48: Hoare triple {74217#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,858 INFO L290 TraceCheckUtils]: 49: Hoare triple {74217#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,858 INFO L290 TraceCheckUtils]: 50: Hoare triple {74217#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,858 INFO L290 TraceCheckUtils]: 51: Hoare triple {74217#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,858 INFO L290 TraceCheckUtils]: 52: Hoare triple {74217#false} assume 8480 == #t~mem52;havoc #t~mem52; {74217#false} is VALID [2022-04-15 11:47:29,858 INFO L290 TraceCheckUtils]: 53: Hoare triple {74217#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; {74217#false} is VALID [2022-04-15 11:47:29,858 INFO L290 TraceCheckUtils]: 54: Hoare triple {74217#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); {74217#false} is VALID [2022-04-15 11:47:29,858 INFO L290 TraceCheckUtils]: 55: Hoare triple {74217#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); {74217#false} is VALID [2022-04-15 11:47:29,858 INFO L290 TraceCheckUtils]: 56: Hoare triple {74217#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74217#false} is VALID [2022-04-15 11:47:29,858 INFO L290 TraceCheckUtils]: 57: Hoare triple {74217#false} ~skip~0 := 0; {74217#false} is VALID [2022-04-15 11:47:29,858 INFO L290 TraceCheckUtils]: 58: Hoare triple {74217#false} assume !false; {74217#false} is VALID [2022-04-15 11:47:29,858 INFO L290 TraceCheckUtils]: 59: Hoare triple {74217#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); {74217#false} is VALID [2022-04-15 11:47:29,858 INFO L290 TraceCheckUtils]: 60: Hoare triple {74217#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,859 INFO L290 TraceCheckUtils]: 61: Hoare triple {74217#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,859 INFO L290 TraceCheckUtils]: 62: Hoare triple {74217#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,859 INFO L290 TraceCheckUtils]: 63: Hoare triple {74217#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,859 INFO L290 TraceCheckUtils]: 64: Hoare triple {74217#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,859 INFO L290 TraceCheckUtils]: 65: Hoare triple {74217#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,859 INFO L290 TraceCheckUtils]: 66: Hoare triple {74217#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,859 INFO L290 TraceCheckUtils]: 67: Hoare triple {74217#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,859 INFO L290 TraceCheckUtils]: 68: Hoare triple {74217#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,859 INFO L290 TraceCheckUtils]: 69: Hoare triple {74217#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,859 INFO L290 TraceCheckUtils]: 70: Hoare triple {74217#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,859 INFO L290 TraceCheckUtils]: 71: Hoare triple {74217#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,859 INFO L290 TraceCheckUtils]: 72: Hoare triple {74217#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,859 INFO L290 TraceCheckUtils]: 73: Hoare triple {74217#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,859 INFO L290 TraceCheckUtils]: 74: Hoare triple {74217#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,860 INFO L290 TraceCheckUtils]: 75: Hoare triple {74217#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,860 INFO L290 TraceCheckUtils]: 76: Hoare triple {74217#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,860 INFO L290 TraceCheckUtils]: 77: Hoare triple {74217#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,860 INFO L290 TraceCheckUtils]: 78: Hoare triple {74217#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,860 INFO L290 TraceCheckUtils]: 79: Hoare triple {74217#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,860 INFO L290 TraceCheckUtils]: 80: Hoare triple {74217#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,860 INFO L290 TraceCheckUtils]: 81: Hoare triple {74217#false} assume 8448 == #t~mem68;havoc #t~mem68; {74217#false} is VALID [2022-04-15 11:47:29,860 INFO L290 TraceCheckUtils]: 82: Hoare triple {74217#false} assume !(~num1~0 > 0); {74217#false} is VALID [2022-04-15 11:47:29,860 INFO L290 TraceCheckUtils]: 83: Hoare triple {74217#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; {74217#false} is VALID [2022-04-15 11:47:29,860 INFO L290 TraceCheckUtils]: 84: Hoare triple {74217#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); {74217#false} is VALID [2022-04-15 11:47:29,860 INFO L290 TraceCheckUtils]: 85: Hoare triple {74217#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74217#false} is VALID [2022-04-15 11:47:29,860 INFO L290 TraceCheckUtils]: 86: Hoare triple {74217#false} ~skip~0 := 0; {74217#false} is VALID [2022-04-15 11:47:29,860 INFO L290 TraceCheckUtils]: 87: Hoare triple {74217#false} assume !false; {74217#false} is VALID [2022-04-15 11:47:29,860 INFO L290 TraceCheckUtils]: 88: Hoare triple {74217#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); {74217#false} is VALID [2022-04-15 11:47:29,860 INFO L290 TraceCheckUtils]: 89: Hoare triple {74217#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,861 INFO L290 TraceCheckUtils]: 90: Hoare triple {74217#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,861 INFO L290 TraceCheckUtils]: 91: Hoare triple {74217#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,861 INFO L290 TraceCheckUtils]: 92: Hoare triple {74217#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,861 INFO L290 TraceCheckUtils]: 93: Hoare triple {74217#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,861 INFO L290 TraceCheckUtils]: 94: Hoare triple {74217#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,861 INFO L290 TraceCheckUtils]: 95: Hoare triple {74217#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,861 INFO L290 TraceCheckUtils]: 96: Hoare triple {74217#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,861 INFO L290 TraceCheckUtils]: 97: Hoare triple {74217#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,861 INFO L290 TraceCheckUtils]: 98: Hoare triple {74217#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,861 INFO L290 TraceCheckUtils]: 99: Hoare triple {74217#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,861 INFO L290 TraceCheckUtils]: 100: Hoare triple {74217#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,861 INFO L290 TraceCheckUtils]: 101: Hoare triple {74217#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,861 INFO L290 TraceCheckUtils]: 102: Hoare triple {74217#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,861 INFO L290 TraceCheckUtils]: 103: Hoare triple {74217#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,862 INFO L290 TraceCheckUtils]: 104: Hoare triple {74217#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,862 INFO L290 TraceCheckUtils]: 105: Hoare triple {74217#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,862 INFO L290 TraceCheckUtils]: 106: Hoare triple {74217#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,862 INFO L290 TraceCheckUtils]: 107: Hoare triple {74217#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,862 INFO L290 TraceCheckUtils]: 108: Hoare triple {74217#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,862 INFO L290 TraceCheckUtils]: 109: Hoare triple {74217#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,862 INFO L290 TraceCheckUtils]: 110: Hoare triple {74217#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,862 INFO L290 TraceCheckUtils]: 111: Hoare triple {74217#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,862 INFO L290 TraceCheckUtils]: 112: Hoare triple {74217#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,862 INFO L290 TraceCheckUtils]: 113: Hoare triple {74217#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,862 INFO L290 TraceCheckUtils]: 114: Hoare triple {74217#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,862 INFO L290 TraceCheckUtils]: 115: Hoare triple {74217#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,862 INFO L290 TraceCheckUtils]: 116: Hoare triple {74217#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {74217#false} is VALID [2022-04-15 11:47:29,862 INFO L290 TraceCheckUtils]: 117: Hoare triple {74217#false} assume 8640 == #t~mem75;havoc #t~mem75; {74217#false} is VALID [2022-04-15 11:47:29,863 INFO L290 TraceCheckUtils]: 118: Hoare triple {74217#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {74217#false} is VALID [2022-04-15 11:47:29,863 INFO L290 TraceCheckUtils]: 119: Hoare triple {74217#false} assume !(4 == ~blastFlag~0); {74217#false} is VALID [2022-04-15 11:47:29,863 INFO L290 TraceCheckUtils]: 120: Hoare triple {74217#false} assume 7 == ~blastFlag~0; {74217#false} is VALID [2022-04-15 11:47:29,863 INFO L290 TraceCheckUtils]: 121: Hoare triple {74217#false} assume !false; {74217#false} is VALID [2022-04-15 11:47:29,863 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-15 11:47:29,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:29,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101321438] [2022-04-15 11:47:29,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101321438] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:29,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:29,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:29,864 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:29,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1070021481] [2022-04-15 11:47:29,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1070021481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:29,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:29,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:29,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786255180] [2022-04-15 11:47:29,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:29,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have 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-15 11:47:29,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:29,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:29,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:29,927 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:47:29,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:29,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:47:29,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:47:29,928 INFO L87 Difference]: Start difference. First operand 344 states and 528 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:31,986 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:35,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:35,023 INFO L93 Difference]: Finished difference Result 734 states and 1127 transitions. [2022-04-15 11:47:35,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:47:35,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have 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-15 11:47:35,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:35,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:35,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2022-04-15 11:47:35,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:35,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2022-04-15 11:47:35,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 575 transitions. [2022-04-15 11:47:35,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 575 edges. 575 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:35,445 INFO L225 Difference]: With dead ends: 734 [2022-04-15 11:47:35,445 INFO L226 Difference]: Without dead ends: 418 [2022-04-15 11:47:35,446 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:47:35,446 INFO L913 BasicCegarLoop]: 115 mSDtfsCounter, 141 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:35,446 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 334 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 465 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-04-15 11:47:35,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-04-15 11:47:35,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 344. [2022-04-15 11:47:35,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:35,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 418 states. Second operand has 344 states, 339 states have (on average 1.528023598820059) internal successors, (518), 339 states have internal predecessors, (518), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:35,460 INFO L74 IsIncluded]: Start isIncluded. First operand 418 states. Second operand has 344 states, 339 states have (on average 1.528023598820059) internal successors, (518), 339 states have internal predecessors, (518), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:35,460 INFO L87 Difference]: Start difference. First operand 418 states. Second operand has 344 states, 339 states have (on average 1.528023598820059) internal successors, (518), 339 states have internal predecessors, (518), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:35,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:35,466 INFO L93 Difference]: Finished difference Result 418 states and 625 transitions. [2022-04-15 11:47:35,466 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 625 transitions. [2022-04-15 11:47:35,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:35,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:35,467 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 339 states have (on average 1.528023598820059) internal successors, (518), 339 states have internal predecessors, (518), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 418 states. [2022-04-15 11:47:35,467 INFO L87 Difference]: Start difference. First operand has 344 states, 339 states have (on average 1.528023598820059) internal successors, (518), 339 states have internal predecessors, (518), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 418 states. [2022-04-15 11:47:35,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:35,474 INFO L93 Difference]: Finished difference Result 418 states and 625 transitions. [2022-04-15 11:47:35,474 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 625 transitions. [2022-04-15 11:47:35,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:35,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:35,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:35,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:35,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 339 states have (on average 1.528023598820059) internal successors, (518), 339 states have internal predecessors, (518), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:35,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 522 transitions. [2022-04-15 11:47:35,480 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 522 transitions. Word has length 122 [2022-04-15 11:47:35,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:35,480 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 522 transitions. [2022-04-15 11:47:35,480 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:35,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 522 transitions. [2022-04-15 11:47:35,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 522 edges. 522 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:35,913 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 522 transitions. [2022-04-15 11:47:35,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-15 11:47:35,913 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:35,913 INFO L499 BasicCegarLoop]: 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, 1] [2022-04-15 11:47:35,913 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 11:47:35,914 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:35,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:35,914 INFO L85 PathProgramCache]: Analyzing trace with hash -2107194313, now seen corresponding path program 1 times [2022-04-15 11:47:35,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:35,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [743301652] [2022-04-15 11:47:35,986 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:47:35,986 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:47:35,986 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:35,986 INFO L85 PathProgramCache]: Analyzing trace with hash -2107194313, now seen corresponding path program 2 times [2022-04-15 11:47:35,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:35,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809043216] [2022-04-15 11:47:35,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:35,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:36,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:36,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {77227#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {77220#true} is VALID [2022-04-15 11:47:36,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {77220#true} assume true; {77220#true} is VALID [2022-04-15 11:47:36,162 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77220#true} {77220#true} #678#return; {77220#true} is VALID [2022-04-15 11:47:36,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {77220#true} call ULTIMATE.init(); {77227#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:47:36,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {77227#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {77220#true} is VALID [2022-04-15 11:47:36,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {77220#true} assume true; {77220#true} is VALID [2022-04-15 11:47:36,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77220#true} {77220#true} #678#return; {77220#true} is VALID [2022-04-15 11:47:36,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {77220#true} call #t~ret161 := main(); {77220#true} is VALID [2022-04-15 11:47:36,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {77220#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; {77220#true} is VALID [2022-04-15 11:47:36,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {77220#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {77220#true} is VALID [2022-04-15 11:47:36,164 INFO L272 TraceCheckUtils]: 7: Hoare triple {77220#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {77220#true} is VALID [2022-04-15 11:47:36,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {77220#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); {77220#true} is VALID [2022-04-15 11:47:36,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {77220#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; {77220#true} is VALID [2022-04-15 11:47:36,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {77220#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; {77220#true} is VALID [2022-04-15 11:47:36,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {77220#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {77220#true} is VALID [2022-04-15 11:47:36,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {77220#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {77220#true} is VALID [2022-04-15 11:47:36,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {77220#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {77220#true} is VALID [2022-04-15 11:47:36,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {77220#true} assume !false; {77220#true} is VALID [2022-04-15 11:47:36,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {77220#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); {77220#true} is VALID [2022-04-15 11:47:36,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {77220#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {77220#true} is VALID [2022-04-15 11:47:36,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {77220#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {77220#true} is VALID [2022-04-15 11:47:36,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {77220#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {77220#true} is VALID [2022-04-15 11:47:36,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {77220#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {77220#true} is VALID [2022-04-15 11:47:36,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {77220#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {77220#true} is VALID [2022-04-15 11:47:36,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {77220#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {77220#true} is VALID [2022-04-15 11:47:36,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {77220#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {77220#true} is VALID [2022-04-15 11:47:36,165 INFO L290 TraceCheckUtils]: 23: Hoare triple {77220#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {77220#true} is VALID [2022-04-15 11:47:36,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {77220#true} assume 8464 == #t~mem55;havoc #t~mem55; {77220#true} is VALID [2022-04-15 11:47:36,165 INFO L290 TraceCheckUtils]: 25: Hoare triple {77220#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; {77220#true} is VALID [2022-04-15 11:47:36,165 INFO L290 TraceCheckUtils]: 26: Hoare triple {77220#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {77220#true} is VALID [2022-04-15 11:47:36,165 INFO L290 TraceCheckUtils]: 27: Hoare triple {77220#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); {77220#true} is VALID [2022-04-15 11:47:36,165 INFO L290 TraceCheckUtils]: 28: Hoare triple {77220#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); {77220#true} is VALID [2022-04-15 11:47:36,165 INFO L290 TraceCheckUtils]: 29: Hoare triple {77220#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {77220#true} is VALID [2022-04-15 11:47:36,165 INFO L290 TraceCheckUtils]: 30: Hoare triple {77220#true} ~skip~0 := 0; {77220#true} is VALID [2022-04-15 11:47:36,165 INFO L290 TraceCheckUtils]: 31: Hoare triple {77220#true} assume !false; {77220#true} is VALID [2022-04-15 11:47:36,176 INFO L290 TraceCheckUtils]: 32: Hoare triple {77220#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); {77220#true} is VALID [2022-04-15 11:47:36,176 INFO L290 TraceCheckUtils]: 33: Hoare triple {77220#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {77220#true} is VALID [2022-04-15 11:47:36,176 INFO L290 TraceCheckUtils]: 34: Hoare triple {77220#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {77220#true} is VALID [2022-04-15 11:47:36,176 INFO L290 TraceCheckUtils]: 35: Hoare triple {77220#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {77220#true} is VALID [2022-04-15 11:47:36,176 INFO L290 TraceCheckUtils]: 36: Hoare triple {77220#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {77220#true} is VALID [2022-04-15 11:47:36,176 INFO L290 TraceCheckUtils]: 37: Hoare triple {77220#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {77220#true} is VALID [2022-04-15 11:47:36,176 INFO L290 TraceCheckUtils]: 38: Hoare triple {77220#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {77220#true} is VALID [2022-04-15 11:47:36,176 INFO L290 TraceCheckUtils]: 39: Hoare triple {77220#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {77220#true} is VALID [2022-04-15 11:47:36,177 INFO L290 TraceCheckUtils]: 40: Hoare triple {77220#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {77220#true} is VALID [2022-04-15 11:47:36,177 INFO L290 TraceCheckUtils]: 41: Hoare triple {77220#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {77220#true} is VALID [2022-04-15 11:47:36,177 INFO L290 TraceCheckUtils]: 42: Hoare triple {77220#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {77220#true} is VALID [2022-04-15 11:47:36,177 INFO L290 TraceCheckUtils]: 43: Hoare triple {77220#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {77220#true} is VALID [2022-04-15 11:47:36,177 INFO L290 TraceCheckUtils]: 44: Hoare triple {77220#true} assume 8496 == #t~mem58;havoc #t~mem58; {77220#true} is VALID [2022-04-15 11:47:36,177 INFO L290 TraceCheckUtils]: 45: Hoare triple {77220#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {77220#true} is VALID [2022-04-15 11:47:36,177 INFO L290 TraceCheckUtils]: 46: Hoare triple {77220#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {77220#true} is VALID [2022-04-15 11:47:36,177 INFO L290 TraceCheckUtils]: 47: Hoare triple {77220#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {77220#true} is VALID [2022-04-15 11:47:36,178 INFO L290 TraceCheckUtils]: 48: Hoare triple {77220#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,179 INFO L290 TraceCheckUtils]: 49: Hoare triple {77225#(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); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,180 INFO L290 TraceCheckUtils]: 50: Hoare triple {77225#(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); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,180 INFO L290 TraceCheckUtils]: 51: Hoare triple {77225#(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; {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,180 INFO L290 TraceCheckUtils]: 52: Hoare triple {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,181 INFO L290 TraceCheckUtils]: 53: Hoare triple {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,181 INFO L290 TraceCheckUtils]: 54: Hoare triple {77225#(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); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,182 INFO L290 TraceCheckUtils]: 55: Hoare triple {77225#(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); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,182 INFO L290 TraceCheckUtils]: 56: Hoare triple {77225#(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); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,182 INFO L290 TraceCheckUtils]: 57: Hoare triple {77225#(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); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,183 INFO L290 TraceCheckUtils]: 58: Hoare triple {77225#(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); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,183 INFO L290 TraceCheckUtils]: 59: Hoare triple {77225#(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); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,183 INFO L290 TraceCheckUtils]: 60: Hoare triple {77225#(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); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,184 INFO L290 TraceCheckUtils]: 61: Hoare triple {77225#(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); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,184 INFO L290 TraceCheckUtils]: 62: Hoare triple {77225#(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); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,184 INFO L290 TraceCheckUtils]: 63: Hoare triple {77225#(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); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,185 INFO L290 TraceCheckUtils]: 64: Hoare triple {77225#(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); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,185 INFO L290 TraceCheckUtils]: 65: Hoare triple {77225#(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); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,186 INFO L290 TraceCheckUtils]: 66: Hoare triple {77225#(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); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,186 INFO L290 TraceCheckUtils]: 67: Hoare triple {77225#(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); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,186 INFO L290 TraceCheckUtils]: 68: Hoare triple {77225#(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); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,187 INFO L290 TraceCheckUtils]: 69: Hoare triple {77225#(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); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,187 INFO L290 TraceCheckUtils]: 70: Hoare triple {77225#(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); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,187 INFO L290 TraceCheckUtils]: 71: Hoare triple {77225#(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); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,188 INFO L290 TraceCheckUtils]: 72: Hoare triple {77225#(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); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,188 INFO L290 TraceCheckUtils]: 73: Hoare triple {77225#(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); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,188 INFO L290 TraceCheckUtils]: 74: Hoare triple {77225#(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); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,189 INFO L290 TraceCheckUtils]: 75: Hoare triple {77225#(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); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,189 INFO L290 TraceCheckUtils]: 76: Hoare triple {77225#(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); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,189 INFO L290 TraceCheckUtils]: 77: Hoare triple {77225#(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); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,190 INFO L290 TraceCheckUtils]: 78: Hoare triple {77225#(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); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,190 INFO L290 TraceCheckUtils]: 79: Hoare triple {77225#(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); {77225#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,191 INFO L290 TraceCheckUtils]: 80: Hoare triple {77225#(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); {77226#(not (= |ssl3_accept_#t~mem73| 8608))} is VALID [2022-04-15 11:47:36,191 INFO L290 TraceCheckUtils]: 81: Hoare triple {77226#(not (= |ssl3_accept_#t~mem73| 8608))} assume 8608 == #t~mem73;havoc #t~mem73; {77221#false} is VALID [2022-04-15 11:47:36,191 INFO L290 TraceCheckUtils]: 82: Hoare triple {77221#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {77221#false} is VALID [2022-04-15 11:47:36,191 INFO L290 TraceCheckUtils]: 83: Hoare triple {77221#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); {77221#false} is VALID [2022-04-15 11:47:36,191 INFO L290 TraceCheckUtils]: 84: Hoare triple {77221#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); {77221#false} is VALID [2022-04-15 11:47:36,191 INFO L290 TraceCheckUtils]: 85: Hoare triple {77221#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {77221#false} is VALID [2022-04-15 11:47:36,191 INFO L290 TraceCheckUtils]: 86: Hoare triple {77221#false} ~skip~0 := 0; {77221#false} is VALID [2022-04-15 11:47:36,191 INFO L290 TraceCheckUtils]: 87: Hoare triple {77221#false} assume !false; {77221#false} is VALID [2022-04-15 11:47:36,191 INFO L290 TraceCheckUtils]: 88: Hoare triple {77221#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); {77221#false} is VALID [2022-04-15 11:47:36,191 INFO L290 TraceCheckUtils]: 89: Hoare triple {77221#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {77221#false} is VALID [2022-04-15 11:47:36,192 INFO L290 TraceCheckUtils]: 90: Hoare triple {77221#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {77221#false} is VALID [2022-04-15 11:47:36,192 INFO L290 TraceCheckUtils]: 91: Hoare triple {77221#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {77221#false} is VALID [2022-04-15 11:47:36,192 INFO L290 TraceCheckUtils]: 92: Hoare triple {77221#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {77221#false} is VALID [2022-04-15 11:47:36,192 INFO L290 TraceCheckUtils]: 93: Hoare triple {77221#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {77221#false} is VALID [2022-04-15 11:47:36,192 INFO L290 TraceCheckUtils]: 94: Hoare triple {77221#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {77221#false} is VALID [2022-04-15 11:47:36,192 INFO L290 TraceCheckUtils]: 95: Hoare triple {77221#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {77221#false} is VALID [2022-04-15 11:47:36,192 INFO L290 TraceCheckUtils]: 96: Hoare triple {77221#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {77221#false} is VALID [2022-04-15 11:47:36,192 INFO L290 TraceCheckUtils]: 97: Hoare triple {77221#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {77221#false} is VALID [2022-04-15 11:47:36,192 INFO L290 TraceCheckUtils]: 98: Hoare triple {77221#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {77221#false} is VALID [2022-04-15 11:47:36,192 INFO L290 TraceCheckUtils]: 99: Hoare triple {77221#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {77221#false} is VALID [2022-04-15 11:47:36,192 INFO L290 TraceCheckUtils]: 100: Hoare triple {77221#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {77221#false} is VALID [2022-04-15 11:47:36,192 INFO L290 TraceCheckUtils]: 101: Hoare triple {77221#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {77221#false} is VALID [2022-04-15 11:47:36,192 INFO L290 TraceCheckUtils]: 102: Hoare triple {77221#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {77221#false} is VALID [2022-04-15 11:47:36,192 INFO L290 TraceCheckUtils]: 103: Hoare triple {77221#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {77221#false} is VALID [2022-04-15 11:47:36,193 INFO L290 TraceCheckUtils]: 104: Hoare triple {77221#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {77221#false} is VALID [2022-04-15 11:47:36,193 INFO L290 TraceCheckUtils]: 105: Hoare triple {77221#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {77221#false} is VALID [2022-04-15 11:47:36,193 INFO L290 TraceCheckUtils]: 106: Hoare triple {77221#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {77221#false} is VALID [2022-04-15 11:47:36,193 INFO L290 TraceCheckUtils]: 107: Hoare triple {77221#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {77221#false} is VALID [2022-04-15 11:47:36,193 INFO L290 TraceCheckUtils]: 108: Hoare triple {77221#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {77221#false} is VALID [2022-04-15 11:47:36,193 INFO L290 TraceCheckUtils]: 109: Hoare triple {77221#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {77221#false} is VALID [2022-04-15 11:47:36,193 INFO L290 TraceCheckUtils]: 110: Hoare triple {77221#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {77221#false} is VALID [2022-04-15 11:47:36,193 INFO L290 TraceCheckUtils]: 111: Hoare triple {77221#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {77221#false} is VALID [2022-04-15 11:47:36,193 INFO L290 TraceCheckUtils]: 112: Hoare triple {77221#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {77221#false} is VALID [2022-04-15 11:47:36,193 INFO L290 TraceCheckUtils]: 113: Hoare triple {77221#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {77221#false} is VALID [2022-04-15 11:47:36,193 INFO L290 TraceCheckUtils]: 114: Hoare triple {77221#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {77221#false} is VALID [2022-04-15 11:47:36,193 INFO L290 TraceCheckUtils]: 115: Hoare triple {77221#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {77221#false} is VALID [2022-04-15 11:47:36,193 INFO L290 TraceCheckUtils]: 116: Hoare triple {77221#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {77221#false} is VALID [2022-04-15 11:47:36,193 INFO L290 TraceCheckUtils]: 117: Hoare triple {77221#false} assume 8640 == #t~mem75;havoc #t~mem75; {77221#false} is VALID [2022-04-15 11:47:36,194 INFO L290 TraceCheckUtils]: 118: Hoare triple {77221#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {77221#false} is VALID [2022-04-15 11:47:36,194 INFO L290 TraceCheckUtils]: 119: Hoare triple {77221#false} assume !(4 == ~blastFlag~0); {77221#false} is VALID [2022-04-15 11:47:36,194 INFO L290 TraceCheckUtils]: 120: Hoare triple {77221#false} assume 7 == ~blastFlag~0; {77221#false} is VALID [2022-04-15 11:47:36,194 INFO L290 TraceCheckUtils]: 121: Hoare triple {77221#false} assume !false; {77221#false} is VALID [2022-04-15 11:47:36,194 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-15 11:47:36,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:36,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809043216] [2022-04-15 11:47:36,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809043216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:36,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:36,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:36,195 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:36,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [743301652] [2022-04-15 11:47:36,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [743301652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:36,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:36,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:36,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160145644] [2022-04-15 11:47:36,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:36,195 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-15 11:47:36,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:36,196 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-15 11:47:36,274 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-15 11:47:36,275 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:47:36,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:36,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:47:36,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:47:36,275 INFO L87 Difference]: Start difference. First operand 344 states and 522 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-15 11:47:40,015 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:43,414 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:45,394 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:49,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:49,688 INFO L93 Difference]: Finished difference Result 774 states and 1180 transitions. [2022-04-15 11:47:49,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:47:49,689 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-15 11:47:49,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:49,689 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-15 11:47:49,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-15 11:47:49,691 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-15 11:47:49,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-15 11:47:49,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 574 transitions. [2022-04-15 11:47:50,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 574 edges. 574 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:50,095 INFO L225 Difference]: With dead ends: 774 [2022-04-15 11:47:50,095 INFO L226 Difference]: Without dead ends: 458 [2022-04-15 11:47:50,095 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:47:50,096 INFO L913 BasicCegarLoop]: 115 mSDtfsCounter, 114 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:50,096 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 334 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-04-15 11:47:50,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-04-15 11:47:50,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 381. [2022-04-15 11:47:50,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:50,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 458 states. Second operand has 381 states, 376 states have (on average 1.5345744680851063) internal successors, (577), 376 states have internal predecessors, (577), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:50,112 INFO L74 IsIncluded]: Start isIncluded. First operand 458 states. Second operand has 381 states, 376 states have (on average 1.5345744680851063) internal successors, (577), 376 states have internal predecessors, (577), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:50,112 INFO L87 Difference]: Start difference. First operand 458 states. Second operand has 381 states, 376 states have (on average 1.5345744680851063) internal successors, (577), 376 states have internal predecessors, (577), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:50,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:50,119 INFO L93 Difference]: Finished difference Result 458 states and 688 transitions. [2022-04-15 11:47:50,119 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 688 transitions. [2022-04-15 11:47:50,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:50,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:50,121 INFO L74 IsIncluded]: Start isIncluded. First operand has 381 states, 376 states have (on average 1.5345744680851063) internal successors, (577), 376 states have internal predecessors, (577), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 458 states. [2022-04-15 11:47:50,121 INFO L87 Difference]: Start difference. First operand has 381 states, 376 states have (on average 1.5345744680851063) internal successors, (577), 376 states have internal predecessors, (577), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 458 states. [2022-04-15 11:47:50,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:50,128 INFO L93 Difference]: Finished difference Result 458 states and 688 transitions. [2022-04-15 11:47:50,128 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 688 transitions. [2022-04-15 11:47:50,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:50,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:50,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:50,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:50,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 376 states have (on average 1.5345744680851063) internal successors, (577), 376 states have internal predecessors, (577), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:50,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 581 transitions. [2022-04-15 11:47:50,136 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 581 transitions. Word has length 122 [2022-04-15 11:47:50,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:50,136 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 581 transitions. [2022-04-15 11:47:50,136 INFO L479 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-15 11:47:50,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 381 states and 581 transitions. [2022-04-15 11:47:50,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 581 edges. 581 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:50,646 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 581 transitions. [2022-04-15 11:47:50,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-15 11:47:50,646 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:50,647 INFO L499 BasicCegarLoop]: 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, 1] [2022-04-15 11:47:50,647 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 11:47:50,647 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:50,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:50,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1920434487, now seen corresponding path program 1 times [2022-04-15 11:47:50,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:50,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1539097192] [2022-04-15 11:47:50,708 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:47:50,708 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:47:50,708 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:50,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1920434487, now seen corresponding path program 2 times [2022-04-15 11:47:50,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:50,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379750799] [2022-04-15 11:47:50,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:50,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:50,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:50,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {80465#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {80458#true} is VALID [2022-04-15 11:47:50,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {80458#true} assume true; {80458#true} is VALID [2022-04-15 11:47:50,871 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80458#true} {80458#true} #678#return; {80458#true} is VALID [2022-04-15 11:47:50,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {80458#true} call ULTIMATE.init(); {80465#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:47:50,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {80465#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {80458#true} is VALID [2022-04-15 11:47:50,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {80458#true} assume true; {80458#true} is VALID [2022-04-15 11:47:50,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80458#true} {80458#true} #678#return; {80458#true} is VALID [2022-04-15 11:47:50,872 INFO L272 TraceCheckUtils]: 4: Hoare triple {80458#true} call #t~ret161 := main(); {80458#true} is VALID [2022-04-15 11:47:50,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {80458#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; {80458#true} is VALID [2022-04-15 11:47:50,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {80458#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {80458#true} is VALID [2022-04-15 11:47:50,872 INFO L272 TraceCheckUtils]: 7: Hoare triple {80458#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {80458#true} is VALID [2022-04-15 11:47:50,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {80458#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); {80458#true} is VALID [2022-04-15 11:47:50,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {80458#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; {80458#true} is VALID [2022-04-15 11:47:50,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {80458#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; {80458#true} is VALID [2022-04-15 11:47:50,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {80458#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {80458#true} is VALID [2022-04-15 11:47:50,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {80458#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {80458#true} is VALID [2022-04-15 11:47:50,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {80458#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {80458#true} is VALID [2022-04-15 11:47:50,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {80458#true} assume !false; {80458#true} is VALID [2022-04-15 11:47:50,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {80458#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); {80458#true} is VALID [2022-04-15 11:47:50,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {80458#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {80458#true} is VALID [2022-04-15 11:47:50,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {80458#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {80458#true} is VALID [2022-04-15 11:47:50,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {80458#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {80458#true} is VALID [2022-04-15 11:47:50,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {80458#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {80458#true} is VALID [2022-04-15 11:47:50,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {80458#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {80458#true} is VALID [2022-04-15 11:47:50,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {80458#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {80458#true} is VALID [2022-04-15 11:47:50,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {80458#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {80458#true} is VALID [2022-04-15 11:47:50,874 INFO L290 TraceCheckUtils]: 23: Hoare triple {80458#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {80458#true} is VALID [2022-04-15 11:47:50,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {80458#true} assume 8464 == #t~mem55;havoc #t~mem55; {80458#true} is VALID [2022-04-15 11:47:50,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {80458#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; {80458#true} is VALID [2022-04-15 11:47:50,874 INFO L290 TraceCheckUtils]: 26: Hoare triple {80458#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {80458#true} is VALID [2022-04-15 11:47:50,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {80458#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); {80458#true} is VALID [2022-04-15 11:47:50,874 INFO L290 TraceCheckUtils]: 28: Hoare triple {80458#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); {80458#true} is VALID [2022-04-15 11:47:50,874 INFO L290 TraceCheckUtils]: 29: Hoare triple {80458#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {80458#true} is VALID [2022-04-15 11:47:50,874 INFO L290 TraceCheckUtils]: 30: Hoare triple {80458#true} ~skip~0 := 0; {80458#true} is VALID [2022-04-15 11:47:50,874 INFO L290 TraceCheckUtils]: 31: Hoare triple {80458#true} assume !false; {80458#true} is VALID [2022-04-15 11:47:50,874 INFO L290 TraceCheckUtils]: 32: Hoare triple {80458#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); {80458#true} is VALID [2022-04-15 11:47:50,874 INFO L290 TraceCheckUtils]: 33: Hoare triple {80458#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {80458#true} is VALID [2022-04-15 11:47:50,874 INFO L290 TraceCheckUtils]: 34: Hoare triple {80458#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {80458#true} is VALID [2022-04-15 11:47:50,874 INFO L290 TraceCheckUtils]: 35: Hoare triple {80458#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {80458#true} is VALID [2022-04-15 11:47:50,874 INFO L290 TraceCheckUtils]: 36: Hoare triple {80458#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {80458#true} is VALID [2022-04-15 11:47:50,875 INFO L290 TraceCheckUtils]: 37: Hoare triple {80458#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {80458#true} is VALID [2022-04-15 11:47:50,875 INFO L290 TraceCheckUtils]: 38: Hoare triple {80458#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {80458#true} is VALID [2022-04-15 11:47:50,875 INFO L290 TraceCheckUtils]: 39: Hoare triple {80458#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {80458#true} is VALID [2022-04-15 11:47:50,875 INFO L290 TraceCheckUtils]: 40: Hoare triple {80458#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {80458#true} is VALID [2022-04-15 11:47:50,875 INFO L290 TraceCheckUtils]: 41: Hoare triple {80458#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {80458#true} is VALID [2022-04-15 11:47:50,875 INFO L290 TraceCheckUtils]: 42: Hoare triple {80458#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {80458#true} is VALID [2022-04-15 11:47:50,875 INFO L290 TraceCheckUtils]: 43: Hoare triple {80458#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {80458#true} is VALID [2022-04-15 11:47:50,875 INFO L290 TraceCheckUtils]: 44: Hoare triple {80458#true} assume 8496 == #t~mem58;havoc #t~mem58; {80458#true} is VALID [2022-04-15 11:47:50,875 INFO L290 TraceCheckUtils]: 45: Hoare triple {80458#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {80458#true} is VALID [2022-04-15 11:47:50,875 INFO L290 TraceCheckUtils]: 46: Hoare triple {80458#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {80458#true} is VALID [2022-04-15 11:47:50,875 INFO L290 TraceCheckUtils]: 47: Hoare triple {80458#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {80458#true} is VALID [2022-04-15 11:47:50,876 INFO L290 TraceCheckUtils]: 48: Hoare triple {80458#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,877 INFO L290 TraceCheckUtils]: 49: Hoare triple {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,877 INFO L290 TraceCheckUtils]: 50: Hoare triple {80463#(= 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); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,878 INFO L290 TraceCheckUtils]: 51: Hoare triple {80463#(= 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; {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,878 INFO L290 TraceCheckUtils]: 52: Hoare triple {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,878 INFO L290 TraceCheckUtils]: 53: Hoare triple {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,879 INFO L290 TraceCheckUtils]: 54: Hoare triple {80463#(= 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); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,879 INFO L290 TraceCheckUtils]: 55: Hoare triple {80463#(= 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); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,879 INFO L290 TraceCheckUtils]: 56: Hoare triple {80463#(= 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); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,880 INFO L290 TraceCheckUtils]: 57: Hoare triple {80463#(= 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); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,880 INFO L290 TraceCheckUtils]: 58: Hoare triple {80463#(= 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); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,881 INFO L290 TraceCheckUtils]: 59: Hoare triple {80463#(= 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); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,881 INFO L290 TraceCheckUtils]: 60: Hoare triple {80463#(= 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); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,881 INFO L290 TraceCheckUtils]: 61: Hoare triple {80463#(= 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); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,882 INFO L290 TraceCheckUtils]: 62: Hoare triple {80463#(= 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); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,882 INFO L290 TraceCheckUtils]: 63: Hoare triple {80463#(= 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); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,882 INFO L290 TraceCheckUtils]: 64: Hoare triple {80463#(= 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); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,883 INFO L290 TraceCheckUtils]: 65: Hoare triple {80463#(= 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); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,883 INFO L290 TraceCheckUtils]: 66: Hoare triple {80463#(= 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); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,883 INFO L290 TraceCheckUtils]: 67: Hoare triple {80463#(= 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); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,884 INFO L290 TraceCheckUtils]: 68: Hoare triple {80463#(= 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); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,884 INFO L290 TraceCheckUtils]: 69: Hoare triple {80463#(= 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); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,884 INFO L290 TraceCheckUtils]: 70: Hoare triple {80463#(= 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); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,885 INFO L290 TraceCheckUtils]: 71: Hoare triple {80463#(= 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); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,885 INFO L290 TraceCheckUtils]: 72: Hoare triple {80463#(= 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); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,885 INFO L290 TraceCheckUtils]: 73: Hoare triple {80463#(= 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); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,886 INFO L290 TraceCheckUtils]: 74: Hoare triple {80463#(= 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); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,886 INFO L290 TraceCheckUtils]: 75: Hoare triple {80463#(= 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); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,887 INFO L290 TraceCheckUtils]: 76: Hoare triple {80463#(= 8656 (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); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,887 INFO L290 TraceCheckUtils]: 77: Hoare triple {80463#(= 8656 (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); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,887 INFO L290 TraceCheckUtils]: 78: Hoare triple {80463#(= 8656 (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); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,888 INFO L290 TraceCheckUtils]: 79: Hoare triple {80463#(= 8656 (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); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,888 INFO L290 TraceCheckUtils]: 80: Hoare triple {80463#(= 8656 (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); {80463#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:50,888 INFO L290 TraceCheckUtils]: 81: Hoare triple {80463#(= 8656 (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); {80464#(= |ssl3_accept_#t~mem74| 8656)} is VALID [2022-04-15 11:47:50,889 INFO L290 TraceCheckUtils]: 82: Hoare triple {80464#(= |ssl3_accept_#t~mem74| 8656)} assume 8609 == #t~mem74;havoc #t~mem74; {80459#false} is VALID [2022-04-15 11:47:50,889 INFO L290 TraceCheckUtils]: 83: Hoare triple {80459#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {80459#false} is VALID [2022-04-15 11:47:50,889 INFO L290 TraceCheckUtils]: 84: Hoare triple {80459#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); {80459#false} is VALID [2022-04-15 11:47:50,889 INFO L290 TraceCheckUtils]: 85: Hoare triple {80459#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); {80459#false} is VALID [2022-04-15 11:47:50,889 INFO L290 TraceCheckUtils]: 86: Hoare triple {80459#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {80459#false} is VALID [2022-04-15 11:47:50,889 INFO L290 TraceCheckUtils]: 87: Hoare triple {80459#false} ~skip~0 := 0; {80459#false} is VALID [2022-04-15 11:47:50,889 INFO L290 TraceCheckUtils]: 88: Hoare triple {80459#false} assume !false; {80459#false} is VALID [2022-04-15 11:47:50,889 INFO L290 TraceCheckUtils]: 89: Hoare triple {80459#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); {80459#false} is VALID [2022-04-15 11:47:50,889 INFO L290 TraceCheckUtils]: 90: Hoare triple {80459#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {80459#false} is VALID [2022-04-15 11:47:50,889 INFO L290 TraceCheckUtils]: 91: Hoare triple {80459#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {80459#false} is VALID [2022-04-15 11:47:50,889 INFO L290 TraceCheckUtils]: 92: Hoare triple {80459#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {80459#false} is VALID [2022-04-15 11:47:50,890 INFO L290 TraceCheckUtils]: 93: Hoare triple {80459#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {80459#false} is VALID [2022-04-15 11:47:50,890 INFO L290 TraceCheckUtils]: 94: Hoare triple {80459#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {80459#false} is VALID [2022-04-15 11:47:50,890 INFO L290 TraceCheckUtils]: 95: Hoare triple {80459#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {80459#false} is VALID [2022-04-15 11:47:50,890 INFO L290 TraceCheckUtils]: 96: Hoare triple {80459#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {80459#false} is VALID [2022-04-15 11:47:50,890 INFO L290 TraceCheckUtils]: 97: Hoare triple {80459#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {80459#false} is VALID [2022-04-15 11:47:50,890 INFO L290 TraceCheckUtils]: 98: Hoare triple {80459#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {80459#false} is VALID [2022-04-15 11:47:50,890 INFO L290 TraceCheckUtils]: 99: Hoare triple {80459#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {80459#false} is VALID [2022-04-15 11:47:50,890 INFO L290 TraceCheckUtils]: 100: Hoare triple {80459#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {80459#false} is VALID [2022-04-15 11:47:50,890 INFO L290 TraceCheckUtils]: 101: Hoare triple {80459#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {80459#false} is VALID [2022-04-15 11:47:50,890 INFO L290 TraceCheckUtils]: 102: Hoare triple {80459#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {80459#false} is VALID [2022-04-15 11:47:50,890 INFO L290 TraceCheckUtils]: 103: Hoare triple {80459#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {80459#false} is VALID [2022-04-15 11:47:50,890 INFO L290 TraceCheckUtils]: 104: Hoare triple {80459#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {80459#false} is VALID [2022-04-15 11:47:50,890 INFO L290 TraceCheckUtils]: 105: Hoare triple {80459#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {80459#false} is VALID [2022-04-15 11:47:50,890 INFO L290 TraceCheckUtils]: 106: Hoare triple {80459#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {80459#false} is VALID [2022-04-15 11:47:50,891 INFO L290 TraceCheckUtils]: 107: Hoare triple {80459#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {80459#false} is VALID [2022-04-15 11:47:50,891 INFO L290 TraceCheckUtils]: 108: Hoare triple {80459#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {80459#false} is VALID [2022-04-15 11:47:50,891 INFO L290 TraceCheckUtils]: 109: Hoare triple {80459#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {80459#false} is VALID [2022-04-15 11:47:50,891 INFO L290 TraceCheckUtils]: 110: Hoare triple {80459#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {80459#false} is VALID [2022-04-15 11:47:50,891 INFO L290 TraceCheckUtils]: 111: Hoare triple {80459#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {80459#false} is VALID [2022-04-15 11:47:50,891 INFO L290 TraceCheckUtils]: 112: Hoare triple {80459#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {80459#false} is VALID [2022-04-15 11:47:50,891 INFO L290 TraceCheckUtils]: 113: Hoare triple {80459#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {80459#false} is VALID [2022-04-15 11:47:50,891 INFO L290 TraceCheckUtils]: 114: Hoare triple {80459#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {80459#false} is VALID [2022-04-15 11:47:50,891 INFO L290 TraceCheckUtils]: 115: Hoare triple {80459#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {80459#false} is VALID [2022-04-15 11:47:50,891 INFO L290 TraceCheckUtils]: 116: Hoare triple {80459#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {80459#false} is VALID [2022-04-15 11:47:50,891 INFO L290 TraceCheckUtils]: 117: Hoare triple {80459#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {80459#false} is VALID [2022-04-15 11:47:50,891 INFO L290 TraceCheckUtils]: 118: Hoare triple {80459#false} assume 8640 == #t~mem75;havoc #t~mem75; {80459#false} is VALID [2022-04-15 11:47:50,891 INFO L290 TraceCheckUtils]: 119: Hoare triple {80459#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {80459#false} is VALID [2022-04-15 11:47:50,891 INFO L290 TraceCheckUtils]: 120: Hoare triple {80459#false} assume !(4 == ~blastFlag~0); {80459#false} is VALID [2022-04-15 11:47:50,892 INFO L290 TraceCheckUtils]: 121: Hoare triple {80459#false} assume 7 == ~blastFlag~0; {80459#false} is VALID [2022-04-15 11:47:50,892 INFO L290 TraceCheckUtils]: 122: Hoare triple {80459#false} assume !false; {80459#false} is VALID [2022-04-15 11:47:50,892 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-15 11:47:50,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:50,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379750799] [2022-04-15 11:47:50,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379750799] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:50,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:50,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:50,893 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:50,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1539097192] [2022-04-15 11:47:50,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1539097192] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:50,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:50,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:50,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587216354] [2022-04-15 11:47:50,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:50,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-15 11:47:50,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:50,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:50,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:50,975 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:47:50,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:50,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:47:50,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:47:50,975 INFO L87 Difference]: Start difference. First operand 381 states and 581 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:57,759 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:04,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:04,042 INFO L93 Difference]: Finished difference Result 824 states and 1263 transitions. [2022-04-15 11:48:04,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:48:04,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-15 11:48:04,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:04,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:04,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 536 transitions. [2022-04-15 11:48:04,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:04,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 536 transitions. [2022-04-15 11:48:04,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 536 transitions. [2022-04-15 11:48:04,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 536 edges. 536 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:04,395 INFO L225 Difference]: With dead ends: 824 [2022-04-15 11:48:04,395 INFO L226 Difference]: Without dead ends: 471 [2022-04-15 11:48:04,396 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:48:04,396 INFO L913 BasicCegarLoop]: 176 mSDtfsCounter, 74 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:04,396 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 463 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-04-15 11:48:04,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2022-04-15 11:48:04,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 421. [2022-04-15 11:48:04,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:04,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 471 states. Second operand has 421 states, 416 states have (on average 1.5384615384615385) internal successors, (640), 416 states have internal predecessors, (640), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:04,414 INFO L74 IsIncluded]: Start isIncluded. First operand 471 states. Second operand has 421 states, 416 states have (on average 1.5384615384615385) internal successors, (640), 416 states have internal predecessors, (640), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:04,415 INFO L87 Difference]: Start difference. First operand 471 states. Second operand has 421 states, 416 states have (on average 1.5384615384615385) internal successors, (640), 416 states have internal predecessors, (640), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:04,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:04,422 INFO L93 Difference]: Finished difference Result 471 states and 713 transitions. [2022-04-15 11:48:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 713 transitions. [2022-04-15 11:48:04,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:04,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:04,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 421 states, 416 states have (on average 1.5384615384615385) internal successors, (640), 416 states have internal predecessors, (640), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 471 states. [2022-04-15 11:48:04,423 INFO L87 Difference]: Start difference. First operand has 421 states, 416 states have (on average 1.5384615384615385) internal successors, (640), 416 states have internal predecessors, (640), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 471 states. [2022-04-15 11:48:04,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:04,431 INFO L93 Difference]: Finished difference Result 471 states and 713 transitions. [2022-04-15 11:48:04,431 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 713 transitions. [2022-04-15 11:48:04,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:04,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:04,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:04,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:04,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.5384615384615385) internal successors, (640), 416 states have internal predecessors, (640), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:04,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 644 transitions. [2022-04-15 11:48:04,440 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 644 transitions. Word has length 123 [2022-04-15 11:48:04,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:04,440 INFO L478 AbstractCegarLoop]: Abstraction has 421 states and 644 transitions. [2022-04-15 11:48:04,440 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:04,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 421 states and 644 transitions. [2022-04-15 11:48:04,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 644 edges. 644 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:04,977 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 644 transitions. [2022-04-15 11:48:04,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-15 11:48:04,978 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:04,978 INFO L499 BasicCegarLoop]: 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, 1] [2022-04-15 11:48:04,978 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 11:48:04,978 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:04,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:04,979 INFO L85 PathProgramCache]: Analyzing trace with hash -640428359, now seen corresponding path program 1 times [2022-04-15 11:48:04,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:04,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1715468629] [2022-04-15 11:48:05,035 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:48:05,035 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:48:05,035 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:48:05,035 INFO L85 PathProgramCache]: Analyzing trace with hash -640428359, now seen corresponding path program 2 times [2022-04-15 11:48:05,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:05,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381479212] [2022-04-15 11:48:05,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:05,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:05,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:05,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {83909#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {83902#true} is VALID [2022-04-15 11:48:05,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {83902#true} assume true; {83902#true} is VALID [2022-04-15 11:48:05,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83902#true} {83902#true} #678#return; {83902#true} is VALID [2022-04-15 11:48:05,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {83902#true} call ULTIMATE.init(); {83909#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:48:05,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {83909#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {83902#true} is VALID [2022-04-15 11:48:05,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {83902#true} assume true; {83902#true} is VALID [2022-04-15 11:48:05,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83902#true} {83902#true} #678#return; {83902#true} is VALID [2022-04-15 11:48:05,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {83902#true} call #t~ret161 := main(); {83902#true} is VALID [2022-04-15 11:48:05,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {83902#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; {83902#true} is VALID [2022-04-15 11:48:05,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {83902#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {83902#true} is VALID [2022-04-15 11:48:05,193 INFO L272 TraceCheckUtils]: 7: Hoare triple {83902#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {83902#true} is VALID [2022-04-15 11:48:05,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {83902#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); {83902#true} is VALID [2022-04-15 11:48:05,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {83902#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; {83902#true} is VALID [2022-04-15 11:48:05,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {83902#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; {83902#true} is VALID [2022-04-15 11:48:05,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {83902#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {83902#true} is VALID [2022-04-15 11:48:05,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {83902#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {83902#true} is VALID [2022-04-15 11:48:05,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {83902#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {83902#true} is VALID [2022-04-15 11:48:05,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {83902#true} assume !false; {83902#true} is VALID [2022-04-15 11:48:05,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {83902#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); {83902#true} is VALID [2022-04-15 11:48:05,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {83902#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {83902#true} is VALID [2022-04-15 11:48:05,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {83902#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {83902#true} is VALID [2022-04-15 11:48:05,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {83902#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {83902#true} is VALID [2022-04-15 11:48:05,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {83902#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {83902#true} is VALID [2022-04-15 11:48:05,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {83902#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {83902#true} is VALID [2022-04-15 11:48:05,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {83902#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {83902#true} is VALID [2022-04-15 11:48:05,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {83902#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {83902#true} is VALID [2022-04-15 11:48:05,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {83902#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {83902#true} is VALID [2022-04-15 11:48:05,194 INFO L290 TraceCheckUtils]: 24: Hoare triple {83902#true} assume 8464 == #t~mem55;havoc #t~mem55; {83902#true} is VALID [2022-04-15 11:48:05,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {83902#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; {83902#true} is VALID [2022-04-15 11:48:05,195 INFO L290 TraceCheckUtils]: 26: Hoare triple {83902#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {83902#true} is VALID [2022-04-15 11:48:05,195 INFO L290 TraceCheckUtils]: 27: Hoare triple {83902#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); {83902#true} is VALID [2022-04-15 11:48:05,195 INFO L290 TraceCheckUtils]: 28: Hoare triple {83902#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); {83902#true} is VALID [2022-04-15 11:48:05,195 INFO L290 TraceCheckUtils]: 29: Hoare triple {83902#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {83902#true} is VALID [2022-04-15 11:48:05,195 INFO L290 TraceCheckUtils]: 30: Hoare triple {83902#true} ~skip~0 := 0; {83902#true} is VALID [2022-04-15 11:48:05,195 INFO L290 TraceCheckUtils]: 31: Hoare triple {83902#true} assume !false; {83902#true} is VALID [2022-04-15 11:48:05,195 INFO L290 TraceCheckUtils]: 32: Hoare triple {83902#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); {83902#true} is VALID [2022-04-15 11:48:05,195 INFO L290 TraceCheckUtils]: 33: Hoare triple {83902#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {83902#true} is VALID [2022-04-15 11:48:05,195 INFO L290 TraceCheckUtils]: 34: Hoare triple {83902#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {83902#true} is VALID [2022-04-15 11:48:05,195 INFO L290 TraceCheckUtils]: 35: Hoare triple {83902#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {83902#true} is VALID [2022-04-15 11:48:05,195 INFO L290 TraceCheckUtils]: 36: Hoare triple {83902#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {83902#true} is VALID [2022-04-15 11:48:05,195 INFO L290 TraceCheckUtils]: 37: Hoare triple {83902#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {83902#true} is VALID [2022-04-15 11:48:05,195 INFO L290 TraceCheckUtils]: 38: Hoare triple {83902#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {83902#true} is VALID [2022-04-15 11:48:05,195 INFO L290 TraceCheckUtils]: 39: Hoare triple {83902#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {83902#true} is VALID [2022-04-15 11:48:05,196 INFO L290 TraceCheckUtils]: 40: Hoare triple {83902#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {83902#true} is VALID [2022-04-15 11:48:05,196 INFO L290 TraceCheckUtils]: 41: Hoare triple {83902#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {83902#true} is VALID [2022-04-15 11:48:05,196 INFO L290 TraceCheckUtils]: 42: Hoare triple {83902#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {83902#true} is VALID [2022-04-15 11:48:05,196 INFO L290 TraceCheckUtils]: 43: Hoare triple {83902#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {83902#true} is VALID [2022-04-15 11:48:05,196 INFO L290 TraceCheckUtils]: 44: Hoare triple {83902#true} assume 8496 == #t~mem58;havoc #t~mem58; {83902#true} is VALID [2022-04-15 11:48:05,196 INFO L290 TraceCheckUtils]: 45: Hoare triple {83902#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {83902#true} is VALID [2022-04-15 11:48:05,196 INFO L290 TraceCheckUtils]: 46: Hoare triple {83902#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {83902#true} is VALID [2022-04-15 11:48:05,196 INFO L290 TraceCheckUtils]: 47: Hoare triple {83902#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {83902#true} is VALID [2022-04-15 11:48:05,197 INFO L290 TraceCheckUtils]: 48: Hoare triple {83902#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,198 INFO L290 TraceCheckUtils]: 49: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,198 INFO L290 TraceCheckUtils]: 50: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,198 INFO L290 TraceCheckUtils]: 51: Hoare triple {83907#(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; {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,199 INFO L290 TraceCheckUtils]: 52: Hoare triple {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} ~skip~0 := 0; {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,199 INFO L290 TraceCheckUtils]: 53: Hoare triple {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !false; {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,199 INFO L290 TraceCheckUtils]: 54: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,200 INFO L290 TraceCheckUtils]: 55: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,200 INFO L290 TraceCheckUtils]: 56: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,200 INFO L290 TraceCheckUtils]: 57: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,201 INFO L290 TraceCheckUtils]: 58: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,201 INFO L290 TraceCheckUtils]: 59: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,201 INFO L290 TraceCheckUtils]: 60: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,202 INFO L290 TraceCheckUtils]: 61: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,202 INFO L290 TraceCheckUtils]: 62: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,202 INFO L290 TraceCheckUtils]: 63: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,203 INFO L290 TraceCheckUtils]: 64: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,203 INFO L290 TraceCheckUtils]: 65: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,203 INFO L290 TraceCheckUtils]: 66: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,204 INFO L290 TraceCheckUtils]: 67: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,204 INFO L290 TraceCheckUtils]: 68: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,205 INFO L290 TraceCheckUtils]: 69: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,205 INFO L290 TraceCheckUtils]: 70: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,205 INFO L290 TraceCheckUtils]: 71: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,206 INFO L290 TraceCheckUtils]: 72: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,206 INFO L290 TraceCheckUtils]: 73: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,206 INFO L290 TraceCheckUtils]: 74: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,207 INFO L290 TraceCheckUtils]: 75: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,207 INFO L290 TraceCheckUtils]: 76: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,207 INFO L290 TraceCheckUtils]: 77: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,208 INFO L290 TraceCheckUtils]: 78: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,208 INFO L290 TraceCheckUtils]: 79: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,208 INFO L290 TraceCheckUtils]: 80: Hoare triple {83907#(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); {83907#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:48:05,209 INFO L290 TraceCheckUtils]: 81: Hoare triple {83907#(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); {83908#(not (= |ssl3_accept_#t~mem74| 8609))} is VALID [2022-04-15 11:48:05,209 INFO L290 TraceCheckUtils]: 82: Hoare triple {83908#(not (= |ssl3_accept_#t~mem74| 8609))} assume 8609 == #t~mem74;havoc #t~mem74; {83903#false} is VALID [2022-04-15 11:48:05,209 INFO L290 TraceCheckUtils]: 83: Hoare triple {83903#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {83903#false} is VALID [2022-04-15 11:48:05,209 INFO L290 TraceCheckUtils]: 84: Hoare triple {83903#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); {83903#false} is VALID [2022-04-15 11:48:05,209 INFO L290 TraceCheckUtils]: 85: Hoare triple {83903#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); {83903#false} is VALID [2022-04-15 11:48:05,209 INFO L290 TraceCheckUtils]: 86: Hoare triple {83903#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {83903#false} is VALID [2022-04-15 11:48:05,209 INFO L290 TraceCheckUtils]: 87: Hoare triple {83903#false} ~skip~0 := 0; {83903#false} is VALID [2022-04-15 11:48:05,209 INFO L290 TraceCheckUtils]: 88: Hoare triple {83903#false} assume !false; {83903#false} is VALID [2022-04-15 11:48:05,209 INFO L290 TraceCheckUtils]: 89: Hoare triple {83903#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); {83903#false} is VALID [2022-04-15 11:48:05,210 INFO L290 TraceCheckUtils]: 90: Hoare triple {83903#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {83903#false} is VALID [2022-04-15 11:48:05,210 INFO L290 TraceCheckUtils]: 91: Hoare triple {83903#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {83903#false} is VALID [2022-04-15 11:48:05,210 INFO L290 TraceCheckUtils]: 92: Hoare triple {83903#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {83903#false} is VALID [2022-04-15 11:48:05,210 INFO L290 TraceCheckUtils]: 93: Hoare triple {83903#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {83903#false} is VALID [2022-04-15 11:48:05,210 INFO L290 TraceCheckUtils]: 94: Hoare triple {83903#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {83903#false} is VALID [2022-04-15 11:48:05,210 INFO L290 TraceCheckUtils]: 95: Hoare triple {83903#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {83903#false} is VALID [2022-04-15 11:48:05,210 INFO L290 TraceCheckUtils]: 96: Hoare triple {83903#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {83903#false} is VALID [2022-04-15 11:48:05,210 INFO L290 TraceCheckUtils]: 97: Hoare triple {83903#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {83903#false} is VALID [2022-04-15 11:48:05,210 INFO L290 TraceCheckUtils]: 98: Hoare triple {83903#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {83903#false} is VALID [2022-04-15 11:48:05,210 INFO L290 TraceCheckUtils]: 99: Hoare triple {83903#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {83903#false} is VALID [2022-04-15 11:48:05,210 INFO L290 TraceCheckUtils]: 100: Hoare triple {83903#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {83903#false} is VALID [2022-04-15 11:48:05,210 INFO L290 TraceCheckUtils]: 101: Hoare triple {83903#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {83903#false} is VALID [2022-04-15 11:48:05,210 INFO L290 TraceCheckUtils]: 102: Hoare triple {83903#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {83903#false} is VALID [2022-04-15 11:48:05,210 INFO L290 TraceCheckUtils]: 103: Hoare triple {83903#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {83903#false} is VALID [2022-04-15 11:48:05,211 INFO L290 TraceCheckUtils]: 104: Hoare triple {83903#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {83903#false} is VALID [2022-04-15 11:48:05,211 INFO L290 TraceCheckUtils]: 105: Hoare triple {83903#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {83903#false} is VALID [2022-04-15 11:48:05,211 INFO L290 TraceCheckUtils]: 106: Hoare triple {83903#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {83903#false} is VALID [2022-04-15 11:48:05,211 INFO L290 TraceCheckUtils]: 107: Hoare triple {83903#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {83903#false} is VALID [2022-04-15 11:48:05,211 INFO L290 TraceCheckUtils]: 108: Hoare triple {83903#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {83903#false} is VALID [2022-04-15 11:48:05,211 INFO L290 TraceCheckUtils]: 109: Hoare triple {83903#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {83903#false} is VALID [2022-04-15 11:48:05,211 INFO L290 TraceCheckUtils]: 110: Hoare triple {83903#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {83903#false} is VALID [2022-04-15 11:48:05,211 INFO L290 TraceCheckUtils]: 111: Hoare triple {83903#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {83903#false} is VALID [2022-04-15 11:48:05,211 INFO L290 TraceCheckUtils]: 112: Hoare triple {83903#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {83903#false} is VALID [2022-04-15 11:48:05,211 INFO L290 TraceCheckUtils]: 113: Hoare triple {83903#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {83903#false} is VALID [2022-04-15 11:48:05,211 INFO L290 TraceCheckUtils]: 114: Hoare triple {83903#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {83903#false} is VALID [2022-04-15 11:48:05,211 INFO L290 TraceCheckUtils]: 115: Hoare triple {83903#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {83903#false} is VALID [2022-04-15 11:48:05,211 INFO L290 TraceCheckUtils]: 116: Hoare triple {83903#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {83903#false} is VALID [2022-04-15 11:48:05,211 INFO L290 TraceCheckUtils]: 117: Hoare triple {83903#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {83903#false} is VALID [2022-04-15 11:48:05,211 INFO L290 TraceCheckUtils]: 118: Hoare triple {83903#false} assume 8640 == #t~mem75;havoc #t~mem75; {83903#false} is VALID [2022-04-15 11:48:05,212 INFO L290 TraceCheckUtils]: 119: Hoare triple {83903#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {83903#false} is VALID [2022-04-15 11:48:05,212 INFO L290 TraceCheckUtils]: 120: Hoare triple {83903#false} assume !(4 == ~blastFlag~0); {83903#false} is VALID [2022-04-15 11:48:05,212 INFO L290 TraceCheckUtils]: 121: Hoare triple {83903#false} assume 7 == ~blastFlag~0; {83903#false} is VALID [2022-04-15 11:48:05,212 INFO L290 TraceCheckUtils]: 122: Hoare triple {83903#false} assume !false; {83903#false} is VALID [2022-04-15 11:48:05,212 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-15 11:48:05,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:05,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381479212] [2022-04-15 11:48:05,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381479212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:05,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:05,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:05,213 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:05,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1715468629] [2022-04-15 11:48:05,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1715468629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:05,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:05,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:05,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548034368] [2022-04-15 11:48:05,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:05,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-15 11:48:05,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:05,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:05,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:05,284 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:48:05,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:05,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:48:05,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:48:05,284 INFO L87 Difference]: Start difference. First operand 421 states and 644 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:11,381 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:16,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:16,300 INFO L93 Difference]: Finished difference Result 888 states and 1359 transitions. [2022-04-15 11:48:16,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:48:16,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-15 11:48:16,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:16,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-15 11:48:16,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:16,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-15 11:48:16,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 574 transitions. [2022-04-15 11:48:16,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 574 edges. 574 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:16,705 INFO L225 Difference]: With dead ends: 888 [2022-04-15 11:48:16,705 INFO L226 Difference]: Without dead ends: 495 [2022-04-15 11:48:16,706 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:48:16,706 INFO L913 BasicCegarLoop]: 115 mSDtfsCounter, 113 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:16,707 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 334 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-15 11:48:16,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-04-15 11:48:16,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 381. [2022-04-15 11:48:16,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:16,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 495 states. Second operand has 381 states, 376 states have (on average 1.5292553191489362) internal successors, (575), 376 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-15 11:48:16,723 INFO L74 IsIncluded]: Start isIncluded. First operand 495 states. Second operand has 381 states, 376 states have (on average 1.5292553191489362) internal successors, (575), 376 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-15 11:48:16,724 INFO L87 Difference]: Start difference. First operand 495 states. Second operand has 381 states, 376 states have (on average 1.5292553191489362) internal successors, (575), 376 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-15 11:48:16,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:16,732 INFO L93 Difference]: Finished difference Result 495 states and 745 transitions. [2022-04-15 11:48:16,732 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 745 transitions. [2022-04-15 11:48:16,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:16,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:16,733 INFO L74 IsIncluded]: Start isIncluded. First operand has 381 states, 376 states have (on average 1.5292553191489362) internal successors, (575), 376 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 495 states. [2022-04-15 11:48:16,733 INFO L87 Difference]: Start difference. First operand has 381 states, 376 states have (on average 1.5292553191489362) internal successors, (575), 376 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 495 states. [2022-04-15 11:48:16,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:16,741 INFO L93 Difference]: Finished difference Result 495 states and 745 transitions. [2022-04-15 11:48:16,742 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 745 transitions. [2022-04-15 11:48:16,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:16,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:16,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:16,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:16,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 376 states have (on average 1.5292553191489362) internal successors, (575), 376 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-15 11:48:16,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 579 transitions. [2022-04-15 11:48:16,749 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 579 transitions. Word has length 123 [2022-04-15 11:48:16,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:16,749 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 579 transitions. [2022-04-15 11:48:16,749 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:16,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 381 states and 579 transitions. [2022-04-15 11:48:17,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 579 edges. 579 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:17,262 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 579 transitions. [2022-04-15 11:48:17,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-15 11:48:17,263 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:17,263 INFO L499 BasicCegarLoop]: 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-15 11:48:17,263 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-15 11:48:17,263 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:17,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:17,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1060012237, now seen corresponding path program 1 times [2022-04-15 11:48:17,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:17,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [742995084] [2022-04-15 11:48:17,343 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:48:17,343 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:48:17,343 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:48:17,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1060012237, now seen corresponding path program 2 times [2022-04-15 11:48:17,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:17,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705698772] [2022-04-15 11:48:17,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:17,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:17,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:17,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {87449#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {87442#true} is VALID [2022-04-15 11:48:17,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {87442#true} assume true; {87442#true} is VALID [2022-04-15 11:48:17,513 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87442#true} {87442#true} #678#return; {87442#true} is VALID [2022-04-15 11:48:17,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {87442#true} call ULTIMATE.init(); {87449#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:48:17,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {87449#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {87442#true} is VALID [2022-04-15 11:48:17,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {87442#true} assume true; {87442#true} is VALID [2022-04-15 11:48:17,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87442#true} {87442#true} #678#return; {87442#true} is VALID [2022-04-15 11:48:17,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {87442#true} call #t~ret161 := main(); {87442#true} is VALID [2022-04-15 11:48:17,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {87442#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; {87442#true} is VALID [2022-04-15 11:48:17,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {87442#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {87442#true} is VALID [2022-04-15 11:48:17,514 INFO L272 TraceCheckUtils]: 7: Hoare triple {87442#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {87442#true} is VALID [2022-04-15 11:48:17,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {87442#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); {87442#true} is VALID [2022-04-15 11:48:17,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {87442#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; {87442#true} is VALID [2022-04-15 11:48:17,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {87442#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; {87442#true} is VALID [2022-04-15 11:48:17,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {87442#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {87442#true} is VALID [2022-04-15 11:48:17,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {87442#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {87442#true} is VALID [2022-04-15 11:48:17,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {87442#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {87442#true} is VALID [2022-04-15 11:48:17,515 INFO L290 TraceCheckUtils]: 14: Hoare triple {87442#true} assume !false; {87442#true} is VALID [2022-04-15 11:48:17,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {87442#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); {87442#true} is VALID [2022-04-15 11:48:17,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {87442#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {87442#true} is VALID [2022-04-15 11:48:17,515 INFO L290 TraceCheckUtils]: 17: Hoare triple {87442#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {87442#true} is VALID [2022-04-15 11:48:17,515 INFO L290 TraceCheckUtils]: 18: Hoare triple {87442#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {87442#true} is VALID [2022-04-15 11:48:17,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {87442#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {87442#true} is VALID [2022-04-15 11:48:17,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {87442#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {87442#true} is VALID [2022-04-15 11:48:17,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {87442#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {87442#true} is VALID [2022-04-15 11:48:17,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {87442#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {87442#true} is VALID [2022-04-15 11:48:17,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {87442#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {87442#true} is VALID [2022-04-15 11:48:17,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {87442#true} assume 8464 == #t~mem55;havoc #t~mem55; {87442#true} is VALID [2022-04-15 11:48:17,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {87442#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; {87442#true} is VALID [2022-04-15 11:48:17,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {87442#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {87442#true} is VALID [2022-04-15 11:48:17,516 INFO L290 TraceCheckUtils]: 27: Hoare triple {87442#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); {87442#true} is VALID [2022-04-15 11:48:17,516 INFO L290 TraceCheckUtils]: 28: Hoare triple {87442#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); {87442#true} is VALID [2022-04-15 11:48:17,516 INFO L290 TraceCheckUtils]: 29: Hoare triple {87442#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {87442#true} is VALID [2022-04-15 11:48:17,516 INFO L290 TraceCheckUtils]: 30: Hoare triple {87442#true} ~skip~0 := 0; {87442#true} is VALID [2022-04-15 11:48:17,516 INFO L290 TraceCheckUtils]: 31: Hoare triple {87442#true} assume !false; {87442#true} is VALID [2022-04-15 11:48:17,516 INFO L290 TraceCheckUtils]: 32: Hoare triple {87442#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); {87442#true} is VALID [2022-04-15 11:48:17,516 INFO L290 TraceCheckUtils]: 33: Hoare triple {87442#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {87442#true} is VALID [2022-04-15 11:48:17,516 INFO L290 TraceCheckUtils]: 34: Hoare triple {87442#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {87442#true} is VALID [2022-04-15 11:48:17,516 INFO L290 TraceCheckUtils]: 35: Hoare triple {87442#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {87442#true} is VALID [2022-04-15 11:48:17,516 INFO L290 TraceCheckUtils]: 36: Hoare triple {87442#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {87442#true} is VALID [2022-04-15 11:48:17,516 INFO L290 TraceCheckUtils]: 37: Hoare triple {87442#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {87442#true} is VALID [2022-04-15 11:48:17,516 INFO L290 TraceCheckUtils]: 38: Hoare triple {87442#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {87442#true} is VALID [2022-04-15 11:48:17,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {87442#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {87442#true} is VALID [2022-04-15 11:48:17,517 INFO L290 TraceCheckUtils]: 40: Hoare triple {87442#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {87442#true} is VALID [2022-04-15 11:48:17,517 INFO L290 TraceCheckUtils]: 41: Hoare triple {87442#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {87442#true} is VALID [2022-04-15 11:48:17,517 INFO L290 TraceCheckUtils]: 42: Hoare triple {87442#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {87442#true} is VALID [2022-04-15 11:48:17,517 INFO L290 TraceCheckUtils]: 43: Hoare triple {87442#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {87442#true} is VALID [2022-04-15 11:48:17,517 INFO L290 TraceCheckUtils]: 44: Hoare triple {87442#true} assume 8496 == #t~mem58;havoc #t~mem58; {87442#true} is VALID [2022-04-15 11:48:17,517 INFO L290 TraceCheckUtils]: 45: Hoare triple {87442#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {87442#true} is VALID [2022-04-15 11:48:17,517 INFO L290 TraceCheckUtils]: 46: Hoare triple {87442#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {87442#true} is VALID [2022-04-15 11:48:17,517 INFO L290 TraceCheckUtils]: 47: Hoare triple {87442#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {87442#true} is VALID [2022-04-15 11:48:17,518 INFO L290 TraceCheckUtils]: 48: Hoare triple {87442#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,519 INFO L290 TraceCheckUtils]: 49: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,519 INFO L290 TraceCheckUtils]: 50: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,519 INFO L290 TraceCheckUtils]: 51: Hoare triple {87447#(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; {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,520 INFO L290 TraceCheckUtils]: 52: Hoare triple {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,520 INFO L290 TraceCheckUtils]: 53: Hoare triple {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,521 INFO L290 TraceCheckUtils]: 54: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,521 INFO L290 TraceCheckUtils]: 55: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,521 INFO L290 TraceCheckUtils]: 56: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,522 INFO L290 TraceCheckUtils]: 57: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,522 INFO L290 TraceCheckUtils]: 58: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,522 INFO L290 TraceCheckUtils]: 59: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,523 INFO L290 TraceCheckUtils]: 60: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,523 INFO L290 TraceCheckUtils]: 61: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,523 INFO L290 TraceCheckUtils]: 62: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,524 INFO L290 TraceCheckUtils]: 63: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,524 INFO L290 TraceCheckUtils]: 64: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,524 INFO L290 TraceCheckUtils]: 65: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,525 INFO L290 TraceCheckUtils]: 66: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,525 INFO L290 TraceCheckUtils]: 67: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,526 INFO L290 TraceCheckUtils]: 68: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,526 INFO L290 TraceCheckUtils]: 69: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,526 INFO L290 TraceCheckUtils]: 70: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,527 INFO L290 TraceCheckUtils]: 71: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,527 INFO L290 TraceCheckUtils]: 72: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,527 INFO L290 TraceCheckUtils]: 73: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,528 INFO L290 TraceCheckUtils]: 74: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,528 INFO L290 TraceCheckUtils]: 75: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,528 INFO L290 TraceCheckUtils]: 76: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,529 INFO L290 TraceCheckUtils]: 77: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,529 INFO L290 TraceCheckUtils]: 78: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,529 INFO L290 TraceCheckUtils]: 79: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,530 INFO L290 TraceCheckUtils]: 80: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,530 INFO L290 TraceCheckUtils]: 81: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,531 INFO L290 TraceCheckUtils]: 82: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,531 INFO L290 TraceCheckUtils]: 83: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,531 INFO L290 TraceCheckUtils]: 84: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,532 INFO L290 TraceCheckUtils]: 85: Hoare triple {87447#(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); {87447#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:17,532 INFO L290 TraceCheckUtils]: 86: Hoare triple {87447#(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); {87448#(not (= |ssl3_accept_#t~mem79| 8672))} is VALID [2022-04-15 11:48:17,532 INFO L290 TraceCheckUtils]: 87: Hoare triple {87448#(not (= |ssl3_accept_#t~mem79| 8672))} assume 8672 == #t~mem79;havoc #t~mem79; {87443#false} is VALID [2022-04-15 11:48:17,532 INFO L290 TraceCheckUtils]: 88: Hoare triple {87443#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {87443#false} is VALID [2022-04-15 11:48:17,533 INFO L290 TraceCheckUtils]: 89: Hoare triple {87443#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {87443#false} is VALID [2022-04-15 11:48:17,533 INFO L290 TraceCheckUtils]: 90: Hoare triple {87443#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); {87443#false} is VALID [2022-04-15 11:48:17,533 INFO L290 TraceCheckUtils]: 91: Hoare triple {87443#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; {87443#false} is VALID [2022-04-15 11:48:17,533 INFO L290 TraceCheckUtils]: 92: Hoare triple {87443#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,533 INFO L290 TraceCheckUtils]: 93: Hoare triple {87443#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); {87443#false} is VALID [2022-04-15 11:48:17,533 INFO L290 TraceCheckUtils]: 94: Hoare triple {87443#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {87443#false} is VALID [2022-04-15 11:48:17,533 INFO L290 TraceCheckUtils]: 95: Hoare triple {87443#false} ~skip~0 := 0; {87443#false} is VALID [2022-04-15 11:48:17,533 INFO L290 TraceCheckUtils]: 96: Hoare triple {87443#false} assume !false; {87443#false} is VALID [2022-04-15 11:48:17,533 INFO L290 TraceCheckUtils]: 97: Hoare triple {87443#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); {87443#false} is VALID [2022-04-15 11:48:17,533 INFO L290 TraceCheckUtils]: 98: Hoare triple {87443#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,533 INFO L290 TraceCheckUtils]: 99: Hoare triple {87443#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,533 INFO L290 TraceCheckUtils]: 100: Hoare triple {87443#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,533 INFO L290 TraceCheckUtils]: 101: Hoare triple {87443#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,533 INFO L290 TraceCheckUtils]: 102: Hoare triple {87443#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,534 INFO L290 TraceCheckUtils]: 103: Hoare triple {87443#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,534 INFO L290 TraceCheckUtils]: 104: Hoare triple {87443#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,534 INFO L290 TraceCheckUtils]: 105: Hoare triple {87443#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,534 INFO L290 TraceCheckUtils]: 106: Hoare triple {87443#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,534 INFO L290 TraceCheckUtils]: 107: Hoare triple {87443#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,534 INFO L290 TraceCheckUtils]: 108: Hoare triple {87443#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,534 INFO L290 TraceCheckUtils]: 109: Hoare triple {87443#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,534 INFO L290 TraceCheckUtils]: 110: Hoare triple {87443#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,534 INFO L290 TraceCheckUtils]: 111: Hoare triple {87443#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,534 INFO L290 TraceCheckUtils]: 112: Hoare triple {87443#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,534 INFO L290 TraceCheckUtils]: 113: Hoare triple {87443#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,534 INFO L290 TraceCheckUtils]: 114: Hoare triple {87443#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,534 INFO L290 TraceCheckUtils]: 115: Hoare triple {87443#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,534 INFO L290 TraceCheckUtils]: 116: Hoare triple {87443#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,534 INFO L290 TraceCheckUtils]: 117: Hoare triple {87443#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,535 INFO L290 TraceCheckUtils]: 118: Hoare triple {87443#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,535 INFO L290 TraceCheckUtils]: 119: Hoare triple {87443#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,535 INFO L290 TraceCheckUtils]: 120: Hoare triple {87443#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,535 INFO L290 TraceCheckUtils]: 121: Hoare triple {87443#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,535 INFO L290 TraceCheckUtils]: 122: Hoare triple {87443#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,535 INFO L290 TraceCheckUtils]: 123: Hoare triple {87443#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,535 INFO L290 TraceCheckUtils]: 124: Hoare triple {87443#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,535 INFO L290 TraceCheckUtils]: 125: Hoare triple {87443#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {87443#false} is VALID [2022-04-15 11:48:17,535 INFO L290 TraceCheckUtils]: 126: Hoare triple {87443#false} assume 8640 == #t~mem75;havoc #t~mem75; {87443#false} is VALID [2022-04-15 11:48:17,535 INFO L290 TraceCheckUtils]: 127: Hoare triple {87443#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {87443#false} is VALID [2022-04-15 11:48:17,535 INFO L290 TraceCheckUtils]: 128: Hoare triple {87443#false} assume !(4 == ~blastFlag~0); {87443#false} is VALID [2022-04-15 11:48:17,535 INFO L290 TraceCheckUtils]: 129: Hoare triple {87443#false} assume 7 == ~blastFlag~0; {87443#false} is VALID [2022-04-15 11:48:17,535 INFO L290 TraceCheckUtils]: 130: Hoare triple {87443#false} assume !false; {87443#false} is VALID [2022-04-15 11:48:17,536 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-15 11:48:17,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:17,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705698772] [2022-04-15 11:48:17,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705698772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:17,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:17,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:17,536 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:17,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [742995084] [2022-04-15 11:48:17,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [742995084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:17,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:17,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:17,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865870740] [2022-04-15 11:48:17,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:17,537 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-15 11:48:17,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:17,537 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-15 11:48:17,629 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-15 11:48:17,629 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:48:17,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:17,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:48:17,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:48:17,631 INFO L87 Difference]: Start difference. First operand 381 states and 579 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-15 11:48:21,318 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:23,324 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:25,851 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:30,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:30,087 INFO L93 Difference]: Finished difference Result 848 states and 1292 transitions. [2022-04-15 11:48:30,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:48:30,088 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-15 11:48:30,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:30,088 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-15 11:48:30,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2022-04-15 11:48:30,090 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-15 11:48:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2022-04-15 11:48:30,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 573 transitions. [2022-04-15 11:48:30,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 573 edges. 573 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:30,477 INFO L225 Difference]: With dead ends: 848 [2022-04-15 11:48:30,478 INFO L226 Difference]: Without dead ends: 495 [2022-04-15 11:48:30,478 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:48:30,479 INFO L913 BasicCegarLoop]: 115 mSDtfsCounter, 106 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:30,479 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 335 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 469 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2022-04-15 11:48:30,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-04-15 11:48:30,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 424. [2022-04-15 11:48:30,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:30,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 495 states. Second operand has 424 states, 419 states have (on average 1.5346062052505967) internal successors, (643), 419 states have internal predecessors, (643), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:30,499 INFO L74 IsIncluded]: Start isIncluded. First operand 495 states. Second operand has 424 states, 419 states have (on average 1.5346062052505967) internal successors, (643), 419 states have internal predecessors, (643), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:30,500 INFO L87 Difference]: Start difference. First operand 495 states. Second operand has 424 states, 419 states have (on average 1.5346062052505967) internal successors, (643), 419 states have internal predecessors, (643), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:30,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:30,507 INFO L93 Difference]: Finished difference Result 495 states and 744 transitions. [2022-04-15 11:48:30,508 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 744 transitions. [2022-04-15 11:48:30,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:30,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:30,510 INFO L74 IsIncluded]: Start isIncluded. First operand has 424 states, 419 states have (on average 1.5346062052505967) internal successors, (643), 419 states have internal predecessors, (643), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 495 states. [2022-04-15 11:48:30,511 INFO L87 Difference]: Start difference. First operand has 424 states, 419 states have (on average 1.5346062052505967) internal successors, (643), 419 states have internal predecessors, (643), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 495 states. [2022-04-15 11:48:30,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:30,519 INFO L93 Difference]: Finished difference Result 495 states and 744 transitions. [2022-04-15 11:48:30,519 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 744 transitions. [2022-04-15 11:48:30,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:30,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:30,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:30,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:30,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 419 states have (on average 1.5346062052505967) internal successors, (643), 419 states have internal predecessors, (643), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:30,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 647 transitions. [2022-04-15 11:48:30,528 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 647 transitions. Word has length 131 [2022-04-15 11:48:30,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:30,528 INFO L478 AbstractCegarLoop]: Abstraction has 424 states and 647 transitions. [2022-04-15 11:48:30,528 INFO L479 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-15 11:48:30,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 424 states and 647 transitions. [2022-04-15 11:48:31,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 647 edges. 647 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 647 transitions. [2022-04-15 11:48:31,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-15 11:48:31,138 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:31,138 INFO L499 BasicCegarLoop]: 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, 1] [2022-04-15 11:48:31,139 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-15 11:48:31,139 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:31,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:31,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1992420845, now seen corresponding path program 1 times [2022-04-15 11:48:31,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:31,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1447755989] [2022-04-15 11:48:31,210 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:48:31,211 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:48:31,211 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:48:31,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1992420845, now seen corresponding path program 2 times [2022-04-15 11:48:31,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:31,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578089794] [2022-04-15 11:48:31,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:31,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:31,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:31,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {90995#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {90988#true} is VALID [2022-04-15 11:48:31,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {90988#true} assume true; {90988#true} is VALID [2022-04-15 11:48:31,378 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90988#true} {90988#true} #678#return; {90988#true} is VALID [2022-04-15 11:48:31,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {90988#true} call ULTIMATE.init(); {90995#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:48:31,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {90995#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {90988#true} is VALID [2022-04-15 11:48:31,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {90988#true} assume true; {90988#true} is VALID [2022-04-15 11:48:31,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90988#true} {90988#true} #678#return; {90988#true} is VALID [2022-04-15 11:48:31,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {90988#true} call #t~ret161 := main(); {90988#true} is VALID [2022-04-15 11:48:31,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {90988#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; {90988#true} is VALID [2022-04-15 11:48:31,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {90988#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {90988#true} is VALID [2022-04-15 11:48:31,379 INFO L272 TraceCheckUtils]: 7: Hoare triple {90988#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {90988#true} is VALID [2022-04-15 11:48:31,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {90988#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); {90988#true} is VALID [2022-04-15 11:48:31,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {90988#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; {90988#true} is VALID [2022-04-15 11:48:31,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {90988#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; {90988#true} is VALID [2022-04-15 11:48:31,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {90988#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {90988#true} is VALID [2022-04-15 11:48:31,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {90988#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {90988#true} is VALID [2022-04-15 11:48:31,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {90988#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {90988#true} is VALID [2022-04-15 11:48:31,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {90988#true} assume !false; {90988#true} is VALID [2022-04-15 11:48:31,380 INFO L290 TraceCheckUtils]: 15: Hoare triple {90988#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); {90988#true} is VALID [2022-04-15 11:48:31,380 INFO L290 TraceCheckUtils]: 16: Hoare triple {90988#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {90988#true} is VALID [2022-04-15 11:48:31,380 INFO L290 TraceCheckUtils]: 17: Hoare triple {90988#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {90988#true} is VALID [2022-04-15 11:48:31,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {90988#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {90988#true} is VALID [2022-04-15 11:48:31,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {90988#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {90988#true} is VALID [2022-04-15 11:48:31,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {90988#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {90988#true} is VALID [2022-04-15 11:48:31,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {90988#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {90988#true} is VALID [2022-04-15 11:48:31,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {90988#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {90988#true} is VALID [2022-04-15 11:48:31,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {90988#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {90988#true} is VALID [2022-04-15 11:48:31,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {90988#true} assume 8464 == #t~mem55;havoc #t~mem55; {90988#true} is VALID [2022-04-15 11:48:31,380 INFO L290 TraceCheckUtils]: 25: Hoare triple {90988#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; {90988#true} is VALID [2022-04-15 11:48:31,381 INFO L290 TraceCheckUtils]: 26: Hoare triple {90988#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {90988#true} is VALID [2022-04-15 11:48:31,381 INFO L290 TraceCheckUtils]: 27: Hoare triple {90988#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); {90988#true} is VALID [2022-04-15 11:48:31,381 INFO L290 TraceCheckUtils]: 28: Hoare triple {90988#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); {90988#true} is VALID [2022-04-15 11:48:31,381 INFO L290 TraceCheckUtils]: 29: Hoare triple {90988#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {90988#true} is VALID [2022-04-15 11:48:31,381 INFO L290 TraceCheckUtils]: 30: Hoare triple {90988#true} ~skip~0 := 0; {90988#true} is VALID [2022-04-15 11:48:31,381 INFO L290 TraceCheckUtils]: 31: Hoare triple {90988#true} assume !false; {90988#true} is VALID [2022-04-15 11:48:31,381 INFO L290 TraceCheckUtils]: 32: Hoare triple {90988#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); {90988#true} is VALID [2022-04-15 11:48:31,381 INFO L290 TraceCheckUtils]: 33: Hoare triple {90988#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {90988#true} is VALID [2022-04-15 11:48:31,381 INFO L290 TraceCheckUtils]: 34: Hoare triple {90988#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {90988#true} is VALID [2022-04-15 11:48:31,381 INFO L290 TraceCheckUtils]: 35: Hoare triple {90988#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {90988#true} is VALID [2022-04-15 11:48:31,381 INFO L290 TraceCheckUtils]: 36: Hoare triple {90988#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {90988#true} is VALID [2022-04-15 11:48:31,381 INFO L290 TraceCheckUtils]: 37: Hoare triple {90988#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {90988#true} is VALID [2022-04-15 11:48:31,381 INFO L290 TraceCheckUtils]: 38: Hoare triple {90988#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {90988#true} is VALID [2022-04-15 11:48:31,381 INFO L290 TraceCheckUtils]: 39: Hoare triple {90988#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {90988#true} is VALID [2022-04-15 11:48:31,382 INFO L290 TraceCheckUtils]: 40: Hoare triple {90988#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {90988#true} is VALID [2022-04-15 11:48:31,382 INFO L290 TraceCheckUtils]: 41: Hoare triple {90988#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {90988#true} is VALID [2022-04-15 11:48:31,382 INFO L290 TraceCheckUtils]: 42: Hoare triple {90988#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {90988#true} is VALID [2022-04-15 11:48:31,382 INFO L290 TraceCheckUtils]: 43: Hoare triple {90988#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {90988#true} is VALID [2022-04-15 11:48:31,382 INFO L290 TraceCheckUtils]: 44: Hoare triple {90988#true} assume 8496 == #t~mem58;havoc #t~mem58; {90988#true} is VALID [2022-04-15 11:48:31,382 INFO L290 TraceCheckUtils]: 45: Hoare triple {90988#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {90988#true} is VALID [2022-04-15 11:48:31,382 INFO L290 TraceCheckUtils]: 46: Hoare triple {90988#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {90988#true} is VALID [2022-04-15 11:48:31,382 INFO L290 TraceCheckUtils]: 47: Hoare triple {90988#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {90988#true} is VALID [2022-04-15 11:48:31,383 INFO L290 TraceCheckUtils]: 48: Hoare triple {90988#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,384 INFO L290 TraceCheckUtils]: 49: Hoare triple {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,384 INFO L290 TraceCheckUtils]: 50: Hoare triple {90993#(= 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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,384 INFO L290 TraceCheckUtils]: 51: Hoare triple {90993#(= 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; {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,385 INFO L290 TraceCheckUtils]: 52: Hoare triple {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,385 INFO L290 TraceCheckUtils]: 53: Hoare triple {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,385 INFO L290 TraceCheckUtils]: 54: Hoare triple {90993#(= 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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,386 INFO L290 TraceCheckUtils]: 55: Hoare triple {90993#(= 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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,386 INFO L290 TraceCheckUtils]: 56: Hoare triple {90993#(= 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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,386 INFO L290 TraceCheckUtils]: 57: Hoare triple {90993#(= 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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,387 INFO L290 TraceCheckUtils]: 58: Hoare triple {90993#(= 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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,387 INFO L290 TraceCheckUtils]: 59: Hoare triple {90993#(= 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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,387 INFO L290 TraceCheckUtils]: 60: Hoare triple {90993#(= 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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,388 INFO L290 TraceCheckUtils]: 61: Hoare triple {90993#(= 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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,388 INFO L290 TraceCheckUtils]: 62: Hoare triple {90993#(= 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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,388 INFO L290 TraceCheckUtils]: 63: Hoare triple {90993#(= 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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,389 INFO L290 TraceCheckUtils]: 64: Hoare triple {90993#(= 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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,389 INFO L290 TraceCheckUtils]: 65: Hoare triple {90993#(= 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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,389 INFO L290 TraceCheckUtils]: 66: Hoare triple {90993#(= 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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,390 INFO L290 TraceCheckUtils]: 67: Hoare triple {90993#(= 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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,390 INFO L290 TraceCheckUtils]: 68: Hoare triple {90993#(= 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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,390 INFO L290 TraceCheckUtils]: 69: Hoare triple {90993#(= 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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,391 INFO L290 TraceCheckUtils]: 70: Hoare triple {90993#(= 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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,391 INFO L290 TraceCheckUtils]: 71: Hoare triple {90993#(= 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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,391 INFO L290 TraceCheckUtils]: 72: Hoare triple {90993#(= 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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,392 INFO L290 TraceCheckUtils]: 73: Hoare triple {90993#(= 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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,392 INFO L290 TraceCheckUtils]: 74: Hoare triple {90993#(= 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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,392 INFO L290 TraceCheckUtils]: 75: Hoare triple {90993#(= 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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,393 INFO L290 TraceCheckUtils]: 76: Hoare triple {90993#(= 8656 (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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,393 INFO L290 TraceCheckUtils]: 77: Hoare triple {90993#(= 8656 (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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,393 INFO L290 TraceCheckUtils]: 78: Hoare triple {90993#(= 8656 (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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,394 INFO L290 TraceCheckUtils]: 79: Hoare triple {90993#(= 8656 (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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,394 INFO L290 TraceCheckUtils]: 80: Hoare triple {90993#(= 8656 (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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,394 INFO L290 TraceCheckUtils]: 81: Hoare triple {90993#(= 8656 (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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,395 INFO L290 TraceCheckUtils]: 82: Hoare triple {90993#(= 8656 (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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,395 INFO L290 TraceCheckUtils]: 83: Hoare triple {90993#(= 8656 (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); {90993#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:31,395 INFO L290 TraceCheckUtils]: 84: Hoare triple {90993#(= 8656 (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); {90994#(= |ssl3_accept_#t~mem77| 8656)} is VALID [2022-04-15 11:48:31,395 INFO L290 TraceCheckUtils]: 85: Hoare triple {90994#(= |ssl3_accept_#t~mem77| 8656)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,396 INFO L290 TraceCheckUtils]: 86: Hoare triple {90989#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,396 INFO L290 TraceCheckUtils]: 87: Hoare triple {90989#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,396 INFO L290 TraceCheckUtils]: 88: Hoare triple {90989#false} assume 8673 == #t~mem80;havoc #t~mem80; {90989#false} is VALID [2022-04-15 11:48:31,396 INFO L290 TraceCheckUtils]: 89: Hoare triple {90989#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {90989#false} is VALID [2022-04-15 11:48:31,396 INFO L290 TraceCheckUtils]: 90: Hoare triple {90989#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {90989#false} is VALID [2022-04-15 11:48:31,396 INFO L290 TraceCheckUtils]: 91: Hoare triple {90989#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); {90989#false} is VALID [2022-04-15 11:48:31,396 INFO L290 TraceCheckUtils]: 92: Hoare triple {90989#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; {90989#false} is VALID [2022-04-15 11:48:31,396 INFO L290 TraceCheckUtils]: 93: Hoare triple {90989#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,396 INFO L290 TraceCheckUtils]: 94: Hoare triple {90989#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); {90989#false} is VALID [2022-04-15 11:48:31,396 INFO L290 TraceCheckUtils]: 95: Hoare triple {90989#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {90989#false} is VALID [2022-04-15 11:48:31,396 INFO L290 TraceCheckUtils]: 96: Hoare triple {90989#false} ~skip~0 := 0; {90989#false} is VALID [2022-04-15 11:48:31,396 INFO L290 TraceCheckUtils]: 97: Hoare triple {90989#false} assume !false; {90989#false} is VALID [2022-04-15 11:48:31,396 INFO L290 TraceCheckUtils]: 98: Hoare triple {90989#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); {90989#false} is VALID [2022-04-15 11:48:31,396 INFO L290 TraceCheckUtils]: 99: Hoare triple {90989#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,397 INFO L290 TraceCheckUtils]: 100: Hoare triple {90989#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,397 INFO L290 TraceCheckUtils]: 101: Hoare triple {90989#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,397 INFO L290 TraceCheckUtils]: 102: Hoare triple {90989#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,397 INFO L290 TraceCheckUtils]: 103: Hoare triple {90989#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,397 INFO L290 TraceCheckUtils]: 104: Hoare triple {90989#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,397 INFO L290 TraceCheckUtils]: 105: Hoare triple {90989#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,397 INFO L290 TraceCheckUtils]: 106: Hoare triple {90989#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,397 INFO L290 TraceCheckUtils]: 107: Hoare triple {90989#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,397 INFO L290 TraceCheckUtils]: 108: Hoare triple {90989#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,397 INFO L290 TraceCheckUtils]: 109: Hoare triple {90989#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,397 INFO L290 TraceCheckUtils]: 110: Hoare triple {90989#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,397 INFO L290 TraceCheckUtils]: 111: Hoare triple {90989#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,397 INFO L290 TraceCheckUtils]: 112: Hoare triple {90989#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,397 INFO L290 TraceCheckUtils]: 113: Hoare triple {90989#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,397 INFO L290 TraceCheckUtils]: 114: Hoare triple {90989#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,398 INFO L290 TraceCheckUtils]: 115: Hoare triple {90989#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,398 INFO L290 TraceCheckUtils]: 116: Hoare triple {90989#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,398 INFO L290 TraceCheckUtils]: 117: Hoare triple {90989#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,398 INFO L290 TraceCheckUtils]: 118: Hoare triple {90989#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,398 INFO L290 TraceCheckUtils]: 119: Hoare triple {90989#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,398 INFO L290 TraceCheckUtils]: 120: Hoare triple {90989#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,398 INFO L290 TraceCheckUtils]: 121: Hoare triple {90989#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,398 INFO L290 TraceCheckUtils]: 122: Hoare triple {90989#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,398 INFO L290 TraceCheckUtils]: 123: Hoare triple {90989#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,398 INFO L290 TraceCheckUtils]: 124: Hoare triple {90989#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,398 INFO L290 TraceCheckUtils]: 125: Hoare triple {90989#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,398 INFO L290 TraceCheckUtils]: 126: Hoare triple {90989#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {90989#false} is VALID [2022-04-15 11:48:31,398 INFO L290 TraceCheckUtils]: 127: Hoare triple {90989#false} assume 8640 == #t~mem75;havoc #t~mem75; {90989#false} is VALID [2022-04-15 11:48:31,398 INFO L290 TraceCheckUtils]: 128: Hoare triple {90989#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {90989#false} is VALID [2022-04-15 11:48:31,398 INFO L290 TraceCheckUtils]: 129: Hoare triple {90989#false} assume !(4 == ~blastFlag~0); {90989#false} is VALID [2022-04-15 11:48:31,399 INFO L290 TraceCheckUtils]: 130: Hoare triple {90989#false} assume 7 == ~blastFlag~0; {90989#false} is VALID [2022-04-15 11:48:31,399 INFO L290 TraceCheckUtils]: 131: Hoare triple {90989#false} assume !false; {90989#false} is VALID [2022-04-15 11:48:31,399 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-15 11:48:31,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:31,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578089794] [2022-04-15 11:48:31,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578089794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:31,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:31,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:31,400 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:31,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1447755989] [2022-04-15 11:48:31,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1447755989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:31,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:31,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:31,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699079125] [2022-04-15 11:48:31,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:31,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-15 11:48:31,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:31,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:31,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:31,482 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:48:31,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:31,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:48:31,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:48:31,483 INFO L87 Difference]: Start difference. First operand 424 states and 647 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:33,532 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-15 11:48:36,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:36,949 INFO L93 Difference]: Finished difference Result 903 states and 1383 transitions. [2022-04-15 11:48:36,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:48:36,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-15 11:48:36,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:36,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:36,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 524 transitions. [2022-04-15 11:48:36,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:36,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 524 transitions. [2022-04-15 11:48:36,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 524 transitions. [2022-04-15 11:48:37,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 524 edges. 524 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:37,303 INFO L225 Difference]: With dead ends: 903 [2022-04-15 11:48:37,303 INFO L226 Difference]: Without dead ends: 507 [2022-04-15 11:48:37,304 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:48:37,304 INFO L913 BasicCegarLoop]: 179 mSDtfsCounter, 60 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:37,305 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 469 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 488 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-04-15 11:48:37,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-04-15 11:48:37,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 467. [2022-04-15 11:48:37,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:37,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 507 states. Second operand has 467 states, 462 states have (on average 1.5346320346320346) internal successors, (709), 462 states have internal predecessors, (709), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:37,329 INFO L74 IsIncluded]: Start isIncluded. First operand 507 states. Second operand has 467 states, 462 states have (on average 1.5346320346320346) internal successors, (709), 462 states have internal predecessors, (709), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:37,329 INFO L87 Difference]: Start difference. First operand 507 states. Second operand has 467 states, 462 states have (on average 1.5346320346320346) internal successors, (709), 462 states have internal predecessors, (709), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:37,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:37,337 INFO L93 Difference]: Finished difference Result 507 states and 767 transitions. [2022-04-15 11:48:37,337 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 767 transitions. [2022-04-15 11:48:37,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:37,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:37,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 467 states, 462 states have (on average 1.5346320346320346) internal successors, (709), 462 states have internal predecessors, (709), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 507 states. [2022-04-15 11:48:37,339 INFO L87 Difference]: Start difference. First operand has 467 states, 462 states have (on average 1.5346320346320346) internal successors, (709), 462 states have internal predecessors, (709), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 507 states. [2022-04-15 11:48:37,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:37,347 INFO L93 Difference]: Finished difference Result 507 states and 767 transitions. [2022-04-15 11:48:37,347 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 767 transitions. [2022-04-15 11:48:37,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:37,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:37,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:37,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:37,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 462 states have (on average 1.5346320346320346) internal successors, (709), 462 states have internal predecessors, (709), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:37,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 713 transitions. [2022-04-15 11:48:37,358 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 713 transitions. Word has length 132 [2022-04-15 11:48:37,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:37,358 INFO L478 AbstractCegarLoop]: Abstraction has 467 states and 713 transitions. [2022-04-15 11:48:37,358 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:37,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 467 states and 713 transitions. [2022-04-15 11:48:38,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 713 edges. 713 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:38,016 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 713 transitions. [2022-04-15 11:48:38,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-15 11:48:38,017 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:38,017 INFO L499 BasicCegarLoop]: 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, 1] [2022-04-15 11:48:38,017 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-15 11:48:38,017 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:38,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:38,017 INFO L85 PathProgramCache]: Analyzing trace with hash 113289899, now seen corresponding path program 1 times [2022-04-15 11:48:38,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:38,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1073688280] [2022-04-15 11:48:38,082 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:48:38,083 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:48:38,083 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:48:38,083 INFO L85 PathProgramCache]: Analyzing trace with hash 113289899, now seen corresponding path program 2 times [2022-04-15 11:48:38,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:38,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955995787] [2022-04-15 11:48:38,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:38,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:38,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:38,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {94761#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {94754#true} is VALID [2022-04-15 11:48:38,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {94754#true} assume true; {94754#true} is VALID [2022-04-15 11:48:38,236 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {94754#true} {94754#true} #678#return; {94754#true} is VALID [2022-04-15 11:48:38,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {94754#true} call ULTIMATE.init(); {94761#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:48:38,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {94761#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {94754#true} is VALID [2022-04-15 11:48:38,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {94754#true} assume true; {94754#true} is VALID [2022-04-15 11:48:38,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94754#true} {94754#true} #678#return; {94754#true} is VALID [2022-04-15 11:48:38,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {94754#true} call #t~ret161 := main(); {94754#true} is VALID [2022-04-15 11:48:38,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {94754#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; {94754#true} is VALID [2022-04-15 11:48:38,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {94754#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {94754#true} is VALID [2022-04-15 11:48:38,238 INFO L272 TraceCheckUtils]: 7: Hoare triple {94754#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {94754#true} is VALID [2022-04-15 11:48:38,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {94754#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); {94754#true} is VALID [2022-04-15 11:48:38,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {94754#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; {94754#true} is VALID [2022-04-15 11:48:38,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {94754#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; {94754#true} is VALID [2022-04-15 11:48:38,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {94754#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {94754#true} is VALID [2022-04-15 11:48:38,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {94754#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {94754#true} is VALID [2022-04-15 11:48:38,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {94754#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {94754#true} is VALID [2022-04-15 11:48:38,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {94754#true} assume !false; {94754#true} is VALID [2022-04-15 11:48:38,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {94754#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); {94754#true} is VALID [2022-04-15 11:48:38,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {94754#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {94754#true} is VALID [2022-04-15 11:48:38,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {94754#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {94754#true} is VALID [2022-04-15 11:48:38,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {94754#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {94754#true} is VALID [2022-04-15 11:48:38,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {94754#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {94754#true} is VALID [2022-04-15 11:48:38,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {94754#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {94754#true} is VALID [2022-04-15 11:48:38,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {94754#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {94754#true} is VALID [2022-04-15 11:48:38,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {94754#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {94754#true} is VALID [2022-04-15 11:48:38,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {94754#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {94754#true} is VALID [2022-04-15 11:48:38,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {94754#true} assume 8464 == #t~mem55;havoc #t~mem55; {94754#true} is VALID [2022-04-15 11:48:38,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {94754#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; {94754#true} is VALID [2022-04-15 11:48:38,239 INFO L290 TraceCheckUtils]: 26: Hoare triple {94754#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {94754#true} is VALID [2022-04-15 11:48:38,239 INFO L290 TraceCheckUtils]: 27: Hoare triple {94754#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); {94754#true} is VALID [2022-04-15 11:48:38,239 INFO L290 TraceCheckUtils]: 28: Hoare triple {94754#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); {94754#true} is VALID [2022-04-15 11:48:38,239 INFO L290 TraceCheckUtils]: 29: Hoare triple {94754#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {94754#true} is VALID [2022-04-15 11:48:38,239 INFO L290 TraceCheckUtils]: 30: Hoare triple {94754#true} ~skip~0 := 0; {94754#true} is VALID [2022-04-15 11:48:38,239 INFO L290 TraceCheckUtils]: 31: Hoare triple {94754#true} assume !false; {94754#true} is VALID [2022-04-15 11:48:38,239 INFO L290 TraceCheckUtils]: 32: Hoare triple {94754#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); {94754#true} is VALID [2022-04-15 11:48:38,239 INFO L290 TraceCheckUtils]: 33: Hoare triple {94754#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {94754#true} is VALID [2022-04-15 11:48:38,239 INFO L290 TraceCheckUtils]: 34: Hoare triple {94754#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {94754#true} is VALID [2022-04-15 11:48:38,240 INFO L290 TraceCheckUtils]: 35: Hoare triple {94754#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {94754#true} is VALID [2022-04-15 11:48:38,240 INFO L290 TraceCheckUtils]: 36: Hoare triple {94754#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {94754#true} is VALID [2022-04-15 11:48:38,240 INFO L290 TraceCheckUtils]: 37: Hoare triple {94754#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {94754#true} is VALID [2022-04-15 11:48:38,240 INFO L290 TraceCheckUtils]: 38: Hoare triple {94754#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {94754#true} is VALID [2022-04-15 11:48:38,240 INFO L290 TraceCheckUtils]: 39: Hoare triple {94754#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {94754#true} is VALID [2022-04-15 11:48:38,240 INFO L290 TraceCheckUtils]: 40: Hoare triple {94754#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {94754#true} is VALID [2022-04-15 11:48:38,240 INFO L290 TraceCheckUtils]: 41: Hoare triple {94754#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {94754#true} is VALID [2022-04-15 11:48:38,240 INFO L290 TraceCheckUtils]: 42: Hoare triple {94754#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {94754#true} is VALID [2022-04-15 11:48:38,240 INFO L290 TraceCheckUtils]: 43: Hoare triple {94754#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {94754#true} is VALID [2022-04-15 11:48:38,240 INFO L290 TraceCheckUtils]: 44: Hoare triple {94754#true} assume 8496 == #t~mem58;havoc #t~mem58; {94754#true} is VALID [2022-04-15 11:48:38,240 INFO L290 TraceCheckUtils]: 45: Hoare triple {94754#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {94754#true} is VALID [2022-04-15 11:48:38,240 INFO L290 TraceCheckUtils]: 46: Hoare triple {94754#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {94754#true} is VALID [2022-04-15 11:48:38,240 INFO L290 TraceCheckUtils]: 47: Hoare triple {94754#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {94754#true} is VALID [2022-04-15 11:48:38,241 INFO L290 TraceCheckUtils]: 48: Hoare triple {94754#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,242 INFO L290 TraceCheckUtils]: 49: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,242 INFO L290 TraceCheckUtils]: 50: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,243 INFO L290 TraceCheckUtils]: 51: Hoare triple {94759#(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; {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,243 INFO L290 TraceCheckUtils]: 52: Hoare triple {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,243 INFO L290 TraceCheckUtils]: 53: Hoare triple {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,244 INFO L290 TraceCheckUtils]: 54: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,244 INFO L290 TraceCheckUtils]: 55: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,244 INFO L290 TraceCheckUtils]: 56: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,245 INFO L290 TraceCheckUtils]: 57: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,245 INFO L290 TraceCheckUtils]: 58: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,245 INFO L290 TraceCheckUtils]: 59: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,246 INFO L290 TraceCheckUtils]: 60: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,246 INFO L290 TraceCheckUtils]: 61: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,246 INFO L290 TraceCheckUtils]: 62: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,247 INFO L290 TraceCheckUtils]: 63: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,247 INFO L290 TraceCheckUtils]: 64: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,247 INFO L290 TraceCheckUtils]: 65: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,248 INFO L290 TraceCheckUtils]: 66: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,248 INFO L290 TraceCheckUtils]: 67: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,248 INFO L290 TraceCheckUtils]: 68: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,249 INFO L290 TraceCheckUtils]: 69: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,249 INFO L290 TraceCheckUtils]: 70: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,249 INFO L290 TraceCheckUtils]: 71: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,250 INFO L290 TraceCheckUtils]: 72: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,250 INFO L290 TraceCheckUtils]: 73: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,250 INFO L290 TraceCheckUtils]: 74: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,251 INFO L290 TraceCheckUtils]: 75: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,251 INFO L290 TraceCheckUtils]: 76: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,251 INFO L290 TraceCheckUtils]: 77: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,252 INFO L290 TraceCheckUtils]: 78: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,252 INFO L290 TraceCheckUtils]: 79: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,252 INFO L290 TraceCheckUtils]: 80: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,253 INFO L290 TraceCheckUtils]: 81: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,253 INFO L290 TraceCheckUtils]: 82: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,253 INFO L290 TraceCheckUtils]: 83: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,254 INFO L290 TraceCheckUtils]: 84: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,254 INFO L290 TraceCheckUtils]: 85: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,254 INFO L290 TraceCheckUtils]: 86: Hoare triple {94759#(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); {94759#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:38,255 INFO L290 TraceCheckUtils]: 87: Hoare triple {94759#(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); {94760#(not (= |ssl3_accept_#t~mem80| 8673))} is VALID [2022-04-15 11:48:38,255 INFO L290 TraceCheckUtils]: 88: Hoare triple {94760#(not (= |ssl3_accept_#t~mem80| 8673))} assume 8673 == #t~mem80;havoc #t~mem80; {94755#false} is VALID [2022-04-15 11:48:38,255 INFO L290 TraceCheckUtils]: 89: Hoare triple {94755#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {94755#false} is VALID [2022-04-15 11:48:38,255 INFO L290 TraceCheckUtils]: 90: Hoare triple {94755#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {94755#false} is VALID [2022-04-15 11:48:38,255 INFO L290 TraceCheckUtils]: 91: Hoare triple {94755#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); {94755#false} is VALID [2022-04-15 11:48:38,255 INFO L290 TraceCheckUtils]: 92: Hoare triple {94755#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; {94755#false} is VALID [2022-04-15 11:48:38,255 INFO L290 TraceCheckUtils]: 93: Hoare triple {94755#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,255 INFO L290 TraceCheckUtils]: 94: Hoare triple {94755#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); {94755#false} is VALID [2022-04-15 11:48:38,255 INFO L290 TraceCheckUtils]: 95: Hoare triple {94755#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {94755#false} is VALID [2022-04-15 11:48:38,255 INFO L290 TraceCheckUtils]: 96: Hoare triple {94755#false} ~skip~0 := 0; {94755#false} is VALID [2022-04-15 11:48:38,256 INFO L290 TraceCheckUtils]: 97: Hoare triple {94755#false} assume !false; {94755#false} is VALID [2022-04-15 11:48:38,256 INFO L290 TraceCheckUtils]: 98: Hoare triple {94755#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); {94755#false} is VALID [2022-04-15 11:48:38,256 INFO L290 TraceCheckUtils]: 99: Hoare triple {94755#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,256 INFO L290 TraceCheckUtils]: 100: Hoare triple {94755#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,256 INFO L290 TraceCheckUtils]: 101: Hoare triple {94755#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,256 INFO L290 TraceCheckUtils]: 102: Hoare triple {94755#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,256 INFO L290 TraceCheckUtils]: 103: Hoare triple {94755#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,256 INFO L290 TraceCheckUtils]: 104: Hoare triple {94755#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,256 INFO L290 TraceCheckUtils]: 105: Hoare triple {94755#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,256 INFO L290 TraceCheckUtils]: 106: Hoare triple {94755#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,256 INFO L290 TraceCheckUtils]: 107: Hoare triple {94755#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,256 INFO L290 TraceCheckUtils]: 108: Hoare triple {94755#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,256 INFO L290 TraceCheckUtils]: 109: Hoare triple {94755#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,256 INFO L290 TraceCheckUtils]: 110: Hoare triple {94755#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,256 INFO L290 TraceCheckUtils]: 111: Hoare triple {94755#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,257 INFO L290 TraceCheckUtils]: 112: Hoare triple {94755#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,257 INFO L290 TraceCheckUtils]: 113: Hoare triple {94755#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,257 INFO L290 TraceCheckUtils]: 114: Hoare triple {94755#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,257 INFO L290 TraceCheckUtils]: 115: Hoare triple {94755#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,257 INFO L290 TraceCheckUtils]: 116: Hoare triple {94755#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,257 INFO L290 TraceCheckUtils]: 117: Hoare triple {94755#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,257 INFO L290 TraceCheckUtils]: 118: Hoare triple {94755#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,257 INFO L290 TraceCheckUtils]: 119: Hoare triple {94755#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,257 INFO L290 TraceCheckUtils]: 120: Hoare triple {94755#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,257 INFO L290 TraceCheckUtils]: 121: Hoare triple {94755#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,257 INFO L290 TraceCheckUtils]: 122: Hoare triple {94755#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,257 INFO L290 TraceCheckUtils]: 123: Hoare triple {94755#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,257 INFO L290 TraceCheckUtils]: 124: Hoare triple {94755#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,257 INFO L290 TraceCheckUtils]: 125: Hoare triple {94755#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,257 INFO L290 TraceCheckUtils]: 126: Hoare triple {94755#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {94755#false} is VALID [2022-04-15 11:48:38,258 INFO L290 TraceCheckUtils]: 127: Hoare triple {94755#false} assume 8640 == #t~mem75;havoc #t~mem75; {94755#false} is VALID [2022-04-15 11:48:38,258 INFO L290 TraceCheckUtils]: 128: Hoare triple {94755#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {94755#false} is VALID [2022-04-15 11:48:38,258 INFO L290 TraceCheckUtils]: 129: Hoare triple {94755#false} assume !(4 == ~blastFlag~0); {94755#false} is VALID [2022-04-15 11:48:38,258 INFO L290 TraceCheckUtils]: 130: Hoare triple {94755#false} assume 7 == ~blastFlag~0; {94755#false} is VALID [2022-04-15 11:48:38,258 INFO L290 TraceCheckUtils]: 131: Hoare triple {94755#false} assume !false; {94755#false} is VALID [2022-04-15 11:48:38,258 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-15 11:48:38,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:38,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955995787] [2022-04-15 11:48:38,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955995787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:38,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:38,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:38,259 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:38,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1073688280] [2022-04-15 11:48:38,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1073688280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:38,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:38,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:38,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691740267] [2022-04-15 11:48:38,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:38,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-15 11:48:38,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:38,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:38,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:38,351 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:48:38,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:38,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:48:38,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:48:38,351 INFO L87 Difference]: Start difference. First operand 467 states and 713 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:45,789 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:47,794 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-15 11:48:50,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:50,923 INFO L93 Difference]: Finished difference Result 980 states and 1497 transitions. [2022-04-15 11:48:50,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:48:50,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-15 11:48:50,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:50,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:50,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2022-04-15 11:48:50,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:50,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2022-04-15 11:48:50,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 573 transitions. [2022-04-15 11:48:51,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 573 edges. 573 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:51,325 INFO L225 Difference]: With dead ends: 980 [2022-04-15 11:48:51,325 INFO L226 Difference]: Without dead ends: 539 [2022-04-15 11:48:51,326 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:48:51,326 INFO L913 BasicCegarLoop]: 125 mSDtfsCounter, 107 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 58 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:51,327 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 354 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 478 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2022-04-15 11:48:51,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2022-04-15 11:48:51,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 469. [2022-04-15 11:48:51,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:51,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 539 states. Second operand has 469 states, 464 states have (on average 1.5344827586206897) internal successors, (712), 464 states have internal predecessors, (712), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:51,352 INFO L74 IsIncluded]: Start isIncluded. First operand 539 states. Second operand has 469 states, 464 states have (on average 1.5344827586206897) internal successors, (712), 464 states have internal predecessors, (712), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:51,352 INFO L87 Difference]: Start difference. First operand 539 states. Second operand has 469 states, 464 states have (on average 1.5344827586206897) internal successors, (712), 464 states have internal predecessors, (712), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:51,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:51,361 INFO L93 Difference]: Finished difference Result 539 states and 812 transitions. [2022-04-15 11:48:51,361 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 812 transitions. [2022-04-15 11:48:51,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:51,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:51,362 INFO L74 IsIncluded]: Start isIncluded. First operand has 469 states, 464 states have (on average 1.5344827586206897) internal successors, (712), 464 states have internal predecessors, (712), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 539 states. [2022-04-15 11:48:51,362 INFO L87 Difference]: Start difference. First operand has 469 states, 464 states have (on average 1.5344827586206897) internal successors, (712), 464 states have internal predecessors, (712), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 539 states. [2022-04-15 11:48:51,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:51,372 INFO L93 Difference]: Finished difference Result 539 states and 812 transitions. [2022-04-15 11:48:51,372 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 812 transitions. [2022-04-15 11:48:51,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:51,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:51,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:51,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:51,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 464 states have (on average 1.5344827586206897) internal successors, (712), 464 states have internal predecessors, (712), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:51,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 716 transitions. [2022-04-15 11:48:51,382 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 716 transitions. Word has length 132 [2022-04-15 11:48:51,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:51,382 INFO L478 AbstractCegarLoop]: Abstraction has 469 states and 716 transitions. [2022-04-15 11:48:51,382 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:51,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 469 states and 716 transitions. [2022-04-15 11:48:52,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 716 edges. 716 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:52,066 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 716 transitions. [2022-04-15 11:48:52,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-04-15 11:48:52,066 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:52,067 INFO L499 BasicCegarLoop]: 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, 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-15 11:48:52,067 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-15 11:48:52,067 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:52,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:52,067 INFO L85 PathProgramCache]: Analyzing trace with hash 372080641, now seen corresponding path program 1 times [2022-04-15 11:48:52,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:52,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1819408904] [2022-04-15 11:48:52,139 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:48:52,139 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:48:52,139 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:48:52,139 INFO L85 PathProgramCache]: Analyzing trace with hash 372080641, now seen corresponding path program 2 times [2022-04-15 11:48:52,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:52,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215555425] [2022-04-15 11:48:52,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:52,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:52,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:52,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {98749#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {98742#true} is VALID [2022-04-15 11:48:52,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {98742#true} assume true; {98742#true} is VALID [2022-04-15 11:48:52,321 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98742#true} {98742#true} #678#return; {98742#true} is VALID [2022-04-15 11:48:52,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {98742#true} call ULTIMATE.init(); {98749#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:48:52,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {98749#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {98742#true} is VALID [2022-04-15 11:48:52,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {98742#true} assume true; {98742#true} is VALID [2022-04-15 11:48:52,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98742#true} {98742#true} #678#return; {98742#true} is VALID [2022-04-15 11:48:52,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {98742#true} call #t~ret161 := main(); {98742#true} is VALID [2022-04-15 11:48:52,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {98742#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; {98742#true} is VALID [2022-04-15 11:48:52,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {98742#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {98742#true} is VALID [2022-04-15 11:48:52,322 INFO L272 TraceCheckUtils]: 7: Hoare triple {98742#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {98742#true} is VALID [2022-04-15 11:48:52,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {98742#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); {98742#true} is VALID [2022-04-15 11:48:52,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {98742#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; {98742#true} is VALID [2022-04-15 11:48:52,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {98742#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; {98742#true} is VALID [2022-04-15 11:48:52,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {98742#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {98742#true} is VALID [2022-04-15 11:48:52,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {98742#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {98742#true} is VALID [2022-04-15 11:48:52,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {98742#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {98742#true} is VALID [2022-04-15 11:48:52,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {98742#true} assume !false; {98742#true} is VALID [2022-04-15 11:48:52,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {98742#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); {98742#true} is VALID [2022-04-15 11:48:52,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {98742#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {98742#true} is VALID [2022-04-15 11:48:52,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {98742#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {98742#true} is VALID [2022-04-15 11:48:52,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {98742#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {98742#true} is VALID [2022-04-15 11:48:52,323 INFO L290 TraceCheckUtils]: 19: Hoare triple {98742#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {98742#true} is VALID [2022-04-15 11:48:52,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {98742#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {98742#true} is VALID [2022-04-15 11:48:52,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {98742#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {98742#true} is VALID [2022-04-15 11:48:52,324 INFO L290 TraceCheckUtils]: 22: Hoare triple {98742#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {98742#true} is VALID [2022-04-15 11:48:52,324 INFO L290 TraceCheckUtils]: 23: Hoare triple {98742#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {98742#true} is VALID [2022-04-15 11:48:52,324 INFO L290 TraceCheckUtils]: 24: Hoare triple {98742#true} assume 8464 == #t~mem55;havoc #t~mem55; {98742#true} is VALID [2022-04-15 11:48:52,324 INFO L290 TraceCheckUtils]: 25: Hoare triple {98742#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; {98742#true} is VALID [2022-04-15 11:48:52,324 INFO L290 TraceCheckUtils]: 26: Hoare triple {98742#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {98742#true} is VALID [2022-04-15 11:48:52,324 INFO L290 TraceCheckUtils]: 27: Hoare triple {98742#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); {98742#true} is VALID [2022-04-15 11:48:52,324 INFO L290 TraceCheckUtils]: 28: Hoare triple {98742#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); {98742#true} is VALID [2022-04-15 11:48:52,324 INFO L290 TraceCheckUtils]: 29: Hoare triple {98742#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {98742#true} is VALID [2022-04-15 11:48:52,324 INFO L290 TraceCheckUtils]: 30: Hoare triple {98742#true} ~skip~0 := 0; {98742#true} is VALID [2022-04-15 11:48:52,324 INFO L290 TraceCheckUtils]: 31: Hoare triple {98742#true} assume !false; {98742#true} is VALID [2022-04-15 11:48:52,324 INFO L290 TraceCheckUtils]: 32: Hoare triple {98742#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); {98742#true} is VALID [2022-04-15 11:48:52,324 INFO L290 TraceCheckUtils]: 33: Hoare triple {98742#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {98742#true} is VALID [2022-04-15 11:48:52,324 INFO L290 TraceCheckUtils]: 34: Hoare triple {98742#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {98742#true} is VALID [2022-04-15 11:48:52,324 INFO L290 TraceCheckUtils]: 35: Hoare triple {98742#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {98742#true} is VALID [2022-04-15 11:48:52,324 INFO L290 TraceCheckUtils]: 36: Hoare triple {98742#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {98742#true} is VALID [2022-04-15 11:48:52,325 INFO L290 TraceCheckUtils]: 37: Hoare triple {98742#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {98742#true} is VALID [2022-04-15 11:48:52,325 INFO L290 TraceCheckUtils]: 38: Hoare triple {98742#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {98742#true} is VALID [2022-04-15 11:48:52,325 INFO L290 TraceCheckUtils]: 39: Hoare triple {98742#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {98742#true} is VALID [2022-04-15 11:48:52,325 INFO L290 TraceCheckUtils]: 40: Hoare triple {98742#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {98742#true} is VALID [2022-04-15 11:48:52,325 INFO L290 TraceCheckUtils]: 41: Hoare triple {98742#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {98742#true} is VALID [2022-04-15 11:48:52,325 INFO L290 TraceCheckUtils]: 42: Hoare triple {98742#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {98742#true} is VALID [2022-04-15 11:48:52,325 INFO L290 TraceCheckUtils]: 43: Hoare triple {98742#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {98742#true} is VALID [2022-04-15 11:48:52,325 INFO L290 TraceCheckUtils]: 44: Hoare triple {98742#true} assume 8496 == #t~mem58;havoc #t~mem58; {98742#true} is VALID [2022-04-15 11:48:52,325 INFO L290 TraceCheckUtils]: 45: Hoare triple {98742#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {98742#true} is VALID [2022-04-15 11:48:52,325 INFO L290 TraceCheckUtils]: 46: Hoare triple {98742#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {98742#true} is VALID [2022-04-15 11:48:52,325 INFO L290 TraceCheckUtils]: 47: Hoare triple {98742#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {98742#true} is VALID [2022-04-15 11:48:52,326 INFO L290 TraceCheckUtils]: 48: Hoare triple {98742#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {98747#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:52,327 INFO L290 TraceCheckUtils]: 49: Hoare triple {98747#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {98747#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:52,327 INFO L290 TraceCheckUtils]: 50: Hoare triple {98747#(not (= 8560 (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); {98747#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:52,328 INFO L290 TraceCheckUtils]: 51: Hoare triple {98747#(not (= 8560 (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; {98747#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:52,328 INFO L290 TraceCheckUtils]: 52: Hoare triple {98747#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {98747#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:52,328 INFO L290 TraceCheckUtils]: 53: Hoare triple {98747#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {98747#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:52,329 INFO L290 TraceCheckUtils]: 54: Hoare triple {98747#(not (= 8560 (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); {98747#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:52,329 INFO L290 TraceCheckUtils]: 55: Hoare triple {98747#(not (= 8560 (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); {98747#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:52,329 INFO L290 TraceCheckUtils]: 56: Hoare triple {98747#(not (= 8560 (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); {98747#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:52,330 INFO L290 TraceCheckUtils]: 57: Hoare triple {98747#(not (= 8560 (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); {98747#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:52,330 INFO L290 TraceCheckUtils]: 58: Hoare triple {98747#(not (= 8560 (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); {98747#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:52,330 INFO L290 TraceCheckUtils]: 59: Hoare triple {98747#(not (= 8560 (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); {98747#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:52,331 INFO L290 TraceCheckUtils]: 60: Hoare triple {98747#(not (= 8560 (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); {98747#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:52,331 INFO L290 TraceCheckUtils]: 61: Hoare triple {98747#(not (= 8560 (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); {98747#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:52,331 INFO L290 TraceCheckUtils]: 62: Hoare triple {98747#(not (= 8560 (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); {98747#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:52,332 INFO L290 TraceCheckUtils]: 63: Hoare triple {98747#(not (= 8560 (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); {98747#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:52,332 INFO L290 TraceCheckUtils]: 64: Hoare triple {98747#(not (= 8560 (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); {98747#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:52,332 INFO L290 TraceCheckUtils]: 65: Hoare triple {98747#(not (= 8560 (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); {98747#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:52,333 INFO L290 TraceCheckUtils]: 66: Hoare triple {98747#(not (= 8560 (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); {98747#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:52,333 INFO L290 TraceCheckUtils]: 67: Hoare triple {98747#(not (= 8560 (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); {98747#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:52,333 INFO L290 TraceCheckUtils]: 68: Hoare triple {98747#(not (= 8560 (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); {98747#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:52,334 INFO L290 TraceCheckUtils]: 69: Hoare triple {98747#(not (= 8560 (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); {98747#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:52,334 INFO L290 TraceCheckUtils]: 70: Hoare triple {98747#(not (= 8560 (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); {98747#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:52,334 INFO L290 TraceCheckUtils]: 71: Hoare triple {98747#(not (= 8560 (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); {98747#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:52,335 INFO L290 TraceCheckUtils]: 72: Hoare triple {98747#(not (= 8560 (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); {98747#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:52,335 INFO L290 TraceCheckUtils]: 73: Hoare triple {98747#(not (= 8560 (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); {98748#(not (= 8560 |ssl3_accept_#t~mem66|))} is VALID [2022-04-15 11:48:52,335 INFO L290 TraceCheckUtils]: 74: Hoare triple {98748#(not (= 8560 |ssl3_accept_#t~mem66|))} assume 8560 == #t~mem66;havoc #t~mem66; {98743#false} is VALID [2022-04-15 11:48:52,335 INFO L290 TraceCheckUtils]: 75: Hoare triple {98743#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {98743#false} is VALID [2022-04-15 11:48:52,335 INFO L290 TraceCheckUtils]: 76: Hoare triple {98743#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); {98743#false} is VALID [2022-04-15 11:48:52,336 INFO L290 TraceCheckUtils]: 77: Hoare triple {98743#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); {98743#false} is VALID [2022-04-15 11:48:52,336 INFO L290 TraceCheckUtils]: 78: Hoare triple {98743#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {98743#false} is VALID [2022-04-15 11:48:52,336 INFO L290 TraceCheckUtils]: 79: Hoare triple {98743#false} ~skip~0 := 0; {98743#false} is VALID [2022-04-15 11:48:52,336 INFO L290 TraceCheckUtils]: 80: Hoare triple {98743#false} assume !false; {98743#false} is VALID [2022-04-15 11:48:52,336 INFO L290 TraceCheckUtils]: 81: Hoare triple {98743#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); {98743#false} is VALID [2022-04-15 11:48:52,336 INFO L290 TraceCheckUtils]: 82: Hoare triple {98743#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,336 INFO L290 TraceCheckUtils]: 83: Hoare triple {98743#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,336 INFO L290 TraceCheckUtils]: 84: Hoare triple {98743#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,336 INFO L290 TraceCheckUtils]: 85: Hoare triple {98743#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,336 INFO L290 TraceCheckUtils]: 86: Hoare triple {98743#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,336 INFO L290 TraceCheckUtils]: 87: Hoare triple {98743#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,336 INFO L290 TraceCheckUtils]: 88: Hoare triple {98743#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,336 INFO L290 TraceCheckUtils]: 89: Hoare triple {98743#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,336 INFO L290 TraceCheckUtils]: 90: Hoare triple {98743#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,336 INFO L290 TraceCheckUtils]: 91: Hoare triple {98743#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,337 INFO L290 TraceCheckUtils]: 92: Hoare triple {98743#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,337 INFO L290 TraceCheckUtils]: 93: Hoare triple {98743#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,337 INFO L290 TraceCheckUtils]: 94: Hoare triple {98743#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,337 INFO L290 TraceCheckUtils]: 95: Hoare triple {98743#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,337 INFO L290 TraceCheckUtils]: 96: Hoare triple {98743#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,337 INFO L290 TraceCheckUtils]: 97: Hoare triple {98743#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,337 INFO L290 TraceCheckUtils]: 98: Hoare triple {98743#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,337 INFO L290 TraceCheckUtils]: 99: Hoare triple {98743#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,337 INFO L290 TraceCheckUtils]: 100: Hoare triple {98743#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,337 INFO L290 TraceCheckUtils]: 101: Hoare triple {98743#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,337 INFO L290 TraceCheckUtils]: 102: Hoare triple {98743#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,337 INFO L290 TraceCheckUtils]: 103: Hoare triple {98743#false} assume 8448 == #t~mem68;havoc #t~mem68; {98743#false} is VALID [2022-04-15 11:48:52,337 INFO L290 TraceCheckUtils]: 104: Hoare triple {98743#false} assume !(~num1~0 > 0); {98743#false} is VALID [2022-04-15 11:48:52,337 INFO L290 TraceCheckUtils]: 105: Hoare triple {98743#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; {98743#false} is VALID [2022-04-15 11:48:52,337 INFO L290 TraceCheckUtils]: 106: Hoare triple {98743#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); {98743#false} is VALID [2022-04-15 11:48:52,338 INFO L290 TraceCheckUtils]: 107: Hoare triple {98743#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {98743#false} is VALID [2022-04-15 11:48:52,338 INFO L290 TraceCheckUtils]: 108: Hoare triple {98743#false} ~skip~0 := 0; {98743#false} is VALID [2022-04-15 11:48:52,338 INFO L290 TraceCheckUtils]: 109: Hoare triple {98743#false} assume !false; {98743#false} is VALID [2022-04-15 11:48:52,338 INFO L290 TraceCheckUtils]: 110: Hoare triple {98743#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); {98743#false} is VALID [2022-04-15 11:48:52,338 INFO L290 TraceCheckUtils]: 111: Hoare triple {98743#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,338 INFO L290 TraceCheckUtils]: 112: Hoare triple {98743#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,338 INFO L290 TraceCheckUtils]: 113: Hoare triple {98743#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,338 INFO L290 TraceCheckUtils]: 114: Hoare triple {98743#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,338 INFO L290 TraceCheckUtils]: 115: Hoare triple {98743#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,338 INFO L290 TraceCheckUtils]: 116: Hoare triple {98743#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,338 INFO L290 TraceCheckUtils]: 117: Hoare triple {98743#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,338 INFO L290 TraceCheckUtils]: 118: Hoare triple {98743#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,338 INFO L290 TraceCheckUtils]: 119: Hoare triple {98743#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,338 INFO L290 TraceCheckUtils]: 120: Hoare triple {98743#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,339 INFO L290 TraceCheckUtils]: 121: Hoare triple {98743#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,339 INFO L290 TraceCheckUtils]: 122: Hoare triple {98743#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,339 INFO L290 TraceCheckUtils]: 123: Hoare triple {98743#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,339 INFO L290 TraceCheckUtils]: 124: Hoare triple {98743#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,339 INFO L290 TraceCheckUtils]: 125: Hoare triple {98743#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,339 INFO L290 TraceCheckUtils]: 126: Hoare triple {98743#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,339 INFO L290 TraceCheckUtils]: 127: Hoare triple {98743#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,339 INFO L290 TraceCheckUtils]: 128: Hoare triple {98743#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,339 INFO L290 TraceCheckUtils]: 129: Hoare triple {98743#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,339 INFO L290 TraceCheckUtils]: 130: Hoare triple {98743#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,339 INFO L290 TraceCheckUtils]: 131: Hoare triple {98743#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,339 INFO L290 TraceCheckUtils]: 132: Hoare triple {98743#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,339 INFO L290 TraceCheckUtils]: 133: Hoare triple {98743#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,339 INFO L290 TraceCheckUtils]: 134: Hoare triple {98743#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,339 INFO L290 TraceCheckUtils]: 135: Hoare triple {98743#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,340 INFO L290 TraceCheckUtils]: 136: Hoare triple {98743#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,340 INFO L290 TraceCheckUtils]: 137: Hoare triple {98743#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,340 INFO L290 TraceCheckUtils]: 138: Hoare triple {98743#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {98743#false} is VALID [2022-04-15 11:48:52,340 INFO L290 TraceCheckUtils]: 139: Hoare triple {98743#false} assume 8640 == #t~mem75;havoc #t~mem75; {98743#false} is VALID [2022-04-15 11:48:52,340 INFO L290 TraceCheckUtils]: 140: Hoare triple {98743#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {98743#false} is VALID [2022-04-15 11:48:52,340 INFO L290 TraceCheckUtils]: 141: Hoare triple {98743#false} assume !(4 == ~blastFlag~0); {98743#false} is VALID [2022-04-15 11:48:52,340 INFO L290 TraceCheckUtils]: 142: Hoare triple {98743#false} assume 7 == ~blastFlag~0; {98743#false} is VALID [2022-04-15 11:48:52,340 INFO L290 TraceCheckUtils]: 143: Hoare triple {98743#false} assume !false; {98743#false} is VALID [2022-04-15 11:48:52,340 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:48:52,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:52,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215555425] [2022-04-15 11:48:52,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215555425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:52,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:52,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:52,341 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:52,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1819408904] [2022-04-15 11:48:52,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1819408904] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:52,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:52,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:52,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057648820] [2022-04-15 11:48:52,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:52,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 144 [2022-04-15 11:48:52,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:52,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:52,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:52,411 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:48:52,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:52,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:48:52,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:48:52,411 INFO L87 Difference]: Start difference. First operand 469 states and 716 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:57,092 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:00,241 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:05,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:05,934 INFO L93 Difference]: Finished difference Result 1022 states and 1562 transitions. [2022-04-15 11:49:05,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:49:05,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 144 [2022-04-15 11:49:05,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:49:05,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:05,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 571 transitions. [2022-04-15 11:49:05,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:05,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 571 transitions. [2022-04-15 11:49:05,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 571 transitions. [2022-04-15 11:49:06,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 571 edges. 571 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:06,324 INFO L225 Difference]: With dead ends: 1022 [2022-04-15 11:49:06,324 INFO L226 Difference]: Without dead ends: 581 [2022-04-15 11:49:06,325 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:49:06,325 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 118 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 53 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:49:06,325 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 356 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 479 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2022-04-15 11:49:06,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2022-04-15 11:49:06,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 499. [2022-04-15 11:49:06,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:49:06,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 581 states. Second operand has 499 states, 494 states have (on average 1.5242914979757085) internal successors, (753), 494 states have internal predecessors, (753), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:06,362 INFO L74 IsIncluded]: Start isIncluded. First operand 581 states. Second operand has 499 states, 494 states have (on average 1.5242914979757085) internal successors, (753), 494 states have internal predecessors, (753), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:06,362 INFO L87 Difference]: Start difference. First operand 581 states. Second operand has 499 states, 494 states have (on average 1.5242914979757085) internal successors, (753), 494 states have internal predecessors, (753), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:06,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:06,372 INFO L93 Difference]: Finished difference Result 581 states and 871 transitions. [2022-04-15 11:49:06,372 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 871 transitions. [2022-04-15 11:49:06,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:06,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:06,373 INFO L74 IsIncluded]: Start isIncluded. First operand has 499 states, 494 states have (on average 1.5242914979757085) internal successors, (753), 494 states have internal predecessors, (753), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 581 states. [2022-04-15 11:49:06,373 INFO L87 Difference]: Start difference. First operand has 499 states, 494 states have (on average 1.5242914979757085) internal successors, (753), 494 states have internal predecessors, (753), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 581 states. [2022-04-15 11:49:06,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:06,384 INFO L93 Difference]: Finished difference Result 581 states and 871 transitions. [2022-04-15 11:49:06,384 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 871 transitions. [2022-04-15 11:49:06,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:06,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:06,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:49:06,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:49:06,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 494 states have (on average 1.5242914979757085) internal successors, (753), 494 states have internal predecessors, (753), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:06,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 757 transitions. [2022-04-15 11:49:06,395 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 757 transitions. Word has length 144 [2022-04-15 11:49:06,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:49:06,395 INFO L478 AbstractCegarLoop]: Abstraction has 499 states and 757 transitions. [2022-04-15 11:49:06,395 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:06,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 499 states and 757 transitions. [2022-04-15 11:49:07,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 757 edges. 757 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:07,133 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 757 transitions. [2022-04-15 11:49:07,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-15 11:49:07,134 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:49:07,134 INFO L499 BasicCegarLoop]: 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, 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-15 11:49:07,134 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-15 11:49:07,134 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:49:07,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:49:07,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1467985308, now seen corresponding path program 1 times [2022-04-15 11:49:07,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:07,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [365117053] [2022-04-15 11:49:07,212 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:49:07,212 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:49:07,212 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:49:07,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1467985308, now seen corresponding path program 2 times [2022-04-15 11:49:07,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:49:07,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119946712] [2022-04-15 11:49:07,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:49:07,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:49:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:07,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:49:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:07,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {102965#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {102958#true} is VALID [2022-04-15 11:49:07,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {102958#true} assume true; {102958#true} is VALID [2022-04-15 11:49:07,377 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {102958#true} {102958#true} #678#return; {102958#true} is VALID [2022-04-15 11:49:07,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {102958#true} call ULTIMATE.init(); {102965#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:49:07,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {102965#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {102958#true} is VALID [2022-04-15 11:49:07,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {102958#true} assume true; {102958#true} is VALID [2022-04-15 11:49:07,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {102958#true} {102958#true} #678#return; {102958#true} is VALID [2022-04-15 11:49:07,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {102958#true} call #t~ret161 := main(); {102958#true} is VALID [2022-04-15 11:49:07,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {102958#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; {102958#true} is VALID [2022-04-15 11:49:07,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {102958#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {102958#true} is VALID [2022-04-15 11:49:07,378 INFO L272 TraceCheckUtils]: 7: Hoare triple {102958#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {102958#true} is VALID [2022-04-15 11:49:07,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {102958#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); {102958#true} is VALID [2022-04-15 11:49:07,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {102958#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; {102958#true} is VALID [2022-04-15 11:49:07,378 INFO L290 TraceCheckUtils]: 10: Hoare triple {102958#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; {102958#true} is VALID [2022-04-15 11:49:07,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {102958#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {102958#true} is VALID [2022-04-15 11:49:07,379 INFO L290 TraceCheckUtils]: 12: Hoare triple {102958#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {102958#true} is VALID [2022-04-15 11:49:07,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {102958#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {102958#true} is VALID [2022-04-15 11:49:07,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {102958#true} assume !false; {102958#true} is VALID [2022-04-15 11:49:07,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {102958#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); {102958#true} is VALID [2022-04-15 11:49:07,379 INFO L290 TraceCheckUtils]: 16: Hoare triple {102958#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {102958#true} is VALID [2022-04-15 11:49:07,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {102958#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102958#true} is VALID [2022-04-15 11:49:07,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {102958#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102958#true} is VALID [2022-04-15 11:49:07,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {102958#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102958#true} is VALID [2022-04-15 11:49:07,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {102958#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102958#true} is VALID [2022-04-15 11:49:07,379 INFO L290 TraceCheckUtils]: 21: Hoare triple {102958#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102958#true} is VALID [2022-04-15 11:49:07,379 INFO L290 TraceCheckUtils]: 22: Hoare triple {102958#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102958#true} is VALID [2022-04-15 11:49:07,379 INFO L290 TraceCheckUtils]: 23: Hoare triple {102958#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102958#true} is VALID [2022-04-15 11:49:07,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {102958#true} assume 8464 == #t~mem55;havoc #t~mem55; {102958#true} is VALID [2022-04-15 11:49:07,379 INFO L290 TraceCheckUtils]: 25: Hoare triple {102958#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; {102958#true} is VALID [2022-04-15 11:49:07,380 INFO L290 TraceCheckUtils]: 26: Hoare triple {102958#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {102958#true} is VALID [2022-04-15 11:49:07,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {102958#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); {102958#true} is VALID [2022-04-15 11:49:07,380 INFO L290 TraceCheckUtils]: 28: Hoare triple {102958#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); {102958#true} is VALID [2022-04-15 11:49:07,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {102958#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {102958#true} is VALID [2022-04-15 11:49:07,380 INFO L290 TraceCheckUtils]: 30: Hoare triple {102958#true} ~skip~0 := 0; {102958#true} is VALID [2022-04-15 11:49:07,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {102958#true} assume !false; {102958#true} is VALID [2022-04-15 11:49:07,380 INFO L290 TraceCheckUtils]: 32: Hoare triple {102958#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); {102958#true} is VALID [2022-04-15 11:49:07,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {102958#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {102958#true} is VALID [2022-04-15 11:49:07,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {102958#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102958#true} is VALID [2022-04-15 11:49:07,380 INFO L290 TraceCheckUtils]: 35: Hoare triple {102958#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102958#true} is VALID [2022-04-15 11:49:07,380 INFO L290 TraceCheckUtils]: 36: Hoare triple {102958#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102958#true} is VALID [2022-04-15 11:49:07,380 INFO L290 TraceCheckUtils]: 37: Hoare triple {102958#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102958#true} is VALID [2022-04-15 11:49:07,380 INFO L290 TraceCheckUtils]: 38: Hoare triple {102958#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102958#true} is VALID [2022-04-15 11:49:07,380 INFO L290 TraceCheckUtils]: 39: Hoare triple {102958#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102958#true} is VALID [2022-04-15 11:49:07,380 INFO L290 TraceCheckUtils]: 40: Hoare triple {102958#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102958#true} is VALID [2022-04-15 11:49:07,381 INFO L290 TraceCheckUtils]: 41: Hoare triple {102958#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {102958#true} is VALID [2022-04-15 11:49:07,381 INFO L290 TraceCheckUtils]: 42: Hoare triple {102958#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {102958#true} is VALID [2022-04-15 11:49:07,381 INFO L290 TraceCheckUtils]: 43: Hoare triple {102958#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {102958#true} is VALID [2022-04-15 11:49:07,381 INFO L290 TraceCheckUtils]: 44: Hoare triple {102958#true} assume 8496 == #t~mem58;havoc #t~mem58; {102958#true} is VALID [2022-04-15 11:49:07,381 INFO L290 TraceCheckUtils]: 45: Hoare triple {102958#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {102958#true} is VALID [2022-04-15 11:49:07,381 INFO L290 TraceCheckUtils]: 46: Hoare triple {102958#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {102958#true} is VALID [2022-04-15 11:49:07,381 INFO L290 TraceCheckUtils]: 47: Hoare triple {102958#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {102958#true} is VALID [2022-04-15 11:49:07,382 INFO L290 TraceCheckUtils]: 48: Hoare triple {102958#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:07,383 INFO L290 TraceCheckUtils]: 49: Hoare triple {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:07,383 INFO L290 TraceCheckUtils]: 50: Hoare triple {102963#(not (= 8561 (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); {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:07,383 INFO L290 TraceCheckUtils]: 51: Hoare triple {102963#(not (= 8561 (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; {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:07,384 INFO L290 TraceCheckUtils]: 52: Hoare triple {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:07,384 INFO L290 TraceCheckUtils]: 53: Hoare triple {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:07,384 INFO L290 TraceCheckUtils]: 54: Hoare triple {102963#(not (= 8561 (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); {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:07,385 INFO L290 TraceCheckUtils]: 55: Hoare triple {102963#(not (= 8561 (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); {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:07,385 INFO L290 TraceCheckUtils]: 56: Hoare triple {102963#(not (= 8561 (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); {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:07,385 INFO L290 TraceCheckUtils]: 57: Hoare triple {102963#(not (= 8561 (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); {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:07,386 INFO L290 TraceCheckUtils]: 58: Hoare triple {102963#(not (= 8561 (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); {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:07,386 INFO L290 TraceCheckUtils]: 59: Hoare triple {102963#(not (= 8561 (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); {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:07,386 INFO L290 TraceCheckUtils]: 60: Hoare triple {102963#(not (= 8561 (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); {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:07,387 INFO L290 TraceCheckUtils]: 61: Hoare triple {102963#(not (= 8561 (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); {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:07,387 INFO L290 TraceCheckUtils]: 62: Hoare triple {102963#(not (= 8561 (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); {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:07,388 INFO L290 TraceCheckUtils]: 63: Hoare triple {102963#(not (= 8561 (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); {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:07,388 INFO L290 TraceCheckUtils]: 64: Hoare triple {102963#(not (= 8561 (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); {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:07,388 INFO L290 TraceCheckUtils]: 65: Hoare triple {102963#(not (= 8561 (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); {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:07,389 INFO L290 TraceCheckUtils]: 66: Hoare triple {102963#(not (= 8561 (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); {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:07,389 INFO L290 TraceCheckUtils]: 67: Hoare triple {102963#(not (= 8561 (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); {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:07,390 INFO L290 TraceCheckUtils]: 68: Hoare triple {102963#(not (= 8561 (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); {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:07,390 INFO L290 TraceCheckUtils]: 69: Hoare triple {102963#(not (= 8561 (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); {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:07,390 INFO L290 TraceCheckUtils]: 70: Hoare triple {102963#(not (= 8561 (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); {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:07,391 INFO L290 TraceCheckUtils]: 71: Hoare triple {102963#(not (= 8561 (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); {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:07,391 INFO L290 TraceCheckUtils]: 72: Hoare triple {102963#(not (= 8561 (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); {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:07,392 INFO L290 TraceCheckUtils]: 73: Hoare triple {102963#(not (= 8561 (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); {102963#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:07,392 INFO L290 TraceCheckUtils]: 74: Hoare triple {102963#(not (= 8561 (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); {102964#(not (= |ssl3_accept_#t~mem67| 8561))} is VALID [2022-04-15 11:49:07,392 INFO L290 TraceCheckUtils]: 75: Hoare triple {102964#(not (= |ssl3_accept_#t~mem67| 8561))} assume 8561 == #t~mem67;havoc #t~mem67; {102959#false} is VALID [2022-04-15 11:49:07,392 INFO L290 TraceCheckUtils]: 76: Hoare triple {102959#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {102959#false} is VALID [2022-04-15 11:49:07,392 INFO L290 TraceCheckUtils]: 77: Hoare triple {102959#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); {102959#false} is VALID [2022-04-15 11:49:07,393 INFO L290 TraceCheckUtils]: 78: Hoare triple {102959#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); {102959#false} is VALID [2022-04-15 11:49:07,393 INFO L290 TraceCheckUtils]: 79: Hoare triple {102959#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {102959#false} is VALID [2022-04-15 11:49:07,393 INFO L290 TraceCheckUtils]: 80: Hoare triple {102959#false} ~skip~0 := 0; {102959#false} is VALID [2022-04-15 11:49:07,393 INFO L290 TraceCheckUtils]: 81: Hoare triple {102959#false} assume !false; {102959#false} is VALID [2022-04-15 11:49:07,393 INFO L290 TraceCheckUtils]: 82: Hoare triple {102959#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); {102959#false} is VALID [2022-04-15 11:49:07,393 INFO L290 TraceCheckUtils]: 83: Hoare triple {102959#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,393 INFO L290 TraceCheckUtils]: 84: Hoare triple {102959#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,393 INFO L290 TraceCheckUtils]: 85: Hoare triple {102959#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,393 INFO L290 TraceCheckUtils]: 86: Hoare triple {102959#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,393 INFO L290 TraceCheckUtils]: 87: Hoare triple {102959#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,393 INFO L290 TraceCheckUtils]: 88: Hoare triple {102959#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,393 INFO L290 TraceCheckUtils]: 89: Hoare triple {102959#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,393 INFO L290 TraceCheckUtils]: 90: Hoare triple {102959#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,393 INFO L290 TraceCheckUtils]: 91: Hoare triple {102959#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,393 INFO L290 TraceCheckUtils]: 92: Hoare triple {102959#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,394 INFO L290 TraceCheckUtils]: 93: Hoare triple {102959#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,394 INFO L290 TraceCheckUtils]: 94: Hoare triple {102959#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,394 INFO L290 TraceCheckUtils]: 95: Hoare triple {102959#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,394 INFO L290 TraceCheckUtils]: 96: Hoare triple {102959#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,394 INFO L290 TraceCheckUtils]: 97: Hoare triple {102959#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,394 INFO L290 TraceCheckUtils]: 98: Hoare triple {102959#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,394 INFO L290 TraceCheckUtils]: 99: Hoare triple {102959#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,394 INFO L290 TraceCheckUtils]: 100: Hoare triple {102959#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,394 INFO L290 TraceCheckUtils]: 101: Hoare triple {102959#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,394 INFO L290 TraceCheckUtils]: 102: Hoare triple {102959#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,394 INFO L290 TraceCheckUtils]: 103: Hoare triple {102959#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,394 INFO L290 TraceCheckUtils]: 104: Hoare triple {102959#false} assume 8448 == #t~mem68;havoc #t~mem68; {102959#false} is VALID [2022-04-15 11:49:07,394 INFO L290 TraceCheckUtils]: 105: Hoare triple {102959#false} assume !(~num1~0 > 0); {102959#false} is VALID [2022-04-15 11:49:07,395 INFO L290 TraceCheckUtils]: 106: Hoare triple {102959#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; {102959#false} is VALID [2022-04-15 11:49:07,395 INFO L290 TraceCheckUtils]: 107: Hoare triple {102959#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); {102959#false} is VALID [2022-04-15 11:49:07,395 INFO L290 TraceCheckUtils]: 108: Hoare triple {102959#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {102959#false} is VALID [2022-04-15 11:49:07,395 INFO L290 TraceCheckUtils]: 109: Hoare triple {102959#false} ~skip~0 := 0; {102959#false} is VALID [2022-04-15 11:49:07,395 INFO L290 TraceCheckUtils]: 110: Hoare triple {102959#false} assume !false; {102959#false} is VALID [2022-04-15 11:49:07,395 INFO L290 TraceCheckUtils]: 111: Hoare triple {102959#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); {102959#false} is VALID [2022-04-15 11:49:07,395 INFO L290 TraceCheckUtils]: 112: Hoare triple {102959#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,395 INFO L290 TraceCheckUtils]: 113: Hoare triple {102959#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,395 INFO L290 TraceCheckUtils]: 114: Hoare triple {102959#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,395 INFO L290 TraceCheckUtils]: 115: Hoare triple {102959#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,395 INFO L290 TraceCheckUtils]: 116: Hoare triple {102959#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,395 INFO L290 TraceCheckUtils]: 117: Hoare triple {102959#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,395 INFO L290 TraceCheckUtils]: 118: Hoare triple {102959#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,395 INFO L290 TraceCheckUtils]: 119: Hoare triple {102959#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,395 INFO L290 TraceCheckUtils]: 120: Hoare triple {102959#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,396 INFO L290 TraceCheckUtils]: 121: Hoare triple {102959#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,396 INFO L290 TraceCheckUtils]: 122: Hoare triple {102959#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,396 INFO L290 TraceCheckUtils]: 123: Hoare triple {102959#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,396 INFO L290 TraceCheckUtils]: 124: Hoare triple {102959#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,396 INFO L290 TraceCheckUtils]: 125: Hoare triple {102959#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,396 INFO L290 TraceCheckUtils]: 126: Hoare triple {102959#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,396 INFO L290 TraceCheckUtils]: 127: Hoare triple {102959#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,396 INFO L290 TraceCheckUtils]: 128: Hoare triple {102959#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,396 INFO L290 TraceCheckUtils]: 129: Hoare triple {102959#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,396 INFO L290 TraceCheckUtils]: 130: Hoare triple {102959#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,396 INFO L290 TraceCheckUtils]: 131: Hoare triple {102959#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,396 INFO L290 TraceCheckUtils]: 132: Hoare triple {102959#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,396 INFO L290 TraceCheckUtils]: 133: Hoare triple {102959#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,396 INFO L290 TraceCheckUtils]: 134: Hoare triple {102959#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,396 INFO L290 TraceCheckUtils]: 135: Hoare triple {102959#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,397 INFO L290 TraceCheckUtils]: 136: Hoare triple {102959#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,397 INFO L290 TraceCheckUtils]: 137: Hoare triple {102959#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,397 INFO L290 TraceCheckUtils]: 138: Hoare triple {102959#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,397 INFO L290 TraceCheckUtils]: 139: Hoare triple {102959#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {102959#false} is VALID [2022-04-15 11:49:07,397 INFO L290 TraceCheckUtils]: 140: Hoare triple {102959#false} assume 8640 == #t~mem75;havoc #t~mem75; {102959#false} is VALID [2022-04-15 11:49:07,397 INFO L290 TraceCheckUtils]: 141: Hoare triple {102959#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {102959#false} is VALID [2022-04-15 11:49:07,397 INFO L290 TraceCheckUtils]: 142: Hoare triple {102959#false} assume !(4 == ~blastFlag~0); {102959#false} is VALID [2022-04-15 11:49:07,397 INFO L290 TraceCheckUtils]: 143: Hoare triple {102959#false} assume 7 == ~blastFlag~0; {102959#false} is VALID [2022-04-15 11:49:07,397 INFO L290 TraceCheckUtils]: 144: Hoare triple {102959#false} assume !false; {102959#false} is VALID [2022-04-15 11:49:07,398 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:49:07,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:49:07,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119946712] [2022-04-15 11:49:07,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119946712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:07,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:07,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:07,398 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:49:07,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [365117053] [2022-04-15 11:49:07,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [365117053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:07,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:07,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:07,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895743686] [2022-04-15 11:49:07,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:49:07,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-15 11:49:07,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:49:07,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:07,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:07,469 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:49:07,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:07,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:49:07,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:49:07,470 INFO L87 Difference]: Start difference. First operand 499 states and 757 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:11,025 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-15 11:49:13,323 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:18,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:18,779 INFO L93 Difference]: Finished difference Result 1040 states and 1578 transitions. [2022-04-15 11:49:18,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:49:18,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-15 11:49:18,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:49:18,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:18,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 571 transitions. [2022-04-15 11:49:18,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:18,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 571 transitions. [2022-04-15 11:49:18,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 571 transitions. [2022-04-15 11:49:19,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 571 edges. 571 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:19,171 INFO L225 Difference]: With dead ends: 1040 [2022-04-15 11:49:19,171 INFO L226 Difference]: Without dead ends: 569 [2022-04-15 11:49:19,172 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:49:19,172 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 117 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:49:19,172 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 356 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 476 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2022-04-15 11:49:19,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2022-04-15 11:49:19,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 499. [2022-04-15 11:49:19,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:49:19,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 569 states. Second operand has 499 states, 494 states have (on average 1.5101214574898785) internal successors, (746), 494 states have internal predecessors, (746), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:19,201 INFO L74 IsIncluded]: Start isIncluded. First operand 569 states. Second operand has 499 states, 494 states have (on average 1.5101214574898785) internal successors, (746), 494 states have internal predecessors, (746), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:19,201 INFO L87 Difference]: Start difference. First operand 569 states. Second operand has 499 states, 494 states have (on average 1.5101214574898785) internal successors, (746), 494 states have internal predecessors, (746), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:19,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:19,210 INFO L93 Difference]: Finished difference Result 569 states and 846 transitions. [2022-04-15 11:49:19,210 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 846 transitions. [2022-04-15 11:49:19,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:19,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:19,211 INFO L74 IsIncluded]: Start isIncluded. First operand has 499 states, 494 states have (on average 1.5101214574898785) internal successors, (746), 494 states have internal predecessors, (746), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 569 states. [2022-04-15 11:49:19,211 INFO L87 Difference]: Start difference. First operand has 499 states, 494 states have (on average 1.5101214574898785) internal successors, (746), 494 states have internal predecessors, (746), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 569 states. [2022-04-15 11:49:19,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:19,220 INFO L93 Difference]: Finished difference Result 569 states and 846 transitions. [2022-04-15 11:49:19,220 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 846 transitions. [2022-04-15 11:49:19,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:19,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:19,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:49:19,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:49:19,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 494 states have (on average 1.5101214574898785) internal successors, (746), 494 states have internal predecessors, (746), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:19,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 750 transitions. [2022-04-15 11:49:19,231 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 750 transitions. Word has length 145 [2022-04-15 11:49:19,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:49:19,231 INFO L478 AbstractCegarLoop]: Abstraction has 499 states and 750 transitions. [2022-04-15 11:49:19,231 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:19,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 499 states and 750 transitions. [2022-04-15 11:49:19,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 750 edges. 750 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:19,951 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 750 transitions. [2022-04-15 11:49:19,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-15 11:49:19,952 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:49:19,952 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:49:19,952 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-15 11:49:19,952 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:49:19,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:49:19,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1454627095, now seen corresponding path program 1 times [2022-04-15 11:49:19,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:19,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1649666061] [2022-04-15 11:49:20,216 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 21 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:49:20,216 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:49:20,216 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:49:20,217 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:401) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.makeReflexive(PredicateHelper.java:222) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:253) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 11:49:20,219 INFO L158 Benchmark]: Toolchain (without parser) took 406400.84ms. Allocated memory was 178.3MB in the beginning and 287.3MB in the end (delta: 109.1MB). Free memory was 124.3MB in the beginning and 194.0MB in the end (delta: -69.7MB). Peak memory consumption was 39.9MB. Max. memory is 8.0GB. [2022-04-15 11:49:20,220 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 178.3MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 11:49:20,220 INFO L158 Benchmark]: CACSL2BoogieTranslator took 528.26ms. Allocated memory was 178.3MB in the beginning and 239.1MB in the end (delta: 60.8MB). Free memory was 124.1MB in the beginning and 192.7MB in the end (delta: -68.6MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. [2022-04-15 11:49:20,220 INFO L158 Benchmark]: Boogie Preprocessor took 106.11ms. Allocated memory is still 239.1MB. Free memory was 192.7MB in the beginning and 182.7MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-15 11:49:20,220 INFO L158 Benchmark]: RCFGBuilder took 1589.81ms. Allocated memory is still 239.1MB. Free memory was 182.7MB in the beginning and 189.9MB in the end (delta: -7.2MB). Peak memory consumption was 78.8MB. Max. memory is 8.0GB. [2022-04-15 11:49:20,220 INFO L158 Benchmark]: TraceAbstraction took 404172.15ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 189.4MB in the beginning and 194.0MB in the end (delta: -4.6MB). Peak memory consumption was 44.7MB. Max. memory is 8.0GB. [2022-04-15 11:49:20,221 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 178.3MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 528.26ms. Allocated memory was 178.3MB in the beginning and 239.1MB in the end (delta: 60.8MB). Free memory was 124.1MB in the beginning and 192.7MB in the end (delta: -68.6MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 106.11ms. Allocated memory is still 239.1MB. Free memory was 192.7MB in the beginning and 182.7MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 1589.81ms. Allocated memory is still 239.1MB. Free memory was 182.7MB in the beginning and 189.9MB in the end (delta: -7.2MB). Peak memory consumption was 78.8MB. Max. memory is 8.0GB. * TraceAbstraction took 404172.15ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 189.4MB in the beginning and 194.0MB in the end (delta: -4.6MB). Peak memory consumption was 44.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 11:49:20,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...