/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.08.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:41:13,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:41:13,972 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:41:14,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:41:14,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:41:14,008 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:41:14,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:41:14,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:41:14,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:41:14,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:41:14,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:41:14,015 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:41:14,015 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:41:14,016 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:41:14,017 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:41:14,018 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:41:14,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:41:14,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:41:14,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:41:14,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:41:14,023 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:41:14,023 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:41:14,024 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:41:14,025 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:41:14,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:41:14,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:41:14,028 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:41:14,028 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:41:14,029 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:41:14,029 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:41:14,030 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:41:14,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:41:14,031 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:41:14,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:41:14,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:41:14,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:41:14,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:41:14,033 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:41:14,033 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:41:14,033 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:41:14,034 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:41:14,035 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:41:14,035 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 08:41:14,042 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:41:14,043 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:41:14,044 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:41:14,044 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:41:14,044 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:41:14,044 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:41:14,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:41:14,044 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:41:14,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:41:14,045 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:41:14,045 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:41:14,045 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:41:14,045 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:41:14,046 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:41:14,046 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:41:14,046 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:41:14,046 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:41:14,046 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:41:14,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:41:14,047 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:41:14,051 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:41:14,052 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:41:14,052 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:41:14,052 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:41:14,053 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:41:14,053 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-08 08:41:14,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:41:14,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:41:14,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:41:14,291 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:41:14,291 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:41:14,292 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.08.i.cil-2.c [2022-04-08 08:41:14,348 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac2e3a27e/c708900cfe544d188f9739e21dd516a5/FLAG767e59f0d [2022-04-08 08:41:14,835 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:41:14,836 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.08.i.cil-2.c [2022-04-08 08:41:14,866 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac2e3a27e/c708900cfe544d188f9739e21dd516a5/FLAG767e59f0d [2022-04-08 08:41:15,111 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac2e3a27e/c708900cfe544d188f9739e21dd516a5 [2022-04-08 08:41:15,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:41:15,114 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:41:15,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:41:15,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:41:15,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:41:15,118 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:41:15" (1/1) ... [2022-04-08 08:41:15,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@797e3df0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:41:15, skipping insertion in model container [2022-04-08 08:41:15,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:41:15" (1/1) ... [2022-04-08 08:41:15,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:41:15,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:41:15,566 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.08.i.cil-2.c[74416,74429] [2022-04-08 08:41:15,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:41:15,598 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:41:15,731 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.08.i.cil-2.c[74416,74429] [2022-04-08 08:41:15,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:41:15,751 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:41:15,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:41:15 WrapperNode [2022-04-08 08:41:15,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:41:15,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:41:15,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:41:15,753 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:41:15,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:41:15" (1/1) ... [2022-04-08 08:41:15,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:41:15" (1/1) ... [2022-04-08 08:41:15,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:41:15" (1/1) ... [2022-04-08 08:41:15,785 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:41:15" (1/1) ... [2022-04-08 08:41:15,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:41:15" (1/1) ... [2022-04-08 08:41:15,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:41:15" (1/1) ... [2022-04-08 08:41:15,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:41:15" (1/1) ... [2022-04-08 08:41:15,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:41:15,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:41:15,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:41:15,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:41:15,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:41:15" (1/1) ... [2022-04-08 08:41:15,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:41:15,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:41:15,894 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-08 08:41:15,909 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-08 08:41:15,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:41:15,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:41:15,936 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:41:15,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-08 08:41:15,936 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-08 08:41:15,936 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:41:15,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-08 08:41:15,937 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-08 08:41:15,937 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-08 08:41:15,937 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-08 08:41:15,937 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:41:15,938 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:41:15,939 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:41:15,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:41:15,939 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-08 08:41:15,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 08:41:15,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:41:15,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 08:41:15,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-08 08:41:15,939 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-08 08:41:15,940 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-08 08:41:15,940 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-08 08:41:15,940 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-08 08:41:15,940 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-08 08:41:15,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-08 08:41:15,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-08 08:41:15,940 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:41:15,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 08:41:15,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:41:15,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-08 08:41:15,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:41:15,941 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-08 08:41:15,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-08 08:41:15,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:41:15,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:41:15,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:41:15,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-08 08:41:15,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-08 08:41:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-08 08:41:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-08 08:41:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:41:16,131 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:41:16,133 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:41:16,902 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:41:17,473 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-08 08:41:17,473 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-08 08:41:17,484 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:41:17,494 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:41:17,495 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:41:17,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:41:17 BoogieIcfgContainer [2022-04-08 08:41:17,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:41:17,499 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:41:17,499 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:41:17,502 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:41:17,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:41:15" (1/3) ... [2022-04-08 08:41:17,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4e3867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:41:17, skipping insertion in model container [2022-04-08 08:41:17,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:41:15" (2/3) ... [2022-04-08 08:41:17,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4e3867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:41:17, skipping insertion in model container [2022-04-08 08:41:17,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:41:17" (3/3) ... [2022-04-08 08:41:17,506 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.08.i.cil-2.c [2022-04-08 08:41:17,512 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:41:17,513 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:41:17,556 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:41:17,562 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-08 08:41:17,562 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:41:17,587 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 150 states have (on average 1.7066666666666668) internal successors, (256), 151 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 08:41:17,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 08:41:17,597 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:41:17,597 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-08 08:41:17,597 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:41:17,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:41:17,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1567830887, now seen corresponding path program 1 times [2022-04-08 08:41:17,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:17,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [810504969] [2022-04-08 08:41:17,617 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:41:17,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1567830887, now seen corresponding path program 2 times [2022-04-08 08:41:17,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:41:17,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455389941] [2022-04-08 08:41:17,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:41:17,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:41:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:18,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:41:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:18,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {168#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {161#true} is VALID [2022-04-08 08:41:18,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-08 08:41:18,157 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #688#return; {161#true} is VALID [2022-04-08 08:41:18,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {168#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:41:18,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {161#true} is VALID [2022-04-08 08:41:18,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-08 08:41:18,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #688#return; {161#true} is VALID [2022-04-08 08:41:18,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret161 := main(); {161#true} is VALID [2022-04-08 08:41:18,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {161#true} is VALID [2022-04-08 08:41:18,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {161#true} is VALID [2022-04-08 08:41:18,162 INFO L272 TraceCheckUtils]: 7: Hoare triple {161#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {161#true} is VALID [2022-04-08 08:41:18,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {161#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {166#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:18,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {166#(= 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; {166#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:18,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {166#(= 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; {166#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:18,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {166#(= 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)))); {166#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:18,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {166#(= 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); {166#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:18,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {166#(= 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; {166#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:18,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {166#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {166#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:18,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {166#(= 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); {166#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:18,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {166#(= 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); {166#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:18,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {166#(= 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); {166#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:18,176 INFO L290 TraceCheckUtils]: 18: Hoare triple {166#(= 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); {166#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:18,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {166#(= 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); {166#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:18,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {166#(= 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); {166#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:18,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {166#(= 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); {166#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:18,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {166#(= 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); {166#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:18,180 INFO L290 TraceCheckUtils]: 23: Hoare triple {166#(= 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); {167#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-08 08:41:18,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {167#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {162#false} is VALID [2022-04-08 08:41:18,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {162#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {162#false} is VALID [2022-04-08 08:41:18,181 INFO L290 TraceCheckUtils]: 26: Hoare triple {162#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {162#false} is VALID [2022-04-08 08:41:18,182 INFO L290 TraceCheckUtils]: 27: Hoare triple {162#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {162#false} is VALID [2022-04-08 08:41:18,182 INFO L290 TraceCheckUtils]: 28: Hoare triple {162#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {162#false} is VALID [2022-04-08 08:41:18,182 INFO L290 TraceCheckUtils]: 29: Hoare triple {162#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {162#false} is VALID [2022-04-08 08:41:18,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {162#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {162#false} is VALID [2022-04-08 08:41:18,183 INFO L290 TraceCheckUtils]: 31: Hoare triple {162#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {162#false} is VALID [2022-04-08 08:41:18,183 INFO L290 TraceCheckUtils]: 32: Hoare triple {162#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {162#false} is VALID [2022-04-08 08:41:18,184 INFO L290 TraceCheckUtils]: 33: Hoare triple {162#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {162#false} is VALID [2022-04-08 08:41:18,184 INFO L290 TraceCheckUtils]: 34: Hoare triple {162#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {162#false} is VALID [2022-04-08 08:41:18,184 INFO L290 TraceCheckUtils]: 35: Hoare triple {162#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {162#false} is VALID [2022-04-08 08:41:18,184 INFO L290 TraceCheckUtils]: 36: Hoare triple {162#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {162#false} is VALID [2022-04-08 08:41:18,185 INFO L290 TraceCheckUtils]: 37: Hoare triple {162#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {162#false} is VALID [2022-04-08 08:41:18,186 INFO L290 TraceCheckUtils]: 38: Hoare triple {162#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {162#false} is VALID [2022-04-08 08:41:18,186 INFO L290 TraceCheckUtils]: 39: Hoare triple {162#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {162#false} is VALID [2022-04-08 08:41:18,186 INFO L290 TraceCheckUtils]: 40: Hoare triple {162#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {162#false} is VALID [2022-04-08 08:41:18,186 INFO L290 TraceCheckUtils]: 41: Hoare triple {162#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {162#false} is VALID [2022-04-08 08:41:18,187 INFO L290 TraceCheckUtils]: 42: Hoare triple {162#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {162#false} is VALID [2022-04-08 08:41:18,187 INFO L290 TraceCheckUtils]: 43: Hoare triple {162#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {162#false} is VALID [2022-04-08 08:41:18,187 INFO L290 TraceCheckUtils]: 44: Hoare triple {162#false} assume 8640 == #t~mem75;havoc #t~mem75; {162#false} is VALID [2022-04-08 08:41:18,187 INFO L290 TraceCheckUtils]: 45: Hoare triple {162#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {162#false} is VALID [2022-04-08 08:41:18,190 INFO L290 TraceCheckUtils]: 46: Hoare triple {162#false} assume !(4 == ~blastFlag~0); {162#false} is VALID [2022-04-08 08:41:18,190 INFO L290 TraceCheckUtils]: 47: Hoare triple {162#false} assume !(7 == ~blastFlag~0); {162#false} is VALID [2022-04-08 08:41:18,191 INFO L290 TraceCheckUtils]: 48: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-08 08:41:18,192 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-08 08:41:18,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:41:18,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455389941] [2022-04-08 08:41:18,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455389941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:18,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:18,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:18,200 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:41:18,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [810504969] [2022-04-08 08:41:18,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [810504969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:18,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:18,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:18,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785393996] [2022-04-08 08:41:18,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:41:18,208 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-08 08:41:18,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:41:18,212 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-08 08:41:18,268 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-08 08:41:18,268 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:41:18,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:18,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:41:18,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:41:18,309 INFO L87 Difference]: Start difference. First operand has 158 states, 150 states have (on average 1.7066666666666668) internal successors, (256), 151 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 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-08 08:41:24,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:24,075 INFO L93 Difference]: Finished difference Result 334 states and 560 transitions. [2022-04-08 08:41:24,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:41:24,075 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-08 08:41:24,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:41:24,077 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-08 08:41:24,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 560 transitions. [2022-04-08 08:41:24,101 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-08 08:41:24,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 560 transitions. [2022-04-08 08:41:24,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 560 transitions. [2022-04-08 08:41:24,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 560 edges. 560 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:24,598 INFO L225 Difference]: With dead ends: 334 [2022-04-08 08:41:24,598 INFO L226 Difference]: Without dead ends: 170 [2022-04-08 08:41:24,602 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-08 08:41:24,608 INFO L913 BasicCegarLoop]: 229 mSDtfsCounter, 34 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:41:24,609 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 607 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-08 08:41:24,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-04-08 08:41:24,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 153. [2022-04-08 08:41:24,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:41:24,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand has 153 states, 148 states have (on average 1.554054054054054) internal successors, (230), 148 states have internal predecessors, (230), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:24,663 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand has 153 states, 148 states have (on average 1.554054054054054) internal successors, (230), 148 states have internal predecessors, (230), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:24,663 INFO L87 Difference]: Start difference. First operand 170 states. Second operand has 153 states, 148 states have (on average 1.554054054054054) internal successors, (230), 148 states have internal predecessors, (230), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:24,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:24,674 INFO L93 Difference]: Finished difference Result 170 states and 255 transitions. [2022-04-08 08:41:24,675 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 255 transitions. [2022-04-08 08:41:24,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:24,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:24,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 148 states have (on average 1.554054054054054) internal successors, (230), 148 states have internal predecessors, (230), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 170 states. [2022-04-08 08:41:24,683 INFO L87 Difference]: Start difference. First operand has 153 states, 148 states have (on average 1.554054054054054) internal successors, (230), 148 states have internal predecessors, (230), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 170 states. [2022-04-08 08:41:24,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:24,693 INFO L93 Difference]: Finished difference Result 170 states and 255 transitions. [2022-04-08 08:41:24,693 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 255 transitions. [2022-04-08 08:41:24,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:24,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:24,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:41:24,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:41:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 148 states have (on average 1.554054054054054) internal successors, (230), 148 states have internal predecessors, (230), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:24,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 234 transitions. [2022-04-08 08:41:24,703 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 234 transitions. Word has length 49 [2022-04-08 08:41:24,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:41:24,704 INFO L478 AbstractCegarLoop]: Abstraction has 153 states and 234 transitions. [2022-04-08 08:41:24,704 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-08 08:41:24,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 153 states and 234 transitions. [2022-04-08 08:41:24,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:24,895 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 234 transitions. [2022-04-08 08:41:24,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-08 08:41:24,896 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:41:24,896 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:41:24,896 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:41:24,896 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:41:24,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:41:24,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1249968034, now seen corresponding path program 1 times [2022-04-08 08:41:24,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:24,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2082435357] [2022-04-08 08:41:24,928 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:41:24,929 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:41:24,929 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:41:24,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1249968034, now seen corresponding path program 2 times [2022-04-08 08:41:24,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:41:24,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862695796] [2022-04-08 08:41:24,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:41:24,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:41:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:25,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:41:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:25,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {1494#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {1487#true} is VALID [2022-04-08 08:41:25,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {1487#true} assume true; {1487#true} is VALID [2022-04-08 08:41:25,139 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1487#true} {1487#true} #688#return; {1487#true} is VALID [2022-04-08 08:41:25,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {1487#true} call ULTIMATE.init(); {1494#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-08 08:41:25,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {1494#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {1487#true} is VALID [2022-04-08 08:41:25,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {1487#true} assume true; {1487#true} is VALID [2022-04-08 08:41:25,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1487#true} {1487#true} #688#return; {1487#true} is VALID [2022-04-08 08:41:25,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {1487#true} call #t~ret161 := main(); {1487#true} is VALID [2022-04-08 08:41:25,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {1487#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; {1487#true} is VALID [2022-04-08 08:41:25,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {1487#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1487#true} is VALID [2022-04-08 08:41:25,141 INFO L272 TraceCheckUtils]: 7: Hoare triple {1487#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1487#true} is VALID [2022-04-08 08:41:25,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {1487#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); {1492#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:25,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {1492#(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; {1492#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:25,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {1492#(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; {1492#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:25,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {1492#(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)))); {1492#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:25,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {1492#(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); {1492#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:25,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {1492#(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; {1492#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:25,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {1492#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {1492#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:25,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {1492#(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); {1492#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:25,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {1492#(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); {1492#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:25,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {1492#(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); {1492#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:25,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {1492#(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); {1492#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:25,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {1492#(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); {1492#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:25,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {1492#(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); {1493#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-08 08:41:25,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {1493#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {1488#false} is VALID [2022-04-08 08:41:25,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {1488#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; {1488#false} is VALID [2022-04-08 08:41:25,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {1488#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); {1488#false} is VALID [2022-04-08 08:41:25,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {1488#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); {1488#false} is VALID [2022-04-08 08:41:25,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {1488#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {1488#false} is VALID [2022-04-08 08:41:25,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {1488#false} ~skip~0 := 0; {1488#false} is VALID [2022-04-08 08:41:25,153 INFO L290 TraceCheckUtils]: 27: Hoare triple {1488#false} assume !false; {1488#false} is VALID [2022-04-08 08:41:25,153 INFO L290 TraceCheckUtils]: 28: Hoare triple {1488#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); {1488#false} is VALID [2022-04-08 08:41:25,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {1488#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1488#false} is VALID [2022-04-08 08:41:25,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {1488#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1488#false} is VALID [2022-04-08 08:41:25,154 INFO L290 TraceCheckUtils]: 31: Hoare triple {1488#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1488#false} is VALID [2022-04-08 08:41:25,154 INFO L290 TraceCheckUtils]: 32: Hoare triple {1488#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1488#false} is VALID [2022-04-08 08:41:25,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {1488#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1488#false} is VALID [2022-04-08 08:41:25,154 INFO L290 TraceCheckUtils]: 34: Hoare triple {1488#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1488#false} is VALID [2022-04-08 08:41:25,154 INFO L290 TraceCheckUtils]: 35: Hoare triple {1488#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1488#false} is VALID [2022-04-08 08:41:25,154 INFO L290 TraceCheckUtils]: 36: Hoare triple {1488#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1488#false} is VALID [2022-04-08 08:41:25,154 INFO L290 TraceCheckUtils]: 37: Hoare triple {1488#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1488#false} is VALID [2022-04-08 08:41:25,155 INFO L290 TraceCheckUtils]: 38: Hoare triple {1488#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1488#false} is VALID [2022-04-08 08:41:25,155 INFO L290 TraceCheckUtils]: 39: Hoare triple {1488#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1488#false} is VALID [2022-04-08 08:41:25,158 INFO L290 TraceCheckUtils]: 40: Hoare triple {1488#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1488#false} is VALID [2022-04-08 08:41:25,158 INFO L290 TraceCheckUtils]: 41: Hoare triple {1488#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1488#false} is VALID [2022-04-08 08:41:25,158 INFO L290 TraceCheckUtils]: 42: Hoare triple {1488#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1488#false} is VALID [2022-04-08 08:41:25,161 INFO L290 TraceCheckUtils]: 43: Hoare triple {1488#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1488#false} is VALID [2022-04-08 08:41:25,161 INFO L290 TraceCheckUtils]: 44: Hoare triple {1488#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {1488#false} is VALID [2022-04-08 08:41:25,161 INFO L290 TraceCheckUtils]: 45: Hoare triple {1488#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {1488#false} is VALID [2022-04-08 08:41:25,162 INFO L290 TraceCheckUtils]: 46: Hoare triple {1488#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {1488#false} is VALID [2022-04-08 08:41:25,162 INFO L290 TraceCheckUtils]: 47: Hoare triple {1488#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {1488#false} is VALID [2022-04-08 08:41:25,162 INFO L290 TraceCheckUtils]: 48: Hoare triple {1488#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {1488#false} is VALID [2022-04-08 08:41:25,164 INFO L290 TraceCheckUtils]: 49: Hoare triple {1488#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {1488#false} is VALID [2022-04-08 08:41:25,164 INFO L290 TraceCheckUtils]: 50: Hoare triple {1488#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {1488#false} is VALID [2022-04-08 08:41:25,164 INFO L290 TraceCheckUtils]: 51: Hoare triple {1488#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {1488#false} is VALID [2022-04-08 08:41:25,164 INFO L290 TraceCheckUtils]: 52: Hoare triple {1488#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {1488#false} is VALID [2022-04-08 08:41:25,164 INFO L290 TraceCheckUtils]: 53: Hoare triple {1488#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {1488#false} is VALID [2022-04-08 08:41:25,165 INFO L290 TraceCheckUtils]: 54: Hoare triple {1488#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {1488#false} is VALID [2022-04-08 08:41:25,165 INFO L290 TraceCheckUtils]: 55: Hoare triple {1488#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {1488#false} is VALID [2022-04-08 08:41:25,166 INFO L290 TraceCheckUtils]: 56: Hoare triple {1488#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {1488#false} is VALID [2022-04-08 08:41:25,166 INFO L290 TraceCheckUtils]: 57: Hoare triple {1488#false} assume 8640 == #t~mem75;havoc #t~mem75; {1488#false} is VALID [2022-04-08 08:41:25,166 INFO L290 TraceCheckUtils]: 58: Hoare triple {1488#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {1488#false} is VALID [2022-04-08 08:41:25,168 INFO L290 TraceCheckUtils]: 59: Hoare triple {1488#false} assume !(4 == ~blastFlag~0); {1488#false} is VALID [2022-04-08 08:41:25,168 INFO L290 TraceCheckUtils]: 60: Hoare triple {1488#false} assume !(7 == ~blastFlag~0); {1488#false} is VALID [2022-04-08 08:41:25,176 INFO L290 TraceCheckUtils]: 61: Hoare triple {1488#false} assume !false; {1488#false} is VALID [2022-04-08 08:41:25,176 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:41:25,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:41:25,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862695796] [2022-04-08 08:41:25,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862695796] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:25,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:25,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:25,177 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:41:25,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2082435357] [2022-04-08 08:41:25,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2082435357] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:25,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:25,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:25,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841251161] [2022-04-08 08:41:25,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:41:25,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-08 08:41:25,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:41:25,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:25,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:25,241 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:41:25,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:25,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:41:25,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:41:25,242 INFO L87 Difference]: Start difference. First operand 153 states and 234 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:27,336 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:41:28,627 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-08 08:41:31,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:31,628 INFO L93 Difference]: Finished difference Result 397 states and 612 transitions. [2022-04-08 08:41:31,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:41:31,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-08 08:41:31,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:41:31,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-08 08:41:31,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:31,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-08 08:41:31,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-08 08:41:32,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 593 edges. 593 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:32,088 INFO L225 Difference]: With dead ends: 397 [2022-04-08 08:41:32,088 INFO L226 Difference]: Without dead ends: 270 [2022-04-08 08:41:32,089 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-08 08:41:32,090 INFO L913 BasicCegarLoop]: 259 mSDtfsCounter, 143 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:41:32,090 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 626 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-08 08:41:32,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-04-08 08:41:32,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 169. [2022-04-08 08:41:32,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:41:32,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 270 states. Second operand has 169 states, 164 states have (on average 1.5548780487804879) internal successors, (255), 164 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:32,103 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states. Second operand has 169 states, 164 states have (on average 1.5548780487804879) internal successors, (255), 164 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:32,104 INFO L87 Difference]: Start difference. First operand 270 states. Second operand has 169 states, 164 states have (on average 1.5548780487804879) internal successors, (255), 164 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:32,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:32,114 INFO L93 Difference]: Finished difference Result 270 states and 414 transitions. [2022-04-08 08:41:32,114 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 414 transitions. [2022-04-08 08:41:32,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:32,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:32,115 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 164 states have (on average 1.5548780487804879) internal successors, (255), 164 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 270 states. [2022-04-08 08:41:32,116 INFO L87 Difference]: Start difference. First operand has 169 states, 164 states have (on average 1.5548780487804879) internal successors, (255), 164 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 270 states. [2022-04-08 08:41:32,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:32,126 INFO L93 Difference]: Finished difference Result 270 states and 414 transitions. [2022-04-08 08:41:32,126 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 414 transitions. [2022-04-08 08:41:32,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:32,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:32,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:41:32,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:41:32,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.5548780487804879) internal successors, (255), 164 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:32,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 259 transitions. [2022-04-08 08:41:32,133 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 259 transitions. Word has length 62 [2022-04-08 08:41:32,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:41:32,133 INFO L478 AbstractCegarLoop]: Abstraction has 169 states and 259 transitions. [2022-04-08 08:41:32,134 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:32,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 169 states and 259 transitions. [2022-04-08 08:41:32,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:32,330 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 259 transitions. [2022-04-08 08:41:32,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 08:41:32,331 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:41:32,331 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:41:32,331 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:41:32,331 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:41:32,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:41:32,332 INFO L85 PathProgramCache]: Analyzing trace with hash 174782894, now seen corresponding path program 1 times [2022-04-08 08:41:32,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:32,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [387596182] [2022-04-08 08:41:32,355 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:41:32,355 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:41:32,355 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:41:32,355 INFO L85 PathProgramCache]: Analyzing trace with hash 174782894, now seen corresponding path program 2 times [2022-04-08 08:41:32,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:41:32,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571082416] [2022-04-08 08:41:32,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:41:32,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:41:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:32,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:41:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:32,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {3178#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {3171#true} is VALID [2022-04-08 08:41:32,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {3171#true} assume true; {3171#true} is VALID [2022-04-08 08:41:32,522 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3171#true} {3171#true} #688#return; {3171#true} is VALID [2022-04-08 08:41:32,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {3171#true} call ULTIMATE.init(); {3178#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-08 08:41:32,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {3178#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {3171#true} is VALID [2022-04-08 08:41:32,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {3171#true} assume true; {3171#true} is VALID [2022-04-08 08:41:32,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3171#true} {3171#true} #688#return; {3171#true} is VALID [2022-04-08 08:41:32,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {3171#true} call #t~ret161 := main(); {3171#true} is VALID [2022-04-08 08:41:32,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {3171#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; {3171#true} is VALID [2022-04-08 08:41:32,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {3171#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {3171#true} is VALID [2022-04-08 08:41:32,525 INFO L272 TraceCheckUtils]: 7: Hoare triple {3171#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3171#true} is VALID [2022-04-08 08:41:32,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {3171#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); {3176#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:32,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {3176#(= 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; {3176#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:32,529 INFO L290 TraceCheckUtils]: 10: Hoare triple {3176#(= 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; {3176#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:32,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {3176#(= 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)))); {3176#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:32,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {3176#(= 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); {3176#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:32,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {3176#(= 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; {3176#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:32,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {3176#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {3176#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:41:32,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {3176#(= 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); {3177#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-08 08:41:32,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {3177#(= 8464 |ssl3_accept_#t~mem47|)} assume 12292 == #t~mem47;havoc #t~mem47; {3172#false} is VALID [2022-04-08 08:41:32,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {3172#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {3172#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {3172#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {3172#false} is VALID [2022-04-08 08:41:32,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {3172#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {3172#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); {3172#false} is VALID [2022-04-08 08:41:32,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {3172#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {3172#false} is VALID [2022-04-08 08:41:32,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {3172#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); {3172#false} is VALID [2022-04-08 08:41:32,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {3172#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); {3172#false} is VALID [2022-04-08 08:41:32,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {3172#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); {3172#false} is VALID [2022-04-08 08:41:32,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {3172#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {3172#false} is VALID [2022-04-08 08:41:32,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {3172#false} ~skip~0 := 0; {3172#false} is VALID [2022-04-08 08:41:32,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {3172#false} assume !false; {3172#false} is VALID [2022-04-08 08:41:32,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {3172#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); {3172#false} is VALID [2022-04-08 08:41:32,536 INFO L290 TraceCheckUtils]: 30: Hoare triple {3172#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,536 INFO L290 TraceCheckUtils]: 31: Hoare triple {3172#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {3172#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,536 INFO L290 TraceCheckUtils]: 33: Hoare triple {3172#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,536 INFO L290 TraceCheckUtils]: 34: Hoare triple {3172#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,536 INFO L290 TraceCheckUtils]: 35: Hoare triple {3172#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,536 INFO L290 TraceCheckUtils]: 36: Hoare triple {3172#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,536 INFO L290 TraceCheckUtils]: 37: Hoare triple {3172#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,537 INFO L290 TraceCheckUtils]: 38: Hoare triple {3172#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,537 INFO L290 TraceCheckUtils]: 39: Hoare triple {3172#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,537 INFO L290 TraceCheckUtils]: 40: Hoare triple {3172#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,537 INFO L290 TraceCheckUtils]: 41: Hoare triple {3172#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,537 INFO L290 TraceCheckUtils]: 42: Hoare triple {3172#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,537 INFO L290 TraceCheckUtils]: 43: Hoare triple {3172#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,537 INFO L290 TraceCheckUtils]: 44: Hoare triple {3172#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,538 INFO L290 TraceCheckUtils]: 45: Hoare triple {3172#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,538 INFO L290 TraceCheckUtils]: 46: Hoare triple {3172#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,538 INFO L290 TraceCheckUtils]: 47: Hoare triple {3172#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,539 INFO L290 TraceCheckUtils]: 48: Hoare triple {3172#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,539 INFO L290 TraceCheckUtils]: 49: Hoare triple {3172#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,539 INFO L290 TraceCheckUtils]: 50: Hoare triple {3172#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,539 INFO L290 TraceCheckUtils]: 51: Hoare triple {3172#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,539 INFO L290 TraceCheckUtils]: 52: Hoare triple {3172#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,539 INFO L290 TraceCheckUtils]: 53: Hoare triple {3172#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,540 INFO L290 TraceCheckUtils]: 54: Hoare triple {3172#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,540 INFO L290 TraceCheckUtils]: 55: Hoare triple {3172#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,540 INFO L290 TraceCheckUtils]: 56: Hoare triple {3172#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,540 INFO L290 TraceCheckUtils]: 57: Hoare triple {3172#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {3172#false} is VALID [2022-04-08 08:41:32,540 INFO L290 TraceCheckUtils]: 58: Hoare triple {3172#false} assume 8640 == #t~mem75;havoc #t~mem75; {3172#false} is VALID [2022-04-08 08:41:32,540 INFO L290 TraceCheckUtils]: 59: Hoare triple {3172#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {3172#false} is VALID [2022-04-08 08:41:32,540 INFO L290 TraceCheckUtils]: 60: Hoare triple {3172#false} assume !(4 == ~blastFlag~0); {3172#false} is VALID [2022-04-08 08:41:32,540 INFO L290 TraceCheckUtils]: 61: Hoare triple {3172#false} assume !(7 == ~blastFlag~0); {3172#false} is VALID [2022-04-08 08:41:32,541 INFO L290 TraceCheckUtils]: 62: Hoare triple {3172#false} assume !false; {3172#false} is VALID [2022-04-08 08:41:32,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:41:32,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:41:32,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571082416] [2022-04-08 08:41:32,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571082416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:32,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:32,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:32,542 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:41:32,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [387596182] [2022-04-08 08:41:32,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [387596182] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:32,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:32,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:32,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150698322] [2022-04-08 08:41:32,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:41:32,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-08 08:41:32,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:41:32,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:32,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:32,591 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:41:32,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:32,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:41:32,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:41:32,592 INFO L87 Difference]: Start difference. First operand 169 states and 259 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:34,387 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-08 08:41:40,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:40,931 INFO L93 Difference]: Finished difference Result 328 states and 501 transitions. [2022-04-08 08:41:40,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:41:40,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-08 08:41:40,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:41:40,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:40,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2022-04-08 08:41:40,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:40,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2022-04-08 08:41:40,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 449 transitions. [2022-04-08 08:41:41,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 449 edges. 449 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:41,264 INFO L225 Difference]: With dead ends: 328 [2022-04-08 08:41:41,264 INFO L226 Difference]: Without dead ends: 185 [2022-04-08 08:41:41,264 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-08 08:41:41,265 INFO L913 BasicCegarLoop]: 188 mSDtfsCounter, 28 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:41:41,266 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 485 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-08 08:41:41,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-04-08 08:41:41,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 169. [2022-04-08 08:41:41,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:41:41,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 169 states, 164 states have (on average 1.548780487804878) internal successors, (254), 164 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:41,280 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 169 states, 164 states have (on average 1.548780487804878) internal successors, (254), 164 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:41,281 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 169 states, 164 states have (on average 1.548780487804878) internal successors, (254), 164 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:41,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:41,289 INFO L93 Difference]: Finished difference Result 185 states and 278 transitions. [2022-04-08 08:41:41,289 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 278 transitions. [2022-04-08 08:41:41,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:41,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:41,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 164 states have (on average 1.548780487804878) internal successors, (254), 164 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 185 states. [2022-04-08 08:41:41,290 INFO L87 Difference]: Start difference. First operand has 169 states, 164 states have (on average 1.548780487804878) internal successors, (254), 164 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 185 states. [2022-04-08 08:41:41,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:41,307 INFO L93 Difference]: Finished difference Result 185 states and 278 transitions. [2022-04-08 08:41:41,307 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 278 transitions. [2022-04-08 08:41:41,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:41,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:41,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:41:41,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:41:41,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.548780487804878) internal successors, (254), 164 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:41,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 258 transitions. [2022-04-08 08:41:41,312 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 258 transitions. Word has length 63 [2022-04-08 08:41:41,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:41:41,312 INFO L478 AbstractCegarLoop]: Abstraction has 169 states and 258 transitions. [2022-04-08 08:41:41,312 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:41,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 169 states and 258 transitions. [2022-04-08 08:41:41,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:41,510 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 258 transitions. [2022-04-08 08:41:41,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 08:41:41,511 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:41:41,511 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:41:41,511 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:41:41,512 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:41:41,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:41:41,512 INFO L85 PathProgramCache]: Analyzing trace with hash -872727910, now seen corresponding path program 1 times [2022-04-08 08:41:41,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:41,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [402178475] [2022-04-08 08:41:41,689 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-08 08:41:41,689 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:41:41,690 INFO L85 PathProgramCache]: Analyzing trace with hash 105327204, now seen corresponding path program 1 times [2022-04-08 08:41:41,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:41:41,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986418360] [2022-04-08 08:41:41,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:41:41,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:41:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:42,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:41:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:42,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {4556#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {4547#true} is VALID [2022-04-08 08:41:42,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {4547#true} assume true; {4547#true} is VALID [2022-04-08 08:41:42,229 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4547#true} {4547#true} #688#return; {4547#true} is VALID [2022-04-08 08:41:42,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {4547#true} call ULTIMATE.init(); {4556#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-08 08:41:42,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {4556#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {4547#true} is VALID [2022-04-08 08:41:42,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {4547#true} assume true; {4547#true} is VALID [2022-04-08 08:41:42,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4547#true} {4547#true} #688#return; {4547#true} is VALID [2022-04-08 08:41:42,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {4547#true} call #t~ret161 := main(); {4547#true} is VALID [2022-04-08 08:41:42,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {4547#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; {4547#true} is VALID [2022-04-08 08:41:42,232 INFO L290 TraceCheckUtils]: 6: Hoare triple {4547#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {4552#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 136)) 0) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 136)) 0))} is VALID [2022-04-08 08:41:42,233 INFO L272 TraceCheckUtils]: 7: Hoare triple {4552#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 136)) 0) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 136)) 0))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {4553#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136))))} is VALID [2022-04-08 08:41:42,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {4553#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136))))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {4554#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-08 08:41:42,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {4554#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {4554#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-08 08:41:42,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {4554#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {4554#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-08 08:41:42,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {4554#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4554#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-08 08:41:42,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {4554#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {4555#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} is VALID [2022-04-08 08:41:42,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {4555#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {4548#false} is VALID [2022-04-08 08:41:42,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {4548#false} [694] L1167-2-->L1168_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_8|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_250|, 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_10|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_8|, 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_8|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_8|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_10|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_5|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_15, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_4|, #memory_int=|v_#memory_int_251|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_250|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_7} 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] {4548#false} is VALID [2022-04-08 08:41:42,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {4548#false} [693] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4548#false} is VALID [2022-04-08 08:41:42,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {4548#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); {4548#false} is VALID [2022-04-08 08:41:42,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {4548#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {4548#false} is VALID [2022-04-08 08:41:42,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {4548#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4548#false} is VALID [2022-04-08 08:41:42,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {4548#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4548#false} is VALID [2022-04-08 08:41:42,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {4548#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4548#false} is VALID [2022-04-08 08:41:42,242 INFO L290 TraceCheckUtils]: 21: Hoare triple {4548#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4548#false} is VALID [2022-04-08 08:41:42,242 INFO L290 TraceCheckUtils]: 22: Hoare triple {4548#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4548#false} is VALID [2022-04-08 08:41:42,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {4548#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4548#false} is VALID [2022-04-08 08:41:42,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {4548#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4548#false} is VALID [2022-04-08 08:41:42,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {4548#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4548#false} is VALID [2022-04-08 08:41:42,243 INFO L290 TraceCheckUtils]: 26: Hoare triple {4548#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4548#false} is VALID [2022-04-08 08:41:42,243 INFO L290 TraceCheckUtils]: 27: Hoare triple {4548#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4548#false} is VALID [2022-04-08 08:41:42,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {4548#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4548#false} is VALID [2022-04-08 08:41:42,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {4548#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4548#false} is VALID [2022-04-08 08:41:42,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {4548#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4548#false} is VALID [2022-04-08 08:41:42,244 INFO L290 TraceCheckUtils]: 31: Hoare triple {4548#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4548#false} is VALID [2022-04-08 08:41:42,244 INFO L290 TraceCheckUtils]: 32: Hoare triple {4548#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {4548#false} is VALID [2022-04-08 08:41:42,244 INFO L290 TraceCheckUtils]: 33: Hoare triple {4548#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {4548#false} is VALID [2022-04-08 08:41:42,244 INFO L290 TraceCheckUtils]: 34: Hoare triple {4548#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {4548#false} is VALID [2022-04-08 08:41:42,244 INFO L290 TraceCheckUtils]: 35: Hoare triple {4548#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {4548#false} is VALID [2022-04-08 08:41:42,244 INFO L290 TraceCheckUtils]: 36: Hoare triple {4548#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {4548#false} is VALID [2022-04-08 08:41:42,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {4548#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {4548#false} is VALID [2022-04-08 08:41:42,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {4548#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {4548#false} is VALID [2022-04-08 08:41:42,245 INFO L290 TraceCheckUtils]: 39: Hoare triple {4548#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {4548#false} is VALID [2022-04-08 08:41:42,245 INFO L290 TraceCheckUtils]: 40: Hoare triple {4548#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {4548#false} is VALID [2022-04-08 08:41:42,245 INFO L290 TraceCheckUtils]: 41: Hoare triple {4548#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {4548#false} is VALID [2022-04-08 08:41:42,245 INFO L290 TraceCheckUtils]: 42: Hoare triple {4548#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {4548#false} is VALID [2022-04-08 08:41:42,245 INFO L290 TraceCheckUtils]: 43: Hoare triple {4548#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {4548#false} is VALID [2022-04-08 08:41:42,245 INFO L290 TraceCheckUtils]: 44: Hoare triple {4548#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {4548#false} is VALID [2022-04-08 08:41:42,246 INFO L290 TraceCheckUtils]: 45: Hoare triple {4548#false} assume 8640 == #t~mem75;havoc #t~mem75; {4548#false} is VALID [2022-04-08 08:41:42,246 INFO L290 TraceCheckUtils]: 46: Hoare triple {4548#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {4548#false} is VALID [2022-04-08 08:41:42,246 INFO L290 TraceCheckUtils]: 47: Hoare triple {4548#false} assume !(4 == ~blastFlag~0); {4548#false} is VALID [2022-04-08 08:41:42,246 INFO L290 TraceCheckUtils]: 48: Hoare triple {4548#false} assume !(7 == ~blastFlag~0); {4548#false} is VALID [2022-04-08 08:41:42,246 INFO L290 TraceCheckUtils]: 49: Hoare triple {4548#false} assume !false; {4548#false} is VALID [2022-04-08 08:41:42,247 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-08 08:41:42,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:41:42,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986418360] [2022-04-08 08:41:42,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986418360] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:42,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:42,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 08:41:42,249 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:41:42,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [402178475] [2022-04-08 08:41:42,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [402178475] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:42,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:42,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 08:41:42,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576239361] [2022-04-08 08:41:42,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:41:42,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-08 08:41:42,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:41:42,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:42,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:42,305 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 08:41:42,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:42,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 08:41:42,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 08:41:42,306 INFO L87 Difference]: Start difference. First operand 169 states and 258 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:44,639 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:41:48,146 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-08 08:41:52,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:52,977 INFO L93 Difference]: Finished difference Result 331 states and 508 transitions. [2022-04-08 08:41:52,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 08:41:52,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-08 08:41:52,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:41:52,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:52,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 422 transitions. [2022-04-08 08:41:52,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:52,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 422 transitions. [2022-04-08 08:41:52,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 422 transitions. [2022-04-08 08:41:53,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 422 edges. 422 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:53,299 INFO L225 Difference]: With dead ends: 331 [2022-04-08 08:41:53,300 INFO L226 Difference]: Without dead ends: 169 [2022-04-08 08:41:53,300 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 08:41:53,301 INFO L913 BasicCegarLoop]: 209 mSDtfsCounter, 7 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:41:53,301 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 841 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-04-08 08:41:53,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-04-08 08:41:53,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-04-08 08:41:53,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:41:53,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 169 states, 164 states have (on average 1.5426829268292683) internal successors, (253), 164 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:53,309 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 169 states, 164 states have (on average 1.5426829268292683) internal successors, (253), 164 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:53,309 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 169 states, 164 states have (on average 1.5426829268292683) internal successors, (253), 164 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:53,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:53,312 INFO L93 Difference]: Finished difference Result 169 states and 257 transitions. [2022-04-08 08:41:53,312 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 257 transitions. [2022-04-08 08:41:53,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:53,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:53,313 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 164 states have (on average 1.5426829268292683) internal successors, (253), 164 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 169 states. [2022-04-08 08:41:53,314 INFO L87 Difference]: Start difference. First operand has 169 states, 164 states have (on average 1.5426829268292683) internal successors, (253), 164 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 169 states. [2022-04-08 08:41:53,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:53,317 INFO L93 Difference]: Finished difference Result 169 states and 257 transitions. [2022-04-08 08:41:53,317 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 257 transitions. [2022-04-08 08:41:53,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:53,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:53,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:41:53,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:41:53,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.5426829268292683) internal successors, (253), 164 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:53,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 257 transitions. [2022-04-08 08:41:53,321 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 257 transitions. Word has length 63 [2022-04-08 08:41:53,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:41:53,322 INFO L478 AbstractCegarLoop]: Abstraction has 169 states and 257 transitions. [2022-04-08 08:41:53,322 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:53,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 169 states and 257 transitions. [2022-04-08 08:41:53,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:53,498 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 257 transitions. [2022-04-08 08:41:53,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 08:41:53,499 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:41:53,499 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:41:53,499 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:41:53,499 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:41:53,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:41:53,500 INFO L85 PathProgramCache]: Analyzing trace with hash 388189340, now seen corresponding path program 1 times [2022-04-08 08:41:53,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:53,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [279490393] [2022-04-08 08:41:53,635 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-08 08:41:53,636 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:41:53,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1112534370, now seen corresponding path program 1 times [2022-04-08 08:41:53,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:41:53,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389639211] [2022-04-08 08:41:53,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:41:53,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:41:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:41:53,889 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 08:41:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:41:54,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 08:41:54,095 INFO L85 PathProgramCache]: Analyzing trace with hash 388189340, now seen corresponding path program 2 times [2022-04-08 08:41:54,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:41:54,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152277883] [2022-04-08 08:41:54,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:41:54,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:41:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:54,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:41:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:54,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {5910#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {5903#true} is VALID [2022-04-08 08:41:54,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {5903#true} assume true; {5903#true} is VALID [2022-04-08 08:41:54,213 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5903#true} {5903#true} #688#return; {5903#true} is VALID [2022-04-08 08:41:54,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {5903#true} call ULTIMATE.init(); {5910#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-08 08:41:54,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {5910#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {5903#true} is VALID [2022-04-08 08:41:54,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {5903#true} assume true; {5903#true} is VALID [2022-04-08 08:41:54,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5903#true} {5903#true} #688#return; {5903#true} is VALID [2022-04-08 08:41:54,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {5903#true} call #t~ret161 := main(); {5903#true} is VALID [2022-04-08 08:41:54,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {5903#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; {5903#true} is VALID [2022-04-08 08:41:54,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {5903#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {5903#true} is VALID [2022-04-08 08:41:54,215 INFO L272 TraceCheckUtils]: 7: Hoare triple {5903#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5903#true} is VALID [2022-04-08 08:41:54,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {5903#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); {5908#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:54,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {5908#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {5908#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:54,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {5908#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {5908#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:54,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {5908#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5908#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:54,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {5908#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {5908#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:54,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {5908#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {5908#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:54,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {5908#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {5908#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:54,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {5908#(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); {5908#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:41:54,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {5908#(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); {5909#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-08 08:41:54,234 INFO L290 TraceCheckUtils]: 17: Hoare triple {5909#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {5904#false} is VALID [2022-04-08 08:41:54,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {5904#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {5904#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {5904#false} is VALID [2022-04-08 08:41:54,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {5904#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {5904#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); {5904#false} is VALID [2022-04-08 08:41:54,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {5904#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {5904#false} is VALID [2022-04-08 08:41:54,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {5904#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); {5904#false} is VALID [2022-04-08 08:41:54,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {5904#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); {5904#false} is VALID [2022-04-08 08:41:54,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {5904#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); {5904#false} is VALID [2022-04-08 08:41:54,235 INFO L290 TraceCheckUtils]: 26: Hoare triple {5904#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {5904#false} is VALID [2022-04-08 08:41:54,235 INFO L290 TraceCheckUtils]: 27: Hoare triple {5904#false} ~skip~0 := 0; {5904#false} is VALID [2022-04-08 08:41:54,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {5904#false} assume !false; {5904#false} is VALID [2022-04-08 08:41:54,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {5904#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); {5904#false} is VALID [2022-04-08 08:41:54,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {5904#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {5904#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,235 INFO L290 TraceCheckUtils]: 32: Hoare triple {5904#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {5904#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,235 INFO L290 TraceCheckUtils]: 34: Hoare triple {5904#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,235 INFO L290 TraceCheckUtils]: 35: Hoare triple {5904#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,236 INFO L290 TraceCheckUtils]: 36: Hoare triple {5904#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,236 INFO L290 TraceCheckUtils]: 37: Hoare triple {5904#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,236 INFO L290 TraceCheckUtils]: 38: Hoare triple {5904#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,236 INFO L290 TraceCheckUtils]: 39: Hoare triple {5904#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,236 INFO L290 TraceCheckUtils]: 40: Hoare triple {5904#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,236 INFO L290 TraceCheckUtils]: 41: Hoare triple {5904#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,236 INFO L290 TraceCheckUtils]: 42: Hoare triple {5904#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,236 INFO L290 TraceCheckUtils]: 43: Hoare triple {5904#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,237 INFO L290 TraceCheckUtils]: 44: Hoare triple {5904#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,237 INFO L290 TraceCheckUtils]: 45: Hoare triple {5904#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,237 INFO L290 TraceCheckUtils]: 46: Hoare triple {5904#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,237 INFO L290 TraceCheckUtils]: 47: Hoare triple {5904#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,237 INFO L290 TraceCheckUtils]: 48: Hoare triple {5904#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,237 INFO L290 TraceCheckUtils]: 49: Hoare triple {5904#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,237 INFO L290 TraceCheckUtils]: 50: Hoare triple {5904#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,237 INFO L290 TraceCheckUtils]: 51: Hoare triple {5904#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,237 INFO L290 TraceCheckUtils]: 52: Hoare triple {5904#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,238 INFO L290 TraceCheckUtils]: 53: Hoare triple {5904#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,238 INFO L290 TraceCheckUtils]: 54: Hoare triple {5904#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,238 INFO L290 TraceCheckUtils]: 55: Hoare triple {5904#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,238 INFO L290 TraceCheckUtils]: 56: Hoare triple {5904#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,238 INFO L290 TraceCheckUtils]: 57: Hoare triple {5904#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {5904#false} is VALID [2022-04-08 08:41:54,238 INFO L290 TraceCheckUtils]: 58: Hoare triple {5904#false} assume 8640 == #t~mem75;havoc #t~mem75; {5904#false} is VALID [2022-04-08 08:41:54,238 INFO L290 TraceCheckUtils]: 59: Hoare triple {5904#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {5904#false} is VALID [2022-04-08 08:41:54,238 INFO L290 TraceCheckUtils]: 60: Hoare triple {5904#false} assume !(4 == ~blastFlag~0); {5904#false} is VALID [2022-04-08 08:41:54,238 INFO L290 TraceCheckUtils]: 61: Hoare triple {5904#false} assume !(7 == ~blastFlag~0); {5904#false} is VALID [2022-04-08 08:41:54,239 INFO L290 TraceCheckUtils]: 62: Hoare triple {5904#false} assume !false; {5904#false} is VALID [2022-04-08 08:41:54,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:41:54,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:41:54,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152277883] [2022-04-08 08:41:54,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152277883] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:54,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:54,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:54,241 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:41:54,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [279490393] [2022-04-08 08:41:54,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [279490393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:54,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:54,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:54,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809344527] [2022-04-08 08:41:54,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:41:54,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-08 08:41:54,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:41:54,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:54,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:54,308 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:41:54,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:54,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:41:54,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:41:54,308 INFO L87 Difference]: Start difference. First operand 169 states and 257 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:57,860 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:42:00,368 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:42:02,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:02,893 INFO L93 Difference]: Finished difference Result 429 states and 661 transitions. [2022-04-08 08:42:02,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:42:02,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-08 08:42:02,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:42:02,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:02,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2022-04-08 08:42:02,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:02,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2022-04-08 08:42:02,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 592 transitions. [2022-04-08 08:42:03,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 592 edges. 592 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:03,333 INFO L225 Difference]: With dead ends: 429 [2022-04-08 08:42:03,333 INFO L226 Difference]: Without dead ends: 286 [2022-04-08 08:42:03,334 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-08 08:42:03,336 INFO L913 BasicCegarLoop]: 116 mSDtfsCounter, 147 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:42:03,336 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 340 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-04-08 08:42:03,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-04-08 08:42:03,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 181. [2022-04-08 08:42:03,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:42:03,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 286 states. Second operand has 181 states, 176 states have (on average 1.5284090909090908) internal successors, (269), 176 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:03,347 INFO L74 IsIncluded]: Start isIncluded. First operand 286 states. Second operand has 181 states, 176 states have (on average 1.5284090909090908) internal successors, (269), 176 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:03,347 INFO L87 Difference]: Start difference. First operand 286 states. Second operand has 181 states, 176 states have (on average 1.5284090909090908) internal successors, (269), 176 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:03,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:03,355 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2022-04-08 08:42:03,356 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 436 transitions. [2022-04-08 08:42:03,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:03,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:03,357 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 176 states have (on average 1.5284090909090908) internal successors, (269), 176 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 286 states. [2022-04-08 08:42:03,357 INFO L87 Difference]: Start difference. First operand has 181 states, 176 states have (on average 1.5284090909090908) internal successors, (269), 176 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 286 states. [2022-04-08 08:42:03,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:03,363 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2022-04-08 08:42:03,363 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 436 transitions. [2022-04-08 08:42:03,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:03,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:03,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:42:03,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:42:03,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.5284090909090908) internal successors, (269), 176 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:03,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 273 transitions. [2022-04-08 08:42:03,368 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 273 transitions. Word has length 63 [2022-04-08 08:42:03,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:42:03,368 INFO L478 AbstractCegarLoop]: Abstraction has 181 states and 273 transitions. [2022-04-08 08:42:03,369 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:03,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 181 states and 273 transitions. [2022-04-08 08:42:03,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:03,614 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 273 transitions. [2022-04-08 08:42:03,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 08:42:03,615 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:42:03,615 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:42:03,615 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable5 [2022-04-08 08:42:03,615 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:42:03,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:42:03,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1238410683, now seen corresponding path program 1 times [2022-04-08 08:42:03,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:03,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1892332477] [2022-04-08 08:42:03,633 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:42:03,634 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:42:03,634 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:42:03,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1238410683, now seen corresponding path program 2 times [2022-04-08 08:42:03,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:42:03,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251161942] [2022-04-08 08:42:03,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:42:03,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:42:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:03,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:42:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:03,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {7714#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {7707#true} is VALID [2022-04-08 08:42:03,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {7707#true} assume true; {7707#true} is VALID [2022-04-08 08:42:03,776 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7707#true} {7707#true} #688#return; {7707#true} is VALID [2022-04-08 08:42:03,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {7707#true} call ULTIMATE.init(); {7714#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-08 08:42:03,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {7714#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {7707#true} is VALID [2022-04-08 08:42:03,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {7707#true} assume true; {7707#true} is VALID [2022-04-08 08:42:03,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7707#true} {7707#true} #688#return; {7707#true} is VALID [2022-04-08 08:42:03,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {7707#true} call #t~ret161 := main(); {7707#true} is VALID [2022-04-08 08:42:03,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {7707#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; {7707#true} is VALID [2022-04-08 08:42:03,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {7707#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {7707#true} is VALID [2022-04-08 08:42:03,778 INFO L272 TraceCheckUtils]: 7: Hoare triple {7707#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {7707#true} is VALID [2022-04-08 08:42:03,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {7707#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); {7712#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:42:03,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {7712#(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; {7712#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:42:03,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {7712#(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; {7712#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:42:03,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {7712#(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)))); {7712#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:42:03,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {7712#(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); {7712#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:42:03,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {7712#(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; {7712#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:42:03,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {7712#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !false; {7712#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:42:03,784 INFO L290 TraceCheckUtils]: 15: Hoare triple {7712#(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); {7712#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:42:03,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {7712#(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); {7712#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:42:03,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {7712#(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); {7712#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:42:03,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {7712#(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); {7712#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:42:03,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {7712#(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); {7712#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:42:03,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {7712#(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); {7712#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:42:03,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {7712#(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); {7713#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-08 08:42:03,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {7713#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {7708#false} is VALID [2022-04-08 08:42:03,787 INFO L290 TraceCheckUtils]: 23: Hoare triple {7708#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; {7708#false} is VALID [2022-04-08 08:42:03,787 INFO L290 TraceCheckUtils]: 24: Hoare triple {7708#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); {7708#false} is VALID [2022-04-08 08:42:03,787 INFO L290 TraceCheckUtils]: 25: Hoare triple {7708#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); {7708#false} is VALID [2022-04-08 08:42:03,787 INFO L290 TraceCheckUtils]: 26: Hoare triple {7708#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {7708#false} is VALID [2022-04-08 08:42:03,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {7708#false} ~skip~0 := 0; {7708#false} is VALID [2022-04-08 08:42:03,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {7708#false} assume !false; {7708#false} is VALID [2022-04-08 08:42:03,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {7708#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); {7708#false} is VALID [2022-04-08 08:42:03,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {7708#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7708#false} is VALID [2022-04-08 08:42:03,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {7708#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7708#false} is VALID [2022-04-08 08:42:03,793 INFO L290 TraceCheckUtils]: 32: Hoare triple {7708#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7708#false} is VALID [2022-04-08 08:42:03,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {7708#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7708#false} is VALID [2022-04-08 08:42:03,793 INFO L290 TraceCheckUtils]: 34: Hoare triple {7708#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7708#false} is VALID [2022-04-08 08:42:03,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {7708#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7708#false} is VALID [2022-04-08 08:42:03,794 INFO L290 TraceCheckUtils]: 36: Hoare triple {7708#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7708#false} is VALID [2022-04-08 08:42:03,794 INFO L290 TraceCheckUtils]: 37: Hoare triple {7708#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7708#false} is VALID [2022-04-08 08:42:03,794 INFO L290 TraceCheckUtils]: 38: Hoare triple {7708#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7708#false} is VALID [2022-04-08 08:42:03,794 INFO L290 TraceCheckUtils]: 39: Hoare triple {7708#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7708#false} is VALID [2022-04-08 08:42:03,794 INFO L290 TraceCheckUtils]: 40: Hoare triple {7708#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7708#false} is VALID [2022-04-08 08:42:03,794 INFO L290 TraceCheckUtils]: 41: Hoare triple {7708#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7708#false} is VALID [2022-04-08 08:42:03,794 INFO L290 TraceCheckUtils]: 42: Hoare triple {7708#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7708#false} is VALID [2022-04-08 08:42:03,794 INFO L290 TraceCheckUtils]: 43: Hoare triple {7708#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7708#false} is VALID [2022-04-08 08:42:03,794 INFO L290 TraceCheckUtils]: 44: Hoare triple {7708#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7708#false} is VALID [2022-04-08 08:42:03,795 INFO L290 TraceCheckUtils]: 45: Hoare triple {7708#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {7708#false} is VALID [2022-04-08 08:42:03,795 INFO L290 TraceCheckUtils]: 46: Hoare triple {7708#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {7708#false} is VALID [2022-04-08 08:42:03,795 INFO L290 TraceCheckUtils]: 47: Hoare triple {7708#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {7708#false} is VALID [2022-04-08 08:42:03,795 INFO L290 TraceCheckUtils]: 48: Hoare triple {7708#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {7708#false} is VALID [2022-04-08 08:42:03,795 INFO L290 TraceCheckUtils]: 49: Hoare triple {7708#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {7708#false} is VALID [2022-04-08 08:42:03,795 INFO L290 TraceCheckUtils]: 50: Hoare triple {7708#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {7708#false} is VALID [2022-04-08 08:42:03,795 INFO L290 TraceCheckUtils]: 51: Hoare triple {7708#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {7708#false} is VALID [2022-04-08 08:42:03,795 INFO L290 TraceCheckUtils]: 52: Hoare triple {7708#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {7708#false} is VALID [2022-04-08 08:42:03,795 INFO L290 TraceCheckUtils]: 53: Hoare triple {7708#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {7708#false} is VALID [2022-04-08 08:42:03,796 INFO L290 TraceCheckUtils]: 54: Hoare triple {7708#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {7708#false} is VALID [2022-04-08 08:42:03,796 INFO L290 TraceCheckUtils]: 55: Hoare triple {7708#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {7708#false} is VALID [2022-04-08 08:42:03,796 INFO L290 TraceCheckUtils]: 56: Hoare triple {7708#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {7708#false} is VALID [2022-04-08 08:42:03,796 INFO L290 TraceCheckUtils]: 57: Hoare triple {7708#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {7708#false} is VALID [2022-04-08 08:42:03,796 INFO L290 TraceCheckUtils]: 58: Hoare triple {7708#false} assume 8640 == #t~mem75;havoc #t~mem75; {7708#false} is VALID [2022-04-08 08:42:03,797 INFO L290 TraceCheckUtils]: 59: Hoare triple {7708#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {7708#false} is VALID [2022-04-08 08:42:03,797 INFO L290 TraceCheckUtils]: 60: Hoare triple {7708#false} assume !(4 == ~blastFlag~0); {7708#false} is VALID [2022-04-08 08:42:03,797 INFO L290 TraceCheckUtils]: 61: Hoare triple {7708#false} assume !(7 == ~blastFlag~0); {7708#false} is VALID [2022-04-08 08:42:03,797 INFO L290 TraceCheckUtils]: 62: Hoare triple {7708#false} assume !false; {7708#false} is VALID [2022-04-08 08:42:03,797 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:42:03,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:42:03,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251161942] [2022-04-08 08:42:03,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251161942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:03,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:03,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:03,798 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:42:03,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1892332477] [2022-04-08 08:42:03,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1892332477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:03,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:03,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:03,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182327960] [2022-04-08 08:42:03,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:42:03,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-08 08:42:03,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:42:03,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:03,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:03,855 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:42:03,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:03,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:42:03,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:42:03,856 INFO L87 Difference]: Start difference. First operand 181 states and 273 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:11,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:11,522 INFO L93 Difference]: Finished difference Result 441 states and 675 transitions. [2022-04-08 08:42:11,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:42:11,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-08 08:42:11,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:42:11,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:11,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-08 08:42:11,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:11,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-08 08:42:11,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 591 transitions. [2022-04-08 08:42:11,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 591 edges. 591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:11,975 INFO L225 Difference]: With dead ends: 441 [2022-04-08 08:42:11,976 INFO L226 Difference]: Without dead ends: 286 [2022-04-08 08:42:11,976 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-08 08:42:11,977 INFO L913 BasicCegarLoop]: 116 mSDtfsCounter, 141 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:42:11,977 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 340 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 08:42:11,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-04-08 08:42:11,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 186. [2022-04-08 08:42:11,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:42:11,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 286 states. Second operand has 186 states, 181 states have (on average 1.5303867403314917) internal successors, (277), 181 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:11,985 INFO L74 IsIncluded]: Start isIncluded. First operand 286 states. Second operand has 186 states, 181 states have (on average 1.5303867403314917) internal successors, (277), 181 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:11,986 INFO L87 Difference]: Start difference. First operand 286 states. Second operand has 186 states, 181 states have (on average 1.5303867403314917) internal successors, (277), 181 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:11,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:11,992 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2022-04-08 08:42:11,992 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 434 transitions. [2022-04-08 08:42:11,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:11,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:11,993 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 181 states have (on average 1.5303867403314917) internal successors, (277), 181 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 286 states. [2022-04-08 08:42:11,993 INFO L87 Difference]: Start difference. First operand has 186 states, 181 states have (on average 1.5303867403314917) internal successors, (277), 181 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 286 states. [2022-04-08 08:42:11,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:11,999 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2022-04-08 08:42:11,999 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 434 transitions. [2022-04-08 08:42:12,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:12,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:12,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:42:12,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:42:12,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 181 states have (on average 1.5303867403314917) internal successors, (277), 181 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:12,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 281 transitions. [2022-04-08 08:42:12,004 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 281 transitions. Word has length 63 [2022-04-08 08:42:12,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:42:12,004 INFO L478 AbstractCegarLoop]: Abstraction has 186 states and 281 transitions. [2022-04-08 08:42:12,004 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:12,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 186 states and 281 transitions. [2022-04-08 08:42:12,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:12,237 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 281 transitions. [2022-04-08 08:42:12,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 08:42:12,237 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:42:12,238 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:42:12,238 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 08:42:12,238 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:42:12,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:42:12,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1097683996, now seen corresponding path program 1 times [2022-04-08 08:42:12,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:12,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2142500736] [2022-04-08 08:42:12,253 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:42:12,253 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:42:12,254 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:42:12,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1097683996, now seen corresponding path program 2 times [2022-04-08 08:42:12,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:42:12,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947564758] [2022-04-08 08:42:12,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:42:12,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:42:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:12,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:42:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:12,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {9552#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {9545#true} is VALID [2022-04-08 08:42:12,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {9545#true} assume true; {9545#true} is VALID [2022-04-08 08:42:12,411 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9545#true} {9545#true} #688#return; {9545#true} is VALID [2022-04-08 08:42:12,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {9545#true} call ULTIMATE.init(); {9552#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-08 08:42:12,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {9552#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {9545#true} is VALID [2022-04-08 08:42:12,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {9545#true} assume true; {9545#true} is VALID [2022-04-08 08:42:12,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9545#true} {9545#true} #688#return; {9545#true} is VALID [2022-04-08 08:42:12,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {9545#true} call #t~ret161 := main(); {9545#true} is VALID [2022-04-08 08:42:12,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {9545#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; {9545#true} is VALID [2022-04-08 08:42:12,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {9545#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {9545#true} is VALID [2022-04-08 08:42:12,418 INFO L272 TraceCheckUtils]: 7: Hoare triple {9545#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9545#true} is VALID [2022-04-08 08:42:12,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {9545#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); {9550#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:12,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {9550#(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; {9550#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:12,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {9550#(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; {9550#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:12,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {9550#(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)))); {9550#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:12,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {9550#(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); {9550#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:12,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {9550#(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; {9550#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:12,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {9550#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {9550#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:12,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {9550#(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); {9550#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:12,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {9550#(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); {9550#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:12,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {9550#(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); {9550#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:12,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {9550#(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); {9550#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:12,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {9550#(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); {9550#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:12,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {9550#(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); {9550#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:12,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {9550#(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); {9550#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:12,427 INFO L290 TraceCheckUtils]: 22: Hoare triple {9550#(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); {9551#(not (= |ssl3_accept_#t~mem54| 8482))} is VALID [2022-04-08 08:42:12,428 INFO L290 TraceCheckUtils]: 23: Hoare triple {9551#(not (= |ssl3_accept_#t~mem54| 8482))} assume 8482 == #t~mem54;havoc #t~mem54; {9546#false} is VALID [2022-04-08 08:42:12,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {9546#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {9546#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); {9546#false} is VALID [2022-04-08 08:42:12,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {9546#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {9546#false} is VALID [2022-04-08 08:42:12,428 INFO L290 TraceCheckUtils]: 27: Hoare triple {9546#false} ~skip~0 := 0; {9546#false} is VALID [2022-04-08 08:42:12,428 INFO L290 TraceCheckUtils]: 28: Hoare triple {9546#false} assume !false; {9546#false} is VALID [2022-04-08 08:42:12,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {9546#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); {9546#false} is VALID [2022-04-08 08:42:12,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {9546#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,428 INFO L290 TraceCheckUtils]: 31: Hoare triple {9546#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,429 INFO L290 TraceCheckUtils]: 32: Hoare triple {9546#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,429 INFO L290 TraceCheckUtils]: 33: Hoare triple {9546#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,429 INFO L290 TraceCheckUtils]: 34: Hoare triple {9546#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,429 INFO L290 TraceCheckUtils]: 35: Hoare triple {9546#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,429 INFO L290 TraceCheckUtils]: 36: Hoare triple {9546#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,429 INFO L290 TraceCheckUtils]: 37: Hoare triple {9546#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,429 INFO L290 TraceCheckUtils]: 38: Hoare triple {9546#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,429 INFO L290 TraceCheckUtils]: 39: Hoare triple {9546#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,429 INFO L290 TraceCheckUtils]: 40: Hoare triple {9546#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,430 INFO L290 TraceCheckUtils]: 41: Hoare triple {9546#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,430 INFO L290 TraceCheckUtils]: 42: Hoare triple {9546#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,430 INFO L290 TraceCheckUtils]: 43: Hoare triple {9546#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,430 INFO L290 TraceCheckUtils]: 44: Hoare triple {9546#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,430 INFO L290 TraceCheckUtils]: 45: Hoare triple {9546#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,431 INFO L290 TraceCheckUtils]: 46: Hoare triple {9546#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,431 INFO L290 TraceCheckUtils]: 47: Hoare triple {9546#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,431 INFO L290 TraceCheckUtils]: 48: Hoare triple {9546#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,431 INFO L290 TraceCheckUtils]: 49: Hoare triple {9546#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,431 INFO L290 TraceCheckUtils]: 50: Hoare triple {9546#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,431 INFO L290 TraceCheckUtils]: 51: Hoare triple {9546#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,431 INFO L290 TraceCheckUtils]: 52: Hoare triple {9546#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,432 INFO L290 TraceCheckUtils]: 53: Hoare triple {9546#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,432 INFO L290 TraceCheckUtils]: 54: Hoare triple {9546#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,432 INFO L290 TraceCheckUtils]: 55: Hoare triple {9546#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,432 INFO L290 TraceCheckUtils]: 56: Hoare triple {9546#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,432 INFO L290 TraceCheckUtils]: 57: Hoare triple {9546#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {9546#false} is VALID [2022-04-08 08:42:12,432 INFO L290 TraceCheckUtils]: 58: Hoare triple {9546#false} assume 8640 == #t~mem75;havoc #t~mem75; {9546#false} is VALID [2022-04-08 08:42:12,432 INFO L290 TraceCheckUtils]: 59: Hoare triple {9546#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {9546#false} is VALID [2022-04-08 08:42:12,432 INFO L290 TraceCheckUtils]: 60: Hoare triple {9546#false} assume !(4 == ~blastFlag~0); {9546#false} is VALID [2022-04-08 08:42:12,433 INFO L290 TraceCheckUtils]: 61: Hoare triple {9546#false} assume !(7 == ~blastFlag~0); {9546#false} is VALID [2022-04-08 08:42:12,433 INFO L290 TraceCheckUtils]: 62: Hoare triple {9546#false} assume !false; {9546#false} is VALID [2022-04-08 08:42:12,433 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:42:12,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:42:12,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947564758] [2022-04-08 08:42:12,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947564758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:12,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:12,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:12,434 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:42:12,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2142500736] [2022-04-08 08:42:12,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2142500736] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:12,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:12,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:12,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52865134] [2022-04-08 08:42:12,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:42:12,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-08 08:42:12,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:42:12,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:12,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:12,482 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:42:12,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:12,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:42:12,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:42:12,483 INFO L87 Difference]: Start difference. First operand 186 states and 281 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:16,530 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:42:17,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:17,722 INFO L93 Difference]: Finished difference Result 445 states and 681 transitions. [2022-04-08 08:42:17,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:42:17,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-08 08:42:17,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:42:17,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:17,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-08 08:42:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-08 08:42:17,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 589 transitions. [2022-04-08 08:42:18,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 589 edges. 589 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:18,227 INFO L225 Difference]: With dead ends: 445 [2022-04-08 08:42:18,227 INFO L226 Difference]: Without dead ends: 285 [2022-04-08 08:42:18,227 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-08 08:42:18,228 INFO L913 BasicCegarLoop]: 117 mSDtfsCounter, 139 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:42:18,228 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 342 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-08 08:42:18,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-04-08 08:42:18,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 187. [2022-04-08 08:42:18,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:42:18,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 285 states. Second operand has 187 states, 182 states have (on average 1.521978021978022) internal successors, (277), 182 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:18,239 INFO L74 IsIncluded]: Start isIncluded. First operand 285 states. Second operand has 187 states, 182 states have (on average 1.521978021978022) internal successors, (277), 182 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:18,239 INFO L87 Difference]: Start difference. First operand 285 states. Second operand has 187 states, 182 states have (on average 1.521978021978022) internal successors, (277), 182 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:18,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:18,245 INFO L93 Difference]: Finished difference Result 285 states and 431 transitions. [2022-04-08 08:42:18,245 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 431 transitions. [2022-04-08 08:42:18,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:18,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:18,246 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 182 states have (on average 1.521978021978022) internal successors, (277), 182 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 285 states. [2022-04-08 08:42:18,246 INFO L87 Difference]: Start difference. First operand has 187 states, 182 states have (on average 1.521978021978022) internal successors, (277), 182 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 285 states. [2022-04-08 08:42:18,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:18,252 INFO L93 Difference]: Finished difference Result 285 states and 431 transitions. [2022-04-08 08:42:18,252 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 431 transitions. [2022-04-08 08:42:18,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:18,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:18,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:42:18,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:42:18,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.521978021978022) internal successors, (277), 182 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 281 transitions. [2022-04-08 08:42:18,259 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 281 transitions. Word has length 63 [2022-04-08 08:42:18,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:42:18,260 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 281 transitions. [2022-04-08 08:42:18,260 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:18,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 187 states and 281 transitions. [2022-04-08 08:42:18,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:18,464 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 281 transitions. [2022-04-08 08:42:18,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 08:42:18,465 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:42:18,465 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:42:18,470 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 08:42:18,470 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:42:18,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:42:18,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1850937043, now seen corresponding path program 1 times [2022-04-08 08:42:18,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:18,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2006684693] [2022-04-08 08:42:18,627 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 19 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:42:18,628 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:42:18,628 INFO L85 PathProgramCache]: Analyzing trace with hash -125837918, now seen corresponding path program 1 times [2022-04-08 08:42:18,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:42:18,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817462043] [2022-04-08 08:42:18,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:42:18,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:42:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:42:18,841 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 08:42:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:42:18,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 08:42:18,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1850937043, now seen corresponding path program 2 times [2022-04-08 08:42:18,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:42:18,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668896431] [2022-04-08 08:42:18,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:42:18,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:42:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:19,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:42:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:19,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {11398#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {11391#true} is VALID [2022-04-08 08:42:19,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {11391#true} assume true; {11391#true} is VALID [2022-04-08 08:42:19,083 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11391#true} {11391#true} #688#return; {11391#true} is VALID [2022-04-08 08:42:19,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {11391#true} call ULTIMATE.init(); {11398#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-08 08:42:19,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {11398#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {11391#true} is VALID [2022-04-08 08:42:19,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {11391#true} assume true; {11391#true} is VALID [2022-04-08 08:42:19,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11391#true} {11391#true} #688#return; {11391#true} is VALID [2022-04-08 08:42:19,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {11391#true} call #t~ret161 := main(); {11391#true} is VALID [2022-04-08 08:42:19,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {11391#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; {11391#true} is VALID [2022-04-08 08:42:19,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {11391#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {11391#true} is VALID [2022-04-08 08:42:19,085 INFO L272 TraceCheckUtils]: 7: Hoare triple {11391#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {11391#true} is VALID [2022-04-08 08:42:19,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {11391#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); {11396#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:19,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {11396#(= 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; {11396#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:19,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {11396#(= 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; {11396#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:19,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {11396#(= 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)))); {11396#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:19,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {11396#(= 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); {11396#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:19,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {11396#(= 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; {11396#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:19,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {11396#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {11396#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:19,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {11396#(= 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); {11396#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:19,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {11396#(= 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); {11396#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:19,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {11396#(= 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); {11397#(= 8464 |ssl3_accept_#t~mem49|)} is VALID [2022-04-08 08:42:19,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {11397#(= 8464 |ssl3_accept_#t~mem49|)} assume 8192 == #t~mem49;havoc #t~mem49; {11392#false} is VALID [2022-04-08 08:42:19,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {11392#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {11392#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11392#false} is VALID [2022-04-08 08:42:19,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {11392#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {11392#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); {11392#false} is VALID [2022-04-08 08:42:19,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {11392#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {11392#false} is VALID [2022-04-08 08:42:19,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {11392#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); {11392#false} is VALID [2022-04-08 08:42:19,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {11392#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); {11392#false} is VALID [2022-04-08 08:42:19,093 INFO L290 TraceCheckUtils]: 26: Hoare triple {11392#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); {11392#false} is VALID [2022-04-08 08:42:19,093 INFO L290 TraceCheckUtils]: 27: Hoare triple {11392#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {11392#false} is VALID [2022-04-08 08:42:19,093 INFO L290 TraceCheckUtils]: 28: Hoare triple {11392#false} ~skip~0 := 0; {11392#false} is VALID [2022-04-08 08:42:19,093 INFO L290 TraceCheckUtils]: 29: Hoare triple {11392#false} assume !false; {11392#false} is VALID [2022-04-08 08:42:19,093 INFO L290 TraceCheckUtils]: 30: Hoare triple {11392#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); {11392#false} is VALID [2022-04-08 08:42:19,093 INFO L290 TraceCheckUtils]: 31: Hoare triple {11392#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,093 INFO L290 TraceCheckUtils]: 32: Hoare triple {11392#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,093 INFO L290 TraceCheckUtils]: 33: Hoare triple {11392#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,093 INFO L290 TraceCheckUtils]: 34: Hoare triple {11392#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,094 INFO L290 TraceCheckUtils]: 35: Hoare triple {11392#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,094 INFO L290 TraceCheckUtils]: 36: Hoare triple {11392#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,094 INFO L290 TraceCheckUtils]: 37: Hoare triple {11392#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,094 INFO L290 TraceCheckUtils]: 38: Hoare triple {11392#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,094 INFO L290 TraceCheckUtils]: 39: Hoare triple {11392#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,094 INFO L290 TraceCheckUtils]: 40: Hoare triple {11392#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,094 INFO L290 TraceCheckUtils]: 41: Hoare triple {11392#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,094 INFO L290 TraceCheckUtils]: 42: Hoare triple {11392#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,094 INFO L290 TraceCheckUtils]: 43: Hoare triple {11392#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,094 INFO L290 TraceCheckUtils]: 44: Hoare triple {11392#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,095 INFO L290 TraceCheckUtils]: 45: Hoare triple {11392#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,095 INFO L290 TraceCheckUtils]: 46: Hoare triple {11392#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,095 INFO L290 TraceCheckUtils]: 47: Hoare triple {11392#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,095 INFO L290 TraceCheckUtils]: 48: Hoare triple {11392#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,095 INFO L290 TraceCheckUtils]: 49: Hoare triple {11392#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,095 INFO L290 TraceCheckUtils]: 50: Hoare triple {11392#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,095 INFO L290 TraceCheckUtils]: 51: Hoare triple {11392#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,095 INFO L290 TraceCheckUtils]: 52: Hoare triple {11392#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,095 INFO L290 TraceCheckUtils]: 53: Hoare triple {11392#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,096 INFO L290 TraceCheckUtils]: 54: Hoare triple {11392#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,096 INFO L290 TraceCheckUtils]: 55: Hoare triple {11392#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,096 INFO L290 TraceCheckUtils]: 56: Hoare triple {11392#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,096 INFO L290 TraceCheckUtils]: 57: Hoare triple {11392#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,096 INFO L290 TraceCheckUtils]: 58: Hoare triple {11392#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {11392#false} is VALID [2022-04-08 08:42:19,096 INFO L290 TraceCheckUtils]: 59: Hoare triple {11392#false} assume 8640 == #t~mem75;havoc #t~mem75; {11392#false} is VALID [2022-04-08 08:42:19,096 INFO L290 TraceCheckUtils]: 60: Hoare triple {11392#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {11392#false} is VALID [2022-04-08 08:42:19,098 INFO L290 TraceCheckUtils]: 61: Hoare triple {11392#false} assume !(4 == ~blastFlag~0); {11392#false} is VALID [2022-04-08 08:42:19,099 INFO L290 TraceCheckUtils]: 62: Hoare triple {11392#false} assume !(7 == ~blastFlag~0); {11392#false} is VALID [2022-04-08 08:42:19,099 INFO L290 TraceCheckUtils]: 63: Hoare triple {11392#false} assume !false; {11392#false} is VALID [2022-04-08 08:42:19,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:42:19,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:42:19,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668896431] [2022-04-08 08:42:19,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668896431] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:19,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:19,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:19,100 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:42:19,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2006684693] [2022-04-08 08:42:19,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2006684693] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:19,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:19,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:19,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977264618] [2022-04-08 08:42:19,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:42:19,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 08:42:19,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:42:19,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:19,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:19,152 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:42:19,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:19,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:42:19,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:42:19,153 INFO L87 Difference]: Start difference. First operand 187 states and 281 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:23,129 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:42:25,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:25,565 INFO L93 Difference]: Finished difference Result 361 states and 547 transitions. [2022-04-08 08:42:25,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:42:25,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 08:42:25,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:42:25,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:25,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 441 transitions. [2022-04-08 08:42:25,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:25,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 441 transitions. [2022-04-08 08:42:25,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 441 transitions. [2022-04-08 08:42:25,922 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-08 08:42:25,925 INFO L225 Difference]: With dead ends: 361 [2022-04-08 08:42:25,926 INFO L226 Difference]: Without dead ends: 200 [2022-04-08 08:42:25,926 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-08 08:42:25,927 INFO L913 BasicCegarLoop]: 190 mSDtfsCounter, 22 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:42:25,927 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 489 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-08 08:42:25,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-04-08 08:42:25,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 187. [2022-04-08 08:42:25,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:42:25,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 187 states, 182 states have (on average 1.5164835164835164) internal successors, (276), 182 states have internal predecessors, (276), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:25,942 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 187 states, 182 states have (on average 1.5164835164835164) internal successors, (276), 182 states have internal predecessors, (276), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:25,944 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 187 states, 182 states have (on average 1.5164835164835164) internal successors, (276), 182 states have internal predecessors, (276), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:25,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:25,948 INFO L93 Difference]: Finished difference Result 200 states and 297 transitions. [2022-04-08 08:42:25,948 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 297 transitions. [2022-04-08 08:42:25,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:25,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:25,949 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 182 states have (on average 1.5164835164835164) internal successors, (276), 182 states have internal predecessors, (276), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 200 states. [2022-04-08 08:42:25,949 INFO L87 Difference]: Start difference. First operand has 187 states, 182 states have (on average 1.5164835164835164) internal successors, (276), 182 states have internal predecessors, (276), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 200 states. [2022-04-08 08:42:25,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:25,953 INFO L93 Difference]: Finished difference Result 200 states and 297 transitions. [2022-04-08 08:42:25,953 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 297 transitions. [2022-04-08 08:42:25,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:25,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:25,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:42:25,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:42:25,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.5164835164835164) internal successors, (276), 182 states have internal predecessors, (276), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:25,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 280 transitions. [2022-04-08 08:42:25,958 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 280 transitions. Word has length 64 [2022-04-08 08:42:25,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:42:25,958 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 280 transitions. [2022-04-08 08:42:25,958 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:25,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 187 states and 280 transitions. [2022-04-08 08:42:26,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:26,199 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 280 transitions. [2022-04-08 08:42:26,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-08 08:42:26,203 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:42:26,204 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:42:26,204 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable9 [2022-04-08 08:42:26,204 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:42:26,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:42:26,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1670293609, now seen corresponding path program 1 times [2022-04-08 08:42:26,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:26,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [616329851] [2022-04-08 08:42:26,381 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-08 08:42:26,381 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:42:26,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1364210206, now seen corresponding path program 1 times [2022-04-08 08:42:26,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:42:26,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540656111] [2022-04-08 08:42:26,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:42:26,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:42:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:42:26,630 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 08:42:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:42:26,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 08:42:26,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1670293609, now seen corresponding path program 2 times [2022-04-08 08:42:26,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:42:26,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537565832] [2022-04-08 08:42:26,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:42:26,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:42:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:26,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:42:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:26,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {12906#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {12899#true} is VALID [2022-04-08 08:42:26,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {12899#true} assume true; {12899#true} is VALID [2022-04-08 08:42:26,871 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12899#true} {12899#true} #688#return; {12899#true} is VALID [2022-04-08 08:42:26,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {12899#true} call ULTIMATE.init(); {12906#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-08 08:42:26,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {12906#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {12899#true} is VALID [2022-04-08 08:42:26,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {12899#true} assume true; {12899#true} is VALID [2022-04-08 08:42:26,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12899#true} {12899#true} #688#return; {12899#true} is VALID [2022-04-08 08:42:26,872 INFO L272 TraceCheckUtils]: 4: Hoare triple {12899#true} call #t~ret161 := main(); {12899#true} is VALID [2022-04-08 08:42:26,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {12899#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; {12899#true} is VALID [2022-04-08 08:42:26,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {12899#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {12899#true} is VALID [2022-04-08 08:42:26,873 INFO L272 TraceCheckUtils]: 7: Hoare triple {12899#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12899#true} is VALID [2022-04-08 08:42:26,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {12899#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); {12904#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:26,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {12904#(= 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; {12904#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:26,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {12904#(= 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; {12904#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:26,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {12904#(= 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)))); {12904#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:26,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {12904#(= 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); {12904#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:26,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {12904#(= 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; {12904#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:26,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {12904#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {12904#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:26,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {12904#(= 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); {12904#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:26,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {12904#(= 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); {12904#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:26,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {12904#(= 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); {12904#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:26,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {12904#(= 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); {12905#(= 8464 |ssl3_accept_#t~mem50|)} is VALID [2022-04-08 08:42:26,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {12905#(= 8464 |ssl3_accept_#t~mem50|)} assume 24576 == #t~mem50;havoc #t~mem50; {12900#false} is VALID [2022-04-08 08:42:26,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {12900#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {12900#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {12900#false} is VALID [2022-04-08 08:42:26,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {12900#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,880 INFO L290 TraceCheckUtils]: 23: Hoare triple {12900#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); {12900#false} is VALID [2022-04-08 08:42:26,880 INFO L290 TraceCheckUtils]: 24: Hoare triple {12900#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {12900#false} is VALID [2022-04-08 08:42:26,880 INFO L290 TraceCheckUtils]: 25: Hoare triple {12900#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); {12900#false} is VALID [2022-04-08 08:42:26,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {12900#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); {12900#false} is VALID [2022-04-08 08:42:26,881 INFO L290 TraceCheckUtils]: 27: Hoare triple {12900#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); {12900#false} is VALID [2022-04-08 08:42:26,881 INFO L290 TraceCheckUtils]: 28: Hoare triple {12900#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12900#false} is VALID [2022-04-08 08:42:26,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {12900#false} ~skip~0 := 0; {12900#false} is VALID [2022-04-08 08:42:26,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {12900#false} assume !false; {12900#false} is VALID [2022-04-08 08:42:26,881 INFO L290 TraceCheckUtils]: 31: Hoare triple {12900#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); {12900#false} is VALID [2022-04-08 08:42:26,881 INFO L290 TraceCheckUtils]: 32: Hoare triple {12900#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,881 INFO L290 TraceCheckUtils]: 33: Hoare triple {12900#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,881 INFO L290 TraceCheckUtils]: 34: Hoare triple {12900#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,881 INFO L290 TraceCheckUtils]: 35: Hoare triple {12900#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,882 INFO L290 TraceCheckUtils]: 36: Hoare triple {12900#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,882 INFO L290 TraceCheckUtils]: 37: Hoare triple {12900#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,882 INFO L290 TraceCheckUtils]: 38: Hoare triple {12900#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,882 INFO L290 TraceCheckUtils]: 39: Hoare triple {12900#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,882 INFO L290 TraceCheckUtils]: 40: Hoare triple {12900#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,882 INFO L290 TraceCheckUtils]: 41: Hoare triple {12900#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,882 INFO L290 TraceCheckUtils]: 42: Hoare triple {12900#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,882 INFO L290 TraceCheckUtils]: 43: Hoare triple {12900#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,882 INFO L290 TraceCheckUtils]: 44: Hoare triple {12900#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,882 INFO L290 TraceCheckUtils]: 45: Hoare triple {12900#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,883 INFO L290 TraceCheckUtils]: 46: Hoare triple {12900#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,883 INFO L290 TraceCheckUtils]: 47: Hoare triple {12900#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,883 INFO L290 TraceCheckUtils]: 48: Hoare triple {12900#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,883 INFO L290 TraceCheckUtils]: 49: Hoare triple {12900#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,883 INFO L290 TraceCheckUtils]: 50: Hoare triple {12900#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,883 INFO L290 TraceCheckUtils]: 51: Hoare triple {12900#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,883 INFO L290 TraceCheckUtils]: 52: Hoare triple {12900#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,883 INFO L290 TraceCheckUtils]: 53: Hoare triple {12900#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,883 INFO L290 TraceCheckUtils]: 54: Hoare triple {12900#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,883 INFO L290 TraceCheckUtils]: 55: Hoare triple {12900#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,884 INFO L290 TraceCheckUtils]: 56: Hoare triple {12900#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,884 INFO L290 TraceCheckUtils]: 57: Hoare triple {12900#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,884 INFO L290 TraceCheckUtils]: 58: Hoare triple {12900#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,884 INFO L290 TraceCheckUtils]: 59: Hoare triple {12900#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {12900#false} is VALID [2022-04-08 08:42:26,885 INFO L290 TraceCheckUtils]: 60: Hoare triple {12900#false} assume 8640 == #t~mem75;havoc #t~mem75; {12900#false} is VALID [2022-04-08 08:42:26,885 INFO L290 TraceCheckUtils]: 61: Hoare triple {12900#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {12900#false} is VALID [2022-04-08 08:42:26,885 INFO L290 TraceCheckUtils]: 62: Hoare triple {12900#false} assume !(4 == ~blastFlag~0); {12900#false} is VALID [2022-04-08 08:42:26,886 INFO L290 TraceCheckUtils]: 63: Hoare triple {12900#false} assume !(7 == ~blastFlag~0); {12900#false} is VALID [2022-04-08 08:42:26,886 INFO L290 TraceCheckUtils]: 64: Hoare triple {12900#false} assume !false; {12900#false} is VALID [2022-04-08 08:42:26,886 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:42:26,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:42:26,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537565832] [2022-04-08 08:42:26,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537565832] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:26,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:26,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:26,887 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:42:26,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [616329851] [2022-04-08 08:42:26,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [616329851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:26,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:26,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:26,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685988263] [2022-04-08 08:42:26,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:42:26,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-08 08:42:26,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:42:26,888 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-08 08:42:26,949 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-08 08:42:26,949 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:42:26,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:26,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:42:26,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:42:26,950 INFO L87 Difference]: Start difference. First operand 187 states and 280 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-08 08:42:29,009 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:42:33,858 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:42:36,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:36,255 INFO L93 Difference]: Finished difference Result 361 states and 546 transitions. [2022-04-08 08:42:36,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:42:36,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-08 08:42:36,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:42:36,256 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-08 08:42:36,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-08 08:42:36,259 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-08 08:42:36,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-08 08:42:36,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 440 transitions. [2022-04-08 08:42:36,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 440 edges. 440 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:36,607 INFO L225 Difference]: With dead ends: 361 [2022-04-08 08:42:36,607 INFO L226 Difference]: Without dead ends: 200 [2022-04-08 08:42:36,608 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-08 08:42:36,608 INFO L913 BasicCegarLoop]: 190 mSDtfsCounter, 20 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:42:36,608 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 489 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-04-08 08:42:36,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-04-08 08:42:36,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 187. [2022-04-08 08:42:36,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:42:36,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 187 states, 182 states have (on average 1.510989010989011) internal successors, (275), 182 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:36,617 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 187 states, 182 states have (on average 1.510989010989011) internal successors, (275), 182 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:36,617 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 187 states, 182 states have (on average 1.510989010989011) internal successors, (275), 182 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:36,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:36,620 INFO L93 Difference]: Finished difference Result 200 states and 296 transitions. [2022-04-08 08:42:36,621 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 296 transitions. [2022-04-08 08:42:36,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:36,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:36,621 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 182 states have (on average 1.510989010989011) internal successors, (275), 182 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 200 states. [2022-04-08 08:42:36,622 INFO L87 Difference]: Start difference. First operand has 187 states, 182 states have (on average 1.510989010989011) internal successors, (275), 182 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 200 states. [2022-04-08 08:42:36,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:36,625 INFO L93 Difference]: Finished difference Result 200 states and 296 transitions. [2022-04-08 08:42:36,625 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 296 transitions. [2022-04-08 08:42:36,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:36,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:36,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:42:36,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:42:36,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.510989010989011) internal successors, (275), 182 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:36,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 279 transitions. [2022-04-08 08:42:36,630 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 279 transitions. Word has length 65 [2022-04-08 08:42:36,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:42:36,630 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 279 transitions. [2022-04-08 08:42:36,630 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-08 08:42:36,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 187 states and 279 transitions. [2022-04-08 08:42:36,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 279 edges. 279 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:36,870 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 279 transitions. [2022-04-08 08:42:36,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 08:42:36,871 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:42:36,871 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:42:36,871 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable11 [2022-04-08 08:42:36,871 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:42:36,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:42:36,871 INFO L85 PathProgramCache]: Analyzing trace with hash -781063314, now seen corresponding path program 1 times [2022-04-08 08:42:36,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:36,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1006559693] [2022-04-08 08:42:37,034 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-08 08:42:37,034 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:42:37,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1692384802, now seen corresponding path program 1 times [2022-04-08 08:42:37,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:42:37,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236847083] [2022-04-08 08:42:37,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:42:37,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:42:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:42:37,235 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 08:42:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:42:37,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 08:42:37,330 INFO L85 PathProgramCache]: Analyzing trace with hash -781063314, now seen corresponding path program 2 times [2022-04-08 08:42:37,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:42:37,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708314448] [2022-04-08 08:42:37,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:42:37,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:42:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:37,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:42:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:37,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {14414#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {14407#true} is VALID [2022-04-08 08:42:37,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {14407#true} assume true; {14407#true} is VALID [2022-04-08 08:42:37,448 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14407#true} {14407#true} #688#return; {14407#true} is VALID [2022-04-08 08:42:37,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {14407#true} call ULTIMATE.init(); {14414#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-08 08:42:37,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {14414#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {14407#true} is VALID [2022-04-08 08:42:37,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {14407#true} assume true; {14407#true} is VALID [2022-04-08 08:42:37,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14407#true} {14407#true} #688#return; {14407#true} is VALID [2022-04-08 08:42:37,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {14407#true} call #t~ret161 := main(); {14407#true} is VALID [2022-04-08 08:42:37,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {14407#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; {14407#true} is VALID [2022-04-08 08:42:37,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {14407#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {14407#true} is VALID [2022-04-08 08:42:37,450 INFO L272 TraceCheckUtils]: 7: Hoare triple {14407#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {14407#true} is VALID [2022-04-08 08:42:37,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {14407#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); {14412#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:37,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {14412#(not (= 8195 (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; {14412#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:37,453 INFO L290 TraceCheckUtils]: 10: Hoare triple {14412#(not (= 8195 (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; {14412#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:37,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {14412#(not (= 8195 (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)))); {14412#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:37,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {14412#(not (= 8195 (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); {14412#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:37,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {14412#(not (= 8195 (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; {14412#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:37,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {14412#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {14412#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:37,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {14412#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {14412#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:37,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {14412#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14412#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:37,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {14412#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14412#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:37,457 INFO L290 TraceCheckUtils]: 18: Hoare triple {14412#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14412#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:37,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {14412#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14413#(not (= |ssl3_accept_#t~mem51| 8195))} is VALID [2022-04-08 08:42:37,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {14413#(not (= |ssl3_accept_#t~mem51| 8195))} assume 8195 == #t~mem51;havoc #t~mem51; {14408#false} is VALID [2022-04-08 08:42:37,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {14408#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {14408#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {14408#false} is VALID [2022-04-08 08:42:37,458 INFO L290 TraceCheckUtils]: 23: Hoare triple {14408#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,458 INFO L290 TraceCheckUtils]: 24: Hoare triple {14408#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); {14408#false} is VALID [2022-04-08 08:42:37,458 INFO L290 TraceCheckUtils]: 25: Hoare triple {14408#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {14408#false} is VALID [2022-04-08 08:42:37,458 INFO L290 TraceCheckUtils]: 26: Hoare triple {14408#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); {14408#false} is VALID [2022-04-08 08:42:37,458 INFO L290 TraceCheckUtils]: 27: Hoare triple {14408#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); {14408#false} is VALID [2022-04-08 08:42:37,458 INFO L290 TraceCheckUtils]: 28: Hoare triple {14408#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); {14408#false} is VALID [2022-04-08 08:42:37,459 INFO L290 TraceCheckUtils]: 29: Hoare triple {14408#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {14408#false} is VALID [2022-04-08 08:42:37,459 INFO L290 TraceCheckUtils]: 30: Hoare triple {14408#false} ~skip~0 := 0; {14408#false} is VALID [2022-04-08 08:42:37,459 INFO L290 TraceCheckUtils]: 31: Hoare triple {14408#false} assume !false; {14408#false} is VALID [2022-04-08 08:42:37,459 INFO L290 TraceCheckUtils]: 32: Hoare triple {14408#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); {14408#false} is VALID [2022-04-08 08:42:37,459 INFO L290 TraceCheckUtils]: 33: Hoare triple {14408#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,459 INFO L290 TraceCheckUtils]: 34: Hoare triple {14408#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,459 INFO L290 TraceCheckUtils]: 35: Hoare triple {14408#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,459 INFO L290 TraceCheckUtils]: 36: Hoare triple {14408#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,459 INFO L290 TraceCheckUtils]: 37: Hoare triple {14408#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,459 INFO L290 TraceCheckUtils]: 38: Hoare triple {14408#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,460 INFO L290 TraceCheckUtils]: 39: Hoare triple {14408#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,460 INFO L290 TraceCheckUtils]: 40: Hoare triple {14408#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,460 INFO L290 TraceCheckUtils]: 41: Hoare triple {14408#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,460 INFO L290 TraceCheckUtils]: 42: Hoare triple {14408#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,460 INFO L290 TraceCheckUtils]: 43: Hoare triple {14408#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,460 INFO L290 TraceCheckUtils]: 44: Hoare triple {14408#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,460 INFO L290 TraceCheckUtils]: 45: Hoare triple {14408#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,460 INFO L290 TraceCheckUtils]: 46: Hoare triple {14408#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,460 INFO L290 TraceCheckUtils]: 47: Hoare triple {14408#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,461 INFO L290 TraceCheckUtils]: 48: Hoare triple {14408#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,461 INFO L290 TraceCheckUtils]: 49: Hoare triple {14408#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,461 INFO L290 TraceCheckUtils]: 50: Hoare triple {14408#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,461 INFO L290 TraceCheckUtils]: 51: Hoare triple {14408#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,461 INFO L290 TraceCheckUtils]: 52: Hoare triple {14408#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,461 INFO L290 TraceCheckUtils]: 53: Hoare triple {14408#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,461 INFO L290 TraceCheckUtils]: 54: Hoare triple {14408#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,461 INFO L290 TraceCheckUtils]: 55: Hoare triple {14408#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,461 INFO L290 TraceCheckUtils]: 56: Hoare triple {14408#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,461 INFO L290 TraceCheckUtils]: 57: Hoare triple {14408#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,462 INFO L290 TraceCheckUtils]: 58: Hoare triple {14408#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,462 INFO L290 TraceCheckUtils]: 59: Hoare triple {14408#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,462 INFO L290 TraceCheckUtils]: 60: Hoare triple {14408#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {14408#false} is VALID [2022-04-08 08:42:37,462 INFO L290 TraceCheckUtils]: 61: Hoare triple {14408#false} assume 8640 == #t~mem75;havoc #t~mem75; {14408#false} is VALID [2022-04-08 08:42:37,462 INFO L290 TraceCheckUtils]: 62: Hoare triple {14408#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {14408#false} is VALID [2022-04-08 08:42:37,462 INFO L290 TraceCheckUtils]: 63: Hoare triple {14408#false} assume !(4 == ~blastFlag~0); {14408#false} is VALID [2022-04-08 08:42:37,462 INFO L290 TraceCheckUtils]: 64: Hoare triple {14408#false} assume !(7 == ~blastFlag~0); {14408#false} is VALID [2022-04-08 08:42:37,462 INFO L290 TraceCheckUtils]: 65: Hoare triple {14408#false} assume !false; {14408#false} is VALID [2022-04-08 08:42:37,463 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:42:37,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:42:37,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708314448] [2022-04-08 08:42:37,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708314448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:37,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:37,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:37,463 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:42:37,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1006559693] [2022-04-08 08:42:37,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1006559693] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:37,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:37,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:37,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653466097] [2022-04-08 08:42:37,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:42:37,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:42:37,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:42:37,465 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-08 08:42:37,522 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-08 08:42:37,522 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:42:37,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:37,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:42:37,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:42:37,553 INFO L87 Difference]: Start difference. First operand 187 states and 279 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-08 08:42:44,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:44,023 INFO L93 Difference]: Finished difference Result 446 states and 678 transitions. [2022-04-08 08:42:44,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:42:44,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:42:44,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:42:44,024 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-08 08:42:44,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-08 08:42:44,029 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-08 08:42:44,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-08 08:42:44,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 588 transitions. [2022-04-08 08:42:44,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 588 edges. 588 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:44,544 INFO L225 Difference]: With dead ends: 446 [2022-04-08 08:42:44,544 INFO L226 Difference]: Without dead ends: 285 [2022-04-08 08:42:44,545 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-08 08:42:44,546 INFO L913 BasicCegarLoop]: 117 mSDtfsCounter, 141 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:42:44,546 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 342 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-08 08:42:44,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-04-08 08:42:44,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 187. [2022-04-08 08:42:44,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:42:44,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 285 states. Second operand has 187 states, 182 states have (on average 1.4945054945054945) internal successors, (272), 182 states have internal predecessors, (272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:44,554 INFO L74 IsIncluded]: Start isIncluded. First operand 285 states. Second operand has 187 states, 182 states have (on average 1.4945054945054945) internal successors, (272), 182 states have internal predecessors, (272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:44,554 INFO L87 Difference]: Start difference. First operand 285 states. Second operand has 187 states, 182 states have (on average 1.4945054945054945) internal successors, (272), 182 states have internal predecessors, (272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:44,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:44,561 INFO L93 Difference]: Finished difference Result 285 states and 426 transitions. [2022-04-08 08:42:44,561 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 426 transitions. [2022-04-08 08:42:44,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:44,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:44,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 182 states have (on average 1.4945054945054945) internal successors, (272), 182 states have internal predecessors, (272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 285 states. [2022-04-08 08:42:44,562 INFO L87 Difference]: Start difference. First operand has 187 states, 182 states have (on average 1.4945054945054945) internal successors, (272), 182 states have internal predecessors, (272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 285 states. [2022-04-08 08:42:44,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:44,569 INFO L93 Difference]: Finished difference Result 285 states and 426 transitions. [2022-04-08 08:42:44,569 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 426 transitions. [2022-04-08 08:42:44,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:44,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:44,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:42:44,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:42:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.4945054945054945) internal successors, (272), 182 states have internal predecessors, (272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:44,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 276 transitions. [2022-04-08 08:42:44,574 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 276 transitions. Word has length 66 [2022-04-08 08:42:44,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:42:44,575 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 276 transitions. [2022-04-08 08:42:44,575 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-08 08:42:44,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 187 states and 276 transitions. [2022-04-08 08:42:44,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:44,824 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 276 transitions. [2022-04-08 08:42:44,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 08:42:44,824 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:42:44,825 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:42:44,825 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,SelfDestructingSolverStorable13 [2022-04-08 08:42:44,825 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:42:44,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:42:44,825 INFO L85 PathProgramCache]: Analyzing trace with hash 16008741, now seen corresponding path program 1 times [2022-04-08 08:42:44,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:44,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [797283102] [2022-04-08 08:42:44,844 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:42:44,844 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:42:44,844 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:42:44,845 INFO L85 PathProgramCache]: Analyzing trace with hash 16008741, now seen corresponding path program 2 times [2022-04-08 08:42:44,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:42:44,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75469867] [2022-04-08 08:42:44,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:42:44,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:42:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:44,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:42:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:44,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {16262#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {16255#true} is VALID [2022-04-08 08:42:44,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {16255#true} assume true; {16255#true} is VALID [2022-04-08 08:42:44,974 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16255#true} {16255#true} #688#return; {16255#true} is VALID [2022-04-08 08:42:44,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {16255#true} call ULTIMATE.init(); {16262#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-08 08:42:44,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {16262#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {16255#true} is VALID [2022-04-08 08:42:44,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {16255#true} assume true; {16255#true} is VALID [2022-04-08 08:42:44,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16255#true} {16255#true} #688#return; {16255#true} is VALID [2022-04-08 08:42:44,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {16255#true} call #t~ret161 := main(); {16255#true} is VALID [2022-04-08 08:42:44,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {16255#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; {16255#true} is VALID [2022-04-08 08:42:44,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {16255#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {16255#true} is VALID [2022-04-08 08:42:44,976 INFO L272 TraceCheckUtils]: 7: Hoare triple {16255#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16255#true} is VALID [2022-04-08 08:42:44,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {16255#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); {16255#true} is VALID [2022-04-08 08:42:44,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {16255#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; {16255#true} is VALID [2022-04-08 08:42:44,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {16255#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; {16255#true} is VALID [2022-04-08 08:42:44,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {16255#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {16255#true} is VALID [2022-04-08 08:42:44,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {16255#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {16255#true} is VALID [2022-04-08 08:42:44,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {16255#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {16255#true} is VALID [2022-04-08 08:42:44,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {16255#true} assume !false; {16255#true} is VALID [2022-04-08 08:42:44,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {16255#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); {16255#true} is VALID [2022-04-08 08:42:44,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {16255#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16255#true} is VALID [2022-04-08 08:42:44,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {16255#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16255#true} is VALID [2022-04-08 08:42:44,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {16255#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16255#true} is VALID [2022-04-08 08:42:44,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {16255#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16255#true} is VALID [2022-04-08 08:42:44,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {16255#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16255#true} is VALID [2022-04-08 08:42:44,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {16255#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16255#true} is VALID [2022-04-08 08:42:44,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {16255#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16255#true} is VALID [2022-04-08 08:42:44,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {16255#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16255#true} is VALID [2022-04-08 08:42:44,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {16255#true} assume 8464 == #t~mem55;havoc #t~mem55; {16255#true} is VALID [2022-04-08 08:42:44,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {16255#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; {16255#true} is VALID [2022-04-08 08:42:44,978 INFO L290 TraceCheckUtils]: 26: Hoare triple {16255#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {16255#true} is VALID [2022-04-08 08:42:44,979 INFO L290 TraceCheckUtils]: 27: Hoare triple {16255#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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,979 INFO L290 TraceCheckUtils]: 28: Hoare triple {16260#(not (= 8640 (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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {16260#(not (= 8640 (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; {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,981 INFO L290 TraceCheckUtils]: 32: Hoare triple {16260#(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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,981 INFO L290 TraceCheckUtils]: 33: Hoare triple {16260#(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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,982 INFO L290 TraceCheckUtils]: 34: Hoare triple {16260#(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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,982 INFO L290 TraceCheckUtils]: 35: Hoare triple {16260#(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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,982 INFO L290 TraceCheckUtils]: 36: Hoare triple {16260#(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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,983 INFO L290 TraceCheckUtils]: 37: Hoare triple {16260#(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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,983 INFO L290 TraceCheckUtils]: 38: Hoare triple {16260#(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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,984 INFO L290 TraceCheckUtils]: 39: Hoare triple {16260#(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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,984 INFO L290 TraceCheckUtils]: 40: Hoare triple {16260#(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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,984 INFO L290 TraceCheckUtils]: 41: Hoare triple {16260#(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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,985 INFO L290 TraceCheckUtils]: 42: Hoare triple {16260#(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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,985 INFO L290 TraceCheckUtils]: 43: Hoare triple {16260#(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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,986 INFO L290 TraceCheckUtils]: 44: Hoare triple {16260#(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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,986 INFO L290 TraceCheckUtils]: 45: Hoare triple {16260#(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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,986 INFO L290 TraceCheckUtils]: 46: Hoare triple {16260#(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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,987 INFO L290 TraceCheckUtils]: 47: Hoare triple {16260#(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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,987 INFO L290 TraceCheckUtils]: 48: Hoare triple {16260#(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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,988 INFO L290 TraceCheckUtils]: 49: Hoare triple {16260#(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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,988 INFO L290 TraceCheckUtils]: 50: Hoare triple {16260#(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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,989 INFO L290 TraceCheckUtils]: 51: Hoare triple {16260#(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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,989 INFO L290 TraceCheckUtils]: 52: Hoare triple {16260#(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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,989 INFO L290 TraceCheckUtils]: 53: Hoare triple {16260#(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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,990 INFO L290 TraceCheckUtils]: 54: Hoare triple {16260#(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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,990 INFO L290 TraceCheckUtils]: 55: Hoare triple {16260#(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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,991 INFO L290 TraceCheckUtils]: 56: Hoare triple {16260#(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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,991 INFO L290 TraceCheckUtils]: 57: Hoare triple {16260#(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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,991 INFO L290 TraceCheckUtils]: 58: Hoare triple {16260#(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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,992 INFO L290 TraceCheckUtils]: 59: Hoare triple {16260#(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); {16260#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:44,992 INFO L290 TraceCheckUtils]: 60: Hoare triple {16260#(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); {16261#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-08 08:42:45,007 INFO L290 TraceCheckUtils]: 61: Hoare triple {16261#(not (= |ssl3_accept_#t~mem75| 8640))} assume 8640 == #t~mem75;havoc #t~mem75; {16256#false} is VALID [2022-04-08 08:42:45,007 INFO L290 TraceCheckUtils]: 62: Hoare triple {16256#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {16256#false} is VALID [2022-04-08 08:42:45,008 INFO L290 TraceCheckUtils]: 63: Hoare triple {16256#false} assume !(4 == ~blastFlag~0); {16256#false} is VALID [2022-04-08 08:42:45,008 INFO L290 TraceCheckUtils]: 64: Hoare triple {16256#false} assume !(7 == ~blastFlag~0); {16256#false} is VALID [2022-04-08 08:42:45,008 INFO L290 TraceCheckUtils]: 65: Hoare triple {16256#false} assume !false; {16256#false} is VALID [2022-04-08 08:42:45,008 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:42:45,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:42:45,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75469867] [2022-04-08 08:42:45,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75469867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:45,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:45,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:45,009 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:42:45,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [797283102] [2022-04-08 08:42:45,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [797283102] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:45,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:45,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:45,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170732822] [2022-04-08 08:42:45,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:42:45,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:42:45,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:42:45,010 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-08 08:42:45,082 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-08 08:42:45,083 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:42:45,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:45,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:42:45,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:42:45,084 INFO L87 Difference]: Start difference. First operand 187 states and 276 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-08 08:42:50,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:50,470 INFO L93 Difference]: Finished difference Result 465 states and 700 transitions. [2022-04-08 08:42:50,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:42:50,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:42:50,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:42:50,471 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-08 08:42:50,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-08 08:42:50,474 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-08 08:42:50,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-08 08:42:50,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 588 transitions. [2022-04-08 08:42:50,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 588 edges. 588 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:50,882 INFO L225 Difference]: With dead ends: 465 [2022-04-08 08:42:50,882 INFO L226 Difference]: Without dead ends: 304 [2022-04-08 08:42:50,883 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:42:50,883 INFO L913 BasicCegarLoop]: 117 mSDtfsCounter, 117 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:42:50,884 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 342 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-08 08:42:50,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-04-08 08:42:50,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 227. [2022-04-08 08:42:50,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:42:50,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 304 states. Second operand has 227 states, 222 states have (on average 1.5315315315315314) internal successors, (340), 222 states have internal predecessors, (340), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:50,893 INFO L74 IsIncluded]: Start isIncluded. First operand 304 states. Second operand has 227 states, 222 states have (on average 1.5315315315315314) internal successors, (340), 222 states have internal predecessors, (340), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:50,894 INFO L87 Difference]: Start difference. First operand 304 states. Second operand has 227 states, 222 states have (on average 1.5315315315315314) internal successors, (340), 222 states have internal predecessors, (340), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:50,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:50,899 INFO L93 Difference]: Finished difference Result 304 states and 452 transitions. [2022-04-08 08:42:50,899 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 452 transitions. [2022-04-08 08:42:50,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:50,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:50,900 INFO L74 IsIncluded]: Start isIncluded. First operand has 227 states, 222 states have (on average 1.5315315315315314) internal successors, (340), 222 states have internal predecessors, (340), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 304 states. [2022-04-08 08:42:50,900 INFO L87 Difference]: Start difference. First operand has 227 states, 222 states have (on average 1.5315315315315314) internal successors, (340), 222 states have internal predecessors, (340), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 304 states. [2022-04-08 08:42:50,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:50,906 INFO L93 Difference]: Finished difference Result 304 states and 452 transitions. [2022-04-08 08:42:50,906 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 452 transitions. [2022-04-08 08:42:50,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:50,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:50,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:42:50,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:42:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 222 states have (on average 1.5315315315315314) internal successors, (340), 222 states have internal predecessors, (340), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:50,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 344 transitions. [2022-04-08 08:42:50,911 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 344 transitions. Word has length 66 [2022-04-08 08:42:50,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:42:50,912 INFO L478 AbstractCegarLoop]: Abstraction has 227 states and 344 transitions. [2022-04-08 08:42:50,912 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-08 08:42:50,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 227 states and 344 transitions. [2022-04-08 08:42:51,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 344 edges. 344 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:51,186 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 344 transitions. [2022-04-08 08:42:51,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 08:42:51,186 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:42:51,186 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:42:51,186 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 08:42:51,187 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:42:51,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:42:51,187 INFO L85 PathProgramCache]: Analyzing trace with hash 294785801, now seen corresponding path program 1 times [2022-04-08 08:42:51,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:51,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [99008403] [2022-04-08 08:42:51,214 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:42:51,214 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:42:51,214 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:42:51,215 INFO L85 PathProgramCache]: Analyzing trace with hash 294785801, now seen corresponding path program 2 times [2022-04-08 08:42:51,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:42:51,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801567999] [2022-04-08 08:42:51,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:42:51,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:42:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:51,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:42:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:51,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {18266#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {18259#true} is VALID [2022-04-08 08:42:51,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {18259#true} assume true; {18259#true} is VALID [2022-04-08 08:42:51,344 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18259#true} {18259#true} #688#return; {18259#true} is VALID [2022-04-08 08:42:51,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {18259#true} call ULTIMATE.init(); {18266#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-08 08:42:51,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {18266#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {18259#true} is VALID [2022-04-08 08:42:51,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {18259#true} assume true; {18259#true} is VALID [2022-04-08 08:42:51,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18259#true} {18259#true} #688#return; {18259#true} is VALID [2022-04-08 08:42:51,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {18259#true} call #t~ret161 := main(); {18259#true} is VALID [2022-04-08 08:42:51,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {18259#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; {18259#true} is VALID [2022-04-08 08:42:51,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {18259#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {18259#true} is VALID [2022-04-08 08:42:51,346 INFO L272 TraceCheckUtils]: 7: Hoare triple {18259#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {18259#true} is VALID [2022-04-08 08:42:51,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {18259#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); {18259#true} is VALID [2022-04-08 08:42:51,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {18259#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; {18259#true} is VALID [2022-04-08 08:42:51,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {18259#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; {18259#true} is VALID [2022-04-08 08:42:51,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {18259#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18259#true} is VALID [2022-04-08 08:42:51,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {18259#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {18259#true} is VALID [2022-04-08 08:42:51,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {18259#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {18259#true} is VALID [2022-04-08 08:42:51,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {18259#true} assume !false; {18259#true} is VALID [2022-04-08 08:42:51,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {18259#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); {18259#true} is VALID [2022-04-08 08:42:51,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {18259#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18259#true} is VALID [2022-04-08 08:42:51,347 INFO L290 TraceCheckUtils]: 17: Hoare triple {18259#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18259#true} is VALID [2022-04-08 08:42:51,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {18259#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18259#true} is VALID [2022-04-08 08:42:51,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {18259#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18259#true} is VALID [2022-04-08 08:42:51,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {18259#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18259#true} is VALID [2022-04-08 08:42:51,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {18259#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18259#true} is VALID [2022-04-08 08:42:51,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {18259#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18259#true} is VALID [2022-04-08 08:42:51,348 INFO L290 TraceCheckUtils]: 23: Hoare triple {18259#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18259#true} is VALID [2022-04-08 08:42:51,348 INFO L290 TraceCheckUtils]: 24: Hoare triple {18259#true} assume 8464 == #t~mem55;havoc #t~mem55; {18259#true} is VALID [2022-04-08 08:42:51,348 INFO L290 TraceCheckUtils]: 25: Hoare triple {18259#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; {18259#true} is VALID [2022-04-08 08:42:51,348 INFO L290 TraceCheckUtils]: 26: Hoare triple {18259#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {18259#true} is VALID [2022-04-08 08:42:51,349 INFO L290 TraceCheckUtils]: 27: Hoare triple {18259#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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,349 INFO L290 TraceCheckUtils]: 28: Hoare triple {18264#(not (= 8641 (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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,350 INFO L290 TraceCheckUtils]: 29: Hoare triple {18264#(not (= 8641 (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; {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,350 INFO L290 TraceCheckUtils]: 30: Hoare triple {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,351 INFO L290 TraceCheckUtils]: 31: Hoare triple {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,351 INFO L290 TraceCheckUtils]: 32: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,351 INFO L290 TraceCheckUtils]: 33: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,352 INFO L290 TraceCheckUtils]: 34: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,352 INFO L290 TraceCheckUtils]: 35: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,353 INFO L290 TraceCheckUtils]: 36: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,353 INFO L290 TraceCheckUtils]: 37: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,353 INFO L290 TraceCheckUtils]: 38: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,354 INFO L290 TraceCheckUtils]: 39: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,354 INFO L290 TraceCheckUtils]: 40: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,355 INFO L290 TraceCheckUtils]: 41: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,355 INFO L290 TraceCheckUtils]: 42: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,356 INFO L290 TraceCheckUtils]: 43: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,356 INFO L290 TraceCheckUtils]: 44: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,356 INFO L290 TraceCheckUtils]: 45: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,357 INFO L290 TraceCheckUtils]: 46: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,357 INFO L290 TraceCheckUtils]: 47: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,358 INFO L290 TraceCheckUtils]: 48: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,358 INFO L290 TraceCheckUtils]: 49: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,359 INFO L290 TraceCheckUtils]: 50: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,359 INFO L290 TraceCheckUtils]: 51: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,360 INFO L290 TraceCheckUtils]: 52: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,360 INFO L290 TraceCheckUtils]: 53: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,361 INFO L290 TraceCheckUtils]: 54: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,361 INFO L290 TraceCheckUtils]: 55: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,362 INFO L290 TraceCheckUtils]: 56: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,362 INFO L290 TraceCheckUtils]: 57: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,362 INFO L290 TraceCheckUtils]: 58: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,363 INFO L290 TraceCheckUtils]: 59: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,363 INFO L290 TraceCheckUtils]: 60: Hoare triple {18264#(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); {18264#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:51,364 INFO L290 TraceCheckUtils]: 61: Hoare triple {18264#(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); {18265#(not (= |ssl3_accept_#t~mem76| 8641))} is VALID [2022-04-08 08:42:51,364 INFO L290 TraceCheckUtils]: 62: Hoare triple {18265#(not (= |ssl3_accept_#t~mem76| 8641))} assume 8641 == #t~mem76;havoc #t~mem76; {18260#false} is VALID [2022-04-08 08:42:51,364 INFO L290 TraceCheckUtils]: 63: Hoare triple {18260#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {18260#false} is VALID [2022-04-08 08:42:51,364 INFO L290 TraceCheckUtils]: 64: Hoare triple {18260#false} assume !(4 == ~blastFlag~0); {18260#false} is VALID [2022-04-08 08:42:51,364 INFO L290 TraceCheckUtils]: 65: Hoare triple {18260#false} assume !(7 == ~blastFlag~0); {18260#false} is VALID [2022-04-08 08:42:51,364 INFO L290 TraceCheckUtils]: 66: Hoare triple {18260#false} assume !false; {18260#false} is VALID [2022-04-08 08:42:51,365 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:42:51,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:42:51,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801567999] [2022-04-08 08:42:51,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801567999] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:51,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:51,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:51,367 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:42:51,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [99008403] [2022-04-08 08:42:51,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [99008403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:51,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:51,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:51,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920358820] [2022-04-08 08:42:51,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:42:51,368 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 67 [2022-04-08 08:42:51,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:42:51,369 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-08 08:42:51,428 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-08 08:42:51,428 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:42:51,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:51,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:42:51,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:42:51,430 INFO L87 Difference]: Start difference. First operand 227 states and 344 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-08 08:42:58,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:58,290 INFO L93 Difference]: Finished difference Result 526 states and 809 transitions. [2022-04-08 08:42:58,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:42:58,290 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 67 [2022-04-08 08:42:58,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:42:58,291 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-08 08:42:58,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-04-08 08:42:58,293 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-08 08:42:58,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-04-08 08:42:58,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 587 transitions. [2022-04-08 08:42:58,693 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-08 08:42:58,697 INFO L225 Difference]: With dead ends: 526 [2022-04-08 08:42:58,698 INFO L226 Difference]: Without dead ends: 325 [2022-04-08 08:42:58,698 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:42:58,699 INFO L913 BasicCegarLoop]: 127 mSDtfsCounter, 116 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:42:58,699 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 362 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-08 08:42:58,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-04-08 08:42:58,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 249. [2022-04-08 08:42:58,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:42:58,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 325 states. Second operand has 249 states, 244 states have (on average 1.569672131147541) internal successors, (383), 244 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:58,709 INFO L74 IsIncluded]: Start isIncluded. First operand 325 states. Second operand has 249 states, 244 states have (on average 1.569672131147541) internal successors, (383), 244 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:58,710 INFO L87 Difference]: Start difference. First operand 325 states. Second operand has 249 states, 244 states have (on average 1.569672131147541) internal successors, (383), 244 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:58,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:58,716 INFO L93 Difference]: Finished difference Result 325 states and 493 transitions. [2022-04-08 08:42:58,716 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 493 transitions. [2022-04-08 08:42:58,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:58,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:58,717 INFO L74 IsIncluded]: Start isIncluded. First operand has 249 states, 244 states have (on average 1.569672131147541) internal successors, (383), 244 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 325 states. [2022-04-08 08:42:58,717 INFO L87 Difference]: Start difference. First operand has 249 states, 244 states have (on average 1.569672131147541) internal successors, (383), 244 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 325 states. [2022-04-08 08:42:58,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:58,724 INFO L93 Difference]: Finished difference Result 325 states and 493 transitions. [2022-04-08 08:42:58,724 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 493 transitions. [2022-04-08 08:42:58,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:58,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:58,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:42:58,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:42:58,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 244 states have (on average 1.569672131147541) internal successors, (383), 244 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:58,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 387 transitions. [2022-04-08 08:42:58,730 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 387 transitions. Word has length 67 [2022-04-08 08:42:58,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:42:58,730 INFO L478 AbstractCegarLoop]: Abstraction has 249 states and 387 transitions. [2022-04-08 08:42:58,730 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-08 08:42:58,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 249 states and 387 transitions. [2022-04-08 08:42:59,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:59,008 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 387 transitions. [2022-04-08 08:42:59,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-08 08:42:59,009 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:42:59,009 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-08 08:42:59,009 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 08:42:59,009 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:42:59,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:42:59,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1226015397, now seen corresponding path program 1 times [2022-04-08 08:42:59,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:59,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1370249440] [2022-04-08 08:42:59,057 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:42:59,058 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:42:59,058 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:42:59,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1226015397, now seen corresponding path program 2 times [2022-04-08 08:42:59,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:42:59,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908356350] [2022-04-08 08:42:59,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:42:59,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:42:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:59,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:42:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:59,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {20478#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {20471#true} is VALID [2022-04-08 08:42:59,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {20471#true} assume true; {20471#true} is VALID [2022-04-08 08:42:59,194 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20471#true} {20471#true} #688#return; {20471#true} is VALID [2022-04-08 08:42:59,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {20471#true} call ULTIMATE.init(); {20478#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-08 08:42:59,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {20478#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {20471#true} is VALID [2022-04-08 08:42:59,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {20471#true} assume true; {20471#true} is VALID [2022-04-08 08:42:59,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20471#true} {20471#true} #688#return; {20471#true} is VALID [2022-04-08 08:42:59,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {20471#true} call #t~ret161 := main(); {20471#true} is VALID [2022-04-08 08:42:59,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {20471#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; {20471#true} is VALID [2022-04-08 08:42:59,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {20471#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {20471#true} is VALID [2022-04-08 08:42:59,195 INFO L272 TraceCheckUtils]: 7: Hoare triple {20471#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {20471#true} is VALID [2022-04-08 08:42:59,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {20471#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); {20471#true} is VALID [2022-04-08 08:42:59,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {20471#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; {20471#true} is VALID [2022-04-08 08:42:59,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {20471#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; {20471#true} is VALID [2022-04-08 08:42:59,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {20471#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {20471#true} is VALID [2022-04-08 08:42:59,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {20471#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {20471#true} is VALID [2022-04-08 08:42:59,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {20471#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {20471#true} is VALID [2022-04-08 08:42:59,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {20471#true} assume !false; {20471#true} is VALID [2022-04-08 08:42:59,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {20471#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); {20471#true} is VALID [2022-04-08 08:42:59,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {20471#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20471#true} is VALID [2022-04-08 08:42:59,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {20471#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20471#true} is VALID [2022-04-08 08:42:59,197 INFO L290 TraceCheckUtils]: 18: Hoare triple {20471#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20471#true} is VALID [2022-04-08 08:42:59,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {20471#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20471#true} is VALID [2022-04-08 08:42:59,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {20471#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20471#true} is VALID [2022-04-08 08:42:59,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {20471#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20471#true} is VALID [2022-04-08 08:42:59,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {20471#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20471#true} is VALID [2022-04-08 08:42:59,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {20471#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20471#true} is VALID [2022-04-08 08:42:59,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {20471#true} assume 8464 == #t~mem55;havoc #t~mem55; {20471#true} is VALID [2022-04-08 08:42:59,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {20471#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; {20471#true} is VALID [2022-04-08 08:42:59,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {20471#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {20471#true} is VALID [2022-04-08 08:42:59,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {20471#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); {20476#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:59,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {20476#(= 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); {20476#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:59,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {20476#(= 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; {20476#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:59,200 INFO L290 TraceCheckUtils]: 30: Hoare triple {20476#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {20476#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:59,200 INFO L290 TraceCheckUtils]: 31: Hoare triple {20476#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {20476#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:59,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {20476#(= 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); {20476#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:59,208 INFO L290 TraceCheckUtils]: 33: Hoare triple {20476#(= 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); {20476#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:59,209 INFO L290 TraceCheckUtils]: 34: Hoare triple {20476#(= 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); {20476#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:59,209 INFO L290 TraceCheckUtils]: 35: Hoare triple {20476#(= 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); {20476#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:59,210 INFO L290 TraceCheckUtils]: 36: Hoare triple {20476#(= 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); {20476#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:59,210 INFO L290 TraceCheckUtils]: 37: Hoare triple {20476#(= 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); {20476#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:59,210 INFO L290 TraceCheckUtils]: 38: Hoare triple {20476#(= 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); {20476#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:59,211 INFO L290 TraceCheckUtils]: 39: Hoare triple {20476#(= 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); {20476#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:59,211 INFO L290 TraceCheckUtils]: 40: Hoare triple {20476#(= 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); {20476#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:59,212 INFO L290 TraceCheckUtils]: 41: Hoare triple {20476#(= 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); {20476#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:59,212 INFO L290 TraceCheckUtils]: 42: Hoare triple {20476#(= 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); {20476#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:59,213 INFO L290 TraceCheckUtils]: 43: Hoare triple {20476#(= 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); {20477#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-08 08:42:59,213 INFO L290 TraceCheckUtils]: 44: Hoare triple {20477#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,213 INFO L290 TraceCheckUtils]: 45: Hoare triple {20472#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,213 INFO L290 TraceCheckUtils]: 46: Hoare triple {20472#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,213 INFO L290 TraceCheckUtils]: 47: Hoare triple {20472#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,214 INFO L290 TraceCheckUtils]: 48: Hoare triple {20472#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,214 INFO L290 TraceCheckUtils]: 49: Hoare triple {20472#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,214 INFO L290 TraceCheckUtils]: 50: Hoare triple {20472#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,214 INFO L290 TraceCheckUtils]: 51: Hoare triple {20472#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,214 INFO L290 TraceCheckUtils]: 52: Hoare triple {20472#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,214 INFO L290 TraceCheckUtils]: 53: Hoare triple {20472#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,214 INFO L290 TraceCheckUtils]: 54: Hoare triple {20472#false} assume 8448 == #t~mem68;havoc #t~mem68; {20472#false} is VALID [2022-04-08 08:42:59,214 INFO L290 TraceCheckUtils]: 55: Hoare triple {20472#false} assume !(~num1~0 > 0); {20472#false} is VALID [2022-04-08 08:42:59,214 INFO L290 TraceCheckUtils]: 56: Hoare triple {20472#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; {20472#false} is VALID [2022-04-08 08:42:59,215 INFO L290 TraceCheckUtils]: 57: Hoare triple {20472#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); {20472#false} is VALID [2022-04-08 08:42:59,215 INFO L290 TraceCheckUtils]: 58: Hoare triple {20472#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {20472#false} is VALID [2022-04-08 08:42:59,215 INFO L290 TraceCheckUtils]: 59: Hoare triple {20472#false} ~skip~0 := 0; {20472#false} is VALID [2022-04-08 08:42:59,215 INFO L290 TraceCheckUtils]: 60: Hoare triple {20472#false} assume !false; {20472#false} is VALID [2022-04-08 08:42:59,215 INFO L290 TraceCheckUtils]: 61: Hoare triple {20472#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); {20472#false} is VALID [2022-04-08 08:42:59,215 INFO L290 TraceCheckUtils]: 62: Hoare triple {20472#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,215 INFO L290 TraceCheckUtils]: 63: Hoare triple {20472#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,215 INFO L290 TraceCheckUtils]: 64: Hoare triple {20472#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,215 INFO L290 TraceCheckUtils]: 65: Hoare triple {20472#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,215 INFO L290 TraceCheckUtils]: 66: Hoare triple {20472#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,216 INFO L290 TraceCheckUtils]: 67: Hoare triple {20472#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,216 INFO L290 TraceCheckUtils]: 68: Hoare triple {20472#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,216 INFO L290 TraceCheckUtils]: 69: Hoare triple {20472#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,216 INFO L290 TraceCheckUtils]: 70: Hoare triple {20472#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,216 INFO L290 TraceCheckUtils]: 71: Hoare triple {20472#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,216 INFO L290 TraceCheckUtils]: 72: Hoare triple {20472#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,216 INFO L290 TraceCheckUtils]: 73: Hoare triple {20472#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,216 INFO L290 TraceCheckUtils]: 74: Hoare triple {20472#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,216 INFO L290 TraceCheckUtils]: 75: Hoare triple {20472#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,216 INFO L290 TraceCheckUtils]: 76: Hoare triple {20472#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,217 INFO L290 TraceCheckUtils]: 77: Hoare triple {20472#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,217 INFO L290 TraceCheckUtils]: 78: Hoare triple {20472#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,217 INFO L290 TraceCheckUtils]: 79: Hoare triple {20472#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,217 INFO L290 TraceCheckUtils]: 80: Hoare triple {20472#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,217 INFO L290 TraceCheckUtils]: 81: Hoare triple {20472#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,217 INFO L290 TraceCheckUtils]: 82: Hoare triple {20472#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,217 INFO L290 TraceCheckUtils]: 83: Hoare triple {20472#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,217 INFO L290 TraceCheckUtils]: 84: Hoare triple {20472#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,217 INFO L290 TraceCheckUtils]: 85: Hoare triple {20472#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,217 INFO L290 TraceCheckUtils]: 86: Hoare triple {20472#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,218 INFO L290 TraceCheckUtils]: 87: Hoare triple {20472#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,218 INFO L290 TraceCheckUtils]: 88: Hoare triple {20472#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,218 INFO L290 TraceCheckUtils]: 89: Hoare triple {20472#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {20472#false} is VALID [2022-04-08 08:42:59,218 INFO L290 TraceCheckUtils]: 90: Hoare triple {20472#false} assume 8640 == #t~mem75;havoc #t~mem75; {20472#false} is VALID [2022-04-08 08:42:59,218 INFO L290 TraceCheckUtils]: 91: Hoare triple {20472#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {20472#false} is VALID [2022-04-08 08:42:59,218 INFO L290 TraceCheckUtils]: 92: Hoare triple {20472#false} assume !(4 == ~blastFlag~0); {20472#false} is VALID [2022-04-08 08:42:59,218 INFO L290 TraceCheckUtils]: 93: Hoare triple {20472#false} assume !(7 == ~blastFlag~0); {20472#false} is VALID [2022-04-08 08:42:59,218 INFO L290 TraceCheckUtils]: 94: Hoare triple {20472#false} assume !false; {20472#false} is VALID [2022-04-08 08:42:59,219 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 08:42:59,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:42:59,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908356350] [2022-04-08 08:42:59,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908356350] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:59,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:59,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:59,220 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:42:59,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1370249440] [2022-04-08 08:42:59,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1370249440] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:59,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:59,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:59,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916723443] [2022-04-08 08:42:59,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:42:59,221 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 95 [2022-04-08 08:42:59,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:42:59,221 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-08 08:42:59,297 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-08 08:42:59,298 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:42:59,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:59,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:42:59,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:42:59,299 INFO L87 Difference]: Start difference. First operand 249 states and 387 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-08 08:43:03,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:03,383 INFO L93 Difference]: Finished difference Result 512 states and 803 transitions. [2022-04-08 08:43:03,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:43:03,383 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 95 [2022-04-08 08:43:03,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:43:03,383 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-08 08:43:03,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2022-04-08 08:43:03,386 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-08 08:43:03,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2022-04-08 08:43:03,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 468 transitions. [2022-04-08 08:43:03,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 468 edges. 468 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:03,707 INFO L225 Difference]: With dead ends: 512 [2022-04-08 08:43:03,707 INFO L226 Difference]: Without dead ends: 289 [2022-04-08 08:43:03,709 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:43:03,710 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 29 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:43:03,710 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 507 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-08 08:43:03,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-04-08 08:43:03,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 271. [2022-04-08 08:43:03,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:43:03,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 289 states. Second operand has 271 states, 266 states have (on average 1.5639097744360901) internal successors, (416), 266 states have internal predecessors, (416), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:03,731 INFO L74 IsIncluded]: Start isIncluded. First operand 289 states. Second operand has 271 states, 266 states have (on average 1.5639097744360901) internal successors, (416), 266 states have internal predecessors, (416), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:03,731 INFO L87 Difference]: Start difference. First operand 289 states. Second operand has 271 states, 266 states have (on average 1.5639097744360901) internal successors, (416), 266 states have internal predecessors, (416), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:03,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:03,736 INFO L93 Difference]: Finished difference Result 289 states and 444 transitions. [2022-04-08 08:43:03,737 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 444 transitions. [2022-04-08 08:43:03,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:03,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:03,744 INFO L74 IsIncluded]: Start isIncluded. First operand has 271 states, 266 states have (on average 1.5639097744360901) internal successors, (416), 266 states have internal predecessors, (416), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 289 states. [2022-04-08 08:43:03,744 INFO L87 Difference]: Start difference. First operand has 271 states, 266 states have (on average 1.5639097744360901) internal successors, (416), 266 states have internal predecessors, (416), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 289 states. [2022-04-08 08:43:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:03,750 INFO L93 Difference]: Finished difference Result 289 states and 444 transitions. [2022-04-08 08:43:03,750 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 444 transitions. [2022-04-08 08:43:03,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:03,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:03,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:43:03,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:43:03,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 266 states have (on average 1.5639097744360901) internal successors, (416), 266 states have internal predecessors, (416), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:03,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 420 transitions. [2022-04-08 08:43:03,757 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 420 transitions. Word has length 95 [2022-04-08 08:43:03,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:43:03,759 INFO L478 AbstractCegarLoop]: Abstraction has 271 states and 420 transitions. [2022-04-08 08:43:03,759 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-08 08:43:03,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 271 states and 420 transitions. [2022-04-08 08:43:04,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 420 edges. 420 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:04,065 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 420 transitions. [2022-04-08 08:43:04,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-08 08:43:04,067 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:43:04,067 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 08:43:04,067 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 08:43:04,067 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:43:04,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:43:04,068 INFO L85 PathProgramCache]: Analyzing trace with hash -192714178, now seen corresponding path program 1 times [2022-04-08 08:43:04,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:04,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1048582325] [2022-04-08 08:43:04,167 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:43:04,167 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:43:04,167 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:43:04,167 INFO L85 PathProgramCache]: Analyzing trace with hash -192714178, now seen corresponding path program 2 times [2022-04-08 08:43:04,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:43:04,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312795294] [2022-04-08 08:43:04,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:43:04,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:43:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:04,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:43:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:04,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {22634#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {22627#true} is VALID [2022-04-08 08:43:04,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {22627#true} assume true; {22627#true} is VALID [2022-04-08 08:43:04,288 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22627#true} {22627#true} #688#return; {22627#true} is VALID [2022-04-08 08:43:04,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {22627#true} call ULTIMATE.init(); {22634#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-08 08:43:04,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {22634#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {22627#true} is VALID [2022-04-08 08:43:04,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {22627#true} assume true; {22627#true} is VALID [2022-04-08 08:43:04,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22627#true} {22627#true} #688#return; {22627#true} is VALID [2022-04-08 08:43:04,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {22627#true} call #t~ret161 := main(); {22627#true} is VALID [2022-04-08 08:43:04,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {22627#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; {22627#true} is VALID [2022-04-08 08:43:04,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {22627#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {22627#true} is VALID [2022-04-08 08:43:04,290 INFO L272 TraceCheckUtils]: 7: Hoare triple {22627#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {22627#true} is VALID [2022-04-08 08:43:04,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {22627#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); {22627#true} is VALID [2022-04-08 08:43:04,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {22627#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; {22627#true} is VALID [2022-04-08 08:43:04,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {22627#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; {22627#true} is VALID [2022-04-08 08:43:04,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {22627#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {22627#true} is VALID [2022-04-08 08:43:04,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {22627#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {22627#true} is VALID [2022-04-08 08:43:04,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {22627#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {22627#true} is VALID [2022-04-08 08:43:04,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {22627#true} assume !false; {22627#true} is VALID [2022-04-08 08:43:04,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {22627#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); {22627#true} is VALID [2022-04-08 08:43:04,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {22627#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22627#true} is VALID [2022-04-08 08:43:04,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {22627#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22627#true} is VALID [2022-04-08 08:43:04,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {22627#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22627#true} is VALID [2022-04-08 08:43:04,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {22627#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22627#true} is VALID [2022-04-08 08:43:04,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {22627#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22627#true} is VALID [2022-04-08 08:43:04,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {22627#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22627#true} is VALID [2022-04-08 08:43:04,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {22627#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22627#true} is VALID [2022-04-08 08:43:04,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {22627#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22627#true} is VALID [2022-04-08 08:43:04,291 INFO L290 TraceCheckUtils]: 24: Hoare triple {22627#true} assume 8464 == #t~mem55;havoc #t~mem55; {22627#true} is VALID [2022-04-08 08:43:04,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {22627#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; {22627#true} is VALID [2022-04-08 08:43:04,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {22627#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {22627#true} is VALID [2022-04-08 08:43:04,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {22627#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); {22627#true} is VALID [2022-04-08 08:43:04,292 INFO L290 TraceCheckUtils]: 28: Hoare triple {22627#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); {22627#true} is VALID [2022-04-08 08:43:04,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {22627#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {22627#true} is VALID [2022-04-08 08:43:04,292 INFO L290 TraceCheckUtils]: 30: Hoare triple {22627#true} ~skip~0 := 0; {22627#true} is VALID [2022-04-08 08:43:04,292 INFO L290 TraceCheckUtils]: 31: Hoare triple {22627#true} assume !false; {22627#true} is VALID [2022-04-08 08:43:04,292 INFO L290 TraceCheckUtils]: 32: Hoare triple {22627#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); {22627#true} is VALID [2022-04-08 08:43:04,292 INFO L290 TraceCheckUtils]: 33: Hoare triple {22627#true} assume 12292 == #t~mem47;havoc #t~mem47; {22627#true} is VALID [2022-04-08 08:43:04,292 INFO L290 TraceCheckUtils]: 34: Hoare triple {22627#true} call write~int(1, ~s.base, 40 + ~s.offset, 4); {22627#true} is VALID [2022-04-08 08:43:04,293 INFO L290 TraceCheckUtils]: 35: Hoare triple {22627#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {22627#true} is VALID [2022-04-08 08:43:04,293 INFO L290 TraceCheckUtils]: 36: Hoare triple {22627#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {22627#true} is VALID [2022-04-08 08:43:04,293 INFO L290 TraceCheckUtils]: 37: Hoare triple {22627#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {22627#true} is VALID [2022-04-08 08:43:04,293 INFO L290 TraceCheckUtils]: 38: Hoare triple {22627#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); {22627#true} is VALID [2022-04-08 08:43:04,293 INFO L290 TraceCheckUtils]: 39: Hoare triple {22627#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {22627#true} is VALID [2022-04-08 08:43:04,293 INFO L290 TraceCheckUtils]: 40: Hoare triple {22627#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); {22627#true} is VALID [2022-04-08 08:43:04,294 INFO L290 TraceCheckUtils]: 41: Hoare triple {22627#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); {22632#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:04,295 INFO L290 TraceCheckUtils]: 42: Hoare triple {22632#(= 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); {22632#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:04,295 INFO L290 TraceCheckUtils]: 43: Hoare triple {22632#(= 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; {22632#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:04,295 INFO L290 TraceCheckUtils]: 44: Hoare triple {22632#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {22632#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:04,296 INFO L290 TraceCheckUtils]: 45: Hoare triple {22632#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {22632#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:04,296 INFO L290 TraceCheckUtils]: 46: Hoare triple {22632#(= 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); {22632#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:04,297 INFO L290 TraceCheckUtils]: 47: Hoare triple {22632#(= 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); {22632#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:04,297 INFO L290 TraceCheckUtils]: 48: Hoare triple {22632#(= 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); {22632#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:04,297 INFO L290 TraceCheckUtils]: 49: Hoare triple {22632#(= 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); {22632#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:04,298 INFO L290 TraceCheckUtils]: 50: Hoare triple {22632#(= 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); {22632#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:04,298 INFO L290 TraceCheckUtils]: 51: Hoare triple {22632#(= 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); {22633#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-08 08:43:04,299 INFO L290 TraceCheckUtils]: 52: Hoare triple {22633#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,299 INFO L290 TraceCheckUtils]: 53: Hoare triple {22628#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,299 INFO L290 TraceCheckUtils]: 54: Hoare triple {22628#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,299 INFO L290 TraceCheckUtils]: 55: Hoare triple {22628#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,299 INFO L290 TraceCheckUtils]: 56: Hoare triple {22628#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,299 INFO L290 TraceCheckUtils]: 57: Hoare triple {22628#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,299 INFO L290 TraceCheckUtils]: 58: Hoare triple {22628#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,299 INFO L290 TraceCheckUtils]: 59: Hoare triple {22628#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,299 INFO L290 TraceCheckUtils]: 60: Hoare triple {22628#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,300 INFO L290 TraceCheckUtils]: 61: Hoare triple {22628#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,300 INFO L290 TraceCheckUtils]: 62: Hoare triple {22628#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,300 INFO L290 TraceCheckUtils]: 63: Hoare triple {22628#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,300 INFO L290 TraceCheckUtils]: 64: Hoare triple {22628#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,300 INFO L290 TraceCheckUtils]: 65: Hoare triple {22628#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,300 INFO L290 TraceCheckUtils]: 66: Hoare triple {22628#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,300 INFO L290 TraceCheckUtils]: 67: Hoare triple {22628#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,300 INFO L290 TraceCheckUtils]: 68: Hoare triple {22628#false} assume 8448 == #t~mem68;havoc #t~mem68; {22628#false} is VALID [2022-04-08 08:43:04,300 INFO L290 TraceCheckUtils]: 69: Hoare triple {22628#false} assume !(~num1~0 > 0); {22628#false} is VALID [2022-04-08 08:43:04,300 INFO L290 TraceCheckUtils]: 70: Hoare triple {22628#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; {22628#false} is VALID [2022-04-08 08:43:04,301 INFO L290 TraceCheckUtils]: 71: Hoare triple {22628#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); {22628#false} is VALID [2022-04-08 08:43:04,301 INFO L290 TraceCheckUtils]: 72: Hoare triple {22628#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {22628#false} is VALID [2022-04-08 08:43:04,301 INFO L290 TraceCheckUtils]: 73: Hoare triple {22628#false} ~skip~0 := 0; {22628#false} is VALID [2022-04-08 08:43:04,301 INFO L290 TraceCheckUtils]: 74: Hoare triple {22628#false} assume !false; {22628#false} is VALID [2022-04-08 08:43:04,301 INFO L290 TraceCheckUtils]: 75: Hoare triple {22628#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); {22628#false} is VALID [2022-04-08 08:43:04,301 INFO L290 TraceCheckUtils]: 76: Hoare triple {22628#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,301 INFO L290 TraceCheckUtils]: 77: Hoare triple {22628#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,301 INFO L290 TraceCheckUtils]: 78: Hoare triple {22628#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,301 INFO L290 TraceCheckUtils]: 79: Hoare triple {22628#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,302 INFO L290 TraceCheckUtils]: 80: Hoare triple {22628#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,302 INFO L290 TraceCheckUtils]: 81: Hoare triple {22628#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,302 INFO L290 TraceCheckUtils]: 82: Hoare triple {22628#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,302 INFO L290 TraceCheckUtils]: 83: Hoare triple {22628#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,302 INFO L290 TraceCheckUtils]: 84: Hoare triple {22628#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,302 INFO L290 TraceCheckUtils]: 85: Hoare triple {22628#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,302 INFO L290 TraceCheckUtils]: 86: Hoare triple {22628#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,302 INFO L290 TraceCheckUtils]: 87: Hoare triple {22628#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,302 INFO L290 TraceCheckUtils]: 88: Hoare triple {22628#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,302 INFO L290 TraceCheckUtils]: 89: Hoare triple {22628#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,303 INFO L290 TraceCheckUtils]: 90: Hoare triple {22628#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,303 INFO L290 TraceCheckUtils]: 91: Hoare triple {22628#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,303 INFO L290 TraceCheckUtils]: 92: Hoare triple {22628#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,303 INFO L290 TraceCheckUtils]: 93: Hoare triple {22628#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,303 INFO L290 TraceCheckUtils]: 94: Hoare triple {22628#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,303 INFO L290 TraceCheckUtils]: 95: Hoare triple {22628#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,303 INFO L290 TraceCheckUtils]: 96: Hoare triple {22628#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,303 INFO L290 TraceCheckUtils]: 97: Hoare triple {22628#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,303 INFO L290 TraceCheckUtils]: 98: Hoare triple {22628#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,304 INFO L290 TraceCheckUtils]: 99: Hoare triple {22628#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,304 INFO L290 TraceCheckUtils]: 100: Hoare triple {22628#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,304 INFO L290 TraceCheckUtils]: 101: Hoare triple {22628#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,304 INFO L290 TraceCheckUtils]: 102: Hoare triple {22628#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,304 INFO L290 TraceCheckUtils]: 103: Hoare triple {22628#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {22628#false} is VALID [2022-04-08 08:43:04,304 INFO L290 TraceCheckUtils]: 104: Hoare triple {22628#false} assume 8640 == #t~mem75;havoc #t~mem75; {22628#false} is VALID [2022-04-08 08:43:04,304 INFO L290 TraceCheckUtils]: 105: Hoare triple {22628#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {22628#false} is VALID [2022-04-08 08:43:04,304 INFO L290 TraceCheckUtils]: 106: Hoare triple {22628#false} assume !(4 == ~blastFlag~0); {22628#false} is VALID [2022-04-08 08:43:04,304 INFO L290 TraceCheckUtils]: 107: Hoare triple {22628#false} assume !(7 == ~blastFlag~0); {22628#false} is VALID [2022-04-08 08:43:04,304 INFO L290 TraceCheckUtils]: 108: Hoare triple {22628#false} assume !false; {22628#false} is VALID [2022-04-08 08:43:04,305 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-08 08:43:04,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:43:04,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312795294] [2022-04-08 08:43:04,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312795294] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:04,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:04,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:04,305 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:43:04,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1048582325] [2022-04-08 08:43:04,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1048582325] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:04,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:04,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:04,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240838429] [2022-04-08 08:43:04,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:43:04,306 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 109 [2022-04-08 08:43:04,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:43:04,307 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-08 08:43:04,375 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-08 08:43:04,376 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:43:04,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:04,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:43:04,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:43:04,376 INFO L87 Difference]: Start difference. First operand 271 states and 420 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-08 08:43:11,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:11,400 INFO L93 Difference]: Finished difference Result 529 states and 827 transitions. [2022-04-08 08:43:11,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:43:11,400 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 109 [2022-04-08 08:43:11,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:43:11,400 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-08 08:43:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-08 08:43:11,402 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-08 08:43:11,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-08 08:43:11,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 451 transitions. [2022-04-08 08:43:11,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:11,692 INFO L225 Difference]: With dead ends: 529 [2022-04-08 08:43:11,692 INFO L226 Difference]: Without dead ends: 284 [2022-04-08 08:43:11,693 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:43:11,693 INFO L913 BasicCegarLoop]: 227 mSDtfsCounter, 20 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:43:11,693 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 568 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-08 08:43:11,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-04-08 08:43:11,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 271. [2022-04-08 08:43:11,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:43:11,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 284 states. Second operand has 271 states, 266 states have (on average 1.5601503759398496) internal successors, (415), 266 states have internal predecessors, (415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:11,705 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand has 271 states, 266 states have (on average 1.5601503759398496) internal successors, (415), 266 states have internal predecessors, (415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:11,705 INFO L87 Difference]: Start difference. First operand 284 states. Second operand has 271 states, 266 states have (on average 1.5601503759398496) internal successors, (415), 266 states have internal predecessors, (415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:11,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:11,710 INFO L93 Difference]: Finished difference Result 284 states and 435 transitions. [2022-04-08 08:43:11,710 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 435 transitions. [2022-04-08 08:43:11,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:11,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:11,711 INFO L74 IsIncluded]: Start isIncluded. First operand has 271 states, 266 states have (on average 1.5601503759398496) internal successors, (415), 266 states have internal predecessors, (415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 284 states. [2022-04-08 08:43:11,727 INFO L87 Difference]: Start difference. First operand has 271 states, 266 states have (on average 1.5601503759398496) internal successors, (415), 266 states have internal predecessors, (415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 284 states. [2022-04-08 08:43:11,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:11,733 INFO L93 Difference]: Finished difference Result 284 states and 435 transitions. [2022-04-08 08:43:11,733 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 435 transitions. [2022-04-08 08:43:11,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:11,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:11,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:43:11,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:43:11,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 266 states have (on average 1.5601503759398496) internal successors, (415), 266 states have internal predecessors, (415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:11,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 419 transitions. [2022-04-08 08:43:11,740 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 419 transitions. Word has length 109 [2022-04-08 08:43:11,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:43:11,741 INFO L478 AbstractCegarLoop]: Abstraction has 271 states and 419 transitions. [2022-04-08 08:43:11,741 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-08 08:43:11,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 271 states and 419 transitions. [2022-04-08 08:43:12,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 419 edges. 419 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:12,046 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 419 transitions. [2022-04-08 08:43:12,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-08 08:43:12,047 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:43:12,048 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 08:43:12,048 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 08:43:12,048 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:43:12,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:43:12,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2124754523, now seen corresponding path program 1 times [2022-04-08 08:43:12,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:12,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1756010454] [2022-04-08 08:43:12,120 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:43:12,120 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:43:12,120 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:43:12,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2124754523, now seen corresponding path program 2 times [2022-04-08 08:43:12,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:43:12,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194417163] [2022-04-08 08:43:12,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:43:12,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:43:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:12,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:43:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:12,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {24815#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {24807#true} is VALID [2022-04-08 08:43:12,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {24807#true} assume true; {24807#true} is VALID [2022-04-08 08:43:12,271 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24807#true} {24807#true} #688#return; {24807#true} is VALID [2022-04-08 08:43:12,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {24807#true} call ULTIMATE.init(); {24815#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-08 08:43:12,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {24815#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {24807#true} is VALID [2022-04-08 08:43:12,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {24807#true} assume true; {24807#true} is VALID [2022-04-08 08:43:12,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24807#true} {24807#true} #688#return; {24807#true} is VALID [2022-04-08 08:43:12,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {24807#true} call #t~ret161 := main(); {24807#true} is VALID [2022-04-08 08:43:12,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {24807#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; {24807#true} is VALID [2022-04-08 08:43:12,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {24807#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {24807#true} is VALID [2022-04-08 08:43:12,273 INFO L272 TraceCheckUtils]: 7: Hoare triple {24807#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {24807#true} is VALID [2022-04-08 08:43:12,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {24807#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); {24807#true} is VALID [2022-04-08 08:43:12,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {24807#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; {24807#true} is VALID [2022-04-08 08:43:12,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {24807#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; {24807#true} is VALID [2022-04-08 08:43:12,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {24807#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {24807#true} is VALID [2022-04-08 08:43:12,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {24807#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {24807#true} is VALID [2022-04-08 08:43:12,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {24807#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {24807#true} is VALID [2022-04-08 08:43:12,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {24807#true} assume !false; {24807#true} is VALID [2022-04-08 08:43:12,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {24807#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); {24807#true} is VALID [2022-04-08 08:43:12,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {24807#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24807#true} is VALID [2022-04-08 08:43:12,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {24807#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24807#true} is VALID [2022-04-08 08:43:12,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {24807#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24807#true} is VALID [2022-04-08 08:43:12,274 INFO L290 TraceCheckUtils]: 19: Hoare triple {24807#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24807#true} is VALID [2022-04-08 08:43:12,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {24807#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24807#true} is VALID [2022-04-08 08:43:12,274 INFO L290 TraceCheckUtils]: 21: Hoare triple {24807#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24807#true} is VALID [2022-04-08 08:43:12,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {24807#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24807#true} is VALID [2022-04-08 08:43:12,274 INFO L290 TraceCheckUtils]: 23: Hoare triple {24807#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24807#true} is VALID [2022-04-08 08:43:12,274 INFO L290 TraceCheckUtils]: 24: Hoare triple {24807#true} assume 8464 == #t~mem55;havoc #t~mem55; {24807#true} is VALID [2022-04-08 08:43:12,274 INFO L290 TraceCheckUtils]: 25: Hoare triple {24807#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; {24807#true} is VALID [2022-04-08 08:43:12,274 INFO L290 TraceCheckUtils]: 26: Hoare triple {24807#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {24807#true} is VALID [2022-04-08 08:43:12,275 INFO L290 TraceCheckUtils]: 27: Hoare triple {24807#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); {24807#true} is VALID [2022-04-08 08:43:12,275 INFO L290 TraceCheckUtils]: 28: Hoare triple {24807#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); {24807#true} is VALID [2022-04-08 08:43:12,275 INFO L290 TraceCheckUtils]: 29: Hoare triple {24807#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {24807#true} is VALID [2022-04-08 08:43:12,275 INFO L290 TraceCheckUtils]: 30: Hoare triple {24807#true} ~skip~0 := 0; {24807#true} is VALID [2022-04-08 08:43:12,275 INFO L290 TraceCheckUtils]: 31: Hoare triple {24807#true} assume !false; {24807#true} is VALID [2022-04-08 08:43:12,275 INFO L290 TraceCheckUtils]: 32: Hoare triple {24807#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); {24812#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:12,276 INFO L290 TraceCheckUtils]: 33: Hoare triple {24812#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 12292 == #t~mem47;havoc #t~mem47; {24813#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:12,277 INFO L290 TraceCheckUtils]: 34: Hoare triple {24813#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 40 + ~s.offset, 4); {24813#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:12,277 INFO L290 TraceCheckUtils]: 35: Hoare triple {24813#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 36 + ~s.offset, 4); {24813#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:12,278 INFO L290 TraceCheckUtils]: 36: Hoare triple {24813#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {24813#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:12,278 INFO L290 TraceCheckUtils]: 37: Hoare triple {24813#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {24813#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:12,279 INFO L290 TraceCheckUtils]: 38: Hoare triple {24813#(= 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); {24813#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:12,280 INFO L290 TraceCheckUtils]: 39: Hoare triple {24813#(= 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; {24813#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:12,280 INFO L290 TraceCheckUtils]: 40: Hoare triple {24813#(= 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); {24814#(= 12292 |ssl3_accept_#t~mem85|)} is VALID [2022-04-08 08:43:12,281 INFO L290 TraceCheckUtils]: 41: Hoare triple {24814#(= 12292 |ssl3_accept_#t~mem85|)} assume 12292 != #t~mem85;havoc #t~mem85; {24808#false} is VALID [2022-04-08 08:43:12,281 INFO L290 TraceCheckUtils]: 42: Hoare triple {24808#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; {24808#false} is VALID [2022-04-08 08:43:12,281 INFO L290 TraceCheckUtils]: 43: Hoare triple {24808#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); {24808#false} is VALID [2022-04-08 08:43:12,281 INFO L290 TraceCheckUtils]: 44: Hoare triple {24808#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {24808#false} is VALID [2022-04-08 08:43:12,281 INFO L290 TraceCheckUtils]: 45: Hoare triple {24808#false} ~skip~0 := 0; {24808#false} is VALID [2022-04-08 08:43:12,281 INFO L290 TraceCheckUtils]: 46: Hoare triple {24808#false} assume !false; {24808#false} is VALID [2022-04-08 08:43:12,281 INFO L290 TraceCheckUtils]: 47: Hoare triple {24808#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); {24808#false} is VALID [2022-04-08 08:43:12,281 INFO L290 TraceCheckUtils]: 48: Hoare triple {24808#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,282 INFO L290 TraceCheckUtils]: 49: Hoare triple {24808#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,282 INFO L290 TraceCheckUtils]: 50: Hoare triple {24808#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,282 INFO L290 TraceCheckUtils]: 51: Hoare triple {24808#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,282 INFO L290 TraceCheckUtils]: 52: Hoare triple {24808#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,282 INFO L290 TraceCheckUtils]: 53: Hoare triple {24808#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,282 INFO L290 TraceCheckUtils]: 54: Hoare triple {24808#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,282 INFO L290 TraceCheckUtils]: 55: Hoare triple {24808#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,282 INFO L290 TraceCheckUtils]: 56: Hoare triple {24808#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,282 INFO L290 TraceCheckUtils]: 57: Hoare triple {24808#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,282 INFO L290 TraceCheckUtils]: 58: Hoare triple {24808#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,283 INFO L290 TraceCheckUtils]: 59: Hoare triple {24808#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,283 INFO L290 TraceCheckUtils]: 60: Hoare triple {24808#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,283 INFO L290 TraceCheckUtils]: 61: Hoare triple {24808#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,283 INFO L290 TraceCheckUtils]: 62: Hoare triple {24808#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,283 INFO L290 TraceCheckUtils]: 63: Hoare triple {24808#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,283 INFO L290 TraceCheckUtils]: 64: Hoare triple {24808#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,283 INFO L290 TraceCheckUtils]: 65: Hoare triple {24808#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,283 INFO L290 TraceCheckUtils]: 66: Hoare triple {24808#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,283 INFO L290 TraceCheckUtils]: 67: Hoare triple {24808#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,283 INFO L290 TraceCheckUtils]: 68: Hoare triple {24808#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,284 INFO L290 TraceCheckUtils]: 69: Hoare triple {24808#false} assume 8448 == #t~mem68;havoc #t~mem68; {24808#false} is VALID [2022-04-08 08:43:12,284 INFO L290 TraceCheckUtils]: 70: Hoare triple {24808#false} assume !(~num1~0 > 0); {24808#false} is VALID [2022-04-08 08:43:12,284 INFO L290 TraceCheckUtils]: 71: Hoare triple {24808#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; {24808#false} is VALID [2022-04-08 08:43:12,284 INFO L290 TraceCheckUtils]: 72: Hoare triple {24808#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); {24808#false} is VALID [2022-04-08 08:43:12,284 INFO L290 TraceCheckUtils]: 73: Hoare triple {24808#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {24808#false} is VALID [2022-04-08 08:43:12,284 INFO L290 TraceCheckUtils]: 74: Hoare triple {24808#false} ~skip~0 := 0; {24808#false} is VALID [2022-04-08 08:43:12,284 INFO L290 TraceCheckUtils]: 75: Hoare triple {24808#false} assume !false; {24808#false} is VALID [2022-04-08 08:43:12,284 INFO L290 TraceCheckUtils]: 76: Hoare triple {24808#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); {24808#false} is VALID [2022-04-08 08:43:12,284 INFO L290 TraceCheckUtils]: 77: Hoare triple {24808#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,284 INFO L290 TraceCheckUtils]: 78: Hoare triple {24808#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,285 INFO L290 TraceCheckUtils]: 79: Hoare triple {24808#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,285 INFO L290 TraceCheckUtils]: 80: Hoare triple {24808#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,285 INFO L290 TraceCheckUtils]: 81: Hoare triple {24808#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,285 INFO L290 TraceCheckUtils]: 82: Hoare triple {24808#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,285 INFO L290 TraceCheckUtils]: 83: Hoare triple {24808#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,285 INFO L290 TraceCheckUtils]: 84: Hoare triple {24808#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,285 INFO L290 TraceCheckUtils]: 85: Hoare triple {24808#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,285 INFO L290 TraceCheckUtils]: 86: Hoare triple {24808#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,285 INFO L290 TraceCheckUtils]: 87: Hoare triple {24808#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,286 INFO L290 TraceCheckUtils]: 88: Hoare triple {24808#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,286 INFO L290 TraceCheckUtils]: 89: Hoare triple {24808#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,286 INFO L290 TraceCheckUtils]: 90: Hoare triple {24808#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,286 INFO L290 TraceCheckUtils]: 91: Hoare triple {24808#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,286 INFO L290 TraceCheckUtils]: 92: Hoare triple {24808#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,286 INFO L290 TraceCheckUtils]: 93: Hoare triple {24808#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,286 INFO L290 TraceCheckUtils]: 94: Hoare triple {24808#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,286 INFO L290 TraceCheckUtils]: 95: Hoare triple {24808#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,286 INFO L290 TraceCheckUtils]: 96: Hoare triple {24808#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,286 INFO L290 TraceCheckUtils]: 97: Hoare triple {24808#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,287 INFO L290 TraceCheckUtils]: 98: Hoare triple {24808#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,287 INFO L290 TraceCheckUtils]: 99: Hoare triple {24808#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,287 INFO L290 TraceCheckUtils]: 100: Hoare triple {24808#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,287 INFO L290 TraceCheckUtils]: 101: Hoare triple {24808#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,287 INFO L290 TraceCheckUtils]: 102: Hoare triple {24808#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,287 INFO L290 TraceCheckUtils]: 103: Hoare triple {24808#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,287 INFO L290 TraceCheckUtils]: 104: Hoare triple {24808#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {24808#false} is VALID [2022-04-08 08:43:12,287 INFO L290 TraceCheckUtils]: 105: Hoare triple {24808#false} assume 8640 == #t~mem75;havoc #t~mem75; {24808#false} is VALID [2022-04-08 08:43:12,287 INFO L290 TraceCheckUtils]: 106: Hoare triple {24808#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {24808#false} is VALID [2022-04-08 08:43:12,287 INFO L290 TraceCheckUtils]: 107: Hoare triple {24808#false} assume !(4 == ~blastFlag~0); {24808#false} is VALID [2022-04-08 08:43:12,288 INFO L290 TraceCheckUtils]: 108: Hoare triple {24808#false} assume !(7 == ~blastFlag~0); {24808#false} is VALID [2022-04-08 08:43:12,288 INFO L290 TraceCheckUtils]: 109: Hoare triple {24808#false} assume !false; {24808#false} is VALID [2022-04-08 08:43:12,288 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-08 08:43:12,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:43:12,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194417163] [2022-04-08 08:43:12,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194417163] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:12,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:12,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:43:12,289 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:43:12,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1756010454] [2022-04-08 08:43:12,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1756010454] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:12,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:12,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:43:12,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820079908] [2022-04-08 08:43:12,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:43:12,290 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 110 [2022-04-08 08:43:12,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:43:12,290 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-08 08:43:12,356 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-08 08:43:12,357 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 08:43:12,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:12,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 08:43:12,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:43:12,357 INFO L87 Difference]: Start difference. First operand 271 states and 419 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-08 08:43:14,630 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:43:17,859 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:43:21,497 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:43:23,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:23,079 INFO L93 Difference]: Finished difference Result 525 states and 821 transitions. [2022-04-08 08:43:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 08:43:23,080 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 110 [2022-04-08 08:43:23,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:43:23,080 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-08 08:43:23,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 422 transitions. [2022-04-08 08:43:23,082 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-08 08:43:23,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 422 transitions. [2022-04-08 08:43:23,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 422 transitions. [2022-04-08 08:43:23,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 422 edges. 422 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:23,356 INFO L225 Difference]: With dead ends: 525 [2022-04-08 08:43:23,357 INFO L226 Difference]: Without dead ends: 280 [2022-04-08 08:43:23,357 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 08:43:23,358 INFO L913 BasicCegarLoop]: 202 mSDtfsCounter, 3 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:43:23,358 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 631 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-04-08 08:43:23,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-08 08:43:23,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2022-04-08 08:43:23,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:43:23,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 280 states. Second operand has 280 states, 275 states have (on average 1.549090909090909) internal successors, (426), 275 states have internal predecessors, (426), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:23,377 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand has 280 states, 275 states have (on average 1.549090909090909) internal successors, (426), 275 states have internal predecessors, (426), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:23,378 INFO L87 Difference]: Start difference. First operand 280 states. Second operand has 280 states, 275 states have (on average 1.549090909090909) internal successors, (426), 275 states have internal predecessors, (426), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:23,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:23,383 INFO L93 Difference]: Finished difference Result 280 states and 430 transitions. [2022-04-08 08:43:23,383 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 430 transitions. [2022-04-08 08:43:23,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:23,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:23,384 INFO L74 IsIncluded]: Start isIncluded. First operand has 280 states, 275 states have (on average 1.549090909090909) internal successors, (426), 275 states have internal predecessors, (426), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 280 states. [2022-04-08 08:43:23,384 INFO L87 Difference]: Start difference. First operand has 280 states, 275 states have (on average 1.549090909090909) internal successors, (426), 275 states have internal predecessors, (426), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 280 states. [2022-04-08 08:43:23,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:23,389 INFO L93 Difference]: Finished difference Result 280 states and 430 transitions. [2022-04-08 08:43:23,389 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 430 transitions. [2022-04-08 08:43:23,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:23,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:23,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:43:23,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:43:23,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 275 states have (on average 1.549090909090909) internal successors, (426), 275 states have internal predecessors, (426), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:23,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 430 transitions. [2022-04-08 08:43:23,417 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 430 transitions. Word has length 110 [2022-04-08 08:43:23,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:43:23,418 INFO L478 AbstractCegarLoop]: Abstraction has 280 states and 430 transitions. [2022-04-08 08:43:23,418 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-08 08:43:23,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 280 states and 430 transitions. [2022-04-08 08:43:23,738 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-08 08:43:23,738 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 430 transitions. [2022-04-08 08:43:23,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-08 08:43:23,739 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:43:23,740 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:43:23,740 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 08:43:23,740 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:43:23,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:43:23,740 INFO L85 PathProgramCache]: Analyzing trace with hash -407231674, now seen corresponding path program 1 times [2022-04-08 08:43:23,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:23,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1255919975] [2022-04-08 08:43:23,806 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:43:23,806 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:43:23,806 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:43:23,806 INFO L85 PathProgramCache]: Analyzing trace with hash -407231674, now seen corresponding path program 2 times [2022-04-08 08:43:23,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:43:23,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133674138] [2022-04-08 08:43:23,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:43:23,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:43:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:23,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:43:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:23,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {26997#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {26990#true} is VALID [2022-04-08 08:43:23,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {26990#true} assume true; {26990#true} is VALID [2022-04-08 08:43:23,924 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26990#true} {26990#true} #688#return; {26990#true} is VALID [2022-04-08 08:43:23,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {26990#true} call ULTIMATE.init(); {26997#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-08 08:43:23,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {26997#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {26990#true} is VALID [2022-04-08 08:43:23,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {26990#true} assume true; {26990#true} is VALID [2022-04-08 08:43:23,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26990#true} {26990#true} #688#return; {26990#true} is VALID [2022-04-08 08:43:23,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {26990#true} call #t~ret161 := main(); {26990#true} is VALID [2022-04-08 08:43:23,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {26990#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; {26990#true} is VALID [2022-04-08 08:43:23,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {26990#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {26990#true} is VALID [2022-04-08 08:43:23,926 INFO L272 TraceCheckUtils]: 7: Hoare triple {26990#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {26990#true} is VALID [2022-04-08 08:43:23,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {26990#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); {26990#true} is VALID [2022-04-08 08:43:23,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {26990#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; {26990#true} is VALID [2022-04-08 08:43:23,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {26990#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; {26990#true} is VALID [2022-04-08 08:43:23,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {26990#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {26990#true} is VALID [2022-04-08 08:43:23,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {26990#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {26990#true} is VALID [2022-04-08 08:43:23,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {26990#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {26990#true} is VALID [2022-04-08 08:43:23,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {26990#true} assume !false; {26990#true} is VALID [2022-04-08 08:43:23,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {26990#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); {26990#true} is VALID [2022-04-08 08:43:23,927 INFO L290 TraceCheckUtils]: 16: Hoare triple {26990#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26990#true} is VALID [2022-04-08 08:43:23,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {26990#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26990#true} is VALID [2022-04-08 08:43:23,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {26990#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26990#true} is VALID [2022-04-08 08:43:23,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {26990#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26990#true} is VALID [2022-04-08 08:43:23,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {26990#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26990#true} is VALID [2022-04-08 08:43:23,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {26990#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26990#true} is VALID [2022-04-08 08:43:23,928 INFO L290 TraceCheckUtils]: 22: Hoare triple {26990#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26990#true} is VALID [2022-04-08 08:43:23,928 INFO L290 TraceCheckUtils]: 23: Hoare triple {26990#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26990#true} is VALID [2022-04-08 08:43:23,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {26990#true} assume 8464 == #t~mem55;havoc #t~mem55; {26990#true} is VALID [2022-04-08 08:43:23,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {26990#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; {26990#true} is VALID [2022-04-08 08:43:23,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {26990#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {26990#true} is VALID [2022-04-08 08:43:23,929 INFO L290 TraceCheckUtils]: 27: Hoare triple {26990#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); {26995#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:23,930 INFO L290 TraceCheckUtils]: 28: Hoare triple {26995#(= 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); {26995#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:23,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {26995#(= 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; {26995#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:23,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {26995#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {26995#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:23,931 INFO L290 TraceCheckUtils]: 31: Hoare triple {26995#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {26995#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:23,931 INFO L290 TraceCheckUtils]: 32: Hoare triple {26995#(= 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); {26995#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:23,932 INFO L290 TraceCheckUtils]: 33: Hoare triple {26995#(= 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); {26995#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:23,932 INFO L290 TraceCheckUtils]: 34: Hoare triple {26995#(= 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); {26996#(= |ssl3_accept_#t~mem49| 8496)} is VALID [2022-04-08 08:43:23,932 INFO L290 TraceCheckUtils]: 35: Hoare triple {26996#(= |ssl3_accept_#t~mem49| 8496)} assume 8192 == #t~mem49;havoc #t~mem49; {26991#false} is VALID [2022-04-08 08:43:23,932 INFO L290 TraceCheckUtils]: 36: Hoare triple {26991#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,933 INFO L290 TraceCheckUtils]: 37: Hoare triple {26991#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {26991#false} is VALID [2022-04-08 08:43:23,933 INFO L290 TraceCheckUtils]: 38: Hoare triple {26991#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,933 INFO L290 TraceCheckUtils]: 39: Hoare triple {26991#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); {26991#false} is VALID [2022-04-08 08:43:23,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {26991#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {26991#false} is VALID [2022-04-08 08:43:23,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {26991#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); {26991#false} is VALID [2022-04-08 08:43:23,933 INFO L290 TraceCheckUtils]: 42: Hoare triple {26991#false} assume 12292 != #t~mem85;havoc #t~mem85; {26991#false} is VALID [2022-04-08 08:43:23,933 INFO L290 TraceCheckUtils]: 43: Hoare triple {26991#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; {26991#false} is VALID [2022-04-08 08:43:23,933 INFO L290 TraceCheckUtils]: 44: Hoare triple {26991#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); {26991#false} is VALID [2022-04-08 08:43:23,934 INFO L290 TraceCheckUtils]: 45: Hoare triple {26991#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {26991#false} is VALID [2022-04-08 08:43:23,934 INFO L290 TraceCheckUtils]: 46: Hoare triple {26991#false} ~skip~0 := 0; {26991#false} is VALID [2022-04-08 08:43:23,934 INFO L290 TraceCheckUtils]: 47: Hoare triple {26991#false} assume !false; {26991#false} is VALID [2022-04-08 08:43:23,934 INFO L290 TraceCheckUtils]: 48: Hoare triple {26991#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); {26991#false} is VALID [2022-04-08 08:43:23,934 INFO L290 TraceCheckUtils]: 49: Hoare triple {26991#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,934 INFO L290 TraceCheckUtils]: 50: Hoare triple {26991#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,934 INFO L290 TraceCheckUtils]: 51: Hoare triple {26991#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,934 INFO L290 TraceCheckUtils]: 52: Hoare triple {26991#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,934 INFO L290 TraceCheckUtils]: 53: Hoare triple {26991#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,935 INFO L290 TraceCheckUtils]: 54: Hoare triple {26991#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,935 INFO L290 TraceCheckUtils]: 55: Hoare triple {26991#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,935 INFO L290 TraceCheckUtils]: 56: Hoare triple {26991#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,935 INFO L290 TraceCheckUtils]: 57: Hoare triple {26991#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,935 INFO L290 TraceCheckUtils]: 58: Hoare triple {26991#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,935 INFO L290 TraceCheckUtils]: 59: Hoare triple {26991#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,935 INFO L290 TraceCheckUtils]: 60: Hoare triple {26991#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,935 INFO L290 TraceCheckUtils]: 61: Hoare triple {26991#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,936 INFO L290 TraceCheckUtils]: 62: Hoare triple {26991#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,936 INFO L290 TraceCheckUtils]: 63: Hoare triple {26991#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,936 INFO L290 TraceCheckUtils]: 64: Hoare triple {26991#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,936 INFO L290 TraceCheckUtils]: 65: Hoare triple {26991#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,936 INFO L290 TraceCheckUtils]: 66: Hoare triple {26991#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,936 INFO L290 TraceCheckUtils]: 67: Hoare triple {26991#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,936 INFO L290 TraceCheckUtils]: 68: Hoare triple {26991#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,936 INFO L290 TraceCheckUtils]: 69: Hoare triple {26991#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,936 INFO L290 TraceCheckUtils]: 70: Hoare triple {26991#false} assume 8448 == #t~mem68;havoc #t~mem68; {26991#false} is VALID [2022-04-08 08:43:23,937 INFO L290 TraceCheckUtils]: 71: Hoare triple {26991#false} assume !(~num1~0 > 0); {26991#false} is VALID [2022-04-08 08:43:23,937 INFO L290 TraceCheckUtils]: 72: Hoare triple {26991#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; {26991#false} is VALID [2022-04-08 08:43:23,937 INFO L290 TraceCheckUtils]: 73: Hoare triple {26991#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); {26991#false} is VALID [2022-04-08 08:43:23,937 INFO L290 TraceCheckUtils]: 74: Hoare triple {26991#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {26991#false} is VALID [2022-04-08 08:43:23,937 INFO L290 TraceCheckUtils]: 75: Hoare triple {26991#false} ~skip~0 := 0; {26991#false} is VALID [2022-04-08 08:43:23,937 INFO L290 TraceCheckUtils]: 76: Hoare triple {26991#false} assume !false; {26991#false} is VALID [2022-04-08 08:43:23,937 INFO L290 TraceCheckUtils]: 77: Hoare triple {26991#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); {26991#false} is VALID [2022-04-08 08:43:23,937 INFO L290 TraceCheckUtils]: 78: Hoare triple {26991#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,937 INFO L290 TraceCheckUtils]: 79: Hoare triple {26991#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,937 INFO L290 TraceCheckUtils]: 80: Hoare triple {26991#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,938 INFO L290 TraceCheckUtils]: 81: Hoare triple {26991#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,938 INFO L290 TraceCheckUtils]: 82: Hoare triple {26991#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,938 INFO L290 TraceCheckUtils]: 83: Hoare triple {26991#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,938 INFO L290 TraceCheckUtils]: 84: Hoare triple {26991#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,938 INFO L290 TraceCheckUtils]: 85: Hoare triple {26991#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,938 INFO L290 TraceCheckUtils]: 86: Hoare triple {26991#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,938 INFO L290 TraceCheckUtils]: 87: Hoare triple {26991#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,938 INFO L290 TraceCheckUtils]: 88: Hoare triple {26991#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,938 INFO L290 TraceCheckUtils]: 89: Hoare triple {26991#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,939 INFO L290 TraceCheckUtils]: 90: Hoare triple {26991#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,939 INFO L290 TraceCheckUtils]: 91: Hoare triple {26991#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,939 INFO L290 TraceCheckUtils]: 92: Hoare triple {26991#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,939 INFO L290 TraceCheckUtils]: 93: Hoare triple {26991#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,939 INFO L290 TraceCheckUtils]: 94: Hoare triple {26991#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,939 INFO L290 TraceCheckUtils]: 95: Hoare triple {26991#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,939 INFO L290 TraceCheckUtils]: 96: Hoare triple {26991#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,939 INFO L290 TraceCheckUtils]: 97: Hoare triple {26991#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,939 INFO L290 TraceCheckUtils]: 98: Hoare triple {26991#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,939 INFO L290 TraceCheckUtils]: 99: Hoare triple {26991#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,940 INFO L290 TraceCheckUtils]: 100: Hoare triple {26991#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,940 INFO L290 TraceCheckUtils]: 101: Hoare triple {26991#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,940 INFO L290 TraceCheckUtils]: 102: Hoare triple {26991#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,940 INFO L290 TraceCheckUtils]: 103: Hoare triple {26991#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,940 INFO L290 TraceCheckUtils]: 104: Hoare triple {26991#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,940 INFO L290 TraceCheckUtils]: 105: Hoare triple {26991#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {26991#false} is VALID [2022-04-08 08:43:23,940 INFO L290 TraceCheckUtils]: 106: Hoare triple {26991#false} assume 8640 == #t~mem75;havoc #t~mem75; {26991#false} is VALID [2022-04-08 08:43:23,940 INFO L290 TraceCheckUtils]: 107: Hoare triple {26991#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {26991#false} is VALID [2022-04-08 08:43:23,940 INFO L290 TraceCheckUtils]: 108: Hoare triple {26991#false} assume !(4 == ~blastFlag~0); {26991#false} is VALID [2022-04-08 08:43:23,940 INFO L290 TraceCheckUtils]: 109: Hoare triple {26991#false} assume !(7 == ~blastFlag~0); {26991#false} is VALID [2022-04-08 08:43:23,941 INFO L290 TraceCheckUtils]: 110: Hoare triple {26991#false} assume !false; {26991#false} is VALID [2022-04-08 08:43:23,941 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-08 08:43:23,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:43:23,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133674138] [2022-04-08 08:43:23,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133674138] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:23,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:23,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:23,942 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:43:23,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1255919975] [2022-04-08 08:43:23,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1255919975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:23,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:23,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:23,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923602456] [2022-04-08 08:43:23,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:43:23,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 111 [2022-04-08 08:43:23,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:43:23,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:24,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:24,013 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:43:24,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:24,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:43:24,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:43:24,014 INFO L87 Difference]: Start difference. First operand 280 states and 430 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:26,075 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:43:29,272 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-08 08:43:32,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:32,721 INFO L93 Difference]: Finished difference Result 561 states and 866 transitions. [2022-04-08 08:43:32,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:43:32,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 111 [2022-04-08 08:43:32,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:43:32,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:32,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 467 transitions. [2022-04-08 08:43:32,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:32,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 467 transitions. [2022-04-08 08:43:32,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 467 transitions. [2022-04-08 08:43:33,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 467 edges. 467 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:33,025 INFO L225 Difference]: With dead ends: 561 [2022-04-08 08:43:33,025 INFO L226 Difference]: Without dead ends: 307 [2022-04-08 08:43:33,026 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:43:33,026 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 37 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:43:33,026 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 507 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 388 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2022-04-08 08:43:33,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-04-08 08:43:33,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 280. [2022-04-08 08:43:33,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:43:33,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 307 states. Second operand has 280 states, 275 states have (on average 1.5454545454545454) internal successors, (425), 275 states have internal predecessors, (425), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:33,043 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand has 280 states, 275 states have (on average 1.5454545454545454) internal successors, (425), 275 states have internal predecessors, (425), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:33,044 INFO L87 Difference]: Start difference. First operand 307 states. Second operand has 280 states, 275 states have (on average 1.5454545454545454) internal successors, (425), 275 states have internal predecessors, (425), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:33,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:33,048 INFO L93 Difference]: Finished difference Result 307 states and 464 transitions. [2022-04-08 08:43:33,048 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 464 transitions. [2022-04-08 08:43:33,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:33,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:33,049 INFO L74 IsIncluded]: Start isIncluded. First operand has 280 states, 275 states have (on average 1.5454545454545454) internal successors, (425), 275 states have internal predecessors, (425), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 307 states. [2022-04-08 08:43:33,049 INFO L87 Difference]: Start difference. First operand has 280 states, 275 states have (on average 1.5454545454545454) internal successors, (425), 275 states have internal predecessors, (425), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 307 states. [2022-04-08 08:43:33,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:33,057 INFO L93 Difference]: Finished difference Result 307 states and 464 transitions. [2022-04-08 08:43:33,057 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 464 transitions. [2022-04-08 08:43:33,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:33,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:33,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:43:33,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:43:33,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 275 states have (on average 1.5454545454545454) internal successors, (425), 275 states have internal predecessors, (425), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:33,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 429 transitions. [2022-04-08 08:43:33,064 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 429 transitions. Word has length 111 [2022-04-08 08:43:33,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:43:33,064 INFO L478 AbstractCegarLoop]: Abstraction has 280 states and 429 transitions. [2022-04-08 08:43:33,064 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:33,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 280 states and 429 transitions. [2022-04-08 08:43:33,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 429 edges. 429 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:33,392 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 429 transitions. [2022-04-08 08:43:33,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-04-08 08:43:33,393 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:43:33,393 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:43:33,393 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-08 08:43:33,393 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:43:33,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:43:33,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1121258754, now seen corresponding path program 1 times [2022-04-08 08:43:33,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:33,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [311399496] [2022-04-08 08:43:33,473 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:43:33,473 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:43:33,473 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:43:33,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1121258754, now seen corresponding path program 2 times [2022-04-08 08:43:33,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:43:33,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303118559] [2022-04-08 08:43:33,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:43:33,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:43:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:33,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:43:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:33,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {29305#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {29298#true} is VALID [2022-04-08 08:43:33,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {29298#true} assume true; {29298#true} is VALID [2022-04-08 08:43:33,587 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29298#true} {29298#true} #688#return; {29298#true} is VALID [2022-04-08 08:43:33,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {29298#true} call ULTIMATE.init(); {29305#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-08 08:43:33,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {29305#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {29298#true} is VALID [2022-04-08 08:43:33,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {29298#true} assume true; {29298#true} is VALID [2022-04-08 08:43:33,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29298#true} {29298#true} #688#return; {29298#true} is VALID [2022-04-08 08:43:33,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {29298#true} call #t~ret161 := main(); {29298#true} is VALID [2022-04-08 08:43:33,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {29298#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; {29298#true} is VALID [2022-04-08 08:43:33,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {29298#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {29298#true} is VALID [2022-04-08 08:43:33,589 INFO L272 TraceCheckUtils]: 7: Hoare triple {29298#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {29298#true} is VALID [2022-04-08 08:43:33,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {29298#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); {29298#true} is VALID [2022-04-08 08:43:33,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {29298#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; {29298#true} is VALID [2022-04-08 08:43:33,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {29298#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; {29298#true} is VALID [2022-04-08 08:43:33,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {29298#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {29298#true} is VALID [2022-04-08 08:43:33,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {29298#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {29298#true} is VALID [2022-04-08 08:43:33,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {29298#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {29298#true} is VALID [2022-04-08 08:43:33,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {29298#true} assume !false; {29298#true} is VALID [2022-04-08 08:43:33,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {29298#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); {29298#true} is VALID [2022-04-08 08:43:33,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {29298#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29298#true} is VALID [2022-04-08 08:43:33,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {29298#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29298#true} is VALID [2022-04-08 08:43:33,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {29298#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29298#true} is VALID [2022-04-08 08:43:33,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {29298#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29298#true} is VALID [2022-04-08 08:43:33,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {29298#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29298#true} is VALID [2022-04-08 08:43:33,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {29298#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29298#true} is VALID [2022-04-08 08:43:33,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {29298#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29298#true} is VALID [2022-04-08 08:43:33,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {29298#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29298#true} is VALID [2022-04-08 08:43:33,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {29298#true} assume 8464 == #t~mem55;havoc #t~mem55; {29298#true} is VALID [2022-04-08 08:43:33,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {29298#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; {29298#true} is VALID [2022-04-08 08:43:33,591 INFO L290 TraceCheckUtils]: 26: Hoare triple {29298#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {29298#true} is VALID [2022-04-08 08:43:33,592 INFO L290 TraceCheckUtils]: 27: Hoare triple {29298#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); {29303#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:33,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {29303#(not (= 24576 (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); {29303#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:33,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {29303#(not (= 24576 (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; {29303#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:33,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {29303#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {29303#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:33,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {29303#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {29303#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:33,594 INFO L290 TraceCheckUtils]: 32: Hoare triple {29303#(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); {29303#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:33,594 INFO L290 TraceCheckUtils]: 33: Hoare triple {29303#(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); {29303#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:33,594 INFO L290 TraceCheckUtils]: 34: Hoare triple {29303#(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); {29303#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:33,595 INFO L290 TraceCheckUtils]: 35: Hoare triple {29303#(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); {29304#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-08 08:43:33,595 INFO L290 TraceCheckUtils]: 36: Hoare triple {29304#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {29299#false} is VALID [2022-04-08 08:43:33,595 INFO L290 TraceCheckUtils]: 37: Hoare triple {29299#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,595 INFO L290 TraceCheckUtils]: 38: Hoare triple {29299#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {29299#false} is VALID [2022-04-08 08:43:33,596 INFO L290 TraceCheckUtils]: 39: Hoare triple {29299#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,596 INFO L290 TraceCheckUtils]: 40: Hoare triple {29299#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); {29299#false} is VALID [2022-04-08 08:43:33,596 INFO L290 TraceCheckUtils]: 41: Hoare triple {29299#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {29299#false} is VALID [2022-04-08 08:43:33,596 INFO L290 TraceCheckUtils]: 42: Hoare triple {29299#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); {29299#false} is VALID [2022-04-08 08:43:33,596 INFO L290 TraceCheckUtils]: 43: Hoare triple {29299#false} assume 12292 != #t~mem85;havoc #t~mem85; {29299#false} is VALID [2022-04-08 08:43:33,596 INFO L290 TraceCheckUtils]: 44: Hoare triple {29299#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; {29299#false} is VALID [2022-04-08 08:43:33,596 INFO L290 TraceCheckUtils]: 45: Hoare triple {29299#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); {29299#false} is VALID [2022-04-08 08:43:33,596 INFO L290 TraceCheckUtils]: 46: Hoare triple {29299#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {29299#false} is VALID [2022-04-08 08:43:33,596 INFO L290 TraceCheckUtils]: 47: Hoare triple {29299#false} ~skip~0 := 0; {29299#false} is VALID [2022-04-08 08:43:33,596 INFO L290 TraceCheckUtils]: 48: Hoare triple {29299#false} assume !false; {29299#false} is VALID [2022-04-08 08:43:33,596 INFO L290 TraceCheckUtils]: 49: Hoare triple {29299#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); {29299#false} is VALID [2022-04-08 08:43:33,596 INFO L290 TraceCheckUtils]: 50: Hoare triple {29299#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,597 INFO L290 TraceCheckUtils]: 51: Hoare triple {29299#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,597 INFO L290 TraceCheckUtils]: 52: Hoare triple {29299#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,597 INFO L290 TraceCheckUtils]: 53: Hoare triple {29299#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,597 INFO L290 TraceCheckUtils]: 54: Hoare triple {29299#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,597 INFO L290 TraceCheckUtils]: 55: Hoare triple {29299#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,597 INFO L290 TraceCheckUtils]: 56: Hoare triple {29299#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,597 INFO L290 TraceCheckUtils]: 57: Hoare triple {29299#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,597 INFO L290 TraceCheckUtils]: 58: Hoare triple {29299#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,597 INFO L290 TraceCheckUtils]: 59: Hoare triple {29299#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,597 INFO L290 TraceCheckUtils]: 60: Hoare triple {29299#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,597 INFO L290 TraceCheckUtils]: 61: Hoare triple {29299#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,597 INFO L290 TraceCheckUtils]: 62: Hoare triple {29299#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,597 INFO L290 TraceCheckUtils]: 63: Hoare triple {29299#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,598 INFO L290 TraceCheckUtils]: 64: Hoare triple {29299#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,598 INFO L290 TraceCheckUtils]: 65: Hoare triple {29299#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,598 INFO L290 TraceCheckUtils]: 66: Hoare triple {29299#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,598 INFO L290 TraceCheckUtils]: 67: Hoare triple {29299#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,598 INFO L290 TraceCheckUtils]: 68: Hoare triple {29299#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,598 INFO L290 TraceCheckUtils]: 69: Hoare triple {29299#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,598 INFO L290 TraceCheckUtils]: 70: Hoare triple {29299#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,598 INFO L290 TraceCheckUtils]: 71: Hoare triple {29299#false} assume 8448 == #t~mem68;havoc #t~mem68; {29299#false} is VALID [2022-04-08 08:43:33,598 INFO L290 TraceCheckUtils]: 72: Hoare triple {29299#false} assume !(~num1~0 > 0); {29299#false} is VALID [2022-04-08 08:43:33,599 INFO L290 TraceCheckUtils]: 73: Hoare triple {29299#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; {29299#false} is VALID [2022-04-08 08:43:33,599 INFO L290 TraceCheckUtils]: 74: Hoare triple {29299#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); {29299#false} is VALID [2022-04-08 08:43:33,599 INFO L290 TraceCheckUtils]: 75: Hoare triple {29299#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {29299#false} is VALID [2022-04-08 08:43:33,599 INFO L290 TraceCheckUtils]: 76: Hoare triple {29299#false} ~skip~0 := 0; {29299#false} is VALID [2022-04-08 08:43:33,599 INFO L290 TraceCheckUtils]: 77: Hoare triple {29299#false} assume !false; {29299#false} is VALID [2022-04-08 08:43:33,599 INFO L290 TraceCheckUtils]: 78: Hoare triple {29299#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); {29299#false} is VALID [2022-04-08 08:43:33,599 INFO L290 TraceCheckUtils]: 79: Hoare triple {29299#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,599 INFO L290 TraceCheckUtils]: 80: Hoare triple {29299#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,599 INFO L290 TraceCheckUtils]: 81: Hoare triple {29299#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,599 INFO L290 TraceCheckUtils]: 82: Hoare triple {29299#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,600 INFO L290 TraceCheckUtils]: 83: Hoare triple {29299#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,600 INFO L290 TraceCheckUtils]: 84: Hoare triple {29299#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,600 INFO L290 TraceCheckUtils]: 85: Hoare triple {29299#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,600 INFO L290 TraceCheckUtils]: 86: Hoare triple {29299#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,600 INFO L290 TraceCheckUtils]: 87: Hoare triple {29299#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,600 INFO L290 TraceCheckUtils]: 88: Hoare triple {29299#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,600 INFO L290 TraceCheckUtils]: 89: Hoare triple {29299#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,600 INFO L290 TraceCheckUtils]: 90: Hoare triple {29299#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,600 INFO L290 TraceCheckUtils]: 91: Hoare triple {29299#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,600 INFO L290 TraceCheckUtils]: 92: Hoare triple {29299#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,601 INFO L290 TraceCheckUtils]: 93: Hoare triple {29299#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,601 INFO L290 TraceCheckUtils]: 94: Hoare triple {29299#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,601 INFO L290 TraceCheckUtils]: 95: Hoare triple {29299#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,601 INFO L290 TraceCheckUtils]: 96: Hoare triple {29299#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,601 INFO L290 TraceCheckUtils]: 97: Hoare triple {29299#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,601 INFO L290 TraceCheckUtils]: 98: Hoare triple {29299#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,601 INFO L290 TraceCheckUtils]: 99: Hoare triple {29299#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,601 INFO L290 TraceCheckUtils]: 100: Hoare triple {29299#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,601 INFO L290 TraceCheckUtils]: 101: Hoare triple {29299#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,602 INFO L290 TraceCheckUtils]: 102: Hoare triple {29299#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,602 INFO L290 TraceCheckUtils]: 103: Hoare triple {29299#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,602 INFO L290 TraceCheckUtils]: 104: Hoare triple {29299#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,602 INFO L290 TraceCheckUtils]: 105: Hoare triple {29299#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,602 INFO L290 TraceCheckUtils]: 106: Hoare triple {29299#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {29299#false} is VALID [2022-04-08 08:43:33,602 INFO L290 TraceCheckUtils]: 107: Hoare triple {29299#false} assume 8640 == #t~mem75;havoc #t~mem75; {29299#false} is VALID [2022-04-08 08:43:33,602 INFO L290 TraceCheckUtils]: 108: Hoare triple {29299#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {29299#false} is VALID [2022-04-08 08:43:33,602 INFO L290 TraceCheckUtils]: 109: Hoare triple {29299#false} assume !(4 == ~blastFlag~0); {29299#false} is VALID [2022-04-08 08:43:33,602 INFO L290 TraceCheckUtils]: 110: Hoare triple {29299#false} assume !(7 == ~blastFlag~0); {29299#false} is VALID [2022-04-08 08:43:33,602 INFO L290 TraceCheckUtils]: 111: Hoare triple {29299#false} assume !false; {29299#false} is VALID [2022-04-08 08:43:33,603 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-08 08:43:33,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:43:33,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303118559] [2022-04-08 08:43:33,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303118559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:33,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:33,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:33,604 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:43:33,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [311399496] [2022-04-08 08:43:33,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [311399496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:33,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:33,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:33,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576240740] [2022-04-08 08:43:33,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:43:33,605 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 112 [2022-04-08 08:43:33,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:43:33,605 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-08 08:43:33,671 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-08 08:43:33,672 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:43:33,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:33,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:43:33,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:43:33,672 INFO L87 Difference]: Start difference. First operand 280 states and 429 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-08 08:43:38,106 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:43:40,112 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-08 08:43:41,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:41,284 INFO L93 Difference]: Finished difference Result 619 states and 946 transitions. [2022-04-08 08:43:41,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:43:41,285 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 112 [2022-04-08 08:43:41,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:43:41,285 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-08 08:43:41,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-08 08:43:41,287 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-08 08:43:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-08 08:43:41,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 586 transitions. [2022-04-08 08:43:41,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 586 edges. 586 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:41,698 INFO L225 Difference]: With dead ends: 619 [2022-04-08 08:43:41,698 INFO L226 Difference]: Without dead ends: 365 [2022-04-08 08:43:41,699 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:43:41,699 INFO L913 BasicCegarLoop]: 127 mSDtfsCounter, 141 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:43:41,700 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 362 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 482 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-04-08 08:43:41,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-04-08 08:43:41,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 280. [2022-04-08 08:43:41,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:43:41,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 365 states. Second operand has 280 states, 275 states have (on average 1.530909090909091) internal successors, (421), 275 states have internal predecessors, (421), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:41,711 INFO L74 IsIncluded]: Start isIncluded. First operand 365 states. Second operand has 280 states, 275 states have (on average 1.530909090909091) internal successors, (421), 275 states have internal predecessors, (421), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:41,711 INFO L87 Difference]: Start difference. First operand 365 states. Second operand has 280 states, 275 states have (on average 1.530909090909091) internal successors, (421), 275 states have internal predecessors, (421), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:41,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:41,718 INFO L93 Difference]: Finished difference Result 365 states and 542 transitions. [2022-04-08 08:43:41,718 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 542 transitions. [2022-04-08 08:43:41,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:41,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:41,719 INFO L74 IsIncluded]: Start isIncluded. First operand has 280 states, 275 states have (on average 1.530909090909091) internal successors, (421), 275 states have internal predecessors, (421), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 365 states. [2022-04-08 08:43:41,720 INFO L87 Difference]: Start difference. First operand has 280 states, 275 states have (on average 1.530909090909091) internal successors, (421), 275 states have internal predecessors, (421), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 365 states. [2022-04-08 08:43:41,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:41,726 INFO L93 Difference]: Finished difference Result 365 states and 542 transitions. [2022-04-08 08:43:41,727 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 542 transitions. [2022-04-08 08:43:41,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:41,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:41,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:43:41,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:43:41,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 275 states have (on average 1.530909090909091) internal successors, (421), 275 states have internal predecessors, (421), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:41,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 425 transitions. [2022-04-08 08:43:41,733 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 425 transitions. Word has length 112 [2022-04-08 08:43:41,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:43:41,733 INFO L478 AbstractCegarLoop]: Abstraction has 280 states and 425 transitions. [2022-04-08 08:43:41,734 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-08 08:43:41,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 280 states and 425 transitions. [2022-04-08 08:43:42,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 425 edges. 425 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 425 transitions. [2022-04-08 08:43:42,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-08 08:43:42,061 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:43:42,061 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 08:43:42,061 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 08:43:42,062 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:43:42,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:43:42,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1070160263, now seen corresponding path program 1 times [2022-04-08 08:43:42,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:42,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1117003314] [2022-04-08 08:43:42,121 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:43:42,121 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:43:42,121 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:43:42,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1070160263, now seen corresponding path program 2 times [2022-04-08 08:43:42,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:43:42,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820281594] [2022-04-08 08:43:42,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:43:42,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:43:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:42,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:43:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:42,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {31845#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {31838#true} is VALID [2022-04-08 08:43:42,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {31838#true} assume true; {31838#true} is VALID [2022-04-08 08:43:42,247 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31838#true} {31838#true} #688#return; {31838#true} is VALID [2022-04-08 08:43:42,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {31838#true} call ULTIMATE.init(); {31845#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-08 08:43:42,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {31845#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {31838#true} is VALID [2022-04-08 08:43:42,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {31838#true} assume true; {31838#true} is VALID [2022-04-08 08:43:42,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31838#true} {31838#true} #688#return; {31838#true} is VALID [2022-04-08 08:43:42,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {31838#true} call #t~ret161 := main(); {31838#true} is VALID [2022-04-08 08:43:42,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {31838#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; {31838#true} is VALID [2022-04-08 08:43:42,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {31838#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {31838#true} is VALID [2022-04-08 08:43:42,248 INFO L272 TraceCheckUtils]: 7: Hoare triple {31838#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {31838#true} is VALID [2022-04-08 08:43:42,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {31838#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); {31838#true} is VALID [2022-04-08 08:43:42,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {31838#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; {31838#true} is VALID [2022-04-08 08:43:42,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {31838#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; {31838#true} is VALID [2022-04-08 08:43:42,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {31838#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {31838#true} is VALID [2022-04-08 08:43:42,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {31838#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {31838#true} is VALID [2022-04-08 08:43:42,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {31838#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {31838#true} is VALID [2022-04-08 08:43:42,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {31838#true} assume !false; {31838#true} is VALID [2022-04-08 08:43:42,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {31838#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); {31838#true} is VALID [2022-04-08 08:43:42,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {31838#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {31838#true} is VALID [2022-04-08 08:43:42,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {31838#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31838#true} is VALID [2022-04-08 08:43:42,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {31838#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31838#true} is VALID [2022-04-08 08:43:42,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {31838#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31838#true} is VALID [2022-04-08 08:43:42,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {31838#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31838#true} is VALID [2022-04-08 08:43:42,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {31838#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31838#true} is VALID [2022-04-08 08:43:42,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {31838#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31838#true} is VALID [2022-04-08 08:43:42,250 INFO L290 TraceCheckUtils]: 23: Hoare triple {31838#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31838#true} is VALID [2022-04-08 08:43:42,250 INFO L290 TraceCheckUtils]: 24: Hoare triple {31838#true} assume 8464 == #t~mem55;havoc #t~mem55; {31838#true} is VALID [2022-04-08 08:43:42,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {31838#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; {31838#true} is VALID [2022-04-08 08:43:42,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {31838#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {31838#true} is VALID [2022-04-08 08:43:42,250 INFO L290 TraceCheckUtils]: 27: Hoare triple {31838#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); {31838#true} is VALID [2022-04-08 08:43:42,250 INFO L290 TraceCheckUtils]: 28: Hoare triple {31838#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); {31838#true} is VALID [2022-04-08 08:43:42,251 INFO L290 TraceCheckUtils]: 29: Hoare triple {31838#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {31838#true} is VALID [2022-04-08 08:43:42,251 INFO L290 TraceCheckUtils]: 30: Hoare triple {31838#true} ~skip~0 := 0; {31838#true} is VALID [2022-04-08 08:43:42,251 INFO L290 TraceCheckUtils]: 31: Hoare triple {31838#true} assume !false; {31838#true} is VALID [2022-04-08 08:43:42,251 INFO L290 TraceCheckUtils]: 32: Hoare triple {31838#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); {31838#true} is VALID [2022-04-08 08:43:42,251 INFO L290 TraceCheckUtils]: 33: Hoare triple {31838#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {31838#true} is VALID [2022-04-08 08:43:42,251 INFO L290 TraceCheckUtils]: 34: Hoare triple {31838#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31838#true} is VALID [2022-04-08 08:43:42,251 INFO L290 TraceCheckUtils]: 35: Hoare triple {31838#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31838#true} is VALID [2022-04-08 08:43:42,251 INFO L290 TraceCheckUtils]: 36: Hoare triple {31838#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31838#true} is VALID [2022-04-08 08:43:42,251 INFO L290 TraceCheckUtils]: 37: Hoare triple {31838#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31838#true} is VALID [2022-04-08 08:43:42,251 INFO L290 TraceCheckUtils]: 38: Hoare triple {31838#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31838#true} is VALID [2022-04-08 08:43:42,252 INFO L290 TraceCheckUtils]: 39: Hoare triple {31838#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31838#true} is VALID [2022-04-08 08:43:42,252 INFO L290 TraceCheckUtils]: 40: Hoare triple {31838#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31838#true} is VALID [2022-04-08 08:43:42,252 INFO L290 TraceCheckUtils]: 41: Hoare triple {31838#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31838#true} is VALID [2022-04-08 08:43:42,252 INFO L290 TraceCheckUtils]: 42: Hoare triple {31838#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {31838#true} is VALID [2022-04-08 08:43:42,252 INFO L290 TraceCheckUtils]: 43: Hoare triple {31838#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {31838#true} is VALID [2022-04-08 08:43:42,252 INFO L290 TraceCheckUtils]: 44: Hoare triple {31838#true} assume 8496 == #t~mem58;havoc #t~mem58; {31838#true} is VALID [2022-04-08 08:43:42,252 INFO L290 TraceCheckUtils]: 45: Hoare triple {31838#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {31838#true} is VALID [2022-04-08 08:43:42,252 INFO L290 TraceCheckUtils]: 46: Hoare triple {31838#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {31838#true} is VALID [2022-04-08 08:43:42,252 INFO L290 TraceCheckUtils]: 47: Hoare triple {31838#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {31838#true} is VALID [2022-04-08 08:43:42,253 INFO L290 TraceCheckUtils]: 48: Hoare triple {31838#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:42,254 INFO L290 TraceCheckUtils]: 49: Hoare triple {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:42,255 INFO L290 TraceCheckUtils]: 50: Hoare triple {31843#(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); {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:42,255 INFO L290 TraceCheckUtils]: 51: Hoare triple {31843#(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; {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:42,255 INFO L290 TraceCheckUtils]: 52: Hoare triple {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:42,256 INFO L290 TraceCheckUtils]: 53: Hoare triple {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:42,256 INFO L290 TraceCheckUtils]: 54: Hoare triple {31843#(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); {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:42,257 INFO L290 TraceCheckUtils]: 55: Hoare triple {31843#(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); {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:42,257 INFO L290 TraceCheckUtils]: 56: Hoare triple {31843#(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); {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:42,257 INFO L290 TraceCheckUtils]: 57: Hoare triple {31843#(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); {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:42,258 INFO L290 TraceCheckUtils]: 58: Hoare triple {31843#(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); {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:42,258 INFO L290 TraceCheckUtils]: 59: Hoare triple {31843#(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); {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:42,259 INFO L290 TraceCheckUtils]: 60: Hoare triple {31843#(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); {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:42,259 INFO L290 TraceCheckUtils]: 61: Hoare triple {31843#(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); {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:42,260 INFO L290 TraceCheckUtils]: 62: Hoare triple {31843#(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); {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:42,260 INFO L290 TraceCheckUtils]: 63: Hoare triple {31843#(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); {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:42,260 INFO L290 TraceCheckUtils]: 64: Hoare triple {31843#(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); {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:42,261 INFO L290 TraceCheckUtils]: 65: Hoare triple {31843#(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); {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:42,261 INFO L290 TraceCheckUtils]: 66: Hoare triple {31843#(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); {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:42,262 INFO L290 TraceCheckUtils]: 67: Hoare triple {31843#(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); {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:42,262 INFO L290 TraceCheckUtils]: 68: Hoare triple {31843#(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); {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:42,262 INFO L290 TraceCheckUtils]: 69: Hoare triple {31843#(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); {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:42,263 INFO L290 TraceCheckUtils]: 70: Hoare triple {31843#(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); {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:42,263 INFO L290 TraceCheckUtils]: 71: Hoare triple {31843#(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); {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:42,264 INFO L290 TraceCheckUtils]: 72: Hoare triple {31843#(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); {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:42,264 INFO L290 TraceCheckUtils]: 73: Hoare triple {31843#(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); {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:42,264 INFO L290 TraceCheckUtils]: 74: Hoare triple {31843#(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); {31843#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:42,265 INFO L290 TraceCheckUtils]: 75: Hoare triple {31843#(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); {31844#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-08 08:43:42,265 INFO L290 TraceCheckUtils]: 76: Hoare triple {31844#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {31839#false} is VALID [2022-04-08 08:43:42,265 INFO L290 TraceCheckUtils]: 77: Hoare triple {31839#false} assume !(~num1~0 > 0); {31839#false} is VALID [2022-04-08 08:43:42,265 INFO L290 TraceCheckUtils]: 78: Hoare triple {31839#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; {31839#false} is VALID [2022-04-08 08:43:42,266 INFO L290 TraceCheckUtils]: 79: Hoare triple {31839#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); {31839#false} is VALID [2022-04-08 08:43:42,266 INFO L290 TraceCheckUtils]: 80: Hoare triple {31839#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {31839#false} is VALID [2022-04-08 08:43:42,266 INFO L290 TraceCheckUtils]: 81: Hoare triple {31839#false} ~skip~0 := 0; {31839#false} is VALID [2022-04-08 08:43:42,266 INFO L290 TraceCheckUtils]: 82: Hoare triple {31839#false} assume !false; {31839#false} is VALID [2022-04-08 08:43:42,266 INFO L290 TraceCheckUtils]: 83: Hoare triple {31839#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); {31839#false} is VALID [2022-04-08 08:43:42,266 INFO L290 TraceCheckUtils]: 84: Hoare triple {31839#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {31839#false} is VALID [2022-04-08 08:43:42,266 INFO L290 TraceCheckUtils]: 85: Hoare triple {31839#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31839#false} is VALID [2022-04-08 08:43:42,266 INFO L290 TraceCheckUtils]: 86: Hoare triple {31839#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31839#false} is VALID [2022-04-08 08:43:42,266 INFO L290 TraceCheckUtils]: 87: Hoare triple {31839#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31839#false} is VALID [2022-04-08 08:43:42,267 INFO L290 TraceCheckUtils]: 88: Hoare triple {31839#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31839#false} is VALID [2022-04-08 08:43:42,267 INFO L290 TraceCheckUtils]: 89: Hoare triple {31839#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31839#false} is VALID [2022-04-08 08:43:42,267 INFO L290 TraceCheckUtils]: 90: Hoare triple {31839#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31839#false} is VALID [2022-04-08 08:43:42,267 INFO L290 TraceCheckUtils]: 91: Hoare triple {31839#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31839#false} is VALID [2022-04-08 08:43:42,267 INFO L290 TraceCheckUtils]: 92: Hoare triple {31839#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31839#false} is VALID [2022-04-08 08:43:42,267 INFO L290 TraceCheckUtils]: 93: Hoare triple {31839#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {31839#false} is VALID [2022-04-08 08:43:42,267 INFO L290 TraceCheckUtils]: 94: Hoare triple {31839#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {31839#false} is VALID [2022-04-08 08:43:42,267 INFO L290 TraceCheckUtils]: 95: Hoare triple {31839#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {31839#false} is VALID [2022-04-08 08:43:42,267 INFO L290 TraceCheckUtils]: 96: Hoare triple {31839#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {31839#false} is VALID [2022-04-08 08:43:42,267 INFO L290 TraceCheckUtils]: 97: Hoare triple {31839#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {31839#false} is VALID [2022-04-08 08:43:42,268 INFO L290 TraceCheckUtils]: 98: Hoare triple {31839#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {31839#false} is VALID [2022-04-08 08:43:42,268 INFO L290 TraceCheckUtils]: 99: Hoare triple {31839#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {31839#false} is VALID [2022-04-08 08:43:42,268 INFO L290 TraceCheckUtils]: 100: Hoare triple {31839#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {31839#false} is VALID [2022-04-08 08:43:42,268 INFO L290 TraceCheckUtils]: 101: Hoare triple {31839#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {31839#false} is VALID [2022-04-08 08:43:42,268 INFO L290 TraceCheckUtils]: 102: Hoare triple {31839#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {31839#false} is VALID [2022-04-08 08:43:42,268 INFO L290 TraceCheckUtils]: 103: Hoare triple {31839#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {31839#false} is VALID [2022-04-08 08:43:42,268 INFO L290 TraceCheckUtils]: 104: Hoare triple {31839#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {31839#false} is VALID [2022-04-08 08:43:42,268 INFO L290 TraceCheckUtils]: 105: Hoare triple {31839#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {31839#false} is VALID [2022-04-08 08:43:42,268 INFO L290 TraceCheckUtils]: 106: Hoare triple {31839#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {31839#false} is VALID [2022-04-08 08:43:42,269 INFO L290 TraceCheckUtils]: 107: Hoare triple {31839#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {31839#false} is VALID [2022-04-08 08:43:42,269 INFO L290 TraceCheckUtils]: 108: Hoare triple {31839#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {31839#false} is VALID [2022-04-08 08:43:42,269 INFO L290 TraceCheckUtils]: 109: Hoare triple {31839#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {31839#false} is VALID [2022-04-08 08:43:42,269 INFO L290 TraceCheckUtils]: 110: Hoare triple {31839#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {31839#false} is VALID [2022-04-08 08:43:42,269 INFO L290 TraceCheckUtils]: 111: Hoare triple {31839#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {31839#false} is VALID [2022-04-08 08:43:42,269 INFO L290 TraceCheckUtils]: 112: Hoare triple {31839#false} assume 8640 == #t~mem75;havoc #t~mem75; {31839#false} is VALID [2022-04-08 08:43:42,269 INFO L290 TraceCheckUtils]: 113: Hoare triple {31839#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {31839#false} is VALID [2022-04-08 08:43:42,269 INFO L290 TraceCheckUtils]: 114: Hoare triple {31839#false} assume !(4 == ~blastFlag~0); {31839#false} is VALID [2022-04-08 08:43:42,269 INFO L290 TraceCheckUtils]: 115: Hoare triple {31839#false} assume !(7 == ~blastFlag~0); {31839#false} is VALID [2022-04-08 08:43:42,269 INFO L290 TraceCheckUtils]: 116: Hoare triple {31839#false} assume !false; {31839#false} is VALID [2022-04-08 08:43:42,270 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 08:43:42,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:43:42,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820281594] [2022-04-08 08:43:42,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820281594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:42,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:42,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:42,271 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:43:42,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1117003314] [2022-04-08 08:43:42,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1117003314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:42,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:42,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:42,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328096051] [2022-04-08 08:43:42,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:43:42,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2022-04-08 08:43:42,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:43:42,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:42,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:42,370 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:43:42,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:42,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:43:42,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:43:42,372 INFO L87 Difference]: Start difference. First operand 280 states and 425 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:47,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:47,724 INFO L93 Difference]: Finished difference Result 695 states and 1068 transitions. [2022-04-08 08:43:47,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:43:47,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2022-04-08 08:43:47,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:43:47,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:47,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 581 transitions. [2022-04-08 08:43:47,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:47,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 581 transitions. [2022-04-08 08:43:47,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 581 transitions. [2022-04-08 08:43:48,122 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-08 08:43:48,131 INFO L225 Difference]: With dead ends: 695 [2022-04-08 08:43:48,131 INFO L226 Difference]: Without dead ends: 441 [2022-04-08 08:43:48,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-08 08:43:48,132 INFO L913 BasicCegarLoop]: 133 mSDtfsCounter, 121 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:43:48,132 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 374 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-08 08:43:48,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-04-08 08:43:48,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 344. [2022-04-08 08:43:48,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:43:48,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 441 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-08 08:43:48,151 INFO L74 IsIncluded]: Start isIncluded. First operand 441 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-08 08:43:48,151 INFO L87 Difference]: Start difference. First operand 441 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-08 08:43:48,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:48,161 INFO L93 Difference]: Finished difference Result 441 states and 670 transitions. [2022-04-08 08:43:48,161 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 670 transitions. [2022-04-08 08:43:48,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:48,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:48,162 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 441 states. [2022-04-08 08:43:48,163 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 441 states. [2022-04-08 08:43:48,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:48,173 INFO L93 Difference]: Finished difference Result 441 states and 670 transitions. [2022-04-08 08:43:48,173 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 670 transitions. [2022-04-08 08:43:48,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:48,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:48,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:43:48,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:43:48,174 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-08 08:43:48,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 529 transitions. [2022-04-08 08:43:48,182 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 529 transitions. Word has length 117 [2022-04-08 08:43:48,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:43:48,183 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 529 transitions. [2022-04-08 08:43:48,183 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:48,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 529 transitions. [2022-04-08 08:43:48,585 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-08 08:43:48,585 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 529 transitions. [2022-04-08 08:43:48,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-08 08:43:48,596 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:43:48,596 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-08 08:43:48,596 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-08 08:43:48,596 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:43:48,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:43:48,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1710554449, now seen corresponding path program 1 times [2022-04-08 08:43:48,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:48,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [824965539] [2022-04-08 08:43:48,667 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:43:48,667 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:43:48,667 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:43:48,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1710554449, now seen corresponding path program 2 times [2022-04-08 08:43:48,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:43:48,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569311210] [2022-04-08 08:43:48,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:43:48,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:43:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:48,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:43:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:48,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {34817#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {34810#true} is VALID [2022-04-08 08:43:48,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {34810#true} assume true; {34810#true} is VALID [2022-04-08 08:43:48,790 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34810#true} {34810#true} #688#return; {34810#true} is VALID [2022-04-08 08:43:48,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {34810#true} call ULTIMATE.init(); {34817#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-08 08:43:48,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {34817#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {34810#true} is VALID [2022-04-08 08:43:48,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {34810#true} assume true; {34810#true} is VALID [2022-04-08 08:43:48,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34810#true} {34810#true} #688#return; {34810#true} is VALID [2022-04-08 08:43:48,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {34810#true} call #t~ret161 := main(); {34810#true} is VALID [2022-04-08 08:43:48,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {34810#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; {34810#true} is VALID [2022-04-08 08:43:48,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {34810#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {34810#true} is VALID [2022-04-08 08:43:48,791 INFO L272 TraceCheckUtils]: 7: Hoare triple {34810#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {34810#true} is VALID [2022-04-08 08:43:48,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {34810#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); {34810#true} is VALID [2022-04-08 08:43:48,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {34810#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; {34810#true} is VALID [2022-04-08 08:43:48,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {34810#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; {34810#true} is VALID [2022-04-08 08:43:48,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {34810#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {34810#true} is VALID [2022-04-08 08:43:48,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {34810#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {34810#true} is VALID [2022-04-08 08:43:48,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {34810#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {34810#true} is VALID [2022-04-08 08:43:48,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {34810#true} assume !false; {34810#true} is VALID [2022-04-08 08:43:48,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {34810#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); {34810#true} is VALID [2022-04-08 08:43:48,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {34810#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {34810#true} is VALID [2022-04-08 08:43:48,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {34810#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {34810#true} is VALID [2022-04-08 08:43:48,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {34810#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {34810#true} is VALID [2022-04-08 08:43:48,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {34810#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {34810#true} is VALID [2022-04-08 08:43:48,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {34810#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {34810#true} is VALID [2022-04-08 08:43:48,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {34810#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {34810#true} is VALID [2022-04-08 08:43:48,793 INFO L290 TraceCheckUtils]: 22: Hoare triple {34810#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {34810#true} is VALID [2022-04-08 08:43:48,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {34810#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {34810#true} is VALID [2022-04-08 08:43:48,793 INFO L290 TraceCheckUtils]: 24: Hoare triple {34810#true} assume 8464 == #t~mem55;havoc #t~mem55; {34810#true} is VALID [2022-04-08 08:43:48,793 INFO L290 TraceCheckUtils]: 25: Hoare triple {34810#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; {34810#true} is VALID [2022-04-08 08:43:48,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {34810#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {34810#true} is VALID [2022-04-08 08:43:48,794 INFO L290 TraceCheckUtils]: 27: Hoare triple {34810#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); {34815#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:48,795 INFO L290 TraceCheckUtils]: 28: Hoare triple {34815#(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); {34815#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:48,795 INFO L290 TraceCheckUtils]: 29: Hoare triple {34815#(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; {34815#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:48,796 INFO L290 TraceCheckUtils]: 30: Hoare triple {34815#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {34815#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:48,796 INFO L290 TraceCheckUtils]: 31: Hoare triple {34815#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {34815#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:48,796 INFO L290 TraceCheckUtils]: 32: Hoare triple {34815#(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); {34816#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-08 08:43:48,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {34816#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {34811#false} is VALID [2022-04-08 08:43:48,797 INFO L290 TraceCheckUtils]: 34: Hoare triple {34811#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,797 INFO L290 TraceCheckUtils]: 35: Hoare triple {34811#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,797 INFO L290 TraceCheckUtils]: 36: Hoare triple {34811#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {34811#false} is VALID [2022-04-08 08:43:48,797 INFO L290 TraceCheckUtils]: 37: Hoare triple {34811#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,797 INFO L290 TraceCheckUtils]: 38: Hoare triple {34811#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); {34811#false} is VALID [2022-04-08 08:43:48,797 INFO L290 TraceCheckUtils]: 39: Hoare triple {34811#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {34811#false} is VALID [2022-04-08 08:43:48,798 INFO L290 TraceCheckUtils]: 40: Hoare triple {34811#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); {34811#false} is VALID [2022-04-08 08:43:48,798 INFO L290 TraceCheckUtils]: 41: Hoare triple {34811#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); {34811#false} is VALID [2022-04-08 08:43:48,798 INFO L290 TraceCheckUtils]: 42: Hoare triple {34811#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); {34811#false} is VALID [2022-04-08 08:43:48,798 INFO L290 TraceCheckUtils]: 43: Hoare triple {34811#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {34811#false} is VALID [2022-04-08 08:43:48,798 INFO L290 TraceCheckUtils]: 44: Hoare triple {34811#false} ~skip~0 := 0; {34811#false} is VALID [2022-04-08 08:43:48,798 INFO L290 TraceCheckUtils]: 45: Hoare triple {34811#false} assume !false; {34811#false} is VALID [2022-04-08 08:43:48,798 INFO L290 TraceCheckUtils]: 46: Hoare triple {34811#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); {34811#false} is VALID [2022-04-08 08:43:48,798 INFO L290 TraceCheckUtils]: 47: Hoare triple {34811#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,798 INFO L290 TraceCheckUtils]: 48: Hoare triple {34811#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,798 INFO L290 TraceCheckUtils]: 49: Hoare triple {34811#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,799 INFO L290 TraceCheckUtils]: 50: Hoare triple {34811#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,799 INFO L290 TraceCheckUtils]: 51: Hoare triple {34811#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,799 INFO L290 TraceCheckUtils]: 52: Hoare triple {34811#false} assume 8480 == #t~mem52;havoc #t~mem52; {34811#false} is VALID [2022-04-08 08:43:48,799 INFO L290 TraceCheckUtils]: 53: Hoare triple {34811#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; {34811#false} is VALID [2022-04-08 08:43:48,799 INFO L290 TraceCheckUtils]: 54: Hoare triple {34811#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); {34811#false} is VALID [2022-04-08 08:43:48,799 INFO L290 TraceCheckUtils]: 55: Hoare triple {34811#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); {34811#false} is VALID [2022-04-08 08:43:48,799 INFO L290 TraceCheckUtils]: 56: Hoare triple {34811#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {34811#false} is VALID [2022-04-08 08:43:48,799 INFO L290 TraceCheckUtils]: 57: Hoare triple {34811#false} ~skip~0 := 0; {34811#false} is VALID [2022-04-08 08:43:48,799 INFO L290 TraceCheckUtils]: 58: Hoare triple {34811#false} assume !false; {34811#false} is VALID [2022-04-08 08:43:48,800 INFO L290 TraceCheckUtils]: 59: Hoare triple {34811#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); {34811#false} is VALID [2022-04-08 08:43:48,800 INFO L290 TraceCheckUtils]: 60: Hoare triple {34811#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,800 INFO L290 TraceCheckUtils]: 61: Hoare triple {34811#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,800 INFO L290 TraceCheckUtils]: 62: Hoare triple {34811#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,800 INFO L290 TraceCheckUtils]: 63: Hoare triple {34811#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,800 INFO L290 TraceCheckUtils]: 64: Hoare triple {34811#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,800 INFO L290 TraceCheckUtils]: 65: Hoare triple {34811#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,800 INFO L290 TraceCheckUtils]: 66: Hoare triple {34811#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,800 INFO L290 TraceCheckUtils]: 67: Hoare triple {34811#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,800 INFO L290 TraceCheckUtils]: 68: Hoare triple {34811#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,801 INFO L290 TraceCheckUtils]: 69: Hoare triple {34811#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,801 INFO L290 TraceCheckUtils]: 70: Hoare triple {34811#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,801 INFO L290 TraceCheckUtils]: 71: Hoare triple {34811#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,801 INFO L290 TraceCheckUtils]: 72: Hoare triple {34811#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,801 INFO L290 TraceCheckUtils]: 73: Hoare triple {34811#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,801 INFO L290 TraceCheckUtils]: 74: Hoare triple {34811#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,801 INFO L290 TraceCheckUtils]: 75: Hoare triple {34811#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,801 INFO L290 TraceCheckUtils]: 76: Hoare triple {34811#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,801 INFO L290 TraceCheckUtils]: 77: Hoare triple {34811#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,802 INFO L290 TraceCheckUtils]: 78: Hoare triple {34811#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,802 INFO L290 TraceCheckUtils]: 79: Hoare triple {34811#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,802 INFO L290 TraceCheckUtils]: 80: Hoare triple {34811#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,802 INFO L290 TraceCheckUtils]: 81: Hoare triple {34811#false} assume 8448 == #t~mem68;havoc #t~mem68; {34811#false} is VALID [2022-04-08 08:43:48,802 INFO L290 TraceCheckUtils]: 82: Hoare triple {34811#false} assume !(~num1~0 > 0); {34811#false} is VALID [2022-04-08 08:43:48,802 INFO L290 TraceCheckUtils]: 83: Hoare triple {34811#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; {34811#false} is VALID [2022-04-08 08:43:48,802 INFO L290 TraceCheckUtils]: 84: Hoare triple {34811#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); {34811#false} is VALID [2022-04-08 08:43:48,802 INFO L290 TraceCheckUtils]: 85: Hoare triple {34811#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {34811#false} is VALID [2022-04-08 08:43:48,802 INFO L290 TraceCheckUtils]: 86: Hoare triple {34811#false} ~skip~0 := 0; {34811#false} is VALID [2022-04-08 08:43:48,802 INFO L290 TraceCheckUtils]: 87: Hoare triple {34811#false} assume !false; {34811#false} is VALID [2022-04-08 08:43:48,803 INFO L290 TraceCheckUtils]: 88: Hoare triple {34811#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); {34811#false} is VALID [2022-04-08 08:43:48,803 INFO L290 TraceCheckUtils]: 89: Hoare triple {34811#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,803 INFO L290 TraceCheckUtils]: 90: Hoare triple {34811#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,803 INFO L290 TraceCheckUtils]: 91: Hoare triple {34811#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,803 INFO L290 TraceCheckUtils]: 92: Hoare triple {34811#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,803 INFO L290 TraceCheckUtils]: 93: Hoare triple {34811#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,803 INFO L290 TraceCheckUtils]: 94: Hoare triple {34811#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,803 INFO L290 TraceCheckUtils]: 95: Hoare triple {34811#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,803 INFO L290 TraceCheckUtils]: 96: Hoare triple {34811#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,804 INFO L290 TraceCheckUtils]: 97: Hoare triple {34811#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,804 INFO L290 TraceCheckUtils]: 98: Hoare triple {34811#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,804 INFO L290 TraceCheckUtils]: 99: Hoare triple {34811#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,804 INFO L290 TraceCheckUtils]: 100: Hoare triple {34811#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,804 INFO L290 TraceCheckUtils]: 101: Hoare triple {34811#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,804 INFO L290 TraceCheckUtils]: 102: Hoare triple {34811#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,804 INFO L290 TraceCheckUtils]: 103: Hoare triple {34811#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,804 INFO L290 TraceCheckUtils]: 104: Hoare triple {34811#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,804 INFO L290 TraceCheckUtils]: 105: Hoare triple {34811#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,804 INFO L290 TraceCheckUtils]: 106: Hoare triple {34811#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,805 INFO L290 TraceCheckUtils]: 107: Hoare triple {34811#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,805 INFO L290 TraceCheckUtils]: 108: Hoare triple {34811#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,805 INFO L290 TraceCheckUtils]: 109: Hoare triple {34811#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,805 INFO L290 TraceCheckUtils]: 110: Hoare triple {34811#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,805 INFO L290 TraceCheckUtils]: 111: Hoare triple {34811#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,805 INFO L290 TraceCheckUtils]: 112: Hoare triple {34811#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,805 INFO L290 TraceCheckUtils]: 113: Hoare triple {34811#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,805 INFO L290 TraceCheckUtils]: 114: Hoare triple {34811#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,805 INFO L290 TraceCheckUtils]: 115: Hoare triple {34811#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,805 INFO L290 TraceCheckUtils]: 116: Hoare triple {34811#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {34811#false} is VALID [2022-04-08 08:43:48,805 INFO L290 TraceCheckUtils]: 117: Hoare triple {34811#false} assume 8640 == #t~mem75;havoc #t~mem75; {34811#false} is VALID [2022-04-08 08:43:48,806 INFO L290 TraceCheckUtils]: 118: Hoare triple {34811#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {34811#false} is VALID [2022-04-08 08:43:48,806 INFO L290 TraceCheckUtils]: 119: Hoare triple {34811#false} assume !(4 == ~blastFlag~0); {34811#false} is VALID [2022-04-08 08:43:48,806 INFO L290 TraceCheckUtils]: 120: Hoare triple {34811#false} assume !(7 == ~blastFlag~0); {34811#false} is VALID [2022-04-08 08:43:48,806 INFO L290 TraceCheckUtils]: 121: Hoare triple {34811#false} assume !false; {34811#false} is VALID [2022-04-08 08:43:48,806 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-08 08:43:48,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:43:48,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569311210] [2022-04-08 08:43:48,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569311210] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:48,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:48,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:48,807 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:43:48,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [824965539] [2022-04-08 08:43:48,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [824965539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:48,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:48,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:48,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623842201] [2022-04-08 08:43:48,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:43:48,808 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-08 08:43:48,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:43:48,808 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-08 08:43:48,874 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-08 08:43:48,874 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:43:48,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:48,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:43:48,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:43:48,875 INFO L87 Difference]: Start difference. First operand 344 states and 529 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-08 08:43:56,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:56,782 INFO L93 Difference]: Finished difference Result 737 states and 1134 transitions. [2022-04-08 08:43:56,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:43:56,782 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-08 08:43:56,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:43:56,783 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-08 08:43:56,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2022-04-08 08:43:56,785 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-08 08:43:56,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2022-04-08 08:43:56,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 584 transitions. [2022-04-08 08:43:57,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 584 edges. 584 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:57,192 INFO L225 Difference]: With dead ends: 737 [2022-04-08 08:43:57,192 INFO L226 Difference]: Without dead ends: 419 [2022-04-08 08:43:57,193 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:43:57,194 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 143 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:43:57,194 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 344 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-08 08:43:57,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-04-08 08:43:57,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 344. [2022-04-08 08:43:57,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:43:57,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 419 states. Second operand has 344 states, 339 states have (on average 1.5309734513274336) internal successors, (519), 339 states have internal predecessors, (519), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:57,226 INFO L74 IsIncluded]: Start isIncluded. First operand 419 states. Second operand has 344 states, 339 states have (on average 1.5309734513274336) internal successors, (519), 339 states have internal predecessors, (519), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:57,226 INFO L87 Difference]: Start difference. First operand 419 states. Second operand has 344 states, 339 states have (on average 1.5309734513274336) internal successors, (519), 339 states have internal predecessors, (519), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:57,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:57,235 INFO L93 Difference]: Finished difference Result 419 states and 628 transitions. [2022-04-08 08:43:57,235 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 628 transitions. [2022-04-08 08:43:57,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:57,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:57,236 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 339 states have (on average 1.5309734513274336) internal successors, (519), 339 states have internal predecessors, (519), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 419 states. [2022-04-08 08:43:57,237 INFO L87 Difference]: Start difference. First operand has 344 states, 339 states have (on average 1.5309734513274336) internal successors, (519), 339 states have internal predecessors, (519), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 419 states. [2022-04-08 08:43:57,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:57,246 INFO L93 Difference]: Finished difference Result 419 states and 628 transitions. [2022-04-08 08:43:57,246 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 628 transitions. [2022-04-08 08:43:57,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:57,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:57,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:43:57,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:43:57,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 339 states have (on average 1.5309734513274336) internal successors, (519), 339 states have internal predecessors, (519), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:57,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 523 transitions. [2022-04-08 08:43:57,254 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 523 transitions. Word has length 122 [2022-04-08 08:43:57,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:43:57,254 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 523 transitions. [2022-04-08 08:43:57,254 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-08 08:43:57,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 523 transitions. [2022-04-08 08:43:57,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 523 edges. 523 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:57,661 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 523 transitions. [2022-04-08 08:43:57,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-08 08:43:57,661 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:43:57,662 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-08 08:43:57,662 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-08 08:43:57,662 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:43:57,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:43:57,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1280483039, now seen corresponding path program 1 times [2022-04-08 08:43:57,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:57,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1111801381] [2022-04-08 08:43:57,732 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:43:57,732 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:43:57,732 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:43:57,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1280483039, now seen corresponding path program 2 times [2022-04-08 08:43:57,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:43:57,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887452119] [2022-04-08 08:43:57,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:43:57,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:43:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:57,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:43:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:57,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {37829#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {37822#true} is VALID [2022-04-08 08:43:57,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {37822#true} assume true; {37822#true} is VALID [2022-04-08 08:43:57,857 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37822#true} {37822#true} #688#return; {37822#true} is VALID [2022-04-08 08:43:57,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {37822#true} call ULTIMATE.init(); {37829#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-08 08:43:57,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {37829#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {37822#true} is VALID [2022-04-08 08:43:57,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {37822#true} assume true; {37822#true} is VALID [2022-04-08 08:43:57,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37822#true} {37822#true} #688#return; {37822#true} is VALID [2022-04-08 08:43:57,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {37822#true} call #t~ret161 := main(); {37822#true} is VALID [2022-04-08 08:43:57,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {37822#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; {37822#true} is VALID [2022-04-08 08:43:57,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {37822#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {37822#true} is VALID [2022-04-08 08:43:57,859 INFO L272 TraceCheckUtils]: 7: Hoare triple {37822#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {37822#true} is VALID [2022-04-08 08:43:57,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {37822#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); {37822#true} is VALID [2022-04-08 08:43:57,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {37822#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; {37822#true} is VALID [2022-04-08 08:43:57,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {37822#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; {37822#true} is VALID [2022-04-08 08:43:57,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {37822#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {37822#true} is VALID [2022-04-08 08:43:57,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {37822#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {37822#true} is VALID [2022-04-08 08:43:57,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {37822#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {37822#true} is VALID [2022-04-08 08:43:57,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {37822#true} assume !false; {37822#true} is VALID [2022-04-08 08:43:57,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {37822#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); {37822#true} is VALID [2022-04-08 08:43:57,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {37822#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {37822#true} is VALID [2022-04-08 08:43:57,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {37822#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37822#true} is VALID [2022-04-08 08:43:57,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {37822#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37822#true} is VALID [2022-04-08 08:43:57,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {37822#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37822#true} is VALID [2022-04-08 08:43:57,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {37822#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37822#true} is VALID [2022-04-08 08:43:57,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {37822#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37822#true} is VALID [2022-04-08 08:43:57,860 INFO L290 TraceCheckUtils]: 22: Hoare triple {37822#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37822#true} is VALID [2022-04-08 08:43:57,860 INFO L290 TraceCheckUtils]: 23: Hoare triple {37822#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37822#true} is VALID [2022-04-08 08:43:57,860 INFO L290 TraceCheckUtils]: 24: Hoare triple {37822#true} assume 8464 == #t~mem55;havoc #t~mem55; {37822#true} is VALID [2022-04-08 08:43:57,861 INFO L290 TraceCheckUtils]: 25: Hoare triple {37822#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; {37822#true} is VALID [2022-04-08 08:43:57,861 INFO L290 TraceCheckUtils]: 26: Hoare triple {37822#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37822#true} is VALID [2022-04-08 08:43:57,861 INFO L290 TraceCheckUtils]: 27: Hoare triple {37822#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); {37822#true} is VALID [2022-04-08 08:43:57,861 INFO L290 TraceCheckUtils]: 28: Hoare triple {37822#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); {37822#true} is VALID [2022-04-08 08:43:57,861 INFO L290 TraceCheckUtils]: 29: Hoare triple {37822#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37822#true} is VALID [2022-04-08 08:43:57,861 INFO L290 TraceCheckUtils]: 30: Hoare triple {37822#true} ~skip~0 := 0; {37822#true} is VALID [2022-04-08 08:43:57,861 INFO L290 TraceCheckUtils]: 31: Hoare triple {37822#true} assume !false; {37822#true} is VALID [2022-04-08 08:43:57,861 INFO L290 TraceCheckUtils]: 32: Hoare triple {37822#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); {37822#true} is VALID [2022-04-08 08:43:57,861 INFO L290 TraceCheckUtils]: 33: Hoare triple {37822#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {37822#true} is VALID [2022-04-08 08:43:57,861 INFO L290 TraceCheckUtils]: 34: Hoare triple {37822#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37822#true} is VALID [2022-04-08 08:43:57,862 INFO L290 TraceCheckUtils]: 35: Hoare triple {37822#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37822#true} is VALID [2022-04-08 08:43:57,862 INFO L290 TraceCheckUtils]: 36: Hoare triple {37822#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37822#true} is VALID [2022-04-08 08:43:57,862 INFO L290 TraceCheckUtils]: 37: Hoare triple {37822#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37822#true} is VALID [2022-04-08 08:43:57,862 INFO L290 TraceCheckUtils]: 38: Hoare triple {37822#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37822#true} is VALID [2022-04-08 08:43:57,862 INFO L290 TraceCheckUtils]: 39: Hoare triple {37822#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37822#true} is VALID [2022-04-08 08:43:57,862 INFO L290 TraceCheckUtils]: 40: Hoare triple {37822#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37822#true} is VALID [2022-04-08 08:43:57,862 INFO L290 TraceCheckUtils]: 41: Hoare triple {37822#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37822#true} is VALID [2022-04-08 08:43:57,862 INFO L290 TraceCheckUtils]: 42: Hoare triple {37822#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37822#true} is VALID [2022-04-08 08:43:57,862 INFO L290 TraceCheckUtils]: 43: Hoare triple {37822#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37822#true} is VALID [2022-04-08 08:43:57,862 INFO L290 TraceCheckUtils]: 44: Hoare triple {37822#true} assume 8496 == #t~mem58;havoc #t~mem58; {37822#true} is VALID [2022-04-08 08:43:57,862 INFO L290 TraceCheckUtils]: 45: Hoare triple {37822#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {37822#true} is VALID [2022-04-08 08:43:57,863 INFO L290 TraceCheckUtils]: 46: Hoare triple {37822#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {37822#true} is VALID [2022-04-08 08:43:57,863 INFO L290 TraceCheckUtils]: 47: Hoare triple {37822#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {37822#true} is VALID [2022-04-08 08:43:57,863 INFO L290 TraceCheckUtils]: 48: Hoare triple {37822#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,864 INFO L290 TraceCheckUtils]: 49: Hoare triple {37827#(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); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,865 INFO L290 TraceCheckUtils]: 50: Hoare triple {37827#(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); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,865 INFO L290 TraceCheckUtils]: 51: Hoare triple {37827#(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; {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,865 INFO L290 TraceCheckUtils]: 52: Hoare triple {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,866 INFO L290 TraceCheckUtils]: 53: Hoare triple {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,866 INFO L290 TraceCheckUtils]: 54: Hoare triple {37827#(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); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,867 INFO L290 TraceCheckUtils]: 55: Hoare triple {37827#(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); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,867 INFO L290 TraceCheckUtils]: 56: Hoare triple {37827#(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); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,867 INFO L290 TraceCheckUtils]: 57: Hoare triple {37827#(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); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,868 INFO L290 TraceCheckUtils]: 58: Hoare triple {37827#(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); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,889 INFO L290 TraceCheckUtils]: 59: Hoare triple {37827#(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); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,890 INFO L290 TraceCheckUtils]: 60: Hoare triple {37827#(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); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,892 INFO L290 TraceCheckUtils]: 61: Hoare triple {37827#(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); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,897 INFO L290 TraceCheckUtils]: 62: Hoare triple {37827#(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); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,898 INFO L290 TraceCheckUtils]: 63: Hoare triple {37827#(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); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,898 INFO L290 TraceCheckUtils]: 64: Hoare triple {37827#(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); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,899 INFO L290 TraceCheckUtils]: 65: Hoare triple {37827#(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); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,899 INFO L290 TraceCheckUtils]: 66: Hoare triple {37827#(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); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,900 INFO L290 TraceCheckUtils]: 67: Hoare triple {37827#(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); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,900 INFO L290 TraceCheckUtils]: 68: Hoare triple {37827#(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); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,900 INFO L290 TraceCheckUtils]: 69: Hoare triple {37827#(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); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,901 INFO L290 TraceCheckUtils]: 70: Hoare triple {37827#(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); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,901 INFO L290 TraceCheckUtils]: 71: Hoare triple {37827#(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); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,902 INFO L290 TraceCheckUtils]: 72: Hoare triple {37827#(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); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,904 INFO L290 TraceCheckUtils]: 73: Hoare triple {37827#(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); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,905 INFO L290 TraceCheckUtils]: 74: Hoare triple {37827#(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); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,905 INFO L290 TraceCheckUtils]: 75: Hoare triple {37827#(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); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,906 INFO L290 TraceCheckUtils]: 76: Hoare triple {37827#(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); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,906 INFO L290 TraceCheckUtils]: 77: Hoare triple {37827#(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); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,906 INFO L290 TraceCheckUtils]: 78: Hoare triple {37827#(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); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,907 INFO L290 TraceCheckUtils]: 79: Hoare triple {37827#(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); {37827#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:57,907 INFO L290 TraceCheckUtils]: 80: Hoare triple {37827#(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); {37828#(not (= |ssl3_accept_#t~mem73| 8608))} is VALID [2022-04-08 08:43:57,908 INFO L290 TraceCheckUtils]: 81: Hoare triple {37828#(not (= |ssl3_accept_#t~mem73| 8608))} assume 8608 == #t~mem73;havoc #t~mem73; {37823#false} is VALID [2022-04-08 08:43:57,908 INFO L290 TraceCheckUtils]: 82: Hoare triple {37823#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {37823#false} is VALID [2022-04-08 08:43:57,908 INFO L290 TraceCheckUtils]: 83: Hoare triple {37823#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); {37823#false} is VALID [2022-04-08 08:43:57,908 INFO L290 TraceCheckUtils]: 84: Hoare triple {37823#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); {37823#false} is VALID [2022-04-08 08:43:57,908 INFO L290 TraceCheckUtils]: 85: Hoare triple {37823#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37823#false} is VALID [2022-04-08 08:43:57,908 INFO L290 TraceCheckUtils]: 86: Hoare triple {37823#false} ~skip~0 := 0; {37823#false} is VALID [2022-04-08 08:43:57,908 INFO L290 TraceCheckUtils]: 87: Hoare triple {37823#false} assume !false; {37823#false} is VALID [2022-04-08 08:43:57,908 INFO L290 TraceCheckUtils]: 88: Hoare triple {37823#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); {37823#false} is VALID [2022-04-08 08:43:57,908 INFO L290 TraceCheckUtils]: 89: Hoare triple {37823#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {37823#false} is VALID [2022-04-08 08:43:57,908 INFO L290 TraceCheckUtils]: 90: Hoare triple {37823#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37823#false} is VALID [2022-04-08 08:43:57,909 INFO L290 TraceCheckUtils]: 91: Hoare triple {37823#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37823#false} is VALID [2022-04-08 08:43:57,909 INFO L290 TraceCheckUtils]: 92: Hoare triple {37823#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37823#false} is VALID [2022-04-08 08:43:57,909 INFO L290 TraceCheckUtils]: 93: Hoare triple {37823#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37823#false} is VALID [2022-04-08 08:43:57,909 INFO L290 TraceCheckUtils]: 94: Hoare triple {37823#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37823#false} is VALID [2022-04-08 08:43:57,909 INFO L290 TraceCheckUtils]: 95: Hoare triple {37823#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37823#false} is VALID [2022-04-08 08:43:57,909 INFO L290 TraceCheckUtils]: 96: Hoare triple {37823#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37823#false} is VALID [2022-04-08 08:43:57,909 INFO L290 TraceCheckUtils]: 97: Hoare triple {37823#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37823#false} is VALID [2022-04-08 08:43:57,909 INFO L290 TraceCheckUtils]: 98: Hoare triple {37823#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37823#false} is VALID [2022-04-08 08:43:57,909 INFO L290 TraceCheckUtils]: 99: Hoare triple {37823#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37823#false} is VALID [2022-04-08 08:43:57,909 INFO L290 TraceCheckUtils]: 100: Hoare triple {37823#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {37823#false} is VALID [2022-04-08 08:43:57,909 INFO L290 TraceCheckUtils]: 101: Hoare triple {37823#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {37823#false} is VALID [2022-04-08 08:43:57,909 INFO L290 TraceCheckUtils]: 102: Hoare triple {37823#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {37823#false} is VALID [2022-04-08 08:43:57,909 INFO L290 TraceCheckUtils]: 103: Hoare triple {37823#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {37823#false} is VALID [2022-04-08 08:43:57,909 INFO L290 TraceCheckUtils]: 104: Hoare triple {37823#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {37823#false} is VALID [2022-04-08 08:43:57,910 INFO L290 TraceCheckUtils]: 105: Hoare triple {37823#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {37823#false} is VALID [2022-04-08 08:43:57,910 INFO L290 TraceCheckUtils]: 106: Hoare triple {37823#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {37823#false} is VALID [2022-04-08 08:43:57,910 INFO L290 TraceCheckUtils]: 107: Hoare triple {37823#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {37823#false} is VALID [2022-04-08 08:43:57,910 INFO L290 TraceCheckUtils]: 108: Hoare triple {37823#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {37823#false} is VALID [2022-04-08 08:43:57,910 INFO L290 TraceCheckUtils]: 109: Hoare triple {37823#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {37823#false} is VALID [2022-04-08 08:43:57,910 INFO L290 TraceCheckUtils]: 110: Hoare triple {37823#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {37823#false} is VALID [2022-04-08 08:43:57,910 INFO L290 TraceCheckUtils]: 111: Hoare triple {37823#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {37823#false} is VALID [2022-04-08 08:43:57,910 INFO L290 TraceCheckUtils]: 112: Hoare triple {37823#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {37823#false} is VALID [2022-04-08 08:43:57,910 INFO L290 TraceCheckUtils]: 113: Hoare triple {37823#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {37823#false} is VALID [2022-04-08 08:43:57,910 INFO L290 TraceCheckUtils]: 114: Hoare triple {37823#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {37823#false} is VALID [2022-04-08 08:43:57,910 INFO L290 TraceCheckUtils]: 115: Hoare triple {37823#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {37823#false} is VALID [2022-04-08 08:43:57,910 INFO L290 TraceCheckUtils]: 116: Hoare triple {37823#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {37823#false} is VALID [2022-04-08 08:43:57,910 INFO L290 TraceCheckUtils]: 117: Hoare triple {37823#false} assume 8640 == #t~mem75;havoc #t~mem75; {37823#false} is VALID [2022-04-08 08:43:57,910 INFO L290 TraceCheckUtils]: 118: Hoare triple {37823#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {37823#false} is VALID [2022-04-08 08:43:57,910 INFO L290 TraceCheckUtils]: 119: Hoare triple {37823#false} assume !(4 == ~blastFlag~0); {37823#false} is VALID [2022-04-08 08:43:57,911 INFO L290 TraceCheckUtils]: 120: Hoare triple {37823#false} assume !(7 == ~blastFlag~0); {37823#false} is VALID [2022-04-08 08:43:57,911 INFO L290 TraceCheckUtils]: 121: Hoare triple {37823#false} assume !false; {37823#false} is VALID [2022-04-08 08:43:57,911 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-08 08:43:57,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:43:57,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887452119] [2022-04-08 08:43:57,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887452119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:57,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:57,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:57,912 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:43:57,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1111801381] [2022-04-08 08:43:57,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1111801381] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:57,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:57,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:57,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261416953] [2022-04-08 08:43:57,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:43:57,915 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-08 08:43:57,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:43:57,915 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-08 08:43:57,991 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-08 08:43:57,991 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:43:57,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:57,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:43:57,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:43:57,992 INFO L87 Difference]: Start difference. First operand 344 states and 523 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-08 08:44:01,082 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:03,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:03,910 INFO L93 Difference]: Finished difference Result 777 states and 1187 transitions. [2022-04-08 08:44:03,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:44:03,910 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-08 08:44:03,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:44:03,911 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-08 08:44:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2022-04-08 08:44:03,913 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-08 08:44:03,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2022-04-08 08:44:03,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 583 transitions. [2022-04-08 08:44:04,311 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-08 08:44:04,322 INFO L225 Difference]: With dead ends: 777 [2022-04-08 08:44:04,323 INFO L226 Difference]: Without dead ends: 459 [2022-04-08 08:44:04,323 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-08 08:44:04,324 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 116 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:44:04,324 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 344 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-08 08:44:04,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-04-08 08:44:04,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 381. [2022-04-08 08:44:04,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:44:04,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 459 states. Second operand has 381 states, 376 states have (on average 1.5372340425531914) internal successors, (578), 376 states have internal predecessors, (578), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:04,361 INFO L74 IsIncluded]: Start isIncluded. First operand 459 states. Second operand has 381 states, 376 states have (on average 1.5372340425531914) internal successors, (578), 376 states have internal predecessors, (578), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:04,361 INFO L87 Difference]: Start difference. First operand 459 states. Second operand has 381 states, 376 states have (on average 1.5372340425531914) internal successors, (578), 376 states have internal predecessors, (578), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:04,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:04,372 INFO L93 Difference]: Finished difference Result 459 states and 691 transitions. [2022-04-08 08:44:04,372 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 691 transitions. [2022-04-08 08:44:04,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:04,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:04,373 INFO L74 IsIncluded]: Start isIncluded. First operand has 381 states, 376 states have (on average 1.5372340425531914) internal successors, (578), 376 states have internal predecessors, (578), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 459 states. [2022-04-08 08:44:04,374 INFO L87 Difference]: Start difference. First operand has 381 states, 376 states have (on average 1.5372340425531914) internal successors, (578), 376 states have internal predecessors, (578), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 459 states. [2022-04-08 08:44:04,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:04,384 INFO L93 Difference]: Finished difference Result 459 states and 691 transitions. [2022-04-08 08:44:04,384 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 691 transitions. [2022-04-08 08:44:04,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:04,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:04,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:44:04,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:44:04,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 376 states have (on average 1.5372340425531914) internal successors, (578), 376 states have internal predecessors, (578), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:04,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 582 transitions. [2022-04-08 08:44:04,396 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 582 transitions. Word has length 122 [2022-04-08 08:44:04,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:44:04,396 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 582 transitions. [2022-04-08 08:44:04,396 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-08 08:44:04,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 381 states and 582 transitions. [2022-04-08 08:44:04,888 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-08 08:44:04,888 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 582 transitions. [2022-04-08 08:44:04,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-08 08:44:04,889 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:44:04,889 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-08 08:44:04,889 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-08 08:44:04,889 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:44:04,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:44:04,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1770684853, now seen corresponding path program 1 times [2022-04-08 08:44:04,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:04,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [355739795] [2022-04-08 08:44:04,961 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:44:04,961 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:44:04,961 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:44:04,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1770684853, now seen corresponding path program 2 times [2022-04-08 08:44:04,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:44:04,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335201222] [2022-04-08 08:44:04,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:44:04,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:44:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:05,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:44:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:05,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {41075#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {41068#true} is VALID [2022-04-08 08:44:05,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {41068#true} assume true; {41068#true} is VALID [2022-04-08 08:44:05,090 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41068#true} {41068#true} #688#return; {41068#true} is VALID [2022-04-08 08:44:05,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {41068#true} call ULTIMATE.init(); {41075#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-08 08:44:05,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {41075#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {41068#true} is VALID [2022-04-08 08:44:05,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {41068#true} assume true; {41068#true} is VALID [2022-04-08 08:44:05,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41068#true} {41068#true} #688#return; {41068#true} is VALID [2022-04-08 08:44:05,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {41068#true} call #t~ret161 := main(); {41068#true} is VALID [2022-04-08 08:44:05,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {41068#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; {41068#true} is VALID [2022-04-08 08:44:05,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {41068#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {41068#true} is VALID [2022-04-08 08:44:05,092 INFO L272 TraceCheckUtils]: 7: Hoare triple {41068#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {41068#true} is VALID [2022-04-08 08:44:05,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {41068#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); {41068#true} is VALID [2022-04-08 08:44:05,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {41068#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; {41068#true} is VALID [2022-04-08 08:44:05,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {41068#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; {41068#true} is VALID [2022-04-08 08:44:05,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {41068#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {41068#true} is VALID [2022-04-08 08:44:05,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {41068#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {41068#true} is VALID [2022-04-08 08:44:05,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {41068#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {41068#true} is VALID [2022-04-08 08:44:05,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {41068#true} assume !false; {41068#true} is VALID [2022-04-08 08:44:05,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {41068#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); {41068#true} is VALID [2022-04-08 08:44:05,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {41068#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {41068#true} is VALID [2022-04-08 08:44:05,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {41068#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {41068#true} is VALID [2022-04-08 08:44:05,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {41068#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {41068#true} is VALID [2022-04-08 08:44:05,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {41068#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {41068#true} is VALID [2022-04-08 08:44:05,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {41068#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {41068#true} is VALID [2022-04-08 08:44:05,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {41068#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {41068#true} is VALID [2022-04-08 08:44:05,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {41068#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {41068#true} is VALID [2022-04-08 08:44:05,094 INFO L290 TraceCheckUtils]: 23: Hoare triple {41068#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {41068#true} is VALID [2022-04-08 08:44:05,094 INFO L290 TraceCheckUtils]: 24: Hoare triple {41068#true} assume 8464 == #t~mem55;havoc #t~mem55; {41068#true} is VALID [2022-04-08 08:44:05,094 INFO L290 TraceCheckUtils]: 25: Hoare triple {41068#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; {41068#true} is VALID [2022-04-08 08:44:05,094 INFO L290 TraceCheckUtils]: 26: Hoare triple {41068#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {41068#true} is VALID [2022-04-08 08:44:05,094 INFO L290 TraceCheckUtils]: 27: Hoare triple {41068#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); {41068#true} is VALID [2022-04-08 08:44:05,094 INFO L290 TraceCheckUtils]: 28: Hoare triple {41068#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); {41068#true} is VALID [2022-04-08 08:44:05,094 INFO L290 TraceCheckUtils]: 29: Hoare triple {41068#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {41068#true} is VALID [2022-04-08 08:44:05,094 INFO L290 TraceCheckUtils]: 30: Hoare triple {41068#true} ~skip~0 := 0; {41068#true} is VALID [2022-04-08 08:44:05,094 INFO L290 TraceCheckUtils]: 31: Hoare triple {41068#true} assume !false; {41068#true} is VALID [2022-04-08 08:44:05,094 INFO L290 TraceCheckUtils]: 32: Hoare triple {41068#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); {41068#true} is VALID [2022-04-08 08:44:05,095 INFO L290 TraceCheckUtils]: 33: Hoare triple {41068#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {41068#true} is VALID [2022-04-08 08:44:05,095 INFO L290 TraceCheckUtils]: 34: Hoare triple {41068#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {41068#true} is VALID [2022-04-08 08:44:05,095 INFO L290 TraceCheckUtils]: 35: Hoare triple {41068#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {41068#true} is VALID [2022-04-08 08:44:05,095 INFO L290 TraceCheckUtils]: 36: Hoare triple {41068#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {41068#true} is VALID [2022-04-08 08:44:05,095 INFO L290 TraceCheckUtils]: 37: Hoare triple {41068#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {41068#true} is VALID [2022-04-08 08:44:05,095 INFO L290 TraceCheckUtils]: 38: Hoare triple {41068#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {41068#true} is VALID [2022-04-08 08:44:05,095 INFO L290 TraceCheckUtils]: 39: Hoare triple {41068#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {41068#true} is VALID [2022-04-08 08:44:05,095 INFO L290 TraceCheckUtils]: 40: Hoare triple {41068#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {41068#true} is VALID [2022-04-08 08:44:05,095 INFO L290 TraceCheckUtils]: 41: Hoare triple {41068#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {41068#true} is VALID [2022-04-08 08:44:05,095 INFO L290 TraceCheckUtils]: 42: Hoare triple {41068#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {41068#true} is VALID [2022-04-08 08:44:05,096 INFO L290 TraceCheckUtils]: 43: Hoare triple {41068#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {41068#true} is VALID [2022-04-08 08:44:05,096 INFO L290 TraceCheckUtils]: 44: Hoare triple {41068#true} assume 8496 == #t~mem58;havoc #t~mem58; {41068#true} is VALID [2022-04-08 08:44:05,096 INFO L290 TraceCheckUtils]: 45: Hoare triple {41068#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {41068#true} is VALID [2022-04-08 08:44:05,096 INFO L290 TraceCheckUtils]: 46: Hoare triple {41068#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {41068#true} is VALID [2022-04-08 08:44:05,096 INFO L290 TraceCheckUtils]: 47: Hoare triple {41068#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {41068#true} is VALID [2022-04-08 08:44:05,097 INFO L290 TraceCheckUtils]: 48: Hoare triple {41068#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,097 INFO L290 TraceCheckUtils]: 49: Hoare triple {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,098 INFO L290 TraceCheckUtils]: 50: Hoare triple {41073#(= 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); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,098 INFO L290 TraceCheckUtils]: 51: Hoare triple {41073#(= 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; {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,099 INFO L290 TraceCheckUtils]: 52: Hoare triple {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,099 INFO L290 TraceCheckUtils]: 53: Hoare triple {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,099 INFO L290 TraceCheckUtils]: 54: Hoare triple {41073#(= 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); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,100 INFO L290 TraceCheckUtils]: 55: Hoare triple {41073#(= 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); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,100 INFO L290 TraceCheckUtils]: 56: Hoare triple {41073#(= 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); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,101 INFO L290 TraceCheckUtils]: 57: Hoare triple {41073#(= 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); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,101 INFO L290 TraceCheckUtils]: 58: Hoare triple {41073#(= 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); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,101 INFO L290 TraceCheckUtils]: 59: Hoare triple {41073#(= 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); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,102 INFO L290 TraceCheckUtils]: 60: Hoare triple {41073#(= 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); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,102 INFO L290 TraceCheckUtils]: 61: Hoare triple {41073#(= 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); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,103 INFO L290 TraceCheckUtils]: 62: Hoare triple {41073#(= 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); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,103 INFO L290 TraceCheckUtils]: 63: Hoare triple {41073#(= 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); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,103 INFO L290 TraceCheckUtils]: 64: Hoare triple {41073#(= 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); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,104 INFO L290 TraceCheckUtils]: 65: Hoare triple {41073#(= 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); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,104 INFO L290 TraceCheckUtils]: 66: Hoare triple {41073#(= 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); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,105 INFO L290 TraceCheckUtils]: 67: Hoare triple {41073#(= 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); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,105 INFO L290 TraceCheckUtils]: 68: Hoare triple {41073#(= 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); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,105 INFO L290 TraceCheckUtils]: 69: Hoare triple {41073#(= 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); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,106 INFO L290 TraceCheckUtils]: 70: Hoare triple {41073#(= 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); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,106 INFO L290 TraceCheckUtils]: 71: Hoare triple {41073#(= 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); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,107 INFO L290 TraceCheckUtils]: 72: Hoare triple {41073#(= 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); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,107 INFO L290 TraceCheckUtils]: 73: Hoare triple {41073#(= 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); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,108 INFO L290 TraceCheckUtils]: 74: Hoare triple {41073#(= 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); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,108 INFO L290 TraceCheckUtils]: 75: Hoare triple {41073#(= 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); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,108 INFO L290 TraceCheckUtils]: 76: Hoare triple {41073#(= 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); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,109 INFO L290 TraceCheckUtils]: 77: Hoare triple {41073#(= 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); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,109 INFO L290 TraceCheckUtils]: 78: Hoare triple {41073#(= 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); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,110 INFO L290 TraceCheckUtils]: 79: Hoare triple {41073#(= 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); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,110 INFO L290 TraceCheckUtils]: 80: Hoare triple {41073#(= 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); {41073#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:05,110 INFO L290 TraceCheckUtils]: 81: Hoare triple {41073#(= 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); {41074#(= |ssl3_accept_#t~mem74| 8656)} is VALID [2022-04-08 08:44:05,111 INFO L290 TraceCheckUtils]: 82: Hoare triple {41074#(= |ssl3_accept_#t~mem74| 8656)} assume 8609 == #t~mem74;havoc #t~mem74; {41069#false} is VALID [2022-04-08 08:44:05,111 INFO L290 TraceCheckUtils]: 83: Hoare triple {41069#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {41069#false} is VALID [2022-04-08 08:44:05,111 INFO L290 TraceCheckUtils]: 84: Hoare triple {41069#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); {41069#false} is VALID [2022-04-08 08:44:05,111 INFO L290 TraceCheckUtils]: 85: Hoare triple {41069#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); {41069#false} is VALID [2022-04-08 08:44:05,111 INFO L290 TraceCheckUtils]: 86: Hoare triple {41069#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {41069#false} is VALID [2022-04-08 08:44:05,111 INFO L290 TraceCheckUtils]: 87: Hoare triple {41069#false} ~skip~0 := 0; {41069#false} is VALID [2022-04-08 08:44:05,111 INFO L290 TraceCheckUtils]: 88: Hoare triple {41069#false} assume !false; {41069#false} is VALID [2022-04-08 08:44:05,111 INFO L290 TraceCheckUtils]: 89: Hoare triple {41069#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); {41069#false} is VALID [2022-04-08 08:44:05,112 INFO L290 TraceCheckUtils]: 90: Hoare triple {41069#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {41069#false} is VALID [2022-04-08 08:44:05,112 INFO L290 TraceCheckUtils]: 91: Hoare triple {41069#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {41069#false} is VALID [2022-04-08 08:44:05,112 INFO L290 TraceCheckUtils]: 92: Hoare triple {41069#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {41069#false} is VALID [2022-04-08 08:44:05,112 INFO L290 TraceCheckUtils]: 93: Hoare triple {41069#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {41069#false} is VALID [2022-04-08 08:44:05,112 INFO L290 TraceCheckUtils]: 94: Hoare triple {41069#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {41069#false} is VALID [2022-04-08 08:44:05,112 INFO L290 TraceCheckUtils]: 95: Hoare triple {41069#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {41069#false} is VALID [2022-04-08 08:44:05,112 INFO L290 TraceCheckUtils]: 96: Hoare triple {41069#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {41069#false} is VALID [2022-04-08 08:44:05,112 INFO L290 TraceCheckUtils]: 97: Hoare triple {41069#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {41069#false} is VALID [2022-04-08 08:44:05,112 INFO L290 TraceCheckUtils]: 98: Hoare triple {41069#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {41069#false} is VALID [2022-04-08 08:44:05,112 INFO L290 TraceCheckUtils]: 99: Hoare triple {41069#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {41069#false} is VALID [2022-04-08 08:44:05,113 INFO L290 TraceCheckUtils]: 100: Hoare triple {41069#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {41069#false} is VALID [2022-04-08 08:44:05,113 INFO L290 TraceCheckUtils]: 101: Hoare triple {41069#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {41069#false} is VALID [2022-04-08 08:44:05,113 INFO L290 TraceCheckUtils]: 102: Hoare triple {41069#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {41069#false} is VALID [2022-04-08 08:44:05,113 INFO L290 TraceCheckUtils]: 103: Hoare triple {41069#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {41069#false} is VALID [2022-04-08 08:44:05,113 INFO L290 TraceCheckUtils]: 104: Hoare triple {41069#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {41069#false} is VALID [2022-04-08 08:44:05,113 INFO L290 TraceCheckUtils]: 105: Hoare triple {41069#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {41069#false} is VALID [2022-04-08 08:44:05,113 INFO L290 TraceCheckUtils]: 106: Hoare triple {41069#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {41069#false} is VALID [2022-04-08 08:44:05,113 INFO L290 TraceCheckUtils]: 107: Hoare triple {41069#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {41069#false} is VALID [2022-04-08 08:44:05,113 INFO L290 TraceCheckUtils]: 108: Hoare triple {41069#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {41069#false} is VALID [2022-04-08 08:44:05,113 INFO L290 TraceCheckUtils]: 109: Hoare triple {41069#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {41069#false} is VALID [2022-04-08 08:44:05,114 INFO L290 TraceCheckUtils]: 110: Hoare triple {41069#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {41069#false} is VALID [2022-04-08 08:44:05,114 INFO L290 TraceCheckUtils]: 111: Hoare triple {41069#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {41069#false} is VALID [2022-04-08 08:44:05,114 INFO L290 TraceCheckUtils]: 112: Hoare triple {41069#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {41069#false} is VALID [2022-04-08 08:44:05,114 INFO L290 TraceCheckUtils]: 113: Hoare triple {41069#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {41069#false} is VALID [2022-04-08 08:44:05,114 INFO L290 TraceCheckUtils]: 114: Hoare triple {41069#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {41069#false} is VALID [2022-04-08 08:44:05,114 INFO L290 TraceCheckUtils]: 115: Hoare triple {41069#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {41069#false} is VALID [2022-04-08 08:44:05,114 INFO L290 TraceCheckUtils]: 116: Hoare triple {41069#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {41069#false} is VALID [2022-04-08 08:44:05,114 INFO L290 TraceCheckUtils]: 117: Hoare triple {41069#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {41069#false} is VALID [2022-04-08 08:44:05,114 INFO L290 TraceCheckUtils]: 118: Hoare triple {41069#false} assume 8640 == #t~mem75;havoc #t~mem75; {41069#false} is VALID [2022-04-08 08:44:05,114 INFO L290 TraceCheckUtils]: 119: Hoare triple {41069#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {41069#false} is VALID [2022-04-08 08:44:05,115 INFO L290 TraceCheckUtils]: 120: Hoare triple {41069#false} assume !(4 == ~blastFlag~0); {41069#false} is VALID [2022-04-08 08:44:05,115 INFO L290 TraceCheckUtils]: 121: Hoare triple {41069#false} assume !(7 == ~blastFlag~0); {41069#false} is VALID [2022-04-08 08:44:05,115 INFO L290 TraceCheckUtils]: 122: Hoare triple {41069#false} assume !false; {41069#false} is VALID [2022-04-08 08:44:05,115 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-08 08:44:05,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:44:05,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335201222] [2022-04-08 08:44:05,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335201222] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:05,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:05,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:05,116 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:44:05,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [355739795] [2022-04-08 08:44:05,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [355739795] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:05,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:05,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:05,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613367196] [2022-04-08 08:44:05,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:44:05,117 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-08 08:44:05,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:44:05,117 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-08 08:44:05,206 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-08 08:44:05,206 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:44:05,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:05,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:44:05,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:44:05,207 INFO L87 Difference]: Start difference. First operand 381 states and 582 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-08 08:44:13,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:13,750 INFO L93 Difference]: Finished difference Result 827 states and 1270 transitions. [2022-04-08 08:44:13,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:44:13,750 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-08 08:44:13,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:44:13,751 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-08 08:44:13,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 545 transitions. [2022-04-08 08:44:13,753 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-08 08:44:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 545 transitions. [2022-04-08 08:44:13,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 545 transitions. [2022-04-08 08:44:14,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 545 edges. 545 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:14,123 INFO L225 Difference]: With dead ends: 827 [2022-04-08 08:44:14,123 INFO L226 Difference]: Without dead ends: 472 [2022-04-08 08:44:14,124 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-08 08:44:14,124 INFO L913 BasicCegarLoop]: 179 mSDtfsCounter, 76 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:44:14,124 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 473 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 08:44:14,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-04-08 08:44:14,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 421. [2022-04-08 08:44:14,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:44:14,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 472 states. Second operand has 421 states, 416 states have (on average 1.5408653846153846) internal successors, (641), 416 states have internal predecessors, (641), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:14,149 INFO L74 IsIncluded]: Start isIncluded. First operand 472 states. Second operand has 421 states, 416 states have (on average 1.5408653846153846) internal successors, (641), 416 states have internal predecessors, (641), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:14,149 INFO L87 Difference]: Start difference. First operand 472 states. Second operand has 421 states, 416 states have (on average 1.5408653846153846) internal successors, (641), 416 states have internal predecessors, (641), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:14,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:14,160 INFO L93 Difference]: Finished difference Result 472 states and 716 transitions. [2022-04-08 08:44:14,160 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 716 transitions. [2022-04-08 08:44:14,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:14,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:14,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 421 states, 416 states have (on average 1.5408653846153846) internal successors, (641), 416 states have internal predecessors, (641), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 472 states. [2022-04-08 08:44:14,162 INFO L87 Difference]: Start difference. First operand has 421 states, 416 states have (on average 1.5408653846153846) internal successors, (641), 416 states have internal predecessors, (641), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 472 states. [2022-04-08 08:44:14,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:14,173 INFO L93 Difference]: Finished difference Result 472 states and 716 transitions. [2022-04-08 08:44:14,173 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 716 transitions. [2022-04-08 08:44:14,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:14,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:14,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:44:14,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:44:14,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.5408653846153846) internal successors, (641), 416 states have internal predecessors, (641), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:14,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 645 transitions. [2022-04-08 08:44:14,186 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 645 transitions. Word has length 123 [2022-04-08 08:44:14,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:44:14,186 INFO L478 AbstractCegarLoop]: Abstraction has 421 states and 645 transitions. [2022-04-08 08:44:14,187 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-08 08:44:14,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 421 states and 645 transitions. [2022-04-08 08:44:14,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 645 edges. 645 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:14,716 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 645 transitions. [2022-04-08 08:44:14,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-08 08:44:14,718 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:44:14,718 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-08 08:44:14,718 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-08 08:44:14,718 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:44:14,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:44:14,718 INFO L85 PathProgramCache]: Analyzing trace with hash -36580403, now seen corresponding path program 1 times [2022-04-08 08:44:14,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:14,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [883378867] [2022-04-08 08:44:14,810 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:44:14,810 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:44:14,811 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:44:14,811 INFO L85 PathProgramCache]: Analyzing trace with hash -36580403, now seen corresponding path program 2 times [2022-04-08 08:44:14,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:44:14,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418658053] [2022-04-08 08:44:14,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:44:14,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:44:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:14,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:44:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:14,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {44527#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {44520#true} is VALID [2022-04-08 08:44:14,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {44520#true} assume true; {44520#true} is VALID [2022-04-08 08:44:14,933 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44520#true} {44520#true} #688#return; {44520#true} is VALID [2022-04-08 08:44:14,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {44520#true} call ULTIMATE.init(); {44527#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-08 08:44:14,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {44527#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {44520#true} is VALID [2022-04-08 08:44:14,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {44520#true} assume true; {44520#true} is VALID [2022-04-08 08:44:14,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44520#true} {44520#true} #688#return; {44520#true} is VALID [2022-04-08 08:44:14,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {44520#true} call #t~ret161 := main(); {44520#true} is VALID [2022-04-08 08:44:14,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {44520#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; {44520#true} is VALID [2022-04-08 08:44:14,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {44520#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {44520#true} is VALID [2022-04-08 08:44:14,934 INFO L272 TraceCheckUtils]: 7: Hoare triple {44520#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {44520#true} is VALID [2022-04-08 08:44:14,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {44520#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); {44520#true} is VALID [2022-04-08 08:44:14,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {44520#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; {44520#true} is VALID [2022-04-08 08:44:14,935 INFO L290 TraceCheckUtils]: 10: Hoare triple {44520#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; {44520#true} is VALID [2022-04-08 08:44:14,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {44520#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {44520#true} is VALID [2022-04-08 08:44:14,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {44520#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {44520#true} is VALID [2022-04-08 08:44:14,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {44520#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {44520#true} is VALID [2022-04-08 08:44:14,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {44520#true} assume !false; {44520#true} is VALID [2022-04-08 08:44:14,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {44520#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); {44520#true} is VALID [2022-04-08 08:44:14,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {44520#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44520#true} is VALID [2022-04-08 08:44:14,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {44520#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44520#true} is VALID [2022-04-08 08:44:14,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {44520#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44520#true} is VALID [2022-04-08 08:44:14,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {44520#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44520#true} is VALID [2022-04-08 08:44:14,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {44520#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44520#true} is VALID [2022-04-08 08:44:14,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {44520#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44520#true} is VALID [2022-04-08 08:44:14,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {44520#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44520#true} is VALID [2022-04-08 08:44:14,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {44520#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44520#true} is VALID [2022-04-08 08:44:14,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {44520#true} assume 8464 == #t~mem55;havoc #t~mem55; {44520#true} is VALID [2022-04-08 08:44:14,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {44520#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; {44520#true} is VALID [2022-04-08 08:44:14,936 INFO L290 TraceCheckUtils]: 26: Hoare triple {44520#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {44520#true} is VALID [2022-04-08 08:44:14,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {44520#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); {44520#true} is VALID [2022-04-08 08:44:14,936 INFO L290 TraceCheckUtils]: 28: Hoare triple {44520#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); {44520#true} is VALID [2022-04-08 08:44:14,937 INFO L290 TraceCheckUtils]: 29: Hoare triple {44520#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44520#true} is VALID [2022-04-08 08:44:14,937 INFO L290 TraceCheckUtils]: 30: Hoare triple {44520#true} ~skip~0 := 0; {44520#true} is VALID [2022-04-08 08:44:14,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {44520#true} assume !false; {44520#true} is VALID [2022-04-08 08:44:14,937 INFO L290 TraceCheckUtils]: 32: Hoare triple {44520#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); {44520#true} is VALID [2022-04-08 08:44:14,937 INFO L290 TraceCheckUtils]: 33: Hoare triple {44520#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44520#true} is VALID [2022-04-08 08:44:14,937 INFO L290 TraceCheckUtils]: 34: Hoare triple {44520#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44520#true} is VALID [2022-04-08 08:44:14,937 INFO L290 TraceCheckUtils]: 35: Hoare triple {44520#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44520#true} is VALID [2022-04-08 08:44:14,937 INFO L290 TraceCheckUtils]: 36: Hoare triple {44520#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44520#true} is VALID [2022-04-08 08:44:14,938 INFO L290 TraceCheckUtils]: 37: Hoare triple {44520#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44520#true} is VALID [2022-04-08 08:44:14,938 INFO L290 TraceCheckUtils]: 38: Hoare triple {44520#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44520#true} is VALID [2022-04-08 08:44:14,938 INFO L290 TraceCheckUtils]: 39: Hoare triple {44520#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44520#true} is VALID [2022-04-08 08:44:14,938 INFO L290 TraceCheckUtils]: 40: Hoare triple {44520#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44520#true} is VALID [2022-04-08 08:44:14,938 INFO L290 TraceCheckUtils]: 41: Hoare triple {44520#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44520#true} is VALID [2022-04-08 08:44:14,938 INFO L290 TraceCheckUtils]: 42: Hoare triple {44520#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44520#true} is VALID [2022-04-08 08:44:14,938 INFO L290 TraceCheckUtils]: 43: Hoare triple {44520#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44520#true} is VALID [2022-04-08 08:44:14,938 INFO L290 TraceCheckUtils]: 44: Hoare triple {44520#true} assume 8496 == #t~mem58;havoc #t~mem58; {44520#true} is VALID [2022-04-08 08:44:14,938 INFO L290 TraceCheckUtils]: 45: Hoare triple {44520#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {44520#true} is VALID [2022-04-08 08:44:14,938 INFO L290 TraceCheckUtils]: 46: Hoare triple {44520#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {44520#true} is VALID [2022-04-08 08:44:14,939 INFO L290 TraceCheckUtils]: 47: Hoare triple {44520#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {44520#true} is VALID [2022-04-08 08:44:14,940 INFO L290 TraceCheckUtils]: 48: Hoare triple {44520#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,940 INFO L290 TraceCheckUtils]: 49: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,941 INFO L290 TraceCheckUtils]: 50: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,941 INFO L290 TraceCheckUtils]: 51: Hoare triple {44525#(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; {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,942 INFO L290 TraceCheckUtils]: 52: Hoare triple {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} ~skip~0 := 0; {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,942 INFO L290 TraceCheckUtils]: 53: Hoare triple {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !false; {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,942 INFO L290 TraceCheckUtils]: 54: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,943 INFO L290 TraceCheckUtils]: 55: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,943 INFO L290 TraceCheckUtils]: 56: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,944 INFO L290 TraceCheckUtils]: 57: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,944 INFO L290 TraceCheckUtils]: 58: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,944 INFO L290 TraceCheckUtils]: 59: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,945 INFO L290 TraceCheckUtils]: 60: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,945 INFO L290 TraceCheckUtils]: 61: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,946 INFO L290 TraceCheckUtils]: 62: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,946 INFO L290 TraceCheckUtils]: 63: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,947 INFO L290 TraceCheckUtils]: 64: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,947 INFO L290 TraceCheckUtils]: 65: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,947 INFO L290 TraceCheckUtils]: 66: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,948 INFO L290 TraceCheckUtils]: 67: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,948 INFO L290 TraceCheckUtils]: 68: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,949 INFO L290 TraceCheckUtils]: 69: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,949 INFO L290 TraceCheckUtils]: 70: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,949 INFO L290 TraceCheckUtils]: 71: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,950 INFO L290 TraceCheckUtils]: 72: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,950 INFO L290 TraceCheckUtils]: 73: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,951 INFO L290 TraceCheckUtils]: 74: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,951 INFO L290 TraceCheckUtils]: 75: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,951 INFO L290 TraceCheckUtils]: 76: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,952 INFO L290 TraceCheckUtils]: 77: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,952 INFO L290 TraceCheckUtils]: 78: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,953 INFO L290 TraceCheckUtils]: 79: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,953 INFO L290 TraceCheckUtils]: 80: Hoare triple {44525#(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); {44525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:44:14,954 INFO L290 TraceCheckUtils]: 81: Hoare triple {44525#(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); {44526#(not (= |ssl3_accept_#t~mem74| 8609))} is VALID [2022-04-08 08:44:14,954 INFO L290 TraceCheckUtils]: 82: Hoare triple {44526#(not (= |ssl3_accept_#t~mem74| 8609))} assume 8609 == #t~mem74;havoc #t~mem74; {44521#false} is VALID [2022-04-08 08:44:14,954 INFO L290 TraceCheckUtils]: 83: Hoare triple {44521#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {44521#false} is VALID [2022-04-08 08:44:14,954 INFO L290 TraceCheckUtils]: 84: Hoare triple {44521#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); {44521#false} is VALID [2022-04-08 08:44:14,954 INFO L290 TraceCheckUtils]: 85: Hoare triple {44521#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); {44521#false} is VALID [2022-04-08 08:44:14,954 INFO L290 TraceCheckUtils]: 86: Hoare triple {44521#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44521#false} is VALID [2022-04-08 08:44:14,954 INFO L290 TraceCheckUtils]: 87: Hoare triple {44521#false} ~skip~0 := 0; {44521#false} is VALID [2022-04-08 08:44:14,954 INFO L290 TraceCheckUtils]: 88: Hoare triple {44521#false} assume !false; {44521#false} is VALID [2022-04-08 08:44:14,955 INFO L290 TraceCheckUtils]: 89: Hoare triple {44521#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); {44521#false} is VALID [2022-04-08 08:44:14,955 INFO L290 TraceCheckUtils]: 90: Hoare triple {44521#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44521#false} is VALID [2022-04-08 08:44:14,955 INFO L290 TraceCheckUtils]: 91: Hoare triple {44521#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44521#false} is VALID [2022-04-08 08:44:14,955 INFO L290 TraceCheckUtils]: 92: Hoare triple {44521#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44521#false} is VALID [2022-04-08 08:44:14,955 INFO L290 TraceCheckUtils]: 93: Hoare triple {44521#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44521#false} is VALID [2022-04-08 08:44:14,955 INFO L290 TraceCheckUtils]: 94: Hoare triple {44521#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44521#false} is VALID [2022-04-08 08:44:14,955 INFO L290 TraceCheckUtils]: 95: Hoare triple {44521#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44521#false} is VALID [2022-04-08 08:44:14,955 INFO L290 TraceCheckUtils]: 96: Hoare triple {44521#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44521#false} is VALID [2022-04-08 08:44:14,955 INFO L290 TraceCheckUtils]: 97: Hoare triple {44521#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44521#false} is VALID [2022-04-08 08:44:14,955 INFO L290 TraceCheckUtils]: 98: Hoare triple {44521#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44521#false} is VALID [2022-04-08 08:44:14,955 INFO L290 TraceCheckUtils]: 99: Hoare triple {44521#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44521#false} is VALID [2022-04-08 08:44:14,956 INFO L290 TraceCheckUtils]: 100: Hoare triple {44521#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44521#false} is VALID [2022-04-08 08:44:14,956 INFO L290 TraceCheckUtils]: 101: Hoare triple {44521#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {44521#false} is VALID [2022-04-08 08:44:14,956 INFO L290 TraceCheckUtils]: 102: Hoare triple {44521#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {44521#false} is VALID [2022-04-08 08:44:14,956 INFO L290 TraceCheckUtils]: 103: Hoare triple {44521#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {44521#false} is VALID [2022-04-08 08:44:14,956 INFO L290 TraceCheckUtils]: 104: Hoare triple {44521#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {44521#false} is VALID [2022-04-08 08:44:14,956 INFO L290 TraceCheckUtils]: 105: Hoare triple {44521#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {44521#false} is VALID [2022-04-08 08:44:14,956 INFO L290 TraceCheckUtils]: 106: Hoare triple {44521#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {44521#false} is VALID [2022-04-08 08:44:14,956 INFO L290 TraceCheckUtils]: 107: Hoare triple {44521#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {44521#false} is VALID [2022-04-08 08:44:14,956 INFO L290 TraceCheckUtils]: 108: Hoare triple {44521#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {44521#false} is VALID [2022-04-08 08:44:14,956 INFO L290 TraceCheckUtils]: 109: Hoare triple {44521#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {44521#false} is VALID [2022-04-08 08:44:14,957 INFO L290 TraceCheckUtils]: 110: Hoare triple {44521#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {44521#false} is VALID [2022-04-08 08:44:14,957 INFO L290 TraceCheckUtils]: 111: Hoare triple {44521#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {44521#false} is VALID [2022-04-08 08:44:14,957 INFO L290 TraceCheckUtils]: 112: Hoare triple {44521#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {44521#false} is VALID [2022-04-08 08:44:14,957 INFO L290 TraceCheckUtils]: 113: Hoare triple {44521#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {44521#false} is VALID [2022-04-08 08:44:14,957 INFO L290 TraceCheckUtils]: 114: Hoare triple {44521#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {44521#false} is VALID [2022-04-08 08:44:14,957 INFO L290 TraceCheckUtils]: 115: Hoare triple {44521#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {44521#false} is VALID [2022-04-08 08:44:14,957 INFO L290 TraceCheckUtils]: 116: Hoare triple {44521#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {44521#false} is VALID [2022-04-08 08:44:14,957 INFO L290 TraceCheckUtils]: 117: Hoare triple {44521#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {44521#false} is VALID [2022-04-08 08:44:14,957 INFO L290 TraceCheckUtils]: 118: Hoare triple {44521#false} assume 8640 == #t~mem75;havoc #t~mem75; {44521#false} is VALID [2022-04-08 08:44:14,957 INFO L290 TraceCheckUtils]: 119: Hoare triple {44521#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {44521#false} is VALID [2022-04-08 08:44:14,958 INFO L290 TraceCheckUtils]: 120: Hoare triple {44521#false} assume !(4 == ~blastFlag~0); {44521#false} is VALID [2022-04-08 08:44:14,958 INFO L290 TraceCheckUtils]: 121: Hoare triple {44521#false} assume !(7 == ~blastFlag~0); {44521#false} is VALID [2022-04-08 08:44:14,958 INFO L290 TraceCheckUtils]: 122: Hoare triple {44521#false} assume !false; {44521#false} is VALID [2022-04-08 08:44:14,958 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-08 08:44:14,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:44:14,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418658053] [2022-04-08 08:44:14,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418658053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:14,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:14,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:14,959 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:44:14,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [883378867] [2022-04-08 08:44:14,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [883378867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:14,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:14,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:14,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547677900] [2022-04-08 08:44:14,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:44:14,960 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-08 08:44:14,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:44:14,961 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-08 08:44:15,048 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-08 08:44:15,048 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:44:15,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:15,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:44:15,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:44:15,049 INFO L87 Difference]: Start difference. First operand 421 states and 645 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-08 08:44:17,072 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-08 08:44:18,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:18,202 INFO L93 Difference]: Finished difference Result 891 states and 1366 transitions. [2022-04-08 08:44:18,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:44:18,202 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-08 08:44:18,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:44:18,203 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-08 08:44:18,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2022-04-08 08:44:18,205 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-08 08:44:18,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2022-04-08 08:44:18,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 583 transitions. [2022-04-08 08:44:18,599 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-08 08:44:18,609 INFO L225 Difference]: With dead ends: 891 [2022-04-08 08:44:18,609 INFO L226 Difference]: Without dead ends: 496 [2022-04-08 08:44:18,610 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-08 08:44:18,610 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 115 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:44:18,611 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 344 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 467 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 08:44:18,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-04-08 08:44:18,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 381. [2022-04-08 08:44:18,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:44:18,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 496 states. Second operand has 381 states, 376 states have (on average 1.5319148936170213) internal successors, (576), 376 states have internal predecessors, (576), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:18,634 INFO L74 IsIncluded]: Start isIncluded. First operand 496 states. Second operand has 381 states, 376 states have (on average 1.5319148936170213) internal successors, (576), 376 states have internal predecessors, (576), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:18,635 INFO L87 Difference]: Start difference. First operand 496 states. Second operand has 381 states, 376 states have (on average 1.5319148936170213) internal successors, (576), 376 states have internal predecessors, (576), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:18,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:18,647 INFO L93 Difference]: Finished difference Result 496 states and 748 transitions. [2022-04-08 08:44:18,647 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 748 transitions. [2022-04-08 08:44:18,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:18,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:18,648 INFO L74 IsIncluded]: Start isIncluded. First operand has 381 states, 376 states have (on average 1.5319148936170213) internal successors, (576), 376 states have internal predecessors, (576), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 496 states. [2022-04-08 08:44:18,649 INFO L87 Difference]: Start difference. First operand has 381 states, 376 states have (on average 1.5319148936170213) internal successors, (576), 376 states have internal predecessors, (576), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 496 states. [2022-04-08 08:44:18,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:18,661 INFO L93 Difference]: Finished difference Result 496 states and 748 transitions. [2022-04-08 08:44:18,661 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 748 transitions. [2022-04-08 08:44:18,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:18,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:18,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:44:18,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:44:18,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 376 states have (on average 1.5319148936170213) internal successors, (576), 376 states have internal predecessors, (576), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:18,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 580 transitions. [2022-04-08 08:44:18,672 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 580 transitions. Word has length 123 [2022-04-08 08:44:18,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:44:18,672 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 580 transitions. [2022-04-08 08:44:18,672 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-08 08:44:18,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 381 states and 580 transitions. [2022-04-08 08:44:19,255 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-08 08:44:19,255 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 580 transitions. [2022-04-08 08:44:19,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-08 08:44:19,256 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:44:19,256 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-08 08:44:19,257 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-08 08:44:19,257 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:44:19,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:44:19,257 INFO L85 PathProgramCache]: Analyzing trace with hash 784480907, now seen corresponding path program 1 times [2022-04-08 08:44:19,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:19,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [132944546] [2022-04-08 08:44:19,352 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:44:19,353 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:44:19,353 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:44:19,353 INFO L85 PathProgramCache]: Analyzing trace with hash 784480907, now seen corresponding path program 2 times [2022-04-08 08:44:19,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:44:19,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203455025] [2022-04-08 08:44:19,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:44:19,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:44:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:19,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:44:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:19,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {48075#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {48068#true} is VALID [2022-04-08 08:44:19,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {48068#true} assume true; {48068#true} is VALID [2022-04-08 08:44:19,516 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48068#true} {48068#true} #688#return; {48068#true} is VALID [2022-04-08 08:44:19,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {48068#true} call ULTIMATE.init(); {48075#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-08 08:44:19,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {48075#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {48068#true} is VALID [2022-04-08 08:44:19,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {48068#true} assume true; {48068#true} is VALID [2022-04-08 08:44:19,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48068#true} {48068#true} #688#return; {48068#true} is VALID [2022-04-08 08:44:19,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {48068#true} call #t~ret161 := main(); {48068#true} is VALID [2022-04-08 08:44:19,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {48068#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; {48068#true} is VALID [2022-04-08 08:44:19,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {48068#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {48068#true} is VALID [2022-04-08 08:44:19,518 INFO L272 TraceCheckUtils]: 7: Hoare triple {48068#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {48068#true} is VALID [2022-04-08 08:44:19,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {48068#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); {48068#true} is VALID [2022-04-08 08:44:19,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {48068#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; {48068#true} is VALID [2022-04-08 08:44:19,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {48068#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; {48068#true} is VALID [2022-04-08 08:44:19,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {48068#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {48068#true} is VALID [2022-04-08 08:44:19,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {48068#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {48068#true} is VALID [2022-04-08 08:44:19,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {48068#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {48068#true} is VALID [2022-04-08 08:44:19,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {48068#true} assume !false; {48068#true} is VALID [2022-04-08 08:44:19,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {48068#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); {48068#true} is VALID [2022-04-08 08:44:19,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {48068#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {48068#true} is VALID [2022-04-08 08:44:19,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {48068#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48068#true} is VALID [2022-04-08 08:44:19,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {48068#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48068#true} is VALID [2022-04-08 08:44:19,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {48068#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48068#true} is VALID [2022-04-08 08:44:19,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {48068#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48068#true} is VALID [2022-04-08 08:44:19,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {48068#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48068#true} is VALID [2022-04-08 08:44:19,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {48068#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48068#true} is VALID [2022-04-08 08:44:19,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {48068#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48068#true} is VALID [2022-04-08 08:44:19,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {48068#true} assume 8464 == #t~mem55;havoc #t~mem55; {48068#true} is VALID [2022-04-08 08:44:19,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {48068#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; {48068#true} is VALID [2022-04-08 08:44:19,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {48068#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {48068#true} is VALID [2022-04-08 08:44:19,519 INFO L290 TraceCheckUtils]: 27: Hoare triple {48068#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); {48068#true} is VALID [2022-04-08 08:44:19,520 INFO L290 TraceCheckUtils]: 28: Hoare triple {48068#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); {48068#true} is VALID [2022-04-08 08:44:19,520 INFO L290 TraceCheckUtils]: 29: Hoare triple {48068#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48068#true} is VALID [2022-04-08 08:44:19,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {48068#true} ~skip~0 := 0; {48068#true} is VALID [2022-04-08 08:44:19,520 INFO L290 TraceCheckUtils]: 31: Hoare triple {48068#true} assume !false; {48068#true} is VALID [2022-04-08 08:44:19,520 INFO L290 TraceCheckUtils]: 32: Hoare triple {48068#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); {48068#true} is VALID [2022-04-08 08:44:19,520 INFO L290 TraceCheckUtils]: 33: Hoare triple {48068#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {48068#true} is VALID [2022-04-08 08:44:19,520 INFO L290 TraceCheckUtils]: 34: Hoare triple {48068#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48068#true} is VALID [2022-04-08 08:44:19,520 INFO L290 TraceCheckUtils]: 35: Hoare triple {48068#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48068#true} is VALID [2022-04-08 08:44:19,520 INFO L290 TraceCheckUtils]: 36: Hoare triple {48068#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48068#true} is VALID [2022-04-08 08:44:19,520 INFO L290 TraceCheckUtils]: 37: Hoare triple {48068#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48068#true} is VALID [2022-04-08 08:44:19,520 INFO L290 TraceCheckUtils]: 38: Hoare triple {48068#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48068#true} is VALID [2022-04-08 08:44:19,521 INFO L290 TraceCheckUtils]: 39: Hoare triple {48068#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48068#true} is VALID [2022-04-08 08:44:19,521 INFO L290 TraceCheckUtils]: 40: Hoare triple {48068#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48068#true} is VALID [2022-04-08 08:44:19,521 INFO L290 TraceCheckUtils]: 41: Hoare triple {48068#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {48068#true} is VALID [2022-04-08 08:44:19,521 INFO L290 TraceCheckUtils]: 42: Hoare triple {48068#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {48068#true} is VALID [2022-04-08 08:44:19,521 INFO L290 TraceCheckUtils]: 43: Hoare triple {48068#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {48068#true} is VALID [2022-04-08 08:44:19,521 INFO L290 TraceCheckUtils]: 44: Hoare triple {48068#true} assume 8496 == #t~mem58;havoc #t~mem58; {48068#true} is VALID [2022-04-08 08:44:19,521 INFO L290 TraceCheckUtils]: 45: Hoare triple {48068#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {48068#true} is VALID [2022-04-08 08:44:19,521 INFO L290 TraceCheckUtils]: 46: Hoare triple {48068#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {48068#true} is VALID [2022-04-08 08:44:19,521 INFO L290 TraceCheckUtils]: 47: Hoare triple {48068#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {48068#true} is VALID [2022-04-08 08:44:19,522 INFO L290 TraceCheckUtils]: 48: Hoare triple {48068#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,523 INFO L290 TraceCheckUtils]: 49: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,523 INFO L290 TraceCheckUtils]: 50: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,523 INFO L290 TraceCheckUtils]: 51: Hoare triple {48073#(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; {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,524 INFO L290 TraceCheckUtils]: 52: Hoare triple {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,524 INFO L290 TraceCheckUtils]: 53: Hoare triple {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,525 INFO L290 TraceCheckUtils]: 54: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,525 INFO L290 TraceCheckUtils]: 55: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,525 INFO L290 TraceCheckUtils]: 56: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,526 INFO L290 TraceCheckUtils]: 57: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,526 INFO L290 TraceCheckUtils]: 58: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,527 INFO L290 TraceCheckUtils]: 59: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,527 INFO L290 TraceCheckUtils]: 60: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,527 INFO L290 TraceCheckUtils]: 61: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,528 INFO L290 TraceCheckUtils]: 62: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,528 INFO L290 TraceCheckUtils]: 63: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,529 INFO L290 TraceCheckUtils]: 64: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,529 INFO L290 TraceCheckUtils]: 65: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,529 INFO L290 TraceCheckUtils]: 66: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,530 INFO L290 TraceCheckUtils]: 67: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,530 INFO L290 TraceCheckUtils]: 68: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,531 INFO L290 TraceCheckUtils]: 69: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,531 INFO L290 TraceCheckUtils]: 70: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,532 INFO L290 TraceCheckUtils]: 71: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,532 INFO L290 TraceCheckUtils]: 72: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,532 INFO L290 TraceCheckUtils]: 73: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,533 INFO L290 TraceCheckUtils]: 74: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,533 INFO L290 TraceCheckUtils]: 75: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,534 INFO L290 TraceCheckUtils]: 76: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,534 INFO L290 TraceCheckUtils]: 77: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,534 INFO L290 TraceCheckUtils]: 78: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,535 INFO L290 TraceCheckUtils]: 79: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,535 INFO L290 TraceCheckUtils]: 80: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,536 INFO L290 TraceCheckUtils]: 81: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,536 INFO L290 TraceCheckUtils]: 82: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,536 INFO L290 TraceCheckUtils]: 83: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,537 INFO L290 TraceCheckUtils]: 84: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,537 INFO L290 TraceCheckUtils]: 85: Hoare triple {48073#(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); {48073#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:19,538 INFO L290 TraceCheckUtils]: 86: Hoare triple {48073#(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); {48074#(not (= |ssl3_accept_#t~mem79| 8672))} is VALID [2022-04-08 08:44:19,538 INFO L290 TraceCheckUtils]: 87: Hoare triple {48074#(not (= |ssl3_accept_#t~mem79| 8672))} assume 8672 == #t~mem79;havoc #t~mem79; {48069#false} is VALID [2022-04-08 08:44:19,538 INFO L290 TraceCheckUtils]: 88: Hoare triple {48069#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {48069#false} is VALID [2022-04-08 08:44:19,538 INFO L290 TraceCheckUtils]: 89: Hoare triple {48069#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {48069#false} is VALID [2022-04-08 08:44:19,538 INFO L290 TraceCheckUtils]: 90: Hoare triple {48069#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); {48069#false} is VALID [2022-04-08 08:44:19,539 INFO L290 TraceCheckUtils]: 91: Hoare triple {48069#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; {48069#false} is VALID [2022-04-08 08:44:19,544 INFO L290 TraceCheckUtils]: 92: Hoare triple {48069#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,544 INFO L290 TraceCheckUtils]: 93: Hoare triple {48069#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); {48069#false} is VALID [2022-04-08 08:44:19,544 INFO L290 TraceCheckUtils]: 94: Hoare triple {48069#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48069#false} is VALID [2022-04-08 08:44:19,544 INFO L290 TraceCheckUtils]: 95: Hoare triple {48069#false} ~skip~0 := 0; {48069#false} is VALID [2022-04-08 08:44:19,544 INFO L290 TraceCheckUtils]: 96: Hoare triple {48069#false} assume !false; {48069#false} is VALID [2022-04-08 08:44:19,544 INFO L290 TraceCheckUtils]: 97: Hoare triple {48069#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); {48069#false} is VALID [2022-04-08 08:44:19,545 INFO L290 TraceCheckUtils]: 98: Hoare triple {48069#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,545 INFO L290 TraceCheckUtils]: 99: Hoare triple {48069#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,545 INFO L290 TraceCheckUtils]: 100: Hoare triple {48069#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,545 INFO L290 TraceCheckUtils]: 101: Hoare triple {48069#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,545 INFO L290 TraceCheckUtils]: 102: Hoare triple {48069#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,545 INFO L290 TraceCheckUtils]: 103: Hoare triple {48069#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,545 INFO L290 TraceCheckUtils]: 104: Hoare triple {48069#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,545 INFO L290 TraceCheckUtils]: 105: Hoare triple {48069#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,545 INFO L290 TraceCheckUtils]: 106: Hoare triple {48069#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,545 INFO L290 TraceCheckUtils]: 107: Hoare triple {48069#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,545 INFO L290 TraceCheckUtils]: 108: Hoare triple {48069#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,546 INFO L290 TraceCheckUtils]: 109: Hoare triple {48069#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,546 INFO L290 TraceCheckUtils]: 110: Hoare triple {48069#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,546 INFO L290 TraceCheckUtils]: 111: Hoare triple {48069#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,546 INFO L290 TraceCheckUtils]: 112: Hoare triple {48069#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,546 INFO L290 TraceCheckUtils]: 113: Hoare triple {48069#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,546 INFO L290 TraceCheckUtils]: 114: Hoare triple {48069#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,546 INFO L290 TraceCheckUtils]: 115: Hoare triple {48069#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,546 INFO L290 TraceCheckUtils]: 116: Hoare triple {48069#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,546 INFO L290 TraceCheckUtils]: 117: Hoare triple {48069#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,546 INFO L290 TraceCheckUtils]: 118: Hoare triple {48069#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,546 INFO L290 TraceCheckUtils]: 119: Hoare triple {48069#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,547 INFO L290 TraceCheckUtils]: 120: Hoare triple {48069#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,547 INFO L290 TraceCheckUtils]: 121: Hoare triple {48069#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,548 INFO L290 TraceCheckUtils]: 122: Hoare triple {48069#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,548 INFO L290 TraceCheckUtils]: 123: Hoare triple {48069#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,548 INFO L290 TraceCheckUtils]: 124: Hoare triple {48069#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,548 INFO L290 TraceCheckUtils]: 125: Hoare triple {48069#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {48069#false} is VALID [2022-04-08 08:44:19,548 INFO L290 TraceCheckUtils]: 126: Hoare triple {48069#false} assume 8640 == #t~mem75;havoc #t~mem75; {48069#false} is VALID [2022-04-08 08:44:19,548 INFO L290 TraceCheckUtils]: 127: Hoare triple {48069#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {48069#false} is VALID [2022-04-08 08:44:19,548 INFO L290 TraceCheckUtils]: 128: Hoare triple {48069#false} assume !(4 == ~blastFlag~0); {48069#false} is VALID [2022-04-08 08:44:19,548 INFO L290 TraceCheckUtils]: 129: Hoare triple {48069#false} assume !(7 == ~blastFlag~0); {48069#false} is VALID [2022-04-08 08:44:19,548 INFO L290 TraceCheckUtils]: 130: Hoare triple {48069#false} assume !false; {48069#false} is VALID [2022-04-08 08:44:19,549 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-08 08:44:19,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:44:19,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203455025] [2022-04-08 08:44:19,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203455025] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:19,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:19,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:19,549 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:44:19,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [132944546] [2022-04-08 08:44:19,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [132944546] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:19,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:19,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:19,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569972469] [2022-04-08 08:44:19,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:44:19,550 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-08 08:44:19,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:44:19,551 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-08 08:44:19,640 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-08 08:44:19,641 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:44:19,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:19,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:44:19,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:44:19,641 INFO L87 Difference]: Start difference. First operand 381 states and 580 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-08 08:44:21,246 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-08 08:44:22,885 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:24,889 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-08 08:44:27,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:27,529 INFO L93 Difference]: Finished difference Result 851 states and 1299 transitions. [2022-04-08 08:44:27,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:44:27,529 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-08 08:44:27,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:44:27,529 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-08 08:44:27,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 582 transitions. [2022-04-08 08:44:27,532 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-08 08:44:27,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 582 transitions. [2022-04-08 08:44:27,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 582 transitions. [2022-04-08 08:44:27,927 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-08 08:44:27,937 INFO L225 Difference]: With dead ends: 851 [2022-04-08 08:44:27,938 INFO L226 Difference]: Without dead ends: 496 [2022-04-08 08:44:27,938 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-08 08:44:27,939 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 108 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:44:27,939 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 345 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 471 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2022-04-08 08:44:27,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-04-08 08:44:27,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 424. [2022-04-08 08:44:27,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:44:27,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 496 states. Second operand has 424 states, 419 states have (on average 1.5369928400954653) internal successors, (644), 419 states have internal predecessors, (644), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:27,977 INFO L74 IsIncluded]: Start isIncluded. First operand 496 states. Second operand has 424 states, 419 states have (on average 1.5369928400954653) internal successors, (644), 419 states have internal predecessors, (644), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:27,978 INFO L87 Difference]: Start difference. First operand 496 states. Second operand has 424 states, 419 states have (on average 1.5369928400954653) internal successors, (644), 419 states have internal predecessors, (644), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:27,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:27,990 INFO L93 Difference]: Finished difference Result 496 states and 747 transitions. [2022-04-08 08:44:27,990 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 747 transitions. [2022-04-08 08:44:27,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:27,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:27,991 INFO L74 IsIncluded]: Start isIncluded. First operand has 424 states, 419 states have (on average 1.5369928400954653) internal successors, (644), 419 states have internal predecessors, (644), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 496 states. [2022-04-08 08:44:27,992 INFO L87 Difference]: Start difference. First operand has 424 states, 419 states have (on average 1.5369928400954653) internal successors, (644), 419 states have internal predecessors, (644), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 496 states. [2022-04-08 08:44:28,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:28,004 INFO L93 Difference]: Finished difference Result 496 states and 747 transitions. [2022-04-08 08:44:28,004 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 747 transitions. [2022-04-08 08:44:28,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:28,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:28,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:44:28,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:44:28,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 419 states have (on average 1.5369928400954653) internal successors, (644), 419 states have internal predecessors, (644), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:28,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 648 transitions. [2022-04-08 08:44:28,017 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 648 transitions. Word has length 131 [2022-04-08 08:44:28,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:44:28,017 INFO L478 AbstractCegarLoop]: Abstraction has 424 states and 648 transitions. [2022-04-08 08:44:28,018 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-08 08:44:28,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 424 states and 648 transitions. [2022-04-08 08:44:28,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 648 edges. 648 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:28,717 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 648 transitions. [2022-04-08 08:44:28,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-08 08:44:28,718 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:44:28,718 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-08 08:44:28,718 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-08 08:44:28,718 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:44:28,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:44:28,719 INFO L85 PathProgramCache]: Analyzing trace with hash 277184191, now seen corresponding path program 1 times [2022-04-08 08:44:28,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:28,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [85083237] [2022-04-08 08:44:28,813 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:44:28,813 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:44:28,813 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:44:28,813 INFO L85 PathProgramCache]: Analyzing trace with hash 277184191, now seen corresponding path program 2 times [2022-04-08 08:44:28,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:44:28,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977966280] [2022-04-08 08:44:28,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:44:28,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:44:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:28,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:44:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:28,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {51629#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {51622#true} is VALID [2022-04-08 08:44:28,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {51622#true} assume true; {51622#true} is VALID [2022-04-08 08:44:28,965 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51622#true} {51622#true} #688#return; {51622#true} is VALID [2022-04-08 08:44:28,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {51622#true} call ULTIMATE.init(); {51629#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-08 08:44:28,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {51629#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {51622#true} is VALID [2022-04-08 08:44:28,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {51622#true} assume true; {51622#true} is VALID [2022-04-08 08:44:28,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51622#true} {51622#true} #688#return; {51622#true} is VALID [2022-04-08 08:44:28,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {51622#true} call #t~ret161 := main(); {51622#true} is VALID [2022-04-08 08:44:28,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {51622#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; {51622#true} is VALID [2022-04-08 08:44:28,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {51622#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {51622#true} is VALID [2022-04-08 08:44:28,967 INFO L272 TraceCheckUtils]: 7: Hoare triple {51622#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {51622#true} is VALID [2022-04-08 08:44:28,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {51622#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); {51622#true} is VALID [2022-04-08 08:44:28,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {51622#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; {51622#true} is VALID [2022-04-08 08:44:28,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {51622#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; {51622#true} is VALID [2022-04-08 08:44:28,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {51622#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {51622#true} is VALID [2022-04-08 08:44:28,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {51622#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {51622#true} is VALID [2022-04-08 08:44:28,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {51622#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {51622#true} is VALID [2022-04-08 08:44:28,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {51622#true} assume !false; {51622#true} is VALID [2022-04-08 08:44:28,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {51622#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); {51622#true} is VALID [2022-04-08 08:44:28,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {51622#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {51622#true} is VALID [2022-04-08 08:44:28,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {51622#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {51622#true} is VALID [2022-04-08 08:44:28,968 INFO L290 TraceCheckUtils]: 18: Hoare triple {51622#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {51622#true} is VALID [2022-04-08 08:44:28,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {51622#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {51622#true} is VALID [2022-04-08 08:44:28,968 INFO L290 TraceCheckUtils]: 20: Hoare triple {51622#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {51622#true} is VALID [2022-04-08 08:44:28,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {51622#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {51622#true} is VALID [2022-04-08 08:44:28,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {51622#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {51622#true} is VALID [2022-04-08 08:44:28,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {51622#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {51622#true} is VALID [2022-04-08 08:44:28,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {51622#true} assume 8464 == #t~mem55;havoc #t~mem55; {51622#true} is VALID [2022-04-08 08:44:28,969 INFO L290 TraceCheckUtils]: 25: Hoare triple {51622#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; {51622#true} is VALID [2022-04-08 08:44:28,969 INFO L290 TraceCheckUtils]: 26: Hoare triple {51622#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {51622#true} is VALID [2022-04-08 08:44:28,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {51622#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); {51622#true} is VALID [2022-04-08 08:44:28,969 INFO L290 TraceCheckUtils]: 28: Hoare triple {51622#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); {51622#true} is VALID [2022-04-08 08:44:28,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {51622#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {51622#true} is VALID [2022-04-08 08:44:28,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {51622#true} ~skip~0 := 0; {51622#true} is VALID [2022-04-08 08:44:28,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {51622#true} assume !false; {51622#true} is VALID [2022-04-08 08:44:28,969 INFO L290 TraceCheckUtils]: 32: Hoare triple {51622#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); {51622#true} is VALID [2022-04-08 08:44:28,969 INFO L290 TraceCheckUtils]: 33: Hoare triple {51622#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {51622#true} is VALID [2022-04-08 08:44:28,969 INFO L290 TraceCheckUtils]: 34: Hoare triple {51622#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {51622#true} is VALID [2022-04-08 08:44:28,969 INFO L290 TraceCheckUtils]: 35: Hoare triple {51622#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {51622#true} is VALID [2022-04-08 08:44:28,970 INFO L290 TraceCheckUtils]: 36: Hoare triple {51622#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {51622#true} is VALID [2022-04-08 08:44:28,970 INFO L290 TraceCheckUtils]: 37: Hoare triple {51622#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {51622#true} is VALID [2022-04-08 08:44:28,970 INFO L290 TraceCheckUtils]: 38: Hoare triple {51622#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {51622#true} is VALID [2022-04-08 08:44:28,970 INFO L290 TraceCheckUtils]: 39: Hoare triple {51622#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {51622#true} is VALID [2022-04-08 08:44:28,970 INFO L290 TraceCheckUtils]: 40: Hoare triple {51622#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {51622#true} is VALID [2022-04-08 08:44:28,970 INFO L290 TraceCheckUtils]: 41: Hoare triple {51622#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {51622#true} is VALID [2022-04-08 08:44:28,970 INFO L290 TraceCheckUtils]: 42: Hoare triple {51622#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {51622#true} is VALID [2022-04-08 08:44:28,970 INFO L290 TraceCheckUtils]: 43: Hoare triple {51622#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {51622#true} is VALID [2022-04-08 08:44:28,970 INFO L290 TraceCheckUtils]: 44: Hoare triple {51622#true} assume 8496 == #t~mem58;havoc #t~mem58; {51622#true} is VALID [2022-04-08 08:44:28,970 INFO L290 TraceCheckUtils]: 45: Hoare triple {51622#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {51622#true} is VALID [2022-04-08 08:44:28,970 INFO L290 TraceCheckUtils]: 46: Hoare triple {51622#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {51622#true} is VALID [2022-04-08 08:44:28,971 INFO L290 TraceCheckUtils]: 47: Hoare triple {51622#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {51622#true} is VALID [2022-04-08 08:44:28,971 INFO L290 TraceCheckUtils]: 48: Hoare triple {51622#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,972 INFO L290 TraceCheckUtils]: 49: Hoare triple {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,972 INFO L290 TraceCheckUtils]: 50: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,973 INFO L290 TraceCheckUtils]: 51: Hoare triple {51627#(= 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; {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,973 INFO L290 TraceCheckUtils]: 52: Hoare triple {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,974 INFO L290 TraceCheckUtils]: 53: Hoare triple {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,974 INFO L290 TraceCheckUtils]: 54: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,974 INFO L290 TraceCheckUtils]: 55: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,975 INFO L290 TraceCheckUtils]: 56: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,975 INFO L290 TraceCheckUtils]: 57: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,976 INFO L290 TraceCheckUtils]: 58: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,976 INFO L290 TraceCheckUtils]: 59: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,976 INFO L290 TraceCheckUtils]: 60: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,977 INFO L290 TraceCheckUtils]: 61: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,977 INFO L290 TraceCheckUtils]: 62: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,978 INFO L290 TraceCheckUtils]: 63: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,978 INFO L290 TraceCheckUtils]: 64: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,978 INFO L290 TraceCheckUtils]: 65: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,979 INFO L290 TraceCheckUtils]: 66: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,979 INFO L290 TraceCheckUtils]: 67: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,980 INFO L290 TraceCheckUtils]: 68: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,980 INFO L290 TraceCheckUtils]: 69: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,981 INFO L290 TraceCheckUtils]: 70: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,981 INFO L290 TraceCheckUtils]: 71: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,981 INFO L290 TraceCheckUtils]: 72: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,982 INFO L290 TraceCheckUtils]: 73: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,982 INFO L290 TraceCheckUtils]: 74: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,983 INFO L290 TraceCheckUtils]: 75: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,983 INFO L290 TraceCheckUtils]: 76: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,983 INFO L290 TraceCheckUtils]: 77: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,984 INFO L290 TraceCheckUtils]: 78: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,984 INFO L290 TraceCheckUtils]: 79: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,985 INFO L290 TraceCheckUtils]: 80: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,985 INFO L290 TraceCheckUtils]: 81: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,986 INFO L290 TraceCheckUtils]: 82: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,986 INFO L290 TraceCheckUtils]: 83: Hoare triple {51627#(= 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); {51627#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:28,986 INFO L290 TraceCheckUtils]: 84: Hoare triple {51627#(= 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); {51628#(= |ssl3_accept_#t~mem77| 8656)} is VALID [2022-04-08 08:44:28,987 INFO L290 TraceCheckUtils]: 85: Hoare triple {51628#(= |ssl3_accept_#t~mem77| 8656)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,987 INFO L290 TraceCheckUtils]: 86: Hoare triple {51623#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,987 INFO L290 TraceCheckUtils]: 87: Hoare triple {51623#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,987 INFO L290 TraceCheckUtils]: 88: Hoare triple {51623#false} assume 8673 == #t~mem80;havoc #t~mem80; {51623#false} is VALID [2022-04-08 08:44:28,987 INFO L290 TraceCheckUtils]: 89: Hoare triple {51623#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {51623#false} is VALID [2022-04-08 08:44:28,987 INFO L290 TraceCheckUtils]: 90: Hoare triple {51623#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {51623#false} is VALID [2022-04-08 08:44:28,987 INFO L290 TraceCheckUtils]: 91: Hoare triple {51623#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); {51623#false} is VALID [2022-04-08 08:44:28,988 INFO L290 TraceCheckUtils]: 92: Hoare triple {51623#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; {51623#false} is VALID [2022-04-08 08:44:28,988 INFO L290 TraceCheckUtils]: 93: Hoare triple {51623#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,988 INFO L290 TraceCheckUtils]: 94: Hoare triple {51623#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); {51623#false} is VALID [2022-04-08 08:44:28,988 INFO L290 TraceCheckUtils]: 95: Hoare triple {51623#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {51623#false} is VALID [2022-04-08 08:44:28,988 INFO L290 TraceCheckUtils]: 96: Hoare triple {51623#false} ~skip~0 := 0; {51623#false} is VALID [2022-04-08 08:44:28,988 INFO L290 TraceCheckUtils]: 97: Hoare triple {51623#false} assume !false; {51623#false} is VALID [2022-04-08 08:44:28,988 INFO L290 TraceCheckUtils]: 98: Hoare triple {51623#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); {51623#false} is VALID [2022-04-08 08:44:28,988 INFO L290 TraceCheckUtils]: 99: Hoare triple {51623#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,988 INFO L290 TraceCheckUtils]: 100: Hoare triple {51623#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,988 INFO L290 TraceCheckUtils]: 101: Hoare triple {51623#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,988 INFO L290 TraceCheckUtils]: 102: Hoare triple {51623#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,989 INFO L290 TraceCheckUtils]: 103: Hoare triple {51623#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,989 INFO L290 TraceCheckUtils]: 104: Hoare triple {51623#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,989 INFO L290 TraceCheckUtils]: 105: Hoare triple {51623#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,989 INFO L290 TraceCheckUtils]: 106: Hoare triple {51623#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,989 INFO L290 TraceCheckUtils]: 107: Hoare triple {51623#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,989 INFO L290 TraceCheckUtils]: 108: Hoare triple {51623#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,989 INFO L290 TraceCheckUtils]: 109: Hoare triple {51623#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,989 INFO L290 TraceCheckUtils]: 110: Hoare triple {51623#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,989 INFO L290 TraceCheckUtils]: 111: Hoare triple {51623#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,989 INFO L290 TraceCheckUtils]: 112: Hoare triple {51623#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,989 INFO L290 TraceCheckUtils]: 113: Hoare triple {51623#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,990 INFO L290 TraceCheckUtils]: 114: Hoare triple {51623#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,990 INFO L290 TraceCheckUtils]: 115: Hoare triple {51623#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,990 INFO L290 TraceCheckUtils]: 116: Hoare triple {51623#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,990 INFO L290 TraceCheckUtils]: 117: Hoare triple {51623#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,990 INFO L290 TraceCheckUtils]: 118: Hoare triple {51623#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,990 INFO L290 TraceCheckUtils]: 119: Hoare triple {51623#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,990 INFO L290 TraceCheckUtils]: 120: Hoare triple {51623#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,990 INFO L290 TraceCheckUtils]: 121: Hoare triple {51623#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,990 INFO L290 TraceCheckUtils]: 122: Hoare triple {51623#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,990 INFO L290 TraceCheckUtils]: 123: Hoare triple {51623#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,990 INFO L290 TraceCheckUtils]: 124: Hoare triple {51623#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,990 INFO L290 TraceCheckUtils]: 125: Hoare triple {51623#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,991 INFO L290 TraceCheckUtils]: 126: Hoare triple {51623#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {51623#false} is VALID [2022-04-08 08:44:28,991 INFO L290 TraceCheckUtils]: 127: Hoare triple {51623#false} assume 8640 == #t~mem75;havoc #t~mem75; {51623#false} is VALID [2022-04-08 08:44:28,991 INFO L290 TraceCheckUtils]: 128: Hoare triple {51623#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {51623#false} is VALID [2022-04-08 08:44:28,991 INFO L290 TraceCheckUtils]: 129: Hoare triple {51623#false} assume !(4 == ~blastFlag~0); {51623#false} is VALID [2022-04-08 08:44:28,991 INFO L290 TraceCheckUtils]: 130: Hoare triple {51623#false} assume !(7 == ~blastFlag~0); {51623#false} is VALID [2022-04-08 08:44:28,991 INFO L290 TraceCheckUtils]: 131: Hoare triple {51623#false} assume !false; {51623#false} is VALID [2022-04-08 08:44:28,992 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-08 08:44:28,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:44:28,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977966280] [2022-04-08 08:44:28,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977966280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:28,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:28,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:28,993 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:44:28,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [85083237] [2022-04-08 08:44:28,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [85083237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:28,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:28,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:28,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120243631] [2022-04-08 08:44:28,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:44:28,996 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-08 08:44:28,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:44:28,996 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-08 08:44:29,084 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-08 08:44:29,085 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:44:29,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:29,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:44:29,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:44:29,085 INFO L87 Difference]: Start difference. First operand 424 states and 648 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-08 08:44:36,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:36,067 INFO L93 Difference]: Finished difference Result 905 states and 1388 transitions. [2022-04-08 08:44:36,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:44:36,067 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-08 08:44:36,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:44:36,067 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-08 08:44:36,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 531 transitions. [2022-04-08 08:44:36,070 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-08 08:44:36,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 531 transitions. [2022-04-08 08:44:36,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 531 transitions. [2022-04-08 08:44:36,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 531 edges. 531 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:36,433 INFO L225 Difference]: With dead ends: 905 [2022-04-08 08:44:36,433 INFO L226 Difference]: Without dead ends: 507 [2022-04-08 08:44:36,434 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-08 08:44:36,434 INFO L913 BasicCegarLoop]: 182 mSDtfsCounter, 60 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:44:36,434 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 479 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-08 08:44:36,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-04-08 08:44:36,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 467. [2022-04-08 08:44:36,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:44:36,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 507 states. Second operand has 467 states, 462 states have (on average 1.5367965367965368) internal successors, (710), 462 states have internal predecessors, (710), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:36,476 INFO L74 IsIncluded]: Start isIncluded. First operand 507 states. Second operand has 467 states, 462 states have (on average 1.5367965367965368) internal successors, (710), 462 states have internal predecessors, (710), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:36,477 INFO L87 Difference]: Start difference. First operand 507 states. Second operand has 467 states, 462 states have (on average 1.5367965367965368) internal successors, (710), 462 states have internal predecessors, (710), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:36,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:36,489 INFO L93 Difference]: Finished difference Result 507 states and 768 transitions. [2022-04-08 08:44:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 768 transitions. [2022-04-08 08:44:36,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:36,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:36,491 INFO L74 IsIncluded]: Start isIncluded. First operand has 467 states, 462 states have (on average 1.5367965367965368) internal successors, (710), 462 states have internal predecessors, (710), 3 states have call successors, (3), 3 states 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-08 08:44:36,491 INFO L87 Difference]: Start difference. First operand has 467 states, 462 states have (on average 1.5367965367965368) internal successors, (710), 462 states have internal predecessors, (710), 3 states have call successors, (3), 3 states 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-08 08:44:36,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:36,503 INFO L93 Difference]: Finished difference Result 507 states and 768 transitions. [2022-04-08 08:44:36,503 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 768 transitions. [2022-04-08 08:44:36,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:36,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:36,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:44:36,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:44:36,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 462 states have (on average 1.5367965367965368) internal successors, (710), 462 states have internal predecessors, (710), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 714 transitions. [2022-04-08 08:44:36,519 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 714 transitions. Word has length 132 [2022-04-08 08:44:36,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:44:36,520 INFO L478 AbstractCegarLoop]: Abstraction has 467 states and 714 transitions. [2022-04-08 08:44:36,520 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-08 08:44:36,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 467 states and 714 transitions. [2022-04-08 08:44:37,256 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-08 08:44:37,256 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 714 transitions. [2022-04-08 08:44:37,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-08 08:44:37,257 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:44:37,257 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-08 08:44:37,257 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-08 08:44:37,258 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:44:37,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:44:37,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1601946755, now seen corresponding path program 1 times [2022-04-08 08:44:37,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:37,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [683882989] [2022-04-08 08:44:37,340 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:44:37,340 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:44:37,340 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:44:37,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1601946755, now seen corresponding path program 2 times [2022-04-08 08:44:37,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:44:37,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236673828] [2022-04-08 08:44:37,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:44:37,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:44:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:37,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:44:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:37,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {55399#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {55392#true} is VALID [2022-04-08 08:44:37,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {55392#true} assume true; {55392#true} is VALID [2022-04-08 08:44:37,472 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55392#true} {55392#true} #688#return; {55392#true} is VALID [2022-04-08 08:44:37,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {55392#true} call ULTIMATE.init(); {55399#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-08 08:44:37,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {55399#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {55392#true} is VALID [2022-04-08 08:44:37,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {55392#true} assume true; {55392#true} is VALID [2022-04-08 08:44:37,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55392#true} {55392#true} #688#return; {55392#true} is VALID [2022-04-08 08:44:37,473 INFO L272 TraceCheckUtils]: 4: Hoare triple {55392#true} call #t~ret161 := main(); {55392#true} is VALID [2022-04-08 08:44:37,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {55392#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; {55392#true} is VALID [2022-04-08 08:44:37,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {55392#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {55392#true} is VALID [2022-04-08 08:44:37,474 INFO L272 TraceCheckUtils]: 7: Hoare triple {55392#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {55392#true} is VALID [2022-04-08 08:44:37,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {55392#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); {55392#true} is VALID [2022-04-08 08:44:37,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {55392#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; {55392#true} is VALID [2022-04-08 08:44:37,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {55392#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; {55392#true} is VALID [2022-04-08 08:44:37,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {55392#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {55392#true} is VALID [2022-04-08 08:44:37,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {55392#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {55392#true} is VALID [2022-04-08 08:44:37,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {55392#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {55392#true} is VALID [2022-04-08 08:44:37,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {55392#true} assume !false; {55392#true} is VALID [2022-04-08 08:44:37,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {55392#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); {55392#true} is VALID [2022-04-08 08:44:37,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {55392#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {55392#true} is VALID [2022-04-08 08:44:37,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {55392#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {55392#true} is VALID [2022-04-08 08:44:37,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {55392#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {55392#true} is VALID [2022-04-08 08:44:37,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {55392#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {55392#true} is VALID [2022-04-08 08:44:37,475 INFO L290 TraceCheckUtils]: 20: Hoare triple {55392#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {55392#true} is VALID [2022-04-08 08:44:37,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {55392#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {55392#true} is VALID [2022-04-08 08:44:37,475 INFO L290 TraceCheckUtils]: 22: Hoare triple {55392#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {55392#true} is VALID [2022-04-08 08:44:37,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {55392#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {55392#true} is VALID [2022-04-08 08:44:37,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {55392#true} assume 8464 == #t~mem55;havoc #t~mem55; {55392#true} is VALID [2022-04-08 08:44:37,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {55392#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; {55392#true} is VALID [2022-04-08 08:44:37,476 INFO L290 TraceCheckUtils]: 26: Hoare triple {55392#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {55392#true} is VALID [2022-04-08 08:44:37,476 INFO L290 TraceCheckUtils]: 27: Hoare triple {55392#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); {55392#true} is VALID [2022-04-08 08:44:37,476 INFO L290 TraceCheckUtils]: 28: Hoare triple {55392#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); {55392#true} is VALID [2022-04-08 08:44:37,476 INFO L290 TraceCheckUtils]: 29: Hoare triple {55392#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {55392#true} is VALID [2022-04-08 08:44:37,476 INFO L290 TraceCheckUtils]: 30: Hoare triple {55392#true} ~skip~0 := 0; {55392#true} is VALID [2022-04-08 08:44:37,476 INFO L290 TraceCheckUtils]: 31: Hoare triple {55392#true} assume !false; {55392#true} is VALID [2022-04-08 08:44:37,476 INFO L290 TraceCheckUtils]: 32: Hoare triple {55392#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); {55392#true} is VALID [2022-04-08 08:44:37,476 INFO L290 TraceCheckUtils]: 33: Hoare triple {55392#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {55392#true} is VALID [2022-04-08 08:44:37,476 INFO L290 TraceCheckUtils]: 34: Hoare triple {55392#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {55392#true} is VALID [2022-04-08 08:44:37,477 INFO L290 TraceCheckUtils]: 35: Hoare triple {55392#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {55392#true} is VALID [2022-04-08 08:44:37,477 INFO L290 TraceCheckUtils]: 36: Hoare triple {55392#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {55392#true} is VALID [2022-04-08 08:44:37,477 INFO L290 TraceCheckUtils]: 37: Hoare triple {55392#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {55392#true} is VALID [2022-04-08 08:44:37,477 INFO L290 TraceCheckUtils]: 38: Hoare triple {55392#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {55392#true} is VALID [2022-04-08 08:44:37,477 INFO L290 TraceCheckUtils]: 39: Hoare triple {55392#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {55392#true} is VALID [2022-04-08 08:44:37,477 INFO L290 TraceCheckUtils]: 40: Hoare triple {55392#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {55392#true} is VALID [2022-04-08 08:44:37,477 INFO L290 TraceCheckUtils]: 41: Hoare triple {55392#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {55392#true} is VALID [2022-04-08 08:44:37,477 INFO L290 TraceCheckUtils]: 42: Hoare triple {55392#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {55392#true} is VALID [2022-04-08 08:44:37,477 INFO L290 TraceCheckUtils]: 43: Hoare triple {55392#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {55392#true} is VALID [2022-04-08 08:44:37,477 INFO L290 TraceCheckUtils]: 44: Hoare triple {55392#true} assume 8496 == #t~mem58;havoc #t~mem58; {55392#true} is VALID [2022-04-08 08:44:37,478 INFO L290 TraceCheckUtils]: 45: Hoare triple {55392#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {55392#true} is VALID [2022-04-08 08:44:37,478 INFO L290 TraceCheckUtils]: 46: Hoare triple {55392#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {55392#true} is VALID [2022-04-08 08:44:37,478 INFO L290 TraceCheckUtils]: 47: Hoare triple {55392#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {55392#true} is VALID [2022-04-08 08:44:37,479 INFO L290 TraceCheckUtils]: 48: Hoare triple {55392#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:44:37,479 INFO L290 TraceCheckUtils]: 49: Hoare triple {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:44:37,480 INFO L290 TraceCheckUtils]: 50: Hoare triple {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:44:37,480 INFO L290 TraceCheckUtils]: 51: Hoare triple {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:44:37,480 INFO L290 TraceCheckUtils]: 52: Hoare triple {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} ~skip~0 := 0; {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:44:37,481 INFO L290 TraceCheckUtils]: 53: Hoare triple {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !false; {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:44:37,481 INFO L290 TraceCheckUtils]: 54: Hoare triple {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:44:37,482 INFO L290 TraceCheckUtils]: 55: Hoare triple {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:44:37,482 INFO L290 TraceCheckUtils]: 56: Hoare triple {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:44:37,482 INFO L290 TraceCheckUtils]: 57: Hoare triple {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:44:37,483 INFO L290 TraceCheckUtils]: 58: Hoare triple {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:44:37,483 INFO L290 TraceCheckUtils]: 59: Hoare triple {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:44:37,484 INFO L290 TraceCheckUtils]: 60: Hoare triple {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:44:37,484 INFO L290 TraceCheckUtils]: 61: Hoare triple {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:44:37,484 INFO L290 TraceCheckUtils]: 62: Hoare triple {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:44:37,485 INFO L290 TraceCheckUtils]: 63: Hoare triple {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:44:37,485 INFO L290 TraceCheckUtils]: 64: Hoare triple {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:44:37,486 INFO L290 TraceCheckUtils]: 65: Hoare triple {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:44:37,486 INFO L290 TraceCheckUtils]: 66: Hoare triple {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:44:37,487 INFO L290 TraceCheckUtils]: 67: Hoare triple {55397#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {55398#(= |ssl3_accept_#t~mem60| 8512)} is VALID [2022-04-08 08:44:37,488 INFO L290 TraceCheckUtils]: 68: Hoare triple {55398#(= |ssl3_accept_#t~mem60| 8512)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,489 INFO L290 TraceCheckUtils]: 69: Hoare triple {55393#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,490 INFO L290 TraceCheckUtils]: 70: Hoare triple {55393#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,490 INFO L290 TraceCheckUtils]: 71: Hoare triple {55393#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,491 INFO L290 TraceCheckUtils]: 72: Hoare triple {55393#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,491 INFO L290 TraceCheckUtils]: 73: Hoare triple {55393#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,491 INFO L290 TraceCheckUtils]: 74: Hoare triple {55393#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,491 INFO L290 TraceCheckUtils]: 75: Hoare triple {55393#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,491 INFO L290 TraceCheckUtils]: 76: Hoare triple {55393#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,491 INFO L290 TraceCheckUtils]: 77: Hoare triple {55393#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,492 INFO L290 TraceCheckUtils]: 78: Hoare triple {55393#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,492 INFO L290 TraceCheckUtils]: 79: Hoare triple {55393#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,492 INFO L290 TraceCheckUtils]: 80: Hoare triple {55393#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,492 INFO L290 TraceCheckUtils]: 81: Hoare triple {55393#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,492 INFO L290 TraceCheckUtils]: 82: Hoare triple {55393#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,492 INFO L290 TraceCheckUtils]: 83: Hoare triple {55393#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,492 INFO L290 TraceCheckUtils]: 84: Hoare triple {55393#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,493 INFO L290 TraceCheckUtils]: 85: Hoare triple {55393#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,493 INFO L290 TraceCheckUtils]: 86: Hoare triple {55393#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,493 INFO L290 TraceCheckUtils]: 87: Hoare triple {55393#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,493 INFO L290 TraceCheckUtils]: 88: Hoare triple {55393#false} assume 8673 == #t~mem80;havoc #t~mem80; {55393#false} is VALID [2022-04-08 08:44:37,493 INFO L290 TraceCheckUtils]: 89: Hoare triple {55393#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {55393#false} is VALID [2022-04-08 08:44:37,493 INFO L290 TraceCheckUtils]: 90: Hoare triple {55393#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {55393#false} is VALID [2022-04-08 08:44:37,493 INFO L290 TraceCheckUtils]: 91: Hoare triple {55393#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); {55393#false} is VALID [2022-04-08 08:44:37,493 INFO L290 TraceCheckUtils]: 92: Hoare triple {55393#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; {55393#false} is VALID [2022-04-08 08:44:37,493 INFO L290 TraceCheckUtils]: 93: Hoare triple {55393#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,493 INFO L290 TraceCheckUtils]: 94: Hoare triple {55393#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); {55393#false} is VALID [2022-04-08 08:44:37,494 INFO L290 TraceCheckUtils]: 95: Hoare triple {55393#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {55393#false} is VALID [2022-04-08 08:44:37,494 INFO L290 TraceCheckUtils]: 96: Hoare triple {55393#false} ~skip~0 := 0; {55393#false} is VALID [2022-04-08 08:44:37,494 INFO L290 TraceCheckUtils]: 97: Hoare triple {55393#false} assume !false; {55393#false} is VALID [2022-04-08 08:44:37,494 INFO L290 TraceCheckUtils]: 98: Hoare triple {55393#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); {55393#false} is VALID [2022-04-08 08:44:37,494 INFO L290 TraceCheckUtils]: 99: Hoare triple {55393#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,494 INFO L290 TraceCheckUtils]: 100: Hoare triple {55393#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,494 INFO L290 TraceCheckUtils]: 101: Hoare triple {55393#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,494 INFO L290 TraceCheckUtils]: 102: Hoare triple {55393#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,494 INFO L290 TraceCheckUtils]: 103: Hoare triple {55393#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,494 INFO L290 TraceCheckUtils]: 104: Hoare triple {55393#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,495 INFO L290 TraceCheckUtils]: 105: Hoare triple {55393#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,495 INFO L290 TraceCheckUtils]: 106: Hoare triple {55393#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,495 INFO L290 TraceCheckUtils]: 107: Hoare triple {55393#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,495 INFO L290 TraceCheckUtils]: 108: Hoare triple {55393#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,495 INFO L290 TraceCheckUtils]: 109: Hoare triple {55393#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,495 INFO L290 TraceCheckUtils]: 110: Hoare triple {55393#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,495 INFO L290 TraceCheckUtils]: 111: Hoare triple {55393#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,495 INFO L290 TraceCheckUtils]: 112: Hoare triple {55393#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,495 INFO L290 TraceCheckUtils]: 113: Hoare triple {55393#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,495 INFO L290 TraceCheckUtils]: 114: Hoare triple {55393#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,496 INFO L290 TraceCheckUtils]: 115: Hoare triple {55393#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,496 INFO L290 TraceCheckUtils]: 116: Hoare triple {55393#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,496 INFO L290 TraceCheckUtils]: 117: Hoare triple {55393#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,496 INFO L290 TraceCheckUtils]: 118: Hoare triple {55393#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,496 INFO L290 TraceCheckUtils]: 119: Hoare triple {55393#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,496 INFO L290 TraceCheckUtils]: 120: Hoare triple {55393#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,496 INFO L290 TraceCheckUtils]: 121: Hoare triple {55393#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,496 INFO L290 TraceCheckUtils]: 122: Hoare triple {55393#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,496 INFO L290 TraceCheckUtils]: 123: Hoare triple {55393#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,497 INFO L290 TraceCheckUtils]: 124: Hoare triple {55393#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,497 INFO L290 TraceCheckUtils]: 125: Hoare triple {55393#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,497 INFO L290 TraceCheckUtils]: 126: Hoare triple {55393#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {55393#false} is VALID [2022-04-08 08:44:37,497 INFO L290 TraceCheckUtils]: 127: Hoare triple {55393#false} assume 8640 == #t~mem75;havoc #t~mem75; {55393#false} is VALID [2022-04-08 08:44:37,497 INFO L290 TraceCheckUtils]: 128: Hoare triple {55393#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {55393#false} is VALID [2022-04-08 08:44:37,497 INFO L290 TraceCheckUtils]: 129: Hoare triple {55393#false} assume !(4 == ~blastFlag~0); {55393#false} is VALID [2022-04-08 08:44:37,497 INFO L290 TraceCheckUtils]: 130: Hoare triple {55393#false} assume !(7 == ~blastFlag~0); {55393#false} is VALID [2022-04-08 08:44:37,497 INFO L290 TraceCheckUtils]: 131: Hoare triple {55393#false} assume !false; {55393#false} is VALID [2022-04-08 08:44:37,499 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-08 08:44:37,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:44:37,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236673828] [2022-04-08 08:44:37,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236673828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:37,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:37,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:37,500 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:44:37,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [683882989] [2022-04-08 08:44:37,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [683882989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:37,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:37,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:37,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404379373] [2022-04-08 08:44:37,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:44:37,502 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 132 [2022-04-08 08:44:37,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:44:37,502 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-08 08:44:37,572 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-08 08:44:37,573 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:44:37,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:37,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:44:37,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:44:37,573 INFO L87 Difference]: Start difference. First operand 467 states and 714 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-08 08:44:42,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:42,845 INFO L93 Difference]: Finished difference Result 953 states and 1463 transitions. [2022-04-08 08:44:42,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:44:42,846 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 132 [2022-04-08 08:44:42,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:44:42,846 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-08 08:44:42,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 08:44:42,848 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-08 08:44:42,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 08:44:42,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-08 08:44:43,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:43,165 INFO L225 Difference]: With dead ends: 953 [2022-04-08 08:44:43,165 INFO L226 Difference]: Without dead ends: 512 [2022-04-08 08:44:43,166 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-08 08:44:43,166 INFO L913 BasicCegarLoop]: 241 mSDtfsCounter, 33 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-08 08:44:43,166 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 595 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-08 08:44:43,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2022-04-08 08:44:43,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 491. [2022-04-08 08:44:43,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:44:43,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 512 states. Second operand has 491 states, 486 states have (on average 1.5329218106995885) internal successors, (745), 486 states have internal predecessors, (745), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:43,206 INFO L74 IsIncluded]: Start isIncluded. First operand 512 states. Second operand has 491 states, 486 states have (on average 1.5329218106995885) internal successors, (745), 486 states have internal predecessors, (745), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:43,206 INFO L87 Difference]: Start difference. First operand 512 states. Second operand has 491 states, 486 states have (on average 1.5329218106995885) internal successors, (745), 486 states have internal predecessors, (745), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:43,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:43,215 INFO L93 Difference]: Finished difference Result 512 states and 777 transitions. [2022-04-08 08:44:43,215 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 777 transitions. [2022-04-08 08:44:43,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:43,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:43,216 INFO L74 IsIncluded]: Start isIncluded. First operand has 491 states, 486 states have (on average 1.5329218106995885) internal successors, (745), 486 states have internal predecessors, (745), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 512 states. [2022-04-08 08:44:43,216 INFO L87 Difference]: Start difference. First operand has 491 states, 486 states have (on average 1.5329218106995885) internal successors, (745), 486 states have internal predecessors, (745), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 512 states. [2022-04-08 08:44:43,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:43,225 INFO L93 Difference]: Finished difference Result 512 states and 777 transitions. [2022-04-08 08:44:43,225 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 777 transitions. [2022-04-08 08:44:43,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:43,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:43,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:44:43,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:44:43,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 486 states have (on average 1.5329218106995885) internal successors, (745), 486 states have internal predecessors, (745), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 749 transitions. [2022-04-08 08:44:43,237 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 749 transitions. Word has length 132 [2022-04-08 08:44:43,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:44:43,237 INFO L478 AbstractCegarLoop]: Abstraction has 491 states and 749 transitions. [2022-04-08 08:44:43,237 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-08 08:44:43,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 491 states and 749 transitions. [2022-04-08 08:44:43,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 749 edges. 749 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:43,899 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 749 transitions. [2022-04-08 08:44:43,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-04-08 08:44:43,900 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:44:43,900 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-08 08:44:43,900 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-08 08:44:43,900 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:44:43,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:44:43,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1502995955, now seen corresponding path program 1 times [2022-04-08 08:44:43,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:43,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1028538996] [2022-04-08 08:44:44,009 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:44:44,010 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:44:44,010 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:44:44,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1502995955, now seen corresponding path program 2 times [2022-04-08 08:44:44,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:44:44,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787250182] [2022-04-08 08:44:44,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:44:44,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:44:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:44,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:44:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:44,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {59323#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {59316#true} is VALID [2022-04-08 08:44:44,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {59316#true} assume true; {59316#true} is VALID [2022-04-08 08:44:44,154 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59316#true} {59316#true} #688#return; {59316#true} is VALID [2022-04-08 08:44:44,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {59316#true} call ULTIMATE.init(); {59323#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-08 08:44:44,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {59323#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {59316#true} is VALID [2022-04-08 08:44:44,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {59316#true} assume true; {59316#true} is VALID [2022-04-08 08:44:44,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59316#true} {59316#true} #688#return; {59316#true} is VALID [2022-04-08 08:44:44,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {59316#true} call #t~ret161 := main(); {59316#true} is VALID [2022-04-08 08:44:44,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {59316#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; {59316#true} is VALID [2022-04-08 08:44:44,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {59316#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {59316#true} is VALID [2022-04-08 08:44:44,155 INFO L272 TraceCheckUtils]: 7: Hoare triple {59316#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {59316#true} is VALID [2022-04-08 08:44:44,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {59316#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); {59316#true} is VALID [2022-04-08 08:44:44,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {59316#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; {59316#true} is VALID [2022-04-08 08:44:44,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {59316#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; {59316#true} is VALID [2022-04-08 08:44:44,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {59316#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {59316#true} is VALID [2022-04-08 08:44:44,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {59316#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {59316#true} is VALID [2022-04-08 08:44:44,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {59316#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {59316#true} is VALID [2022-04-08 08:44:44,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {59316#true} assume !false; {59316#true} is VALID [2022-04-08 08:44:44,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {59316#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); {59316#true} is VALID [2022-04-08 08:44:44,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {59316#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59316#true} is VALID [2022-04-08 08:44:44,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {59316#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59316#true} is VALID [2022-04-08 08:44:44,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {59316#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59316#true} is VALID [2022-04-08 08:44:44,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {59316#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59316#true} is VALID [2022-04-08 08:44:44,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {59316#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59316#true} is VALID [2022-04-08 08:44:44,157 INFO L290 TraceCheckUtils]: 21: Hoare triple {59316#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59316#true} is VALID [2022-04-08 08:44:44,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {59316#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59316#true} is VALID [2022-04-08 08:44:44,157 INFO L290 TraceCheckUtils]: 23: Hoare triple {59316#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59316#true} is VALID [2022-04-08 08:44:44,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {59316#true} assume 8464 == #t~mem55;havoc #t~mem55; {59316#true} is VALID [2022-04-08 08:44:44,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {59316#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; {59316#true} is VALID [2022-04-08 08:44:44,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {59316#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {59316#true} is VALID [2022-04-08 08:44:44,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {59316#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); {59316#true} is VALID [2022-04-08 08:44:44,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {59316#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); {59316#true} is VALID [2022-04-08 08:44:44,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {59316#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {59316#true} is VALID [2022-04-08 08:44:44,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {59316#true} ~skip~0 := 0; {59316#true} is VALID [2022-04-08 08:44:44,158 INFO L290 TraceCheckUtils]: 31: Hoare triple {59316#true} assume !false; {59316#true} is VALID [2022-04-08 08:44:44,158 INFO L290 TraceCheckUtils]: 32: Hoare triple {59316#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); {59316#true} is VALID [2022-04-08 08:44:44,158 INFO L290 TraceCheckUtils]: 33: Hoare triple {59316#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59316#true} is VALID [2022-04-08 08:44:44,158 INFO L290 TraceCheckUtils]: 34: Hoare triple {59316#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59316#true} is VALID [2022-04-08 08:44:44,158 INFO L290 TraceCheckUtils]: 35: Hoare triple {59316#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59316#true} is VALID [2022-04-08 08:44:44,158 INFO L290 TraceCheckUtils]: 36: Hoare triple {59316#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59316#true} is VALID [2022-04-08 08:44:44,158 INFO L290 TraceCheckUtils]: 37: Hoare triple {59316#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59316#true} is VALID [2022-04-08 08:44:44,159 INFO L290 TraceCheckUtils]: 38: Hoare triple {59316#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59316#true} is VALID [2022-04-08 08:44:44,159 INFO L290 TraceCheckUtils]: 39: Hoare triple {59316#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59316#true} is VALID [2022-04-08 08:44:44,159 INFO L290 TraceCheckUtils]: 40: Hoare triple {59316#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59316#true} is VALID [2022-04-08 08:44:44,159 INFO L290 TraceCheckUtils]: 41: Hoare triple {59316#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59316#true} is VALID [2022-04-08 08:44:44,159 INFO L290 TraceCheckUtils]: 42: Hoare triple {59316#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59316#true} is VALID [2022-04-08 08:44:44,159 INFO L290 TraceCheckUtils]: 43: Hoare triple {59316#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {59316#true} is VALID [2022-04-08 08:44:44,159 INFO L290 TraceCheckUtils]: 44: Hoare triple {59316#true} assume 8496 == #t~mem58;havoc #t~mem58; {59316#true} is VALID [2022-04-08 08:44:44,159 INFO L290 TraceCheckUtils]: 45: Hoare triple {59316#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {59316#true} is VALID [2022-04-08 08:44:44,159 INFO L290 TraceCheckUtils]: 46: Hoare triple {59316#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {59316#true} is VALID [2022-04-08 08:44:44,159 INFO L290 TraceCheckUtils]: 47: Hoare triple {59316#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {59316#true} is VALID [2022-04-08 08:44:44,160 INFO L290 TraceCheckUtils]: 48: Hoare triple {59316#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {59321#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:44,161 INFO L290 TraceCheckUtils]: 49: Hoare triple {59321#(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); {59321#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:44,161 INFO L290 TraceCheckUtils]: 50: Hoare triple {59321#(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); {59321#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:44,162 INFO L290 TraceCheckUtils]: 51: Hoare triple {59321#(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; {59321#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:44,162 INFO L290 TraceCheckUtils]: 52: Hoare triple {59321#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {59321#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:44,163 INFO L290 TraceCheckUtils]: 53: Hoare triple {59321#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {59321#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:44,163 INFO L290 TraceCheckUtils]: 54: Hoare triple {59321#(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); {59321#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:44,163 INFO L290 TraceCheckUtils]: 55: Hoare triple {59321#(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); {59321#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:44,164 INFO L290 TraceCheckUtils]: 56: Hoare triple {59321#(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); {59321#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:44,164 INFO L290 TraceCheckUtils]: 57: Hoare triple {59321#(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); {59321#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:44,165 INFO L290 TraceCheckUtils]: 58: Hoare triple {59321#(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); {59321#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:44,165 INFO L290 TraceCheckUtils]: 59: Hoare triple {59321#(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); {59321#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:44,166 INFO L290 TraceCheckUtils]: 60: Hoare triple {59321#(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); {59321#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:44,166 INFO L290 TraceCheckUtils]: 61: Hoare triple {59321#(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); {59321#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:44,166 INFO L290 TraceCheckUtils]: 62: Hoare triple {59321#(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); {59321#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:44,167 INFO L290 TraceCheckUtils]: 63: Hoare triple {59321#(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); {59321#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:44,167 INFO L290 TraceCheckUtils]: 64: Hoare triple {59321#(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); {59321#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:44,168 INFO L290 TraceCheckUtils]: 65: Hoare triple {59321#(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); {59321#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:44,168 INFO L290 TraceCheckUtils]: 66: Hoare triple {59321#(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); {59321#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:44,168 INFO L290 TraceCheckUtils]: 67: Hoare triple {59321#(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); {59321#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:44,169 INFO L290 TraceCheckUtils]: 68: Hoare triple {59321#(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); {59321#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:44,169 INFO L290 TraceCheckUtils]: 69: Hoare triple {59321#(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); {59321#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:44,170 INFO L290 TraceCheckUtils]: 70: Hoare triple {59321#(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); {59321#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:44,170 INFO L290 TraceCheckUtils]: 71: Hoare triple {59321#(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); {59321#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:44,171 INFO L290 TraceCheckUtils]: 72: Hoare triple {59321#(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); {59321#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:44,171 INFO L290 TraceCheckUtils]: 73: Hoare triple {59321#(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); {59322#(not (= 8560 |ssl3_accept_#t~mem66|))} is VALID [2022-04-08 08:44:44,171 INFO L290 TraceCheckUtils]: 74: Hoare triple {59322#(not (= 8560 |ssl3_accept_#t~mem66|))} assume 8560 == #t~mem66;havoc #t~mem66; {59317#false} is VALID [2022-04-08 08:44:44,172 INFO L290 TraceCheckUtils]: 75: Hoare triple {59317#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {59317#false} is VALID [2022-04-08 08:44:44,172 INFO L290 TraceCheckUtils]: 76: Hoare triple {59317#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); {59317#false} is VALID [2022-04-08 08:44:44,172 INFO L290 TraceCheckUtils]: 77: Hoare triple {59317#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); {59317#false} is VALID [2022-04-08 08:44:44,172 INFO L290 TraceCheckUtils]: 78: Hoare triple {59317#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {59317#false} is VALID [2022-04-08 08:44:44,172 INFO L290 TraceCheckUtils]: 79: Hoare triple {59317#false} ~skip~0 := 0; {59317#false} is VALID [2022-04-08 08:44:44,172 INFO L290 TraceCheckUtils]: 80: Hoare triple {59317#false} assume !false; {59317#false} is VALID [2022-04-08 08:44:44,172 INFO L290 TraceCheckUtils]: 81: Hoare triple {59317#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); {59317#false} is VALID [2022-04-08 08:44:44,172 INFO L290 TraceCheckUtils]: 82: Hoare triple {59317#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,172 INFO L290 TraceCheckUtils]: 83: Hoare triple {59317#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,172 INFO L290 TraceCheckUtils]: 84: Hoare triple {59317#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,172 INFO L290 TraceCheckUtils]: 85: Hoare triple {59317#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,173 INFO L290 TraceCheckUtils]: 86: Hoare triple {59317#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,173 INFO L290 TraceCheckUtils]: 87: Hoare triple {59317#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,173 INFO L290 TraceCheckUtils]: 88: Hoare triple {59317#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,173 INFO L290 TraceCheckUtils]: 89: Hoare triple {59317#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,173 INFO L290 TraceCheckUtils]: 90: Hoare triple {59317#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,173 INFO L290 TraceCheckUtils]: 91: Hoare triple {59317#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,173 INFO L290 TraceCheckUtils]: 92: Hoare triple {59317#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,173 INFO L290 TraceCheckUtils]: 93: Hoare triple {59317#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,173 INFO L290 TraceCheckUtils]: 94: Hoare triple {59317#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,173 INFO L290 TraceCheckUtils]: 95: Hoare triple {59317#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,174 INFO L290 TraceCheckUtils]: 96: Hoare triple {59317#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,174 INFO L290 TraceCheckUtils]: 97: Hoare triple {59317#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,174 INFO L290 TraceCheckUtils]: 98: Hoare triple {59317#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,174 INFO L290 TraceCheckUtils]: 99: Hoare triple {59317#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,174 INFO L290 TraceCheckUtils]: 100: Hoare triple {59317#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,174 INFO L290 TraceCheckUtils]: 101: Hoare triple {59317#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,174 INFO L290 TraceCheckUtils]: 102: Hoare triple {59317#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,174 INFO L290 TraceCheckUtils]: 103: Hoare triple {59317#false} assume 8448 == #t~mem68;havoc #t~mem68; {59317#false} is VALID [2022-04-08 08:44:44,174 INFO L290 TraceCheckUtils]: 104: Hoare triple {59317#false} assume !(~num1~0 > 0); {59317#false} is VALID [2022-04-08 08:44:44,174 INFO L290 TraceCheckUtils]: 105: Hoare triple {59317#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; {59317#false} is VALID [2022-04-08 08:44:44,175 INFO L290 TraceCheckUtils]: 106: Hoare triple {59317#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); {59317#false} is VALID [2022-04-08 08:44:44,175 INFO L290 TraceCheckUtils]: 107: Hoare triple {59317#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {59317#false} is VALID [2022-04-08 08:44:44,175 INFO L290 TraceCheckUtils]: 108: Hoare triple {59317#false} ~skip~0 := 0; {59317#false} is VALID [2022-04-08 08:44:44,175 INFO L290 TraceCheckUtils]: 109: Hoare triple {59317#false} assume !false; {59317#false} is VALID [2022-04-08 08:44:44,175 INFO L290 TraceCheckUtils]: 110: Hoare triple {59317#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); {59317#false} is VALID [2022-04-08 08:44:44,175 INFO L290 TraceCheckUtils]: 111: Hoare triple {59317#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,175 INFO L290 TraceCheckUtils]: 112: Hoare triple {59317#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,175 INFO L290 TraceCheckUtils]: 113: Hoare triple {59317#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,175 INFO L290 TraceCheckUtils]: 114: Hoare triple {59317#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,176 INFO L290 TraceCheckUtils]: 115: Hoare triple {59317#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,176 INFO L290 TraceCheckUtils]: 116: Hoare triple {59317#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,176 INFO L290 TraceCheckUtils]: 117: Hoare triple {59317#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,176 INFO L290 TraceCheckUtils]: 118: Hoare triple {59317#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,176 INFO L290 TraceCheckUtils]: 119: Hoare triple {59317#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,176 INFO L290 TraceCheckUtils]: 120: Hoare triple {59317#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,176 INFO L290 TraceCheckUtils]: 121: Hoare triple {59317#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,176 INFO L290 TraceCheckUtils]: 122: Hoare triple {59317#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,176 INFO L290 TraceCheckUtils]: 123: Hoare triple {59317#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,176 INFO L290 TraceCheckUtils]: 124: Hoare triple {59317#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,177 INFO L290 TraceCheckUtils]: 125: Hoare triple {59317#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,177 INFO L290 TraceCheckUtils]: 126: Hoare triple {59317#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,177 INFO L290 TraceCheckUtils]: 127: Hoare triple {59317#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,177 INFO L290 TraceCheckUtils]: 128: Hoare triple {59317#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,177 INFO L290 TraceCheckUtils]: 129: Hoare triple {59317#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,177 INFO L290 TraceCheckUtils]: 130: Hoare triple {59317#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,177 INFO L290 TraceCheckUtils]: 131: Hoare triple {59317#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,177 INFO L290 TraceCheckUtils]: 132: Hoare triple {59317#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,177 INFO L290 TraceCheckUtils]: 133: Hoare triple {59317#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,177 INFO L290 TraceCheckUtils]: 134: Hoare triple {59317#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,178 INFO L290 TraceCheckUtils]: 135: Hoare triple {59317#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,178 INFO L290 TraceCheckUtils]: 136: Hoare triple {59317#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,178 INFO L290 TraceCheckUtils]: 137: Hoare triple {59317#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,178 INFO L290 TraceCheckUtils]: 138: Hoare triple {59317#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {59317#false} is VALID [2022-04-08 08:44:44,178 INFO L290 TraceCheckUtils]: 139: Hoare triple {59317#false} assume 8640 == #t~mem75;havoc #t~mem75; {59317#false} is VALID [2022-04-08 08:44:44,178 INFO L290 TraceCheckUtils]: 140: Hoare triple {59317#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {59317#false} is VALID [2022-04-08 08:44:44,178 INFO L290 TraceCheckUtils]: 141: Hoare triple {59317#false} assume !(4 == ~blastFlag~0); {59317#false} is VALID [2022-04-08 08:44:44,178 INFO L290 TraceCheckUtils]: 142: Hoare triple {59317#false} assume !(7 == ~blastFlag~0); {59317#false} is VALID [2022-04-08 08:44:44,178 INFO L290 TraceCheckUtils]: 143: Hoare triple {59317#false} assume !false; {59317#false} is VALID [2022-04-08 08:44:44,179 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-08 08:44:44,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:44:44,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787250182] [2022-04-08 08:44:44,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787250182] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:44,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:44,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:44,180 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:44:44,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1028538996] [2022-04-08 08:44:44,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1028538996] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:44,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:44,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:44,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530166168] [2022-04-08 08:44:44,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:44:44,180 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-08 08:44:44,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:44:44,181 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-08 08:44:44,271 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-08 08:44:44,271 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:44:44,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:44,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:44:44,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:44:44,272 INFO L87 Difference]: Start difference. First operand 491 states and 749 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-08 08:44:46,276 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-08 08:44:48,376 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:51,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:51,075 INFO L93 Difference]: Finished difference Result 1074 states and 1642 transitions. [2022-04-08 08:44:51,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:44:51,075 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-08 08:44:51,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:44:51,076 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-08 08:44:51,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 582 transitions. [2022-04-08 08:44:51,078 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-08 08:44:51,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 582 transitions. [2022-04-08 08:44:51,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 582 transitions. [2022-04-08 08:44:51,515 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-08 08:44:51,533 INFO L225 Difference]: With dead ends: 1074 [2022-04-08 08:44:51,533 INFO L226 Difference]: Without dead ends: 609 [2022-04-08 08:44:51,534 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-08 08:44:51,534 INFO L913 BasicCegarLoop]: 128 mSDtfsCounter, 122 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:44:51,534 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 364 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-08 08:44:51,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2022-04-08 08:44:51,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 521. [2022-04-08 08:44:51,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:44:51,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 609 states. Second operand has 521 states, 516 states have (on average 1.5232558139534884) internal successors, (786), 516 states have internal predecessors, (786), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:51,576 INFO L74 IsIncluded]: Start isIncluded. First operand 609 states. Second operand has 521 states, 516 states have (on average 1.5232558139534884) internal successors, (786), 516 states have internal predecessors, (786), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:51,576 INFO L87 Difference]: Start difference. First operand 609 states. Second operand has 521 states, 516 states have (on average 1.5232558139534884) internal successors, (786), 516 states have internal predecessors, (786), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:51,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:51,593 INFO L93 Difference]: Finished difference Result 609 states and 915 transitions. [2022-04-08 08:44:51,593 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 915 transitions. [2022-04-08 08:44:51,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:51,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:51,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 521 states, 516 states have (on average 1.5232558139534884) internal successors, (786), 516 states have internal predecessors, (786), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 609 states. [2022-04-08 08:44:51,595 INFO L87 Difference]: Start difference. First operand has 521 states, 516 states have (on average 1.5232558139534884) internal successors, (786), 516 states have internal predecessors, (786), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 609 states. [2022-04-08 08:44:51,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:51,611 INFO L93 Difference]: Finished difference Result 609 states and 915 transitions. [2022-04-08 08:44:51,612 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 915 transitions. [2022-04-08 08:44:51,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:51,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:51,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:44:51,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:44:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 516 states have (on average 1.5232558139534884) internal successors, (786), 516 states have internal predecessors, (786), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 790 transitions. [2022-04-08 08:44:51,630 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 790 transitions. Word has length 144 [2022-04-08 08:44:51,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:44:51,630 INFO L478 AbstractCegarLoop]: Abstraction has 521 states and 790 transitions. [2022-04-08 08:44:51,630 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-08 08:44:51,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 521 states and 790 transitions. [2022-04-08 08:44:52,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 790 edges. 790 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:52,368 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 790 transitions. [2022-04-08 08:44:52,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-08 08:44:52,369 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:44:52,369 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 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-08 08:44:52,370 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-08 08:44:52,370 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:44:52,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:44:52,370 INFO L85 PathProgramCache]: Analyzing trace with hash -57882736, now seen corresponding path program 1 times [2022-04-08 08:44:52,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:52,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1287312227] [2022-04-08 08:44:52,585 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 19 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:44:52,586 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:44:52,586 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:44:52,587 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:44:52,587 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:44:52,588 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:190) 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:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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-08 08:44:52,590 INFO L158 Benchmark]: Toolchain (without parser) took 217476.18ms. Allocated memory was 198.2MB in the beginning and 247.5MB in the end (delta: 49.3MB). Free memory was 167.5MB in the beginning and 108.6MB in the end (delta: 58.9MB). Peak memory consumption was 108.1MB. Max. memory is 8.0GB. [2022-04-08 08:44:52,590 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 198.2MB. Free memory is still 157.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 08:44:52,591 INFO L158 Benchmark]: CACSL2BoogieTranslator took 637.08ms. Allocated memory is still 198.2MB. Free memory was 167.4MB in the beginning and 145.2MB in the end (delta: 22.2MB). Peak memory consumption was 23.3MB. Max. memory is 8.0GB. [2022-04-08 08:44:52,591 INFO L158 Benchmark]: Boogie Preprocessor took 111.69ms. Allocated memory is still 198.2MB. Free memory was 145.2MB in the beginning and 135.3MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 08:44:52,591 INFO L158 Benchmark]: RCFGBuilder took 1631.98ms. Allocated memory was 198.2MB in the beginning and 247.5MB in the end (delta: 49.3MB). Free memory was 135.3MB in the beginning and 142.0MB in the end (delta: -6.8MB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. [2022-04-08 08:44:52,594 INFO L158 Benchmark]: TraceAbstraction took 215090.54ms. Allocated memory is still 247.5MB. Free memory was 141.5MB in the beginning and 108.6MB in the end (delta: 32.9MB). Peak memory consumption was 32.4MB. Max. memory is 8.0GB. [2022-04-08 08:44:52,595 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.11ms. Allocated memory is still 198.2MB. Free memory is still 157.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 637.08ms. Allocated memory is still 198.2MB. Free memory was 167.4MB in the beginning and 145.2MB in the end (delta: 22.2MB). Peak memory consumption was 23.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 111.69ms. Allocated memory is still 198.2MB. Free memory was 145.2MB in the beginning and 135.3MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 1631.98ms. Allocated memory was 198.2MB in the beginning and 247.5MB in the end (delta: 49.3MB). Free memory was 135.3MB in the beginning and 142.0MB in the end (delta: -6.8MB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. * TraceAbstraction took 215090.54ms. Allocated memory is still 247.5MB. Free memory was 141.5MB in the beginning and 108.6MB in the end (delta: 32.9MB). Peak memory consumption was 32.4MB. 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-08 08:44:52,626 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...