/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_clnt.blast.04.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 08:35:29,952 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:35:29,972 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:35:30,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:35:30,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:35:30,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:35:30,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:35:30,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:35:30,021 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:35:30,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:35:30,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:35:30,024 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:35:30,024 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:35:30,025 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:35:30,026 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:35:30,027 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:35:30,028 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:35:30,029 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:35:30,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:35:30,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:35:30,033 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:35:30,034 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:35:30,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:35:30,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:35:30,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:35:30,040 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:35:30,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:35:30,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:35:30,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:35:30,041 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:35:30,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:35:30,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:35:30,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:35:30,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:35:30,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:35:30,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:35:30,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:35:30,053 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:35:30,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:35:30,054 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:35:30,058 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:35:30,059 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:35:30,060 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 08:35:30,068 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:35:30,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:35:30,069 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:35:30,069 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:35:30,069 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:35:30,069 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:35:30,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:35:30,070 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:35:30,070 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:35:30,070 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:35:30,070 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:35:30,070 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:35:30,070 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:35:30,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:35:30,071 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:35:30,071 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:35:30,071 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:35:30,071 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:35:30,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:35:30,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:35:30,071 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:35:30,072 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:35:30,072 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:35:30,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:35:30,072 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:35:30,072 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 08:35:30,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:35:30,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:35:30,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:35:30,331 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:35:30,332 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:35:30,333 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.04.i.cil-2.c [2022-04-28 08:35:30,394 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18646df2b/6f884744537b42cf8aa671f56ec6b92e/FLAG0105cb738 [2022-04-28 08:35:30,988 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:35:30,989 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.04.i.cil-2.c [2022-04-28 08:35:31,010 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18646df2b/6f884744537b42cf8aa671f56ec6b92e/FLAG0105cb738 [2022-04-28 08:35:31,382 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18646df2b/6f884744537b42cf8aa671f56ec6b92e [2022-04-28 08:35:31,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:35:31,388 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:35:31,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:35:31,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:35:31,395 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:35:31,396 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:35:31" (1/1) ... [2022-04-28 08:35:31,397 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f117555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:35:31, skipping insertion in model container [2022-04-28 08:35:31,397 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:35:31" (1/1) ... [2022-04-28 08:35:31,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:35:31,463 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:35:31,864 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_clnt.blast.04.i.cil-2.c[65405,65418] [2022-04-28 08:35:31,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:35:31,887 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:35:32,039 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_clnt.blast.04.i.cil-2.c[65405,65418] [2022-04-28 08:35:32,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:35:32,066 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:35:32,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:35:32 WrapperNode [2022-04-28 08:35:32,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:35:32,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:35:32,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:35:32,069 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:35:32,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:35:32" (1/1) ... [2022-04-28 08:35:32,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:35:32" (1/1) ... [2022-04-28 08:35:32,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:35:32" (1/1) ... [2022-04-28 08:35:32,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:35:32" (1/1) ... [2022-04-28 08:35:32,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:35:32" (1/1) ... [2022-04-28 08:35:32,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:35:32" (1/1) ... [2022-04-28 08:35:32,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:35:32" (1/1) ... [2022-04-28 08:35:32,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:35:32,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:35:32,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:35:32,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:35:32,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:35:32" (1/1) ... [2022-04-28 08:35:32,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:35:32,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:35:32,244 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 08:35:32,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 08:35:32,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:35:32,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:35:32,290 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:35:32,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-28 08:35:32,290 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-28 08:35:32,290 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:35:32,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-28 08:35:32,291 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-28 08:35:32,291 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-28 08:35:32,291 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-28 08:35:32,291 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:35:32,291 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:35:32,291 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:35:32,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:35:32,291 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 08:35:32,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 08:35:32,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:35:32,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 08:35:32,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 08:35:32,292 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-28 08:35:32,295 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-28 08:35:32,296 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-28 08:35:32,296 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-28 08:35:32,296 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-28 08:35:32,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-28 08:35:32,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 08:35:32,296 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:35:32,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 08:35:32,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:35:32,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 08:35:32,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:35:32,296 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-28 08:35:32,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-28 08:35:32,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:35:32,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:35:32,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:35:32,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-28 08:35:32,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-28 08:35:32,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-28 08:35:32,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-28 08:35:32,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:35:32,504 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:35:32,506 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:35:33,831 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:35:34,324 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-28 08:35:34,325 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-28 08:35:34,339 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:35:34,346 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:35:34,346 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 08:35:34,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:35:34 BoogieIcfgContainer [2022-04-28 08:35:34,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:35:34,349 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:35:34,349 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:35:34,352 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:35:34,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:35:31" (1/3) ... [2022-04-28 08:35:34,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a98e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:35:34, skipping insertion in model container [2022-04-28 08:35:34,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:35:32" (2/3) ... [2022-04-28 08:35:34,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a98e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:35:34, skipping insertion in model container [2022-04-28 08:35:34,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:35:34" (3/3) ... [2022-04-28 08:35:34,354 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04.i.cil-2.c [2022-04-28 08:35:34,365 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:35:34,366 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:35:34,402 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:35:34,407 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2bf35a0c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4f79af18 [2022-04-28 08:35:34,407 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:35:34,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 08:35:34,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 08:35:34,422 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:35:34,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:35:34,423 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:35:34,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:35:34,429 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 1 times [2022-04-28 08:35:34,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:35:34,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [156342593] [2022-04-28 08:35:34,441 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:35:34,442 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 2 times [2022-04-28 08:35:34,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:35:34,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551462366] [2022-04-28 08:35:34,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:35:34,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:35:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:35,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:35:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:35,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {141#true} is VALID [2022-04-28 08:35:35,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-28 08:35:35,045 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-28 08:35:35,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:35:35,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {141#true} is VALID [2022-04-28 08:35:35,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-28 08:35:35,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-28 08:35:35,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {141#true} call #t~ret158 := main(); {141#true} is VALID [2022-04-28 08:35:35,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {141#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {141#true} is VALID [2022-04-28 08:35:35,049 INFO L272 TraceCheckUtils]: 6: Hoare triple {141#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {141#true} is VALID [2022-04-28 08:35:35,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:35,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:35,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:35,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:35,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:35,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {147#(= 12292 |ssl3_connect_#t~mem49|)} is VALID [2022-04-28 08:35:35,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {147#(= 12292 |ssl3_connect_#t~mem49|)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-28 08:35:35,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {142#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-28 08:35:35,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {142#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-28 08:35:35,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {142#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-28 08:35:35,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {142#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-28 08:35:35,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {142#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-28 08:35:35,062 INFO L290 TraceCheckUtils]: 19: Hoare triple {142#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-28 08:35:35,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {142#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-28 08:35:35,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {142#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-28 08:35:35,062 INFO L290 TraceCheckUtils]: 22: Hoare triple {142#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-28 08:35:35,062 INFO L290 TraceCheckUtils]: 23: Hoare triple {142#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-28 08:35:35,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {142#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-28 08:35:35,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {142#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-28 08:35:35,063 INFO L290 TraceCheckUtils]: 26: Hoare triple {142#false} assume 4432 == #t~mem62;havoc #t~mem62; {142#false} is VALID [2022-04-28 08:35:35,063 INFO L290 TraceCheckUtils]: 27: Hoare triple {142#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {142#false} is VALID [2022-04-28 08:35:35,063 INFO L290 TraceCheckUtils]: 28: Hoare triple {142#false} assume 5 == ~blastFlag~0; {142#false} is VALID [2022-04-28 08:35:35,064 INFO L290 TraceCheckUtils]: 29: Hoare triple {142#false} assume !false; {142#false} is VALID [2022-04-28 08:35:35,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:35:35,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:35:35,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551462366] [2022-04-28 08:35:35,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551462366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:35:35,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:35:35,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:35:35,068 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:35:35,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [156342593] [2022-04-28 08:35:35,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [156342593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:35:35,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:35:35,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:35:35,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849995077] [2022-04-28 08:35:35,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:35:35,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 08:35:35,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:35:35,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:35,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:35:35,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:35:35,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:35:35,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:35:35,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:35:35,151 INFO L87 Difference]: Start difference. First operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 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 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:37,200 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:35:38,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:38,499 INFO L93 Difference]: Finished difference Result 267 states and 442 transitions. [2022-04-28 08:35:38,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:35:38,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 08:35:38,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:35:38,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:38,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-28 08:35:38,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:38,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-28 08:35:38,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-28 08:35:38,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:35:38,911 INFO L225 Difference]: With dead ends: 267 [2022-04-28 08:35:38,912 INFO L226 Difference]: Without dead ends: 122 [2022-04-28 08:35:38,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:35:38,917 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 7 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:35:38,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 555 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 320 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:35:38,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-28 08:35:38,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-04-28 08:35:38,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:35:38,950 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:38,951 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:38,951 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:38,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:38,957 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-28 08:35:38,957 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-28 08:35:38,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:35:38,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:35:38,959 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-28 08:35:38,959 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-28 08:35:38,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:38,965 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-28 08:35:38,965 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-28 08:35:38,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:35:38,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:35:38,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:35:38,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:35:38,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:38,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2022-04-28 08:35:38,973 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 30 [2022-04-28 08:35:38,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:35:38,973 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2022-04-28 08:35:38,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:38,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 178 transitions. [2022-04-28 08:35:39,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:35:39,120 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2022-04-28 08:35:39,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 08:35:39,122 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:35:39,122 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:35:39,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:35:39,122 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:35:39,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:35:39,123 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 1 times [2022-04-28 08:35:39,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:35:39,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [679938750] [2022-04-28 08:35:39,124 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:35:39,124 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 2 times [2022-04-28 08:35:39,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:35:39,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513020499] [2022-04-28 08:35:39,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:35:39,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:35:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:39,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:35:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:39,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {1179#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1173#true} is VALID [2022-04-28 08:35:39,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-28 08:35:39,432 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-28 08:35:39,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} call ULTIMATE.init(); {1179#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:35:39,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {1179#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1173#true} is VALID [2022-04-28 08:35:39,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-28 08:35:39,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-28 08:35:39,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} call #t~ret158 := main(); {1173#true} is VALID [2022-04-28 08:35:39,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {1173#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {1173#true} is VALID [2022-04-28 08:35:39,435 INFO L272 TraceCheckUtils]: 6: Hoare triple {1173#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {1173#true} is VALID [2022-04-28 08:35:39,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {1173#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 12292 == #t~mem49;havoc #t~mem49; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call write~int(0, ~s.base, 36 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,446 INFO L290 TraceCheckUtils]: 20: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___4~0); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,446 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,447 INFO L290 TraceCheckUtils]: 22: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,447 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} ~skip~0 := 0; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,448 INFO L290 TraceCheckUtils]: 26: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,449 INFO L290 TraceCheckUtils]: 27: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,449 INFO L290 TraceCheckUtils]: 28: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,451 INFO L290 TraceCheckUtils]: 31: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,451 INFO L290 TraceCheckUtils]: 32: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,452 INFO L290 TraceCheckUtils]: 33: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,452 INFO L290 TraceCheckUtils]: 34: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,453 INFO L290 TraceCheckUtils]: 35: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,453 INFO L290 TraceCheckUtils]: 36: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,454 INFO L290 TraceCheckUtils]: 37: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,454 INFO L290 TraceCheckUtils]: 38: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,455 INFO L290 TraceCheckUtils]: 39: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,455 INFO L290 TraceCheckUtils]: 40: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 4432 == #t~mem62;havoc #t~mem62; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,455 INFO L290 TraceCheckUtils]: 41: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:35:39,456 INFO L290 TraceCheckUtils]: 42: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 5 == ~blastFlag~0; {1174#false} is VALID [2022-04-28 08:35:39,456 INFO L290 TraceCheckUtils]: 43: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-28 08:35:39,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 08:35:39,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:35:39,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513020499] [2022-04-28 08:35:39,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513020499] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:35:39,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:35:39,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:35:39,459 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:35:39,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [679938750] [2022-04-28 08:35:39,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [679938750] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:35:39,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:35:39,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:35:39,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102638072] [2022-04-28 08:35:39,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:35:39,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-28 08:35:39,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:35:39,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:39,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:35:39,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:35:39,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:35:39,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:35:39,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:35:39,510 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:41,555 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:35:42,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:42,241 INFO L93 Difference]: Finished difference Result 327 states and 490 transitions. [2022-04-28 08:35:42,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:35:42,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-28 08:35:42,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:35:42,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:42,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-28 08:35:42,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:42,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-28 08:35:42,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-28 08:35:42,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:35:42,633 INFO L225 Difference]: With dead ends: 327 [2022-04-28 08:35:42,633 INFO L226 Difference]: Without dead ends: 222 [2022-04-28 08:35:42,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:35:42,635 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 124 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:35:42,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 319 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 190 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 08:35:42,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-28 08:35:42,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-04-28 08:35:42,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:35:42,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:42,651 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:42,651 INFO L87 Difference]: Start difference. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:42,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:42,660 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-28 08:35:42,660 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-28 08:35:42,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:35:42,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:35:42,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-28 08:35:42,662 INFO L87 Difference]: Start difference. First operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-28 08:35:42,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:42,671 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-28 08:35:42,671 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-28 08:35:42,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:35:42,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:35:42,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:35:42,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:35:42,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:42,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 326 transitions. [2022-04-28 08:35:42,681 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 326 transitions. Word has length 44 [2022-04-28 08:35:42,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:35:42,681 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 326 transitions. [2022-04-28 08:35:42,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:42,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 222 states and 326 transitions. [2022-04-28 08:35:42,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 326 edges. 326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:35:42,951 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-28 08:35:42,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 08:35:42,952 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:35:42,953 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:35:42,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:35:42,953 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:35:42,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:35:42,954 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 1 times [2022-04-28 08:35:42,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:35:42,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [89820024] [2022-04-28 08:35:42,955 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:35:42,955 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 2 times [2022-04-28 08:35:42,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:35:42,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660696912] [2022-04-28 08:35:42,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:35:42,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:35:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:43,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:35:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:43,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {2731#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {2724#true} is VALID [2022-04-28 08:35:43,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-28 08:35:43,184 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2724#true} {2724#true} #593#return; {2724#true} is VALID [2022-04-28 08:35:43,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {2724#true} call ULTIMATE.init(); {2731#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:35:43,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {2731#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {2724#true} is VALID [2022-04-28 08:35:43,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-28 08:35:43,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2724#true} {2724#true} #593#return; {2724#true} is VALID [2022-04-28 08:35:43,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {2724#true} call #t~ret158 := main(); {2724#true} is VALID [2022-04-28 08:35:43,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {2724#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {2724#true} is VALID [2022-04-28 08:35:43,186 INFO L272 TraceCheckUtils]: 6: Hoare triple {2724#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {2724#true} is VALID [2022-04-28 08:35:43,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {2724#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {2724#true} is VALID [2022-04-28 08:35:43,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {2724#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {2724#true} is VALID [2022-04-28 08:35:43,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {2724#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {2724#true} is VALID [2022-04-28 08:35:43,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {2724#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {2724#true} is VALID [2022-04-28 08:35:43,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {2724#true} assume !false; {2724#true} is VALID [2022-04-28 08:35:43,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {2724#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {2724#true} is VALID [2022-04-28 08:35:43,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {2724#true} assume 12292 == #t~mem49;havoc #t~mem49; {2724#true} is VALID [2022-04-28 08:35:43,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {2724#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {2724#true} is VALID [2022-04-28 08:35:43,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {2724#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {2724#true} is VALID [2022-04-28 08:35:43,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {2724#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {2724#true} is VALID [2022-04-28 08:35:43,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {2724#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {2724#true} is VALID [2022-04-28 08:35:43,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {2724#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {2724#true} is VALID [2022-04-28 08:35:43,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {2724#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {2724#true} is VALID [2022-04-28 08:35:43,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {2724#true} assume !(0 == ~tmp___4~0); {2724#true} is VALID [2022-04-28 08:35:43,189 INFO L290 TraceCheckUtils]: 21: Hoare triple {2724#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {2724#true} is VALID [2022-04-28 08:35:43,189 INFO L290 TraceCheckUtils]: 22: Hoare triple {2724#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {2724#true} is VALID [2022-04-28 08:35:43,189 INFO L290 TraceCheckUtils]: 23: Hoare triple {2724#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {2724#true} is VALID [2022-04-28 08:35:43,189 INFO L290 TraceCheckUtils]: 24: Hoare triple {2724#true} ~skip~0 := 0; {2724#true} is VALID [2022-04-28 08:35:43,189 INFO L290 TraceCheckUtils]: 25: Hoare triple {2724#true} assume !false; {2724#true} is VALID [2022-04-28 08:35:43,189 INFO L290 TraceCheckUtils]: 26: Hoare triple {2724#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {2724#true} is VALID [2022-04-28 08:35:43,189 INFO L290 TraceCheckUtils]: 27: Hoare triple {2724#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {2724#true} is VALID [2022-04-28 08:35:43,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {2724#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {2724#true} is VALID [2022-04-28 08:35:43,190 INFO L290 TraceCheckUtils]: 29: Hoare triple {2724#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {2724#true} is VALID [2022-04-28 08:35:43,190 INFO L290 TraceCheckUtils]: 30: Hoare triple {2724#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {2724#true} is VALID [2022-04-28 08:35:43,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {2724#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {2724#true} is VALID [2022-04-28 08:35:43,190 INFO L290 TraceCheckUtils]: 32: Hoare triple {2724#true} assume 4368 == #t~mem54;havoc #t~mem54; {2724#true} is VALID [2022-04-28 08:35:43,190 INFO L290 TraceCheckUtils]: 33: Hoare triple {2724#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {2724#true} is VALID [2022-04-28 08:35:43,191 INFO L290 TraceCheckUtils]: 34: Hoare triple {2724#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2724#true} is VALID [2022-04-28 08:35:43,193 INFO L290 TraceCheckUtils]: 35: Hoare triple {2724#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:43,193 INFO L290 TraceCheckUtils]: 36: Hoare triple {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:43,199 INFO L290 TraceCheckUtils]: 37: Hoare triple {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:43,200 INFO L290 TraceCheckUtils]: 38: Hoare triple {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:43,200 INFO L290 TraceCheckUtils]: 39: Hoare triple {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:43,201 INFO L290 TraceCheckUtils]: 40: Hoare triple {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:43,201 INFO L290 TraceCheckUtils]: 41: Hoare triple {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:43,202 INFO L290 TraceCheckUtils]: 42: Hoare triple {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:43,202 INFO L290 TraceCheckUtils]: 43: Hoare triple {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:43,203 INFO L290 TraceCheckUtils]: 44: Hoare triple {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:43,203 INFO L290 TraceCheckUtils]: 45: Hoare triple {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:43,204 INFO L290 TraceCheckUtils]: 46: Hoare triple {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:43,204 INFO L290 TraceCheckUtils]: 47: Hoare triple {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:43,205 INFO L290 TraceCheckUtils]: 48: Hoare triple {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {2730#(= |ssl3_connect_#t~mem56| 4384)} is VALID [2022-04-28 08:35:43,205 INFO L290 TraceCheckUtils]: 49: Hoare triple {2730#(= |ssl3_connect_#t~mem56| 4384)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {2725#false} is VALID [2022-04-28 08:35:43,205 INFO L290 TraceCheckUtils]: 50: Hoare triple {2725#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {2725#false} is VALID [2022-04-28 08:35:43,205 INFO L290 TraceCheckUtils]: 51: Hoare triple {2725#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {2725#false} is VALID [2022-04-28 08:35:43,205 INFO L290 TraceCheckUtils]: 52: Hoare triple {2725#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {2725#false} is VALID [2022-04-28 08:35:43,206 INFO L290 TraceCheckUtils]: 53: Hoare triple {2725#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {2725#false} is VALID [2022-04-28 08:35:43,206 INFO L290 TraceCheckUtils]: 54: Hoare triple {2725#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {2725#false} is VALID [2022-04-28 08:35:43,206 INFO L290 TraceCheckUtils]: 55: Hoare triple {2725#false} assume 4432 == #t~mem62;havoc #t~mem62; {2725#false} is VALID [2022-04-28 08:35:43,206 INFO L290 TraceCheckUtils]: 56: Hoare triple {2725#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {2725#false} is VALID [2022-04-28 08:35:43,206 INFO L290 TraceCheckUtils]: 57: Hoare triple {2725#false} assume 5 == ~blastFlag~0; {2725#false} is VALID [2022-04-28 08:35:43,206 INFO L290 TraceCheckUtils]: 58: Hoare triple {2725#false} assume !false; {2725#false} is VALID [2022-04-28 08:35:43,207 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 08:35:43,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:35:43,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660696912] [2022-04-28 08:35:43,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660696912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:35:43,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:35:43,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:35:43,208 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:35:43,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [89820024] [2022-04-28 08:35:43,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [89820024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:35:43,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:35:43,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:35:43,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391608014] [2022-04-28 08:35:43,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:35:43,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-28 08:35:43,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:35:43,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:43,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:35:43,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:35:43,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:35:43,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:35:43,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:35:43,264 INFO L87 Difference]: Start difference. First operand 222 states and 326 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:45,288 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:35:46,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:46,422 INFO L93 Difference]: Finished difference Result 362 states and 537 transitions. [2022-04-28 08:35:46,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:35:46,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-28 08:35:46,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:35:46,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:46,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-28 08:35:46,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:46,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-28 08:35:46,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 386 transitions. [2022-04-28 08:35:46,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 386 edges. 386 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:35:46,717 INFO L225 Difference]: With dead ends: 362 [2022-04-28 08:35:46,717 INFO L226 Difference]: Without dead ends: 257 [2022-04-28 08:35:46,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:35:46,719 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 31 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:35:46,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 484 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 359 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:35:46,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-28 08:35:46,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 240. [2022-04-28 08:35:46,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:35:46,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:46,733 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:46,733 INFO L87 Difference]: Start difference. First operand 257 states. Second operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:46,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:46,747 INFO L93 Difference]: Finished difference Result 257 states and 378 transitions. [2022-04-28 08:35:46,748 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 378 transitions. [2022-04-28 08:35:46,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:35:46,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:35:46,749 INFO L74 IsIncluded]: Start isIncluded. First operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 257 states. [2022-04-28 08:35:46,750 INFO L87 Difference]: Start difference. First operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 257 states. [2022-04-28 08:35:46,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:46,763 INFO L93 Difference]: Finished difference Result 257 states and 378 transitions. [2022-04-28 08:35:46,764 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 378 transitions. [2022-04-28 08:35:46,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:35:46,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:35:46,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:35:46,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:35:46,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:46,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 356 transitions. [2022-04-28 08:35:46,778 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 356 transitions. Word has length 59 [2022-04-28 08:35:46,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:35:46,779 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 356 transitions. [2022-04-28 08:35:46,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:46,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 240 states and 356 transitions. [2022-04-28 08:35:47,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 356 edges. 356 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:35:47,034 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 356 transitions. [2022-04-28 08:35:47,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 08:35:47,035 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:35:47,035 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:35:47,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 08:35:47,036 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:35:47,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:35:47,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2084364124, now seen corresponding path program 3 times [2022-04-28 08:35:47,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:35:47,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [290767978] [2022-04-28 08:35:55,659 WARN L232 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:36:05,283 WARN L232 SmtUtils]: Spent 5.90s on a formula simplification that was a NOOP. DAG size: 153 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:36:06,105 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:36:06,105 INFO L85 PathProgramCache]: Analyzing trace with hash -2084364124, now seen corresponding path program 4 times [2022-04-28 08:36:06,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:36:06,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572503553] [2022-04-28 08:36:06,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:36:06,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:36:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:06,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:36:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:06,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {4461#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {4454#true} is VALID [2022-04-28 08:36:06,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {4454#true} assume true; {4454#true} is VALID [2022-04-28 08:36:06,315 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4454#true} {4454#true} #593#return; {4454#true} is VALID [2022-04-28 08:36:06,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {4454#true} call ULTIMATE.init(); {4461#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:36:06,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {4461#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {4454#true} is VALID [2022-04-28 08:36:06,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {4454#true} assume true; {4454#true} is VALID [2022-04-28 08:36:06,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4454#true} {4454#true} #593#return; {4454#true} is VALID [2022-04-28 08:36:06,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {4454#true} call #t~ret158 := main(); {4454#true} is VALID [2022-04-28 08:36:06,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {4454#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {4454#true} is VALID [2022-04-28 08:36:06,317 INFO L272 TraceCheckUtils]: 6: Hoare triple {4454#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {4454#true} is VALID [2022-04-28 08:36:06,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {4454#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {4454#true} is VALID [2022-04-28 08:36:06,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {4454#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {4454#true} is VALID [2022-04-28 08:36:06,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {4454#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {4454#true} is VALID [2022-04-28 08:36:06,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {4454#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4454#true} is VALID [2022-04-28 08:36:06,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {4454#true} assume !false; {4454#true} is VALID [2022-04-28 08:36:06,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {4454#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4454#true} is VALID [2022-04-28 08:36:06,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {4454#true} assume 12292 == #t~mem49;havoc #t~mem49; {4454#true} is VALID [2022-04-28 08:36:06,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {4454#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {4454#true} is VALID [2022-04-28 08:36:06,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {4454#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4454#true} is VALID [2022-04-28 08:36:06,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {4454#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4454#true} is VALID [2022-04-28 08:36:06,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {4454#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4454#true} is VALID [2022-04-28 08:36:06,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {4454#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {4454#true} is VALID [2022-04-28 08:36:06,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {4454#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4454#true} is VALID [2022-04-28 08:36:06,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {4454#true} assume !(0 == ~tmp___4~0); {4454#true} is VALID [2022-04-28 08:36:06,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {4454#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {4454#true} is VALID [2022-04-28 08:36:06,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {4454#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {4454#true} is VALID [2022-04-28 08:36:06,319 INFO L290 TraceCheckUtils]: 23: Hoare triple {4454#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4454#true} is VALID [2022-04-28 08:36:06,319 INFO L290 TraceCheckUtils]: 24: Hoare triple {4454#true} ~skip~0 := 0; {4454#true} is VALID [2022-04-28 08:36:06,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {4454#true} assume !false; {4454#true} is VALID [2022-04-28 08:36:06,319 INFO L290 TraceCheckUtils]: 26: Hoare triple {4454#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4454#true} is VALID [2022-04-28 08:36:06,319 INFO L290 TraceCheckUtils]: 27: Hoare triple {4454#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4454#true} is VALID [2022-04-28 08:36:06,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {4454#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4454#true} is VALID [2022-04-28 08:36:06,320 INFO L290 TraceCheckUtils]: 29: Hoare triple {4454#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4454#true} is VALID [2022-04-28 08:36:06,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {4454#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4454#true} is VALID [2022-04-28 08:36:06,320 INFO L290 TraceCheckUtils]: 31: Hoare triple {4454#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4454#true} is VALID [2022-04-28 08:36:06,320 INFO L290 TraceCheckUtils]: 32: Hoare triple {4454#true} assume 4368 == #t~mem54;havoc #t~mem54; {4454#true} is VALID [2022-04-28 08:36:06,320 INFO L290 TraceCheckUtils]: 33: Hoare triple {4454#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {4454#true} is VALID [2022-04-28 08:36:06,320 INFO L290 TraceCheckUtils]: 34: Hoare triple {4454#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4454#true} is VALID [2022-04-28 08:36:06,324 INFO L290 TraceCheckUtils]: 35: Hoare triple {4454#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {4459#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:36:06,324 INFO L290 TraceCheckUtils]: 36: Hoare triple {4459#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {4459#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:36:06,325 INFO L290 TraceCheckUtils]: 37: Hoare triple {4459#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {4459#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:36:06,327 INFO L290 TraceCheckUtils]: 38: Hoare triple {4459#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4459#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:36:06,327 INFO L290 TraceCheckUtils]: 39: Hoare triple {4459#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {4459#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:36:06,328 INFO L290 TraceCheckUtils]: 40: Hoare triple {4459#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {4459#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:36:06,328 INFO L290 TraceCheckUtils]: 41: Hoare triple {4459#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4460#(not (= 12292 |ssl3_connect_#t~mem49|))} is VALID [2022-04-28 08:36:06,329 INFO L290 TraceCheckUtils]: 42: Hoare triple {4460#(not (= 12292 |ssl3_connect_#t~mem49|))} assume 12292 == #t~mem49;havoc #t~mem49; {4455#false} is VALID [2022-04-28 08:36:06,329 INFO L290 TraceCheckUtils]: 43: Hoare triple {4455#false} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {4455#false} is VALID [2022-04-28 08:36:06,329 INFO L290 TraceCheckUtils]: 44: Hoare triple {4455#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4455#false} is VALID [2022-04-28 08:36:06,329 INFO L290 TraceCheckUtils]: 45: Hoare triple {4455#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4455#false} is VALID [2022-04-28 08:36:06,329 INFO L290 TraceCheckUtils]: 46: Hoare triple {4455#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4455#false} is VALID [2022-04-28 08:36:06,329 INFO L290 TraceCheckUtils]: 47: Hoare triple {4455#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {4455#false} is VALID [2022-04-28 08:36:06,329 INFO L290 TraceCheckUtils]: 48: Hoare triple {4455#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4455#false} is VALID [2022-04-28 08:36:06,329 INFO L290 TraceCheckUtils]: 49: Hoare triple {4455#false} assume !(0 == ~tmp___4~0); {4455#false} is VALID [2022-04-28 08:36:06,330 INFO L290 TraceCheckUtils]: 50: Hoare triple {4455#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {4455#false} is VALID [2022-04-28 08:36:06,330 INFO L290 TraceCheckUtils]: 51: Hoare triple {4455#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {4455#false} is VALID [2022-04-28 08:36:06,330 INFO L290 TraceCheckUtils]: 52: Hoare triple {4455#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4455#false} is VALID [2022-04-28 08:36:06,330 INFO L290 TraceCheckUtils]: 53: Hoare triple {4455#false} ~skip~0 := 0; {4455#false} is VALID [2022-04-28 08:36:06,330 INFO L290 TraceCheckUtils]: 54: Hoare triple {4455#false} assume !false; {4455#false} is VALID [2022-04-28 08:36:06,330 INFO L290 TraceCheckUtils]: 55: Hoare triple {4455#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-28 08:36:06,330 INFO L290 TraceCheckUtils]: 56: Hoare triple {4455#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-28 08:36:06,330 INFO L290 TraceCheckUtils]: 57: Hoare triple {4455#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-28 08:36:06,331 INFO L290 TraceCheckUtils]: 58: Hoare triple {4455#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-28 08:36:06,331 INFO L290 TraceCheckUtils]: 59: Hoare triple {4455#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-28 08:36:06,331 INFO L290 TraceCheckUtils]: 60: Hoare triple {4455#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-28 08:36:06,331 INFO L290 TraceCheckUtils]: 61: Hoare triple {4455#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-28 08:36:06,331 INFO L290 TraceCheckUtils]: 62: Hoare triple {4455#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-28 08:36:06,331 INFO L290 TraceCheckUtils]: 63: Hoare triple {4455#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-28 08:36:06,331 INFO L290 TraceCheckUtils]: 64: Hoare triple {4455#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-28 08:36:06,331 INFO L290 TraceCheckUtils]: 65: Hoare triple {4455#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-28 08:36:06,332 INFO L290 TraceCheckUtils]: 66: Hoare triple {4455#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-28 08:36:06,332 INFO L290 TraceCheckUtils]: 67: Hoare triple {4455#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-28 08:36:06,332 INFO L290 TraceCheckUtils]: 68: Hoare triple {4455#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-28 08:36:06,332 INFO L290 TraceCheckUtils]: 69: Hoare triple {4455#false} assume 4432 == #t~mem62;havoc #t~mem62; {4455#false} is VALID [2022-04-28 08:36:06,332 INFO L290 TraceCheckUtils]: 70: Hoare triple {4455#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {4455#false} is VALID [2022-04-28 08:36:06,332 INFO L290 TraceCheckUtils]: 71: Hoare triple {4455#false} assume 5 == ~blastFlag~0; {4455#false} is VALID [2022-04-28 08:36:06,332 INFO L290 TraceCheckUtils]: 72: Hoare triple {4455#false} assume !false; {4455#false} is VALID [2022-04-28 08:36:06,333 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 08:36:06,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:36:06,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572503553] [2022-04-28 08:36:06,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572503553] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:36:06,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:36:06,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:36:06,333 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:36:06,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [290767978] [2022-04-28 08:36:06,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [290767978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:36:06,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:36:06,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:36:06,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108546061] [2022-04-28 08:36:06,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:36:06,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-28 08:36:06,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:36:06,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:06,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:36:06,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:36:06,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:06,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:36:06,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:36:06,396 INFO L87 Difference]: Start difference. First operand 240 states and 356 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:08,421 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:36:09,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:09,527 INFO L93 Difference]: Finished difference Result 645 states and 966 transitions. [2022-04-28 08:36:09,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:36:09,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-28 08:36:09,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:36:09,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:09,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-28 08:36:09,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:09,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-28 08:36:09,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-28 08:36:09,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:36:09,888 INFO L225 Difference]: With dead ends: 645 [2022-04-28 08:36:09,888 INFO L226 Difference]: Without dead ends: 421 [2022-04-28 08:36:09,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:36:09,890 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 112 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 08:36:09,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 296 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 379 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 08:36:09,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-04-28 08:36:09,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 262. [2022-04-28 08:36:09,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:36:09,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 421 states. Second operand has 262 states, 257 states have (on average 1.490272373540856) internal successors, (383), 257 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:09,929 INFO L74 IsIncluded]: Start isIncluded. First operand 421 states. Second operand has 262 states, 257 states have (on average 1.490272373540856) internal successors, (383), 257 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:09,930 INFO L87 Difference]: Start difference. First operand 421 states. Second operand has 262 states, 257 states have (on average 1.490272373540856) internal successors, (383), 257 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:09,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:09,953 INFO L93 Difference]: Finished difference Result 421 states and 627 transitions. [2022-04-28 08:36:09,953 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 627 transitions. [2022-04-28 08:36:09,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:09,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:09,955 INFO L74 IsIncluded]: Start isIncluded. First operand has 262 states, 257 states have (on average 1.490272373540856) internal successors, (383), 257 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 421 states. [2022-04-28 08:36:09,955 INFO L87 Difference]: Start difference. First operand has 262 states, 257 states have (on average 1.490272373540856) internal successors, (383), 257 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 421 states. [2022-04-28 08:36:09,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:09,973 INFO L93 Difference]: Finished difference Result 421 states and 627 transitions. [2022-04-28 08:36:09,973 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 627 transitions. [2022-04-28 08:36:09,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:09,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:09,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:36:09,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:36:09,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 257 states have (on average 1.490272373540856) internal successors, (383), 257 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:09,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 387 transitions. [2022-04-28 08:36:09,981 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 387 transitions. Word has length 73 [2022-04-28 08:36:09,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:36:09,981 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 387 transitions. [2022-04-28 08:36:09,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:09,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 262 states and 387 transitions. [2022-04-28 08:36:10,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:36:10,342 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 387 transitions. [2022-04-28 08:36:10,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 08:36:10,342 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:36:10,342 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:36:10,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 08:36:10,343 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:36:10,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:36:10,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1101622726, now seen corresponding path program 1 times [2022-04-28 08:36:10,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:10,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1643740664] [2022-04-28 08:36:25,056 WARN L232 SmtUtils]: Spent 10.66s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:36:34,110 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:36:34,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1101622726, now seen corresponding path program 2 times [2022-04-28 08:36:34,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:36:34,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361682262] [2022-04-28 08:36:34,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:36:34,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:36:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:34,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:36:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:34,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {7129#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {7122#true} is VALID [2022-04-28 08:36:34,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {7122#true} assume true; {7122#true} is VALID [2022-04-28 08:36:34,325 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7122#true} {7122#true} #593#return; {7122#true} is VALID [2022-04-28 08:36:34,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {7122#true} call ULTIMATE.init(); {7129#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:36:34,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {7129#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {7122#true} is VALID [2022-04-28 08:36:34,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {7122#true} assume true; {7122#true} is VALID [2022-04-28 08:36:34,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7122#true} {7122#true} #593#return; {7122#true} is VALID [2022-04-28 08:36:34,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {7122#true} call #t~ret158 := main(); {7122#true} is VALID [2022-04-28 08:36:34,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {7122#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {7122#true} is VALID [2022-04-28 08:36:34,327 INFO L272 TraceCheckUtils]: 6: Hoare triple {7122#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {7122#true} is VALID [2022-04-28 08:36:34,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {7122#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {7122#true} is VALID [2022-04-28 08:36:34,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {7122#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {7122#true} is VALID [2022-04-28 08:36:34,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {7122#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {7122#true} is VALID [2022-04-28 08:36:34,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {7122#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7122#true} is VALID [2022-04-28 08:36:34,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {7122#true} assume !false; {7122#true} is VALID [2022-04-28 08:36:34,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {7122#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7122#true} is VALID [2022-04-28 08:36:34,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {7122#true} assume 12292 == #t~mem49;havoc #t~mem49; {7122#true} is VALID [2022-04-28 08:36:34,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {7122#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {7122#true} is VALID [2022-04-28 08:36:34,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {7122#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7122#true} is VALID [2022-04-28 08:36:34,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {7122#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7122#true} is VALID [2022-04-28 08:36:34,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {7122#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7122#true} is VALID [2022-04-28 08:36:34,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {7122#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {7122#true} is VALID [2022-04-28 08:36:34,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {7122#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7122#true} is VALID [2022-04-28 08:36:34,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {7122#true} assume !(0 == ~tmp___4~0); {7122#true} is VALID [2022-04-28 08:36:34,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {7122#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {7122#true} is VALID [2022-04-28 08:36:34,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {7122#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {7122#true} is VALID [2022-04-28 08:36:34,337 INFO L290 TraceCheckUtils]: 23: Hoare triple {7122#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7122#true} is VALID [2022-04-28 08:36:34,337 INFO L290 TraceCheckUtils]: 24: Hoare triple {7122#true} ~skip~0 := 0; {7122#true} is VALID [2022-04-28 08:36:34,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {7122#true} assume !false; {7122#true} is VALID [2022-04-28 08:36:34,339 INFO L290 TraceCheckUtils]: 26: Hoare triple {7122#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7122#true} is VALID [2022-04-28 08:36:34,339 INFO L290 TraceCheckUtils]: 27: Hoare triple {7122#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7122#true} is VALID [2022-04-28 08:36:34,340 INFO L290 TraceCheckUtils]: 28: Hoare triple {7122#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7122#true} is VALID [2022-04-28 08:36:34,340 INFO L290 TraceCheckUtils]: 29: Hoare triple {7122#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7122#true} is VALID [2022-04-28 08:36:34,340 INFO L290 TraceCheckUtils]: 30: Hoare triple {7122#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7122#true} is VALID [2022-04-28 08:36:34,340 INFO L290 TraceCheckUtils]: 31: Hoare triple {7122#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7122#true} is VALID [2022-04-28 08:36:34,340 INFO L290 TraceCheckUtils]: 32: Hoare triple {7122#true} assume 4368 == #t~mem54;havoc #t~mem54; {7122#true} is VALID [2022-04-28 08:36:34,340 INFO L290 TraceCheckUtils]: 33: Hoare triple {7122#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {7122#true} is VALID [2022-04-28 08:36:34,340 INFO L290 TraceCheckUtils]: 34: Hoare triple {7122#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7122#true} is VALID [2022-04-28 08:36:34,342 INFO L290 TraceCheckUtils]: 35: Hoare triple {7122#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:36:34,343 INFO L290 TraceCheckUtils]: 36: Hoare triple {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:36:34,343 INFO L290 TraceCheckUtils]: 37: Hoare triple {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:36:34,344 INFO L290 TraceCheckUtils]: 38: Hoare triple {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:36:34,344 INFO L290 TraceCheckUtils]: 39: Hoare triple {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:36:34,344 INFO L290 TraceCheckUtils]: 40: Hoare triple {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:36:34,345 INFO L290 TraceCheckUtils]: 41: Hoare triple {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:36:34,345 INFO L290 TraceCheckUtils]: 42: Hoare triple {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7128#(not (= |ssl3_connect_#t~mem50| 16384))} is VALID [2022-04-28 08:36:34,345 INFO L290 TraceCheckUtils]: 43: Hoare triple {7128#(not (= |ssl3_connect_#t~mem50| 16384))} assume 16384 == #t~mem50;havoc #t~mem50; {7123#false} is VALID [2022-04-28 08:36:34,346 INFO L290 TraceCheckUtils]: 44: Hoare triple {7123#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7123#false} is VALID [2022-04-28 08:36:34,346 INFO L290 TraceCheckUtils]: 45: Hoare triple {7123#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7123#false} is VALID [2022-04-28 08:36:34,346 INFO L290 TraceCheckUtils]: 46: Hoare triple {7123#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7123#false} is VALID [2022-04-28 08:36:34,346 INFO L290 TraceCheckUtils]: 47: Hoare triple {7123#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {7123#false} is VALID [2022-04-28 08:36:34,346 INFO L290 TraceCheckUtils]: 48: Hoare triple {7123#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7123#false} is VALID [2022-04-28 08:36:34,347 INFO L290 TraceCheckUtils]: 49: Hoare triple {7123#false} assume !(0 == ~tmp___4~0); {7123#false} is VALID [2022-04-28 08:36:34,347 INFO L290 TraceCheckUtils]: 50: Hoare triple {7123#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {7123#false} is VALID [2022-04-28 08:36:34,347 INFO L290 TraceCheckUtils]: 51: Hoare triple {7123#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {7123#false} is VALID [2022-04-28 08:36:34,347 INFO L290 TraceCheckUtils]: 52: Hoare triple {7123#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7123#false} is VALID [2022-04-28 08:36:34,347 INFO L290 TraceCheckUtils]: 53: Hoare triple {7123#false} ~skip~0 := 0; {7123#false} is VALID [2022-04-28 08:36:34,347 INFO L290 TraceCheckUtils]: 54: Hoare triple {7123#false} assume !false; {7123#false} is VALID [2022-04-28 08:36:34,348 INFO L290 TraceCheckUtils]: 55: Hoare triple {7123#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-28 08:36:34,349 INFO L290 TraceCheckUtils]: 56: Hoare triple {7123#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-28 08:36:34,349 INFO L290 TraceCheckUtils]: 57: Hoare triple {7123#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-28 08:36:34,349 INFO L290 TraceCheckUtils]: 58: Hoare triple {7123#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-28 08:36:34,349 INFO L290 TraceCheckUtils]: 59: Hoare triple {7123#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-28 08:36:34,349 INFO L290 TraceCheckUtils]: 60: Hoare triple {7123#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-28 08:36:34,349 INFO L290 TraceCheckUtils]: 61: Hoare triple {7123#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-28 08:36:34,349 INFO L290 TraceCheckUtils]: 62: Hoare triple {7123#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-28 08:36:34,349 INFO L290 TraceCheckUtils]: 63: Hoare triple {7123#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-28 08:36:34,350 INFO L290 TraceCheckUtils]: 64: Hoare triple {7123#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-28 08:36:34,350 INFO L290 TraceCheckUtils]: 65: Hoare triple {7123#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-28 08:36:34,350 INFO L290 TraceCheckUtils]: 66: Hoare triple {7123#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-28 08:36:34,350 INFO L290 TraceCheckUtils]: 67: Hoare triple {7123#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-28 08:36:34,350 INFO L290 TraceCheckUtils]: 68: Hoare triple {7123#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-28 08:36:34,350 INFO L290 TraceCheckUtils]: 69: Hoare triple {7123#false} assume 4432 == #t~mem62;havoc #t~mem62; {7123#false} is VALID [2022-04-28 08:36:34,350 INFO L290 TraceCheckUtils]: 70: Hoare triple {7123#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {7123#false} is VALID [2022-04-28 08:36:34,350 INFO L290 TraceCheckUtils]: 71: Hoare triple {7123#false} assume 5 == ~blastFlag~0; {7123#false} is VALID [2022-04-28 08:36:34,350 INFO L290 TraceCheckUtils]: 72: Hoare triple {7123#false} assume !false; {7123#false} is VALID [2022-04-28 08:36:34,352 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 08:36:34,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:36:34,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361682262] [2022-04-28 08:36:34,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361682262] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:36:34,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:36:34,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:36:34,353 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:36:34,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1643740664] [2022-04-28 08:36:34,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1643740664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:36:34,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:36:34,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:36:34,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912249921] [2022-04-28 08:36:34,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:36:34,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-28 08:36:34,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:36:34,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:34,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:36:34,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:36:34,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:34,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:36:34,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:36:34,420 INFO L87 Difference]: Start difference. First operand 262 states and 387 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:36,445 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:36:37,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:37,577 INFO L93 Difference]: Finished difference Result 668 states and 995 transitions. [2022-04-28 08:36:37,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:36:37,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-28 08:36:37,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:36:37,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-28 08:36:37,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:37,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-28 08:36:37,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-28 08:36:37,969 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-28 08:36:37,994 INFO L225 Difference]: With dead ends: 668 [2022-04-28 08:36:37,994 INFO L226 Difference]: Without dead ends: 422 [2022-04-28 08:36:37,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:36:38,002 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 119 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:36:38,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:36:38,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-04-28 08:36:38,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 264. [2022-04-28 08:36:38,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:36:38,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 422 states. Second operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:38,022 INFO L74 IsIncluded]: Start isIncluded. First operand 422 states. Second operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:38,023 INFO L87 Difference]: Start difference. First operand 422 states. Second operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:38,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:38,034 INFO L93 Difference]: Finished difference Result 422 states and 625 transitions. [2022-04-28 08:36:38,034 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 625 transitions. [2022-04-28 08:36:38,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:38,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:38,035 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 422 states. [2022-04-28 08:36:38,036 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 422 states. [2022-04-28 08:36:38,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:38,047 INFO L93 Difference]: Finished difference Result 422 states and 625 transitions. [2022-04-28 08:36:38,047 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 625 transitions. [2022-04-28 08:36:38,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:38,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:38,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:36:38,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:36:38,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:38,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 388 transitions. [2022-04-28 08:36:38,055 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 388 transitions. Word has length 73 [2022-04-28 08:36:38,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:36:38,055 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 388 transitions. [2022-04-28 08:36:38,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:38,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 388 transitions. [2022-04-28 08:36:38,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:36:38,372 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 388 transitions. [2022-04-28 08:36:38,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 08:36:38,372 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:36:38,373 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-04-28 08:36:38,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 08:36:38,373 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:36:38,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:36:38,373 INFO L85 PathProgramCache]: Analyzing trace with hash -155040791, now seen corresponding path program 1 times [2022-04-28 08:36:38,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:38,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1899775538] [2022-04-28 08:36:52,775 WARN L232 SmtUtils]: Spent 14.40s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:37:05,504 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:37:05,504 INFO L85 PathProgramCache]: Analyzing trace with hash -155040791, now seen corresponding path program 2 times [2022-04-28 08:37:05,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:37:05,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907533399] [2022-04-28 08:37:05,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:37:05,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:37:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:37:05,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:37:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:37:05,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {9849#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {9842#true} is VALID [2022-04-28 08:37:05,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {9842#true} assume true; {9842#true} is VALID [2022-04-28 08:37:05,716 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9842#true} {9842#true} #593#return; {9842#true} is VALID [2022-04-28 08:37:05,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {9842#true} call ULTIMATE.init(); {9849#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:37:05,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {9849#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {9842#true} is VALID [2022-04-28 08:37:05,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {9842#true} assume true; {9842#true} is VALID [2022-04-28 08:37:05,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9842#true} {9842#true} #593#return; {9842#true} is VALID [2022-04-28 08:37:05,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {9842#true} call #t~ret158 := main(); {9842#true} is VALID [2022-04-28 08:37:05,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {9842#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {9842#true} is VALID [2022-04-28 08:37:05,719 INFO L272 TraceCheckUtils]: 6: Hoare triple {9842#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {9842#true} is VALID [2022-04-28 08:37:05,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {9842#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {9842#true} is VALID [2022-04-28 08:37:05,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {9842#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {9842#true} is VALID [2022-04-28 08:37:05,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {9842#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {9842#true} is VALID [2022-04-28 08:37:05,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {9842#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9842#true} is VALID [2022-04-28 08:37:05,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {9842#true} assume !false; {9842#true} is VALID [2022-04-28 08:37:05,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {9842#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9842#true} is VALID [2022-04-28 08:37:05,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {9842#true} assume 12292 == #t~mem49;havoc #t~mem49; {9842#true} is VALID [2022-04-28 08:37:05,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {9842#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {9842#true} is VALID [2022-04-28 08:37:05,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {9842#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9842#true} is VALID [2022-04-28 08:37:05,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {9842#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9842#true} is VALID [2022-04-28 08:37:05,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {9842#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9842#true} is VALID [2022-04-28 08:37:05,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {9842#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {9842#true} is VALID [2022-04-28 08:37:05,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {9842#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9842#true} is VALID [2022-04-28 08:37:05,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {9842#true} assume !(0 == ~tmp___4~0); {9842#true} is VALID [2022-04-28 08:37:05,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {9842#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {9842#true} is VALID [2022-04-28 08:37:05,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {9842#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {9842#true} is VALID [2022-04-28 08:37:05,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {9842#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9842#true} is VALID [2022-04-28 08:37:05,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {9842#true} ~skip~0 := 0; {9842#true} is VALID [2022-04-28 08:37:05,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {9842#true} assume !false; {9842#true} is VALID [2022-04-28 08:37:05,721 INFO L290 TraceCheckUtils]: 26: Hoare triple {9842#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9842#true} is VALID [2022-04-28 08:37:05,721 INFO L290 TraceCheckUtils]: 27: Hoare triple {9842#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9842#true} is VALID [2022-04-28 08:37:05,721 INFO L290 TraceCheckUtils]: 28: Hoare triple {9842#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9842#true} is VALID [2022-04-28 08:37:05,721 INFO L290 TraceCheckUtils]: 29: Hoare triple {9842#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9842#true} is VALID [2022-04-28 08:37:05,721 INFO L290 TraceCheckUtils]: 30: Hoare triple {9842#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9842#true} is VALID [2022-04-28 08:37:05,721 INFO L290 TraceCheckUtils]: 31: Hoare triple {9842#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9842#true} is VALID [2022-04-28 08:37:05,721 INFO L290 TraceCheckUtils]: 32: Hoare triple {9842#true} assume 4368 == #t~mem54;havoc #t~mem54; {9842#true} is VALID [2022-04-28 08:37:05,721 INFO L290 TraceCheckUtils]: 33: Hoare triple {9842#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {9842#true} is VALID [2022-04-28 08:37:05,721 INFO L290 TraceCheckUtils]: 34: Hoare triple {9842#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9842#true} is VALID [2022-04-28 08:37:05,723 INFO L290 TraceCheckUtils]: 35: Hoare triple {9842#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:37:05,723 INFO L290 TraceCheckUtils]: 36: Hoare triple {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:37:05,723 INFO L290 TraceCheckUtils]: 37: Hoare triple {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:37:05,724 INFO L290 TraceCheckUtils]: 38: Hoare triple {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:37:05,724 INFO L290 TraceCheckUtils]: 39: Hoare triple {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:37:05,725 INFO L290 TraceCheckUtils]: 40: Hoare triple {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:37:05,725 INFO L290 TraceCheckUtils]: 41: Hoare triple {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:37:05,725 INFO L290 TraceCheckUtils]: 42: Hoare triple {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:37:05,726 INFO L290 TraceCheckUtils]: 43: Hoare triple {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9848#(= |ssl3_connect_#t~mem51| 4384)} is VALID [2022-04-28 08:37:05,726 INFO L290 TraceCheckUtils]: 44: Hoare triple {9848#(= |ssl3_connect_#t~mem51| 4384)} assume 4096 == #t~mem51;havoc #t~mem51; {9843#false} is VALID [2022-04-28 08:37:05,726 INFO L290 TraceCheckUtils]: 45: Hoare triple {9843#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9843#false} is VALID [2022-04-28 08:37:05,726 INFO L290 TraceCheckUtils]: 46: Hoare triple {9843#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9843#false} is VALID [2022-04-28 08:37:05,726 INFO L290 TraceCheckUtils]: 47: Hoare triple {9843#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9843#false} is VALID [2022-04-28 08:37:05,727 INFO L290 TraceCheckUtils]: 48: Hoare triple {9843#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {9843#false} is VALID [2022-04-28 08:37:05,727 INFO L290 TraceCheckUtils]: 49: Hoare triple {9843#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9843#false} is VALID [2022-04-28 08:37:05,732 INFO L290 TraceCheckUtils]: 50: Hoare triple {9843#false} assume !(0 == ~tmp___4~0); {9843#false} is VALID [2022-04-28 08:37:05,732 INFO L290 TraceCheckUtils]: 51: Hoare triple {9843#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {9843#false} is VALID [2022-04-28 08:37:05,732 INFO L290 TraceCheckUtils]: 52: Hoare triple {9843#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {9843#false} is VALID [2022-04-28 08:37:05,732 INFO L290 TraceCheckUtils]: 53: Hoare triple {9843#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9843#false} is VALID [2022-04-28 08:37:05,732 INFO L290 TraceCheckUtils]: 54: Hoare triple {9843#false} ~skip~0 := 0; {9843#false} is VALID [2022-04-28 08:37:05,732 INFO L290 TraceCheckUtils]: 55: Hoare triple {9843#false} assume !false; {9843#false} is VALID [2022-04-28 08:37:05,733 INFO L290 TraceCheckUtils]: 56: Hoare triple {9843#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-28 08:37:05,733 INFO L290 TraceCheckUtils]: 57: Hoare triple {9843#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-28 08:37:05,733 INFO L290 TraceCheckUtils]: 58: Hoare triple {9843#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-28 08:37:05,733 INFO L290 TraceCheckUtils]: 59: Hoare triple {9843#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-28 08:37:05,733 INFO L290 TraceCheckUtils]: 60: Hoare triple {9843#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-28 08:37:05,733 INFO L290 TraceCheckUtils]: 61: Hoare triple {9843#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-28 08:37:05,733 INFO L290 TraceCheckUtils]: 62: Hoare triple {9843#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-28 08:37:05,733 INFO L290 TraceCheckUtils]: 63: Hoare triple {9843#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-28 08:37:05,733 INFO L290 TraceCheckUtils]: 64: Hoare triple {9843#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-28 08:37:05,733 INFO L290 TraceCheckUtils]: 65: Hoare triple {9843#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-28 08:37:05,734 INFO L290 TraceCheckUtils]: 66: Hoare triple {9843#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-28 08:37:05,734 INFO L290 TraceCheckUtils]: 67: Hoare triple {9843#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-28 08:37:05,735 INFO L290 TraceCheckUtils]: 68: Hoare triple {9843#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-28 08:37:05,735 INFO L290 TraceCheckUtils]: 69: Hoare triple {9843#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-28 08:37:05,737 INFO L290 TraceCheckUtils]: 70: Hoare triple {9843#false} assume 4432 == #t~mem62;havoc #t~mem62; {9843#false} is VALID [2022-04-28 08:37:05,738 INFO L290 TraceCheckUtils]: 71: Hoare triple {9843#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {9843#false} is VALID [2022-04-28 08:37:05,738 INFO L290 TraceCheckUtils]: 72: Hoare triple {9843#false} assume 5 == ~blastFlag~0; {9843#false} is VALID [2022-04-28 08:37:05,738 INFO L290 TraceCheckUtils]: 73: Hoare triple {9843#false} assume !false; {9843#false} is VALID [2022-04-28 08:37:05,738 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 08:37:05,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:37:05,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907533399] [2022-04-28 08:37:05,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907533399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:37:05,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:37:05,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:37:05,739 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:37:05,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1899775538] [2022-04-28 08:37:05,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1899775538] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:37:05,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:37:05,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:37:05,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177685822] [2022-04-28 08:37:05,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:37:05,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-28 08:37:05,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:37:05,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:05,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:37:05,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:37:05,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:37:05,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:37:05,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:37:05,805 INFO L87 Difference]: Start difference. First operand 264 states and 388 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:07,832 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:37:08,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:08,913 INFO L93 Difference]: Finished difference Result 415 states and 612 transitions. [2022-04-28 08:37:08,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:37:08,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-28 08:37:08,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:37:08,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 382 transitions. [2022-04-28 08:37:08,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:08,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 382 transitions. [2022-04-28 08:37:08,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 382 transitions. [2022-04-28 08:37:09,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 382 edges. 382 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:37:09,207 INFO L225 Difference]: With dead ends: 415 [2022-04-28 08:37:09,207 INFO L226 Difference]: Without dead ends: 280 [2022-04-28 08:37:09,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:37:09,208 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 33 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:37:09,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 480 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 350 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:37:09,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-28 08:37:09,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 264. [2022-04-28 08:37:09,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:37:09,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 280 states. Second operand has 264 states, 259 states have (on average 1.4787644787644787) internal successors, (383), 259 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:09,221 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand has 264 states, 259 states have (on average 1.4787644787644787) internal successors, (383), 259 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:09,221 INFO L87 Difference]: Start difference. First operand 280 states. Second operand has 264 states, 259 states have (on average 1.4787644787644787) internal successors, (383), 259 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:09,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:09,227 INFO L93 Difference]: Finished difference Result 280 states and 408 transitions. [2022-04-28 08:37:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 408 transitions. [2022-04-28 08:37:09,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:37:09,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:37:09,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.4787644787644787) internal successors, (383), 259 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 280 states. [2022-04-28 08:37:09,229 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.4787644787644787) internal successors, (383), 259 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 280 states. [2022-04-28 08:37:09,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:09,235 INFO L93 Difference]: Finished difference Result 280 states and 408 transitions. [2022-04-28 08:37:09,235 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 408 transitions. [2022-04-28 08:37:09,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:37:09,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:37:09,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:37:09,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:37:09,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.4787644787644787) internal successors, (383), 259 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:09,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 387 transitions. [2022-04-28 08:37:09,242 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 387 transitions. Word has length 74 [2022-04-28 08:37:09,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:37:09,243 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 387 transitions. [2022-04-28 08:37:09,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:09,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 387 transitions. [2022-04-28 08:37:09,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:37:09,612 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 387 transitions. [2022-04-28 08:37:09,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 08:37:09,612 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:37:09,612 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:37:09,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 08:37:09,615 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:37:09,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:37:09,616 INFO L85 PathProgramCache]: Analyzing trace with hash -400323519, now seen corresponding path program 1 times [2022-04-28 08:37:09,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:37:09,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1071542038] [2022-04-28 08:37:21,380 WARN L232 SmtUtils]: Spent 7.54s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:37:28,349 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:37:28,350 INFO L85 PathProgramCache]: Analyzing trace with hash -400323519, now seen corresponding path program 2 times [2022-04-28 08:37:28,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:37:28,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541848223] [2022-04-28 08:37:28,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:37:28,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:37:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:37:28,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:37:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:37:28,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {11779#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {11772#true} is VALID [2022-04-28 08:37:28,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {11772#true} assume true; {11772#true} is VALID [2022-04-28 08:37:28,522 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11772#true} {11772#true} #593#return; {11772#true} is VALID [2022-04-28 08:37:28,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {11772#true} call ULTIMATE.init(); {11779#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:37:28,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {11779#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {11772#true} is VALID [2022-04-28 08:37:28,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {11772#true} assume true; {11772#true} is VALID [2022-04-28 08:37:28,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11772#true} {11772#true} #593#return; {11772#true} is VALID [2022-04-28 08:37:28,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {11772#true} call #t~ret158 := main(); {11772#true} is VALID [2022-04-28 08:37:28,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {11772#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {11772#true} is VALID [2022-04-28 08:37:28,523 INFO L272 TraceCheckUtils]: 6: Hoare triple {11772#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {11772#true} is VALID [2022-04-28 08:37:28,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {11772#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {11772#true} is VALID [2022-04-28 08:37:28,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {11772#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {11772#true} is VALID [2022-04-28 08:37:28,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {11772#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {11772#true} is VALID [2022-04-28 08:37:28,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {11772#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11772#true} is VALID [2022-04-28 08:37:28,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {11772#true} assume !false; {11772#true} is VALID [2022-04-28 08:37:28,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {11772#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11772#true} is VALID [2022-04-28 08:37:28,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {11772#true} assume 12292 == #t~mem49;havoc #t~mem49; {11772#true} is VALID [2022-04-28 08:37:28,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {11772#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {11772#true} is VALID [2022-04-28 08:37:28,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {11772#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11772#true} is VALID [2022-04-28 08:37:28,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {11772#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11772#true} is VALID [2022-04-28 08:37:28,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {11772#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11772#true} is VALID [2022-04-28 08:37:28,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {11772#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {11772#true} is VALID [2022-04-28 08:37:28,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {11772#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {11772#true} is VALID [2022-04-28 08:37:28,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {11772#true} assume !(0 == ~tmp___4~0); {11772#true} is VALID [2022-04-28 08:37:28,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {11772#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {11772#true} is VALID [2022-04-28 08:37:28,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {11772#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {11772#true} is VALID [2022-04-28 08:37:28,525 INFO L290 TraceCheckUtils]: 23: Hoare triple {11772#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11772#true} is VALID [2022-04-28 08:37:28,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {11772#true} ~skip~0 := 0; {11772#true} is VALID [2022-04-28 08:37:28,525 INFO L290 TraceCheckUtils]: 25: Hoare triple {11772#true} assume !false; {11772#true} is VALID [2022-04-28 08:37:28,525 INFO L290 TraceCheckUtils]: 26: Hoare triple {11772#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11772#true} is VALID [2022-04-28 08:37:28,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {11772#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11772#true} is VALID [2022-04-28 08:37:28,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {11772#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11772#true} is VALID [2022-04-28 08:37:28,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {11772#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11772#true} is VALID [2022-04-28 08:37:28,526 INFO L290 TraceCheckUtils]: 30: Hoare triple {11772#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11772#true} is VALID [2022-04-28 08:37:28,526 INFO L290 TraceCheckUtils]: 31: Hoare triple {11772#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11772#true} is VALID [2022-04-28 08:37:28,526 INFO L290 TraceCheckUtils]: 32: Hoare triple {11772#true} assume 4368 == #t~mem54;havoc #t~mem54; {11772#true} is VALID [2022-04-28 08:37:28,526 INFO L290 TraceCheckUtils]: 33: Hoare triple {11772#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {11772#true} is VALID [2022-04-28 08:37:28,526 INFO L290 TraceCheckUtils]: 34: Hoare triple {11772#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11772#true} is VALID [2022-04-28 08:37:28,527 INFO L290 TraceCheckUtils]: 35: Hoare triple {11772#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:37:28,528 INFO L290 TraceCheckUtils]: 36: Hoare triple {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:37:28,528 INFO L290 TraceCheckUtils]: 37: Hoare triple {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:37:28,529 INFO L290 TraceCheckUtils]: 38: Hoare triple {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:37:28,529 INFO L290 TraceCheckUtils]: 39: Hoare triple {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:37:28,530 INFO L290 TraceCheckUtils]: 40: Hoare triple {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:37:28,530 INFO L290 TraceCheckUtils]: 41: Hoare triple {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:37:28,530 INFO L290 TraceCheckUtils]: 42: Hoare triple {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:37:28,531 INFO L290 TraceCheckUtils]: 43: Hoare triple {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:37:28,531 INFO L290 TraceCheckUtils]: 44: Hoare triple {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11778#(= |ssl3_connect_#t~mem52| 4384)} is VALID [2022-04-28 08:37:28,532 INFO L290 TraceCheckUtils]: 45: Hoare triple {11778#(= |ssl3_connect_#t~mem52| 4384)} assume 20480 == #t~mem52;havoc #t~mem52; {11773#false} is VALID [2022-04-28 08:37:28,532 INFO L290 TraceCheckUtils]: 46: Hoare triple {11773#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11773#false} is VALID [2022-04-28 08:37:28,532 INFO L290 TraceCheckUtils]: 47: Hoare triple {11773#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11773#false} is VALID [2022-04-28 08:37:28,532 INFO L290 TraceCheckUtils]: 48: Hoare triple {11773#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11773#false} is VALID [2022-04-28 08:37:28,532 INFO L290 TraceCheckUtils]: 49: Hoare triple {11773#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {11773#false} is VALID [2022-04-28 08:37:28,532 INFO L290 TraceCheckUtils]: 50: Hoare triple {11773#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {11773#false} is VALID [2022-04-28 08:37:28,532 INFO L290 TraceCheckUtils]: 51: Hoare triple {11773#false} assume !(0 == ~tmp___4~0); {11773#false} is VALID [2022-04-28 08:37:28,532 INFO L290 TraceCheckUtils]: 52: Hoare triple {11773#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {11773#false} is VALID [2022-04-28 08:37:28,532 INFO L290 TraceCheckUtils]: 53: Hoare triple {11773#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {11773#false} is VALID [2022-04-28 08:37:28,533 INFO L290 TraceCheckUtils]: 54: Hoare triple {11773#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11773#false} is VALID [2022-04-28 08:37:28,533 INFO L290 TraceCheckUtils]: 55: Hoare triple {11773#false} ~skip~0 := 0; {11773#false} is VALID [2022-04-28 08:37:28,534 INFO L290 TraceCheckUtils]: 56: Hoare triple {11773#false} assume !false; {11773#false} is VALID [2022-04-28 08:37:28,534 INFO L290 TraceCheckUtils]: 57: Hoare triple {11773#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-28 08:37:28,534 INFO L290 TraceCheckUtils]: 58: Hoare triple {11773#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-28 08:37:28,534 INFO L290 TraceCheckUtils]: 59: Hoare triple {11773#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-28 08:37:28,534 INFO L290 TraceCheckUtils]: 60: Hoare triple {11773#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-28 08:37:28,534 INFO L290 TraceCheckUtils]: 61: Hoare triple {11773#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-28 08:37:28,534 INFO L290 TraceCheckUtils]: 62: Hoare triple {11773#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-28 08:37:28,534 INFO L290 TraceCheckUtils]: 63: Hoare triple {11773#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-28 08:37:28,534 INFO L290 TraceCheckUtils]: 64: Hoare triple {11773#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-28 08:37:28,534 INFO L290 TraceCheckUtils]: 65: Hoare triple {11773#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-28 08:37:28,534 INFO L290 TraceCheckUtils]: 66: Hoare triple {11773#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-28 08:37:28,535 INFO L290 TraceCheckUtils]: 67: Hoare triple {11773#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-28 08:37:28,535 INFO L290 TraceCheckUtils]: 68: Hoare triple {11773#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-28 08:37:28,535 INFO L290 TraceCheckUtils]: 69: Hoare triple {11773#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-28 08:37:28,535 INFO L290 TraceCheckUtils]: 70: Hoare triple {11773#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-28 08:37:28,535 INFO L290 TraceCheckUtils]: 71: Hoare triple {11773#false} assume 4432 == #t~mem62;havoc #t~mem62; {11773#false} is VALID [2022-04-28 08:37:28,535 INFO L290 TraceCheckUtils]: 72: Hoare triple {11773#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {11773#false} is VALID [2022-04-28 08:37:28,535 INFO L290 TraceCheckUtils]: 73: Hoare triple {11773#false} assume 5 == ~blastFlag~0; {11773#false} is VALID [2022-04-28 08:37:28,535 INFO L290 TraceCheckUtils]: 74: Hoare triple {11773#false} assume !false; {11773#false} is VALID [2022-04-28 08:37:28,536 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 08:37:28,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:37:28,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541848223] [2022-04-28 08:37:28,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541848223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:37:28,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:37:28,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:37:28,536 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:37:28,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1071542038] [2022-04-28 08:37:28,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1071542038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:37:28,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:37:28,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:37:28,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528035719] [2022-04-28 08:37:28,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:37:28,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-28 08:37:28,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:37:28,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:28,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:37:28,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:37:28,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:37:28,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:37:28,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:37:28,606 INFO L87 Difference]: Start difference. First operand 264 states and 387 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:30,627 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:37:31,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:31,588 INFO L93 Difference]: Finished difference Result 415 states and 610 transitions. [2022-04-28 08:37:31,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:37:31,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-28 08:37:31,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:37:31,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:31,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 381 transitions. [2022-04-28 08:37:31,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:31,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 381 transitions. [2022-04-28 08:37:31,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 381 transitions. [2022-04-28 08:37:31,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 381 edges. 381 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:37:31,865 INFO L225 Difference]: With dead ends: 415 [2022-04-28 08:37:31,865 INFO L226 Difference]: Without dead ends: 280 [2022-04-28 08:37:31,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:37:31,866 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 31 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:37:31,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 478 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 349 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:37:31,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-28 08:37:31,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 264. [2022-04-28 08:37:31,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:37:31,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 280 states. Second operand has 264 states, 259 states have (on average 1.4749034749034748) internal successors, (382), 259 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:31,880 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand has 264 states, 259 states have (on average 1.4749034749034748) internal successors, (382), 259 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:31,880 INFO L87 Difference]: Start difference. First operand 280 states. Second operand has 264 states, 259 states have (on average 1.4749034749034748) internal successors, (382), 259 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:31,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:31,886 INFO L93 Difference]: Finished difference Result 280 states and 407 transitions. [2022-04-28 08:37:31,886 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 407 transitions. [2022-04-28 08:37:31,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:37:31,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:37:31,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.4749034749034748) internal successors, (382), 259 states have internal predecessors, (382), 3 states have call successors, (3), 3 states 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-28 08:37:31,888 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.4749034749034748) internal successors, (382), 259 states have internal predecessors, (382), 3 states have call successors, (3), 3 states 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-28 08:37:31,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:31,893 INFO L93 Difference]: Finished difference Result 280 states and 407 transitions. [2022-04-28 08:37:31,893 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 407 transitions. [2022-04-28 08:37:31,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:37:31,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:37:31,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:37:31,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:37:31,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.4749034749034748) internal successors, (382), 259 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:31,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 386 transitions. [2022-04-28 08:37:31,900 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 386 transitions. Word has length 75 [2022-04-28 08:37:31,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:37:31,900 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 386 transitions. [2022-04-28 08:37:31,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:31,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 386 transitions. [2022-04-28 08:37:32,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 386 edges. 386 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:37:32,187 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 386 transitions. [2022-04-28 08:37:32,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 08:37:32,187 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:37:32,188 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:37:32,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 08:37:32,188 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:37:32,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:37:32,188 INFO L85 PathProgramCache]: Analyzing trace with hash 642427140, now seen corresponding path program 1 times [2022-04-28 08:37:32,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:37:32,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1386036083] [2022-04-28 08:37:46,264 WARN L232 SmtUtils]: Spent 8.96s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:37:53,178 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:37:53,178 INFO L85 PathProgramCache]: Analyzing trace with hash 642427140, now seen corresponding path program 2 times [2022-04-28 08:37:53,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:37:53,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443905011] [2022-04-28 08:37:53,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:37:53,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:37:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:37:53,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:37:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:37:53,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {13709#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {13702#true} is VALID [2022-04-28 08:37:53,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {13702#true} assume true; {13702#true} is VALID [2022-04-28 08:37:53,380 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13702#true} {13702#true} #593#return; {13702#true} is VALID [2022-04-28 08:37:53,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {13702#true} call ULTIMATE.init(); {13709#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:37:53,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {13709#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {13702#true} is VALID [2022-04-28 08:37:53,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {13702#true} assume true; {13702#true} is VALID [2022-04-28 08:37:53,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13702#true} {13702#true} #593#return; {13702#true} is VALID [2022-04-28 08:37:53,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {13702#true} call #t~ret158 := main(); {13702#true} is VALID [2022-04-28 08:37:53,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {13702#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {13702#true} is VALID [2022-04-28 08:37:53,381 INFO L272 TraceCheckUtils]: 6: Hoare triple {13702#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {13702#true} is VALID [2022-04-28 08:37:53,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {13702#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {13702#true} is VALID [2022-04-28 08:37:53,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {13702#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {13702#true} is VALID [2022-04-28 08:37:53,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {13702#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {13702#true} is VALID [2022-04-28 08:37:53,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {13702#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {13702#true} is VALID [2022-04-28 08:37:53,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {13702#true} assume !false; {13702#true} is VALID [2022-04-28 08:37:53,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {13702#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13702#true} is VALID [2022-04-28 08:37:53,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {13702#true} assume 12292 == #t~mem49;havoc #t~mem49; {13702#true} is VALID [2022-04-28 08:37:53,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {13702#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {13702#true} is VALID [2022-04-28 08:37:53,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {13702#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13702#true} is VALID [2022-04-28 08:37:53,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {13702#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13702#true} is VALID [2022-04-28 08:37:53,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {13702#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {13702#true} is VALID [2022-04-28 08:37:53,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {13702#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {13702#true} is VALID [2022-04-28 08:37:53,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {13702#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {13702#true} is VALID [2022-04-28 08:37:53,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {13702#true} assume !(0 == ~tmp___4~0); {13702#true} is VALID [2022-04-28 08:37:53,382 INFO L290 TraceCheckUtils]: 21: Hoare triple {13702#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {13702#true} is VALID [2022-04-28 08:37:53,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {13702#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {13702#true} is VALID [2022-04-28 08:37:53,383 INFO L290 TraceCheckUtils]: 23: Hoare triple {13702#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {13702#true} is VALID [2022-04-28 08:37:53,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {13702#true} ~skip~0 := 0; {13702#true} is VALID [2022-04-28 08:37:53,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {13702#true} assume !false; {13702#true} is VALID [2022-04-28 08:37:53,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {13702#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13702#true} is VALID [2022-04-28 08:37:53,383 INFO L290 TraceCheckUtils]: 27: Hoare triple {13702#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13702#true} is VALID [2022-04-28 08:37:53,383 INFO L290 TraceCheckUtils]: 28: Hoare triple {13702#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13702#true} is VALID [2022-04-28 08:37:53,383 INFO L290 TraceCheckUtils]: 29: Hoare triple {13702#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13702#true} is VALID [2022-04-28 08:37:53,383 INFO L290 TraceCheckUtils]: 30: Hoare triple {13702#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13702#true} is VALID [2022-04-28 08:37:53,383 INFO L290 TraceCheckUtils]: 31: Hoare triple {13702#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13702#true} is VALID [2022-04-28 08:37:53,383 INFO L290 TraceCheckUtils]: 32: Hoare triple {13702#true} assume 4368 == #t~mem54;havoc #t~mem54; {13702#true} is VALID [2022-04-28 08:37:53,383 INFO L290 TraceCheckUtils]: 33: Hoare triple {13702#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {13702#true} is VALID [2022-04-28 08:37:53,383 INFO L290 TraceCheckUtils]: 34: Hoare triple {13702#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {13702#true} is VALID [2022-04-28 08:37:53,385 INFO L290 TraceCheckUtils]: 35: Hoare triple {13702#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:37:53,385 INFO L290 TraceCheckUtils]: 36: Hoare triple {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:37:53,386 INFO L290 TraceCheckUtils]: 37: Hoare triple {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:37:53,386 INFO L290 TraceCheckUtils]: 38: Hoare triple {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:37:53,386 INFO L290 TraceCheckUtils]: 39: Hoare triple {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:37:53,387 INFO L290 TraceCheckUtils]: 40: Hoare triple {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:37:53,387 INFO L290 TraceCheckUtils]: 41: Hoare triple {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:37:53,388 INFO L290 TraceCheckUtils]: 42: Hoare triple {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:37:53,388 INFO L290 TraceCheckUtils]: 43: Hoare triple {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:37:53,388 INFO L290 TraceCheckUtils]: 44: Hoare triple {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:37:53,389 INFO L290 TraceCheckUtils]: 45: Hoare triple {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13708#(= |ssl3_connect_#t~mem53| 4384)} is VALID [2022-04-28 08:37:53,389 INFO L290 TraceCheckUtils]: 46: Hoare triple {13708#(= |ssl3_connect_#t~mem53| 4384)} assume 4099 == #t~mem53;havoc #t~mem53; {13703#false} is VALID [2022-04-28 08:37:53,389 INFO L290 TraceCheckUtils]: 47: Hoare triple {13703#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13703#false} is VALID [2022-04-28 08:37:53,389 INFO L290 TraceCheckUtils]: 48: Hoare triple {13703#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13703#false} is VALID [2022-04-28 08:37:53,389 INFO L290 TraceCheckUtils]: 49: Hoare triple {13703#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {13703#false} is VALID [2022-04-28 08:37:53,390 INFO L290 TraceCheckUtils]: 50: Hoare triple {13703#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {13703#false} is VALID [2022-04-28 08:37:53,390 INFO L290 TraceCheckUtils]: 51: Hoare triple {13703#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {13703#false} is VALID [2022-04-28 08:37:53,390 INFO L290 TraceCheckUtils]: 52: Hoare triple {13703#false} assume !(0 == ~tmp___4~0); {13703#false} is VALID [2022-04-28 08:37:53,390 INFO L290 TraceCheckUtils]: 53: Hoare triple {13703#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {13703#false} is VALID [2022-04-28 08:37:53,390 INFO L290 TraceCheckUtils]: 54: Hoare triple {13703#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {13703#false} is VALID [2022-04-28 08:37:53,390 INFO L290 TraceCheckUtils]: 55: Hoare triple {13703#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {13703#false} is VALID [2022-04-28 08:37:53,390 INFO L290 TraceCheckUtils]: 56: Hoare triple {13703#false} ~skip~0 := 0; {13703#false} is VALID [2022-04-28 08:37:53,390 INFO L290 TraceCheckUtils]: 57: Hoare triple {13703#false} assume !false; {13703#false} is VALID [2022-04-28 08:37:53,390 INFO L290 TraceCheckUtils]: 58: Hoare triple {13703#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-28 08:37:53,390 INFO L290 TraceCheckUtils]: 59: Hoare triple {13703#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-28 08:37:53,390 INFO L290 TraceCheckUtils]: 60: Hoare triple {13703#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-28 08:37:53,390 INFO L290 TraceCheckUtils]: 61: Hoare triple {13703#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-28 08:37:53,391 INFO L290 TraceCheckUtils]: 62: Hoare triple {13703#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-28 08:37:53,391 INFO L290 TraceCheckUtils]: 63: Hoare triple {13703#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-28 08:37:53,391 INFO L290 TraceCheckUtils]: 64: Hoare triple {13703#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-28 08:37:53,391 INFO L290 TraceCheckUtils]: 65: Hoare triple {13703#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-28 08:37:53,391 INFO L290 TraceCheckUtils]: 66: Hoare triple {13703#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-28 08:37:53,391 INFO L290 TraceCheckUtils]: 67: Hoare triple {13703#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-28 08:37:53,391 INFO L290 TraceCheckUtils]: 68: Hoare triple {13703#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-28 08:37:53,391 INFO L290 TraceCheckUtils]: 69: Hoare triple {13703#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-28 08:37:53,391 INFO L290 TraceCheckUtils]: 70: Hoare triple {13703#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-28 08:37:53,391 INFO L290 TraceCheckUtils]: 71: Hoare triple {13703#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-28 08:37:53,391 INFO L290 TraceCheckUtils]: 72: Hoare triple {13703#false} assume 4432 == #t~mem62;havoc #t~mem62; {13703#false} is VALID [2022-04-28 08:37:53,392 INFO L290 TraceCheckUtils]: 73: Hoare triple {13703#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {13703#false} is VALID [2022-04-28 08:37:53,392 INFO L290 TraceCheckUtils]: 74: Hoare triple {13703#false} assume 5 == ~blastFlag~0; {13703#false} is VALID [2022-04-28 08:37:53,392 INFO L290 TraceCheckUtils]: 75: Hoare triple {13703#false} assume !false; {13703#false} is VALID [2022-04-28 08:37:53,392 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 08:37:53,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:37:53,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443905011] [2022-04-28 08:37:53,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443905011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:37:53,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:37:53,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:37:53,393 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:37:53,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1386036083] [2022-04-28 08:37:53,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1386036083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:37:53,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:37:53,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:37:53,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491516555] [2022-04-28 08:37:53,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:37:53,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-28 08:37:53,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:37:53,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:53,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:37:53,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:37:53,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:37:53,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:37:53,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:37:53,462 INFO L87 Difference]: Start difference. First operand 264 states and 386 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:55,487 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:37:56,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:56,326 INFO L93 Difference]: Finished difference Result 406 states and 597 transitions. [2022-04-28 08:37:56,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:37:56,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-28 08:37:56,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:37:56,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 369 transitions. [2022-04-28 08:37:56,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:56,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 369 transitions. [2022-04-28 08:37:56,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 369 transitions. [2022-04-28 08:37:56,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 369 edges. 369 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:37:56,645 INFO L225 Difference]: With dead ends: 406 [2022-04-28 08:37:56,645 INFO L226 Difference]: Without dead ends: 271 [2022-04-28 08:37:56,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:37:56,646 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 22 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:37:56,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 464 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 326 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:37:56,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-04-28 08:37:56,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 264. [2022-04-28 08:37:56,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:37:56,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 271 states. Second operand has 264 states, 259 states have (on average 1.471042471042471) internal successors, (381), 259 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:56,657 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states. Second operand has 264 states, 259 states have (on average 1.471042471042471) internal successors, (381), 259 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:56,658 INFO L87 Difference]: Start difference. First operand 271 states. Second operand has 264 states, 259 states have (on average 1.471042471042471) internal successors, (381), 259 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:56,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:56,663 INFO L93 Difference]: Finished difference Result 271 states and 395 transitions. [2022-04-28 08:37:56,663 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 395 transitions. [2022-04-28 08:37:56,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:37:56,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:37:56,664 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.471042471042471) internal successors, (381), 259 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 271 states. [2022-04-28 08:37:56,665 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.471042471042471) internal successors, (381), 259 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 271 states. [2022-04-28 08:37:56,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:56,671 INFO L93 Difference]: Finished difference Result 271 states and 395 transitions. [2022-04-28 08:37:56,671 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 395 transitions. [2022-04-28 08:37:56,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:37:56,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:37:56,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:37:56,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:37:56,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.471042471042471) internal successors, (381), 259 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:56,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 385 transitions. [2022-04-28 08:37:56,678 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 385 transitions. Word has length 76 [2022-04-28 08:37:56,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:37:56,678 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 385 transitions. [2022-04-28 08:37:56,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:56,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 385 transitions. [2022-04-28 08:37:57,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 385 edges. 385 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:37:57,007 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 385 transitions. [2022-04-28 08:37:57,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 08:37:57,011 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:37:57,011 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-28 08:37:57,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 08:37:57,012 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:37:57,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:37:57,012 INFO L85 PathProgramCache]: Analyzing trace with hash -790014140, now seen corresponding path program 1 times [2022-04-28 08:37:57,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:37:57,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1643135697] [2022-04-28 08:37:57,012 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:37:57,012 INFO L85 PathProgramCache]: Analyzing trace with hash -790014140, now seen corresponding path program 2 times [2022-04-28 08:37:57,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:37:57,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183074708] [2022-04-28 08:37:57,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:37:57,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:37:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:37:57,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:37:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:37:57,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {15602#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {15596#true} is VALID [2022-04-28 08:37:57,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {15596#true} assume true; {15596#true} is VALID [2022-04-28 08:37:57,171 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15596#true} {15596#true} #593#return; {15596#true} is VALID [2022-04-28 08:37:57,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {15596#true} call ULTIMATE.init(); {15602#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:37:57,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {15602#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {15596#true} is VALID [2022-04-28 08:37:57,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {15596#true} assume true; {15596#true} is VALID [2022-04-28 08:37:57,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15596#true} {15596#true} #593#return; {15596#true} is VALID [2022-04-28 08:37:57,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {15596#true} call #t~ret158 := main(); {15596#true} is VALID [2022-04-28 08:37:57,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {15596#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {15596#true} is VALID [2022-04-28 08:37:57,172 INFO L272 TraceCheckUtils]: 6: Hoare triple {15596#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {15596#true} is VALID [2022-04-28 08:37:57,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {15596#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {15596#true} is VALID [2022-04-28 08:37:57,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {15596#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {15596#true} is VALID [2022-04-28 08:37:57,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {15596#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {15596#true} is VALID [2022-04-28 08:37:57,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {15596#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15596#true} is VALID [2022-04-28 08:37:57,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {15596#true} assume !false; {15596#true} is VALID [2022-04-28 08:37:57,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {15596#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15596#true} is VALID [2022-04-28 08:37:57,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {15596#true} assume 12292 == #t~mem49;havoc #t~mem49; {15596#true} is VALID [2022-04-28 08:37:57,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {15596#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {15596#true} is VALID [2022-04-28 08:37:57,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {15596#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {15596#true} is VALID [2022-04-28 08:37:57,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {15596#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15596#true} is VALID [2022-04-28 08:37:57,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {15596#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {15596#true} is VALID [2022-04-28 08:37:57,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {15596#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {15596#true} is VALID [2022-04-28 08:37:57,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {15596#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {15596#true} is VALID [2022-04-28 08:37:57,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {15596#true} assume !(0 == ~tmp___4~0); {15596#true} is VALID [2022-04-28 08:37:57,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {15596#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {15596#true} is VALID [2022-04-28 08:37:57,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {15596#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {15596#true} is VALID [2022-04-28 08:37:57,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {15596#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15596#true} is VALID [2022-04-28 08:37:57,174 INFO L290 TraceCheckUtils]: 24: Hoare triple {15596#true} ~skip~0 := 0; {15596#true} is VALID [2022-04-28 08:37:57,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {15596#true} assume !false; {15596#true} is VALID [2022-04-28 08:37:57,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {15596#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15596#true} is VALID [2022-04-28 08:37:57,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {15596#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15596#true} is VALID [2022-04-28 08:37:57,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {15596#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15596#true} is VALID [2022-04-28 08:37:57,174 INFO L290 TraceCheckUtils]: 29: Hoare triple {15596#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15596#true} is VALID [2022-04-28 08:37:57,174 INFO L290 TraceCheckUtils]: 30: Hoare triple {15596#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15596#true} is VALID [2022-04-28 08:37:57,174 INFO L290 TraceCheckUtils]: 31: Hoare triple {15596#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15596#true} is VALID [2022-04-28 08:37:57,174 INFO L290 TraceCheckUtils]: 32: Hoare triple {15596#true} assume 4368 == #t~mem54;havoc #t~mem54; {15596#true} is VALID [2022-04-28 08:37:57,174 INFO L290 TraceCheckUtils]: 33: Hoare triple {15596#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {15596#true} is VALID [2022-04-28 08:37:57,175 INFO L290 TraceCheckUtils]: 34: Hoare triple {15596#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:37:57,175 INFO L290 TraceCheckUtils]: 35: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:37:57,175 INFO L290 TraceCheckUtils]: 36: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:37:57,176 INFO L290 TraceCheckUtils]: 37: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:37:57,176 INFO L290 TraceCheckUtils]: 38: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:37:57,176 INFO L290 TraceCheckUtils]: 39: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:37:57,177 INFO L290 TraceCheckUtils]: 40: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !false; {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:37:57,177 INFO L290 TraceCheckUtils]: 41: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:37:57,177 INFO L290 TraceCheckUtils]: 42: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:37:57,178 INFO L290 TraceCheckUtils]: 43: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:37:57,178 INFO L290 TraceCheckUtils]: 44: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:37:57,178 INFO L290 TraceCheckUtils]: 45: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:37:57,178 INFO L290 TraceCheckUtils]: 46: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:37:57,179 INFO L290 TraceCheckUtils]: 47: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:37:57,179 INFO L290 TraceCheckUtils]: 48: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:37:57,179 INFO L290 TraceCheckUtils]: 49: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume 4384 == #t~mem56;havoc #t~mem56; {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:37:57,180 INFO L290 TraceCheckUtils]: 50: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:37:57,180 INFO L290 TraceCheckUtils]: 51: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {15597#false} is VALID [2022-04-28 08:37:57,180 INFO L290 TraceCheckUtils]: 52: Hoare triple {15597#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {15597#false} is VALID [2022-04-28 08:37:57,180 INFO L290 TraceCheckUtils]: 53: Hoare triple {15597#false} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-28 08:37:57,180 INFO L290 TraceCheckUtils]: 54: Hoare triple {15597#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {15597#false} is VALID [2022-04-28 08:37:57,180 INFO L290 TraceCheckUtils]: 55: Hoare triple {15597#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {15597#false} is VALID [2022-04-28 08:37:57,181 INFO L290 TraceCheckUtils]: 56: Hoare triple {15597#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15597#false} is VALID [2022-04-28 08:37:57,181 INFO L290 TraceCheckUtils]: 57: Hoare triple {15597#false} ~skip~0 := 0; {15597#false} is VALID [2022-04-28 08:37:57,181 INFO L290 TraceCheckUtils]: 58: Hoare triple {15597#false} assume !false; {15597#false} is VALID [2022-04-28 08:37:57,181 INFO L290 TraceCheckUtils]: 59: Hoare triple {15597#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-28 08:37:57,181 INFO L290 TraceCheckUtils]: 60: Hoare triple {15597#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-28 08:37:57,181 INFO L290 TraceCheckUtils]: 61: Hoare triple {15597#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-28 08:37:57,181 INFO L290 TraceCheckUtils]: 62: Hoare triple {15597#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-28 08:37:57,182 INFO L290 TraceCheckUtils]: 63: Hoare triple {15597#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-28 08:37:57,182 INFO L290 TraceCheckUtils]: 64: Hoare triple {15597#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-28 08:37:57,182 INFO L290 TraceCheckUtils]: 65: Hoare triple {15597#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-28 08:37:57,182 INFO L290 TraceCheckUtils]: 66: Hoare triple {15597#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-28 08:37:57,182 INFO L290 TraceCheckUtils]: 67: Hoare triple {15597#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-28 08:37:57,182 INFO L290 TraceCheckUtils]: 68: Hoare triple {15597#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-28 08:37:57,182 INFO L290 TraceCheckUtils]: 69: Hoare triple {15597#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-28 08:37:57,182 INFO L290 TraceCheckUtils]: 70: Hoare triple {15597#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-28 08:37:57,182 INFO L290 TraceCheckUtils]: 71: Hoare triple {15597#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-28 08:37:57,182 INFO L290 TraceCheckUtils]: 72: Hoare triple {15597#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-28 08:37:57,182 INFO L290 TraceCheckUtils]: 73: Hoare triple {15597#false} assume 4432 == #t~mem62;havoc #t~mem62; {15597#false} is VALID [2022-04-28 08:37:57,182 INFO L290 TraceCheckUtils]: 74: Hoare triple {15597#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {15597#false} is VALID [2022-04-28 08:37:57,182 INFO L290 TraceCheckUtils]: 75: Hoare triple {15597#false} assume 5 == ~blastFlag~0; {15597#false} is VALID [2022-04-28 08:37:57,183 INFO L290 TraceCheckUtils]: 76: Hoare triple {15597#false} assume !false; {15597#false} is VALID [2022-04-28 08:37:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 08:37:57,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:37:57,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183074708] [2022-04-28 08:37:57,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183074708] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:37:57,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:37:57,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:37:57,184 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:37:57,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1643135697] [2022-04-28 08:37:57,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1643135697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:37:57,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:37:57,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:37:57,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730489832] [2022-04-28 08:37:57,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:37:57,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-28 08:37:57,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:37:57,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:57,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:37:57,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:37:57,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:37:57,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:37:57,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:37:57,252 INFO L87 Difference]: Start difference. First operand 264 states and 385 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:59,281 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:37:59,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:59,815 INFO L93 Difference]: Finished difference Result 423 states and 619 transitions. [2022-04-28 08:37:59,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:37:59,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-28 08:37:59,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:37:59,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:59,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2022-04-28 08:37:59,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:59,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2022-04-28 08:37:59,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 367 transitions. [2022-04-28 08:38:00,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 367 edges. 367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:38:00,113 INFO L225 Difference]: With dead ends: 423 [2022-04-28 08:38:00,114 INFO L226 Difference]: Without dead ends: 288 [2022-04-28 08:38:00,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:38:00,114 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 15 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:38:00,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 359 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 213 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 08:38:00,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-04-28 08:38:00,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2022-04-28 08:38:00,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:38:00,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 288 states. Second operand has 288 states, 283 states have (on average 1.459363957597173) internal successors, (413), 283 states have internal predecessors, (413), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:00,127 INFO L74 IsIncluded]: Start isIncluded. First operand 288 states. Second operand has 288 states, 283 states have (on average 1.459363957597173) internal successors, (413), 283 states have internal predecessors, (413), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:00,128 INFO L87 Difference]: Start difference. First operand 288 states. Second operand has 288 states, 283 states have (on average 1.459363957597173) internal successors, (413), 283 states have internal predecessors, (413), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:00,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:38:00,133 INFO L93 Difference]: Finished difference Result 288 states and 417 transitions. [2022-04-28 08:38:00,133 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 417 transitions. [2022-04-28 08:38:00,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:38:00,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:38:00,134 INFO L74 IsIncluded]: Start isIncluded. First operand has 288 states, 283 states have (on average 1.459363957597173) internal successors, (413), 283 states have internal predecessors, (413), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 288 states. [2022-04-28 08:38:00,135 INFO L87 Difference]: Start difference. First operand has 288 states, 283 states have (on average 1.459363957597173) internal successors, (413), 283 states have internal predecessors, (413), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 288 states. [2022-04-28 08:38:00,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:38:00,140 INFO L93 Difference]: Finished difference Result 288 states and 417 transitions. [2022-04-28 08:38:00,140 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 417 transitions. [2022-04-28 08:38:00,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:38:00,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:38:00,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:38:00,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:38:00,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 283 states have (on average 1.459363957597173) internal successors, (413), 283 states have internal predecessors, (413), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:00,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 417 transitions. [2022-04-28 08:38:00,147 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 417 transitions. Word has length 77 [2022-04-28 08:38:00,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:38:00,147 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 417 transitions. [2022-04-28 08:38:00,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:00,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 288 states and 417 transitions. [2022-04-28 08:38:00,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 417 edges. 417 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:38:00,476 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 417 transitions. [2022-04-28 08:38:00,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 08:38:00,477 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:38:00,477 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-28 08:38:00,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 08:38:00,477 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:38:00,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:38:00,478 INFO L85 PathProgramCache]: Analyzing trace with hash -852053754, now seen corresponding path program 1 times [2022-04-28 08:38:00,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:38:00,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [701572682] [2022-04-28 08:38:00,478 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:38:00,478 INFO L85 PathProgramCache]: Analyzing trace with hash -852053754, now seen corresponding path program 2 times [2022-04-28 08:38:00,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:38:00,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336829571] [2022-04-28 08:38:00,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:38:00,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:38:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:38:00,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:38:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:38:00,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {17609#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {17603#true} is VALID [2022-04-28 08:38:00,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {17603#true} assume true; {17603#true} is VALID [2022-04-28 08:38:00,637 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17603#true} {17603#true} #593#return; {17603#true} is VALID [2022-04-28 08:38:00,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {17603#true} call ULTIMATE.init(); {17609#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:38:00,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {17609#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {17603#true} is VALID [2022-04-28 08:38:00,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {17603#true} assume true; {17603#true} is VALID [2022-04-28 08:38:00,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17603#true} {17603#true} #593#return; {17603#true} is VALID [2022-04-28 08:38:00,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {17603#true} call #t~ret158 := main(); {17603#true} is VALID [2022-04-28 08:38:00,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {17603#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {17603#true} is VALID [2022-04-28 08:38:00,638 INFO L272 TraceCheckUtils]: 6: Hoare triple {17603#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {17603#true} is VALID [2022-04-28 08:38:00,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {17603#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {17603#true} is VALID [2022-04-28 08:38:00,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {17603#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {17603#true} is VALID [2022-04-28 08:38:00,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {17603#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {17603#true} is VALID [2022-04-28 08:38:00,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {17603#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {17603#true} is VALID [2022-04-28 08:38:00,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {17603#true} assume !false; {17603#true} is VALID [2022-04-28 08:38:00,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {17603#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-28 08:38:00,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {17603#true} assume 12292 == #t~mem49;havoc #t~mem49; {17603#true} is VALID [2022-04-28 08:38:00,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {17603#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {17603#true} is VALID [2022-04-28 08:38:00,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {17603#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {17603#true} is VALID [2022-04-28 08:38:00,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {17603#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {17603#true} is VALID [2022-04-28 08:38:00,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {17603#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {17603#true} is VALID [2022-04-28 08:38:00,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {17603#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {17603#true} is VALID [2022-04-28 08:38:00,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {17603#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {17603#true} is VALID [2022-04-28 08:38:00,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {17603#true} assume !(0 == ~tmp___4~0); {17603#true} is VALID [2022-04-28 08:38:00,640 INFO L290 TraceCheckUtils]: 21: Hoare triple {17603#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {17603#true} is VALID [2022-04-28 08:38:00,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {17603#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {17603#true} is VALID [2022-04-28 08:38:00,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {17603#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17603#true} is VALID [2022-04-28 08:38:00,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {17603#true} ~skip~0 := 0; {17603#true} is VALID [2022-04-28 08:38:00,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {17603#true} assume !false; {17603#true} is VALID [2022-04-28 08:38:00,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {17603#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-28 08:38:00,640 INFO L290 TraceCheckUtils]: 27: Hoare triple {17603#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-28 08:38:00,640 INFO L290 TraceCheckUtils]: 28: Hoare triple {17603#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-28 08:38:00,641 INFO L290 TraceCheckUtils]: 29: Hoare triple {17603#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-28 08:38:00,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {17603#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-28 08:38:00,641 INFO L290 TraceCheckUtils]: 31: Hoare triple {17603#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-28 08:38:00,641 INFO L290 TraceCheckUtils]: 32: Hoare triple {17603#true} assume 4368 == #t~mem54;havoc #t~mem54; {17603#true} is VALID [2022-04-28 08:38:00,641 INFO L290 TraceCheckUtils]: 33: Hoare triple {17603#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {17603#true} is VALID [2022-04-28 08:38:00,641 INFO L290 TraceCheckUtils]: 34: Hoare triple {17603#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {17603#true} is VALID [2022-04-28 08:38:00,641 INFO L290 TraceCheckUtils]: 35: Hoare triple {17603#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {17603#true} is VALID [2022-04-28 08:38:00,641 INFO L290 TraceCheckUtils]: 36: Hoare triple {17603#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {17603#true} is VALID [2022-04-28 08:38:00,641 INFO L290 TraceCheckUtils]: 37: Hoare triple {17603#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {17603#true} is VALID [2022-04-28 08:38:00,641 INFO L290 TraceCheckUtils]: 38: Hoare triple {17603#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17603#true} is VALID [2022-04-28 08:38:00,641 INFO L290 TraceCheckUtils]: 39: Hoare triple {17603#true} ~skip~0 := 0; {17603#true} is VALID [2022-04-28 08:38:00,641 INFO L290 TraceCheckUtils]: 40: Hoare triple {17603#true} assume !false; {17603#true} is VALID [2022-04-28 08:38:00,642 INFO L290 TraceCheckUtils]: 41: Hoare triple {17603#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-28 08:38:00,642 INFO L290 TraceCheckUtils]: 42: Hoare triple {17603#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-28 08:38:00,642 INFO L290 TraceCheckUtils]: 43: Hoare triple {17603#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-28 08:38:00,642 INFO L290 TraceCheckUtils]: 44: Hoare triple {17603#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-28 08:38:00,642 INFO L290 TraceCheckUtils]: 45: Hoare triple {17603#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-28 08:38:00,642 INFO L290 TraceCheckUtils]: 46: Hoare triple {17603#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-28 08:38:00,642 INFO L290 TraceCheckUtils]: 47: Hoare triple {17603#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-28 08:38:00,642 INFO L290 TraceCheckUtils]: 48: Hoare triple {17603#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-28 08:38:00,642 INFO L290 TraceCheckUtils]: 49: Hoare triple {17603#true} assume 4384 == #t~mem56;havoc #t~mem56; {17603#true} is VALID [2022-04-28 08:38:00,642 INFO L290 TraceCheckUtils]: 50: Hoare triple {17603#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {17603#true} is VALID [2022-04-28 08:38:00,643 INFO L290 TraceCheckUtils]: 51: Hoare triple {17603#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:00,643 INFO L290 TraceCheckUtils]: 52: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:00,643 INFO L290 TraceCheckUtils]: 53: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:00,644 INFO L290 TraceCheckUtils]: 54: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:00,644 INFO L290 TraceCheckUtils]: 55: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:00,644 INFO L290 TraceCheckUtils]: 56: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:00,644 INFO L290 TraceCheckUtils]: 57: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:00,645 INFO L290 TraceCheckUtils]: 58: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:00,645 INFO L290 TraceCheckUtils]: 59: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:00,645 INFO L290 TraceCheckUtils]: 60: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:00,646 INFO L290 TraceCheckUtils]: 61: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:00,646 INFO L290 TraceCheckUtils]: 62: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:00,646 INFO L290 TraceCheckUtils]: 63: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:00,646 INFO L290 TraceCheckUtils]: 64: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:00,647 INFO L290 TraceCheckUtils]: 65: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:00,647 INFO L290 TraceCheckUtils]: 66: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:00,647 INFO L290 TraceCheckUtils]: 67: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:00,648 INFO L290 TraceCheckUtils]: 68: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:00,648 INFO L290 TraceCheckUtils]: 69: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:00,648 INFO L290 TraceCheckUtils]: 70: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:00,649 INFO L290 TraceCheckUtils]: 71: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:00,649 INFO L290 TraceCheckUtils]: 72: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:00,649 INFO L290 TraceCheckUtils]: 73: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:00,649 INFO L290 TraceCheckUtils]: 74: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:00,650 INFO L290 TraceCheckUtils]: 75: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {17604#false} is VALID [2022-04-28 08:38:00,650 INFO L290 TraceCheckUtils]: 76: Hoare triple {17604#false} assume !false; {17604#false} is VALID [2022-04-28 08:38:00,650 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-28 08:38:00,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:38:00,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336829571] [2022-04-28 08:38:00,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336829571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:38:00,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:38:00,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:38:00,651 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:38:00,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [701572682] [2022-04-28 08:38:00,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [701572682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:38:00,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:38:00,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:38:00,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470687150] [2022-04-28 08:38:00,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:38:00,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 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 77 [2022-04-28 08:38:00,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:38:00,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:00,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:38:00,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:38:00,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:38:00,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:38:00,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:38:00,709 INFO L87 Difference]: Start difference. First operand 288 states and 417 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:02,733 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:38:03,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:38:03,667 INFO L93 Difference]: Finished difference Result 578 states and 845 transitions. [2022-04-28 08:38:03,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:38:03,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 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 77 [2022-04-28 08:38:03,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:38:03,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:03,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-28 08:38:03,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-28 08:38:03,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-28 08:38:04,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:38:04,032 INFO L225 Difference]: With dead ends: 578 [2022-04-28 08:38:04,032 INFO L226 Difference]: Without dead ends: 419 [2022-04-28 08:38:04,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:38:04,033 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 125 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:38:04,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 477 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 337 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:38:04,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-04-28 08:38:04,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2022-04-28 08:38:04,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:38:04,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 419 states. Second operand has 419 states, 414 states have (on average 1.458937198067633) internal successors, (604), 414 states have internal predecessors, (604), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:04,050 INFO L74 IsIncluded]: Start isIncluded. First operand 419 states. Second operand has 419 states, 414 states have (on average 1.458937198067633) internal successors, (604), 414 states have internal predecessors, (604), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:04,050 INFO L87 Difference]: Start difference. First operand 419 states. Second operand has 419 states, 414 states have (on average 1.458937198067633) internal successors, (604), 414 states have internal predecessors, (604), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:04,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:38:04,060 INFO L93 Difference]: Finished difference Result 419 states and 608 transitions. [2022-04-28 08:38:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 608 transitions. [2022-04-28 08:38:04,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:38:04,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:38:04,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 419 states, 414 states have (on average 1.458937198067633) internal successors, (604), 414 states have internal predecessors, (604), 3 states have call successors, (3), 3 states 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-28 08:38:04,062 INFO L87 Difference]: Start difference. First operand has 419 states, 414 states have (on average 1.458937198067633) internal successors, (604), 414 states have internal predecessors, (604), 3 states have call successors, (3), 3 states 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-28 08:38:04,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:38:04,071 INFO L93 Difference]: Finished difference Result 419 states and 608 transitions. [2022-04-28 08:38:04,071 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 608 transitions. [2022-04-28 08:38:04,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:38:04,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:38:04,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:38:04,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:38:04,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.458937198067633) internal successors, (604), 414 states have internal predecessors, (604), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:04,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 608 transitions. [2022-04-28 08:38:04,080 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 608 transitions. Word has length 77 [2022-04-28 08:38:04,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:38:04,080 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 608 transitions. [2022-04-28 08:38:04,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:04,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 419 states and 608 transitions. [2022-04-28 08:38:04,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 608 edges. 608 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:38:04,534 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 608 transitions. [2022-04-28 08:38:04,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-28 08:38:04,535 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:38:04,535 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:38:04,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 08:38:04,535 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:38:04,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:38:04,536 INFO L85 PathProgramCache]: Analyzing trace with hash 58549480, now seen corresponding path program 1 times [2022-04-28 08:38:04,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:38:04,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1350797254] [2022-04-28 08:38:04,536 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:38:04,537 INFO L85 PathProgramCache]: Analyzing trace with hash 58549480, now seen corresponding path program 2 times [2022-04-28 08:38:04,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:38:04,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904303954] [2022-04-28 08:38:04,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:38:04,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:38:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:38:04,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:38:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:38:04,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {20450#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {20444#true} is VALID [2022-04-28 08:38:04,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {20444#true} assume true; {20444#true} is VALID [2022-04-28 08:38:04,698 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20444#true} {20444#true} #593#return; {20444#true} is VALID [2022-04-28 08:38:04,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {20444#true} call ULTIMATE.init(); {20450#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:38:04,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {20450#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {20444#true} is VALID [2022-04-28 08:38:04,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {20444#true} assume true; {20444#true} is VALID [2022-04-28 08:38:04,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20444#true} {20444#true} #593#return; {20444#true} is VALID [2022-04-28 08:38:04,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {20444#true} call #t~ret158 := main(); {20444#true} is VALID [2022-04-28 08:38:04,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {20444#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {20444#true} is VALID [2022-04-28 08:38:04,699 INFO L272 TraceCheckUtils]: 6: Hoare triple {20444#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {20444#true} is VALID [2022-04-28 08:38:04,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {20444#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {20444#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {20444#true} is VALID [2022-04-28 08:38:04,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {20444#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {20444#true} is VALID [2022-04-28 08:38:04,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {20444#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {20444#true} is VALID [2022-04-28 08:38:04,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {20444#true} assume !false; {20444#true} is VALID [2022-04-28 08:38:04,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {20444#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {20444#true} assume 12292 == #t~mem49;havoc #t~mem49; {20444#true} is VALID [2022-04-28 08:38:04,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {20444#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {20444#true} is VALID [2022-04-28 08:38:04,715 INFO L290 TraceCheckUtils]: 15: Hoare triple {20444#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {20444#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {20444#true} is VALID [2022-04-28 08:38:04,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {20444#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {20444#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {20444#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {20444#true} is VALID [2022-04-28 08:38:04,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {20444#true} assume !(0 == ~tmp___4~0); {20444#true} is VALID [2022-04-28 08:38:04,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {20444#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {20444#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {20444#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {20444#true} is VALID [2022-04-28 08:38:04,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {20444#true} ~skip~0 := 0; {20444#true} is VALID [2022-04-28 08:38:04,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {20444#true} assume !false; {20444#true} is VALID [2022-04-28 08:38:04,716 INFO L290 TraceCheckUtils]: 26: Hoare triple {20444#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,716 INFO L290 TraceCheckUtils]: 27: Hoare triple {20444#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,716 INFO L290 TraceCheckUtils]: 28: Hoare triple {20444#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,716 INFO L290 TraceCheckUtils]: 29: Hoare triple {20444#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,716 INFO L290 TraceCheckUtils]: 30: Hoare triple {20444#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,716 INFO L290 TraceCheckUtils]: 31: Hoare triple {20444#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,716 INFO L290 TraceCheckUtils]: 32: Hoare triple {20444#true} assume 4368 == #t~mem54;havoc #t~mem54; {20444#true} is VALID [2022-04-28 08:38:04,716 INFO L290 TraceCheckUtils]: 33: Hoare triple {20444#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {20444#true} is VALID [2022-04-28 08:38:04,716 INFO L290 TraceCheckUtils]: 34: Hoare triple {20444#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {20444#true} is VALID [2022-04-28 08:38:04,716 INFO L290 TraceCheckUtils]: 35: Hoare triple {20444#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,716 INFO L290 TraceCheckUtils]: 36: Hoare triple {20444#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {20444#true} is VALID [2022-04-28 08:38:04,717 INFO L290 TraceCheckUtils]: 37: Hoare triple {20444#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,717 INFO L290 TraceCheckUtils]: 38: Hoare triple {20444#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {20444#true} is VALID [2022-04-28 08:38:04,717 INFO L290 TraceCheckUtils]: 39: Hoare triple {20444#true} ~skip~0 := 0; {20444#true} is VALID [2022-04-28 08:38:04,717 INFO L290 TraceCheckUtils]: 40: Hoare triple {20444#true} assume !false; {20444#true} is VALID [2022-04-28 08:38:04,717 INFO L290 TraceCheckUtils]: 41: Hoare triple {20444#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,717 INFO L290 TraceCheckUtils]: 42: Hoare triple {20444#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,717 INFO L290 TraceCheckUtils]: 43: Hoare triple {20444#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,717 INFO L290 TraceCheckUtils]: 44: Hoare triple {20444#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,717 INFO L290 TraceCheckUtils]: 45: Hoare triple {20444#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,717 INFO L290 TraceCheckUtils]: 46: Hoare triple {20444#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,718 INFO L290 TraceCheckUtils]: 47: Hoare triple {20444#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,718 INFO L290 TraceCheckUtils]: 48: Hoare triple {20444#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,718 INFO L290 TraceCheckUtils]: 49: Hoare triple {20444#true} assume 4384 == #t~mem56;havoc #t~mem56; {20444#true} is VALID [2022-04-28 08:38:04,718 INFO L290 TraceCheckUtils]: 50: Hoare triple {20444#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {20444#true} is VALID [2022-04-28 08:38:04,718 INFO L290 TraceCheckUtils]: 51: Hoare triple {20444#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {20444#true} is VALID [2022-04-28 08:38:04,718 INFO L290 TraceCheckUtils]: 52: Hoare triple {20444#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,718 INFO L290 TraceCheckUtils]: 53: Hoare triple {20444#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,718 INFO L290 TraceCheckUtils]: 54: Hoare triple {20444#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,718 INFO L290 TraceCheckUtils]: 55: Hoare triple {20444#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,718 INFO L290 TraceCheckUtils]: 56: Hoare triple {20444#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {20444#true} is VALID [2022-04-28 08:38:04,718 INFO L290 TraceCheckUtils]: 57: Hoare triple {20444#true} ~skip~0 := 0; {20444#true} is VALID [2022-04-28 08:38:04,719 INFO L290 TraceCheckUtils]: 58: Hoare triple {20444#true} assume !false; {20444#true} is VALID [2022-04-28 08:38:04,719 INFO L290 TraceCheckUtils]: 59: Hoare triple {20444#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,719 INFO L290 TraceCheckUtils]: 60: Hoare triple {20444#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,719 INFO L290 TraceCheckUtils]: 61: Hoare triple {20444#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,719 INFO L290 TraceCheckUtils]: 62: Hoare triple {20444#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,719 INFO L290 TraceCheckUtils]: 63: Hoare triple {20444#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,719 INFO L290 TraceCheckUtils]: 64: Hoare triple {20444#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,719 INFO L290 TraceCheckUtils]: 65: Hoare triple {20444#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,719 INFO L290 TraceCheckUtils]: 66: Hoare triple {20444#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,719 INFO L290 TraceCheckUtils]: 67: Hoare triple {20444#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,719 INFO L290 TraceCheckUtils]: 68: Hoare triple {20444#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,720 INFO L290 TraceCheckUtils]: 69: Hoare triple {20444#true} assume 4400 == #t~mem58;havoc #t~mem58; {20444#true} is VALID [2022-04-28 08:38:04,720 INFO L290 TraceCheckUtils]: 70: Hoare triple {20444#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {20444#true} is VALID [2022-04-28 08:38:04,720 INFO L290 TraceCheckUtils]: 71: Hoare triple {20444#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {20444#true} is VALID [2022-04-28 08:38:04,732 INFO L290 TraceCheckUtils]: 72: Hoare triple {20444#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:04,733 INFO L290 TraceCheckUtils]: 73: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:04,733 INFO L290 TraceCheckUtils]: 74: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:04,733 INFO L290 TraceCheckUtils]: 75: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:04,734 INFO L290 TraceCheckUtils]: 76: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:04,734 INFO L290 TraceCheckUtils]: 77: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:04,734 INFO L290 TraceCheckUtils]: 78: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:04,734 INFO L290 TraceCheckUtils]: 79: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:04,735 INFO L290 TraceCheckUtils]: 80: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:04,735 INFO L290 TraceCheckUtils]: 81: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:04,735 INFO L290 TraceCheckUtils]: 82: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:04,736 INFO L290 TraceCheckUtils]: 83: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:04,736 INFO L290 TraceCheckUtils]: 84: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:04,736 INFO L290 TraceCheckUtils]: 85: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:04,736 INFO L290 TraceCheckUtils]: 86: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:04,737 INFO L290 TraceCheckUtils]: 87: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:04,737 INFO L290 TraceCheckUtils]: 88: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:04,737 INFO L290 TraceCheckUtils]: 89: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:04,738 INFO L290 TraceCheckUtils]: 90: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:04,738 INFO L290 TraceCheckUtils]: 91: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:04,738 INFO L290 TraceCheckUtils]: 92: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:04,738 INFO L290 TraceCheckUtils]: 93: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:04,739 INFO L290 TraceCheckUtils]: 94: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:38:04,739 INFO L290 TraceCheckUtils]: 95: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {20445#false} is VALID [2022-04-28 08:38:04,739 INFO L290 TraceCheckUtils]: 96: Hoare triple {20445#false} assume !false; {20445#false} is VALID [2022-04-28 08:38:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 08:38:04,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:38:04,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904303954] [2022-04-28 08:38:04,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904303954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:38:04,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:38:04,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:38:04,740 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:38:04,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1350797254] [2022-04-28 08:38:04,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1350797254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:38:04,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:38:04,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:38:04,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558569931] [2022-04-28 08:38:04,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:38:04,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2022-04-28 08:38:04,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:38:04,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:04,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:38:04,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:38:04,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:38:04,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:38:04,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:38:04,809 INFO L87 Difference]: Start difference. First operand 419 states and 608 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:06,829 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:38:07,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:38:07,700 INFO L93 Difference]: Finished difference Result 840 states and 1228 transitions. [2022-04-28 08:38:07,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:38:07,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2022-04-28 08:38:07,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:38:07,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:07,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-28 08:38:07,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:07,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-28 08:38:07,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 488 transitions. [2022-04-28 08:38:08,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:38:08,034 INFO L225 Difference]: With dead ends: 840 [2022-04-28 08:38:08,034 INFO L226 Difference]: Without dead ends: 550 [2022-04-28 08:38:08,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:38:08,035 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 126 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:38:08,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 476 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 338 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:38:08,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-04-28 08:38:08,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2022-04-28 08:38:08,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:38:08,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 550 states. Second operand has 550 states, 545 states have (on average 1.4587155963302751) internal successors, (795), 545 states have internal predecessors, (795), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:08,065 INFO L74 IsIncluded]: Start isIncluded. First operand 550 states. Second operand has 550 states, 545 states have (on average 1.4587155963302751) internal successors, (795), 545 states have internal predecessors, (795), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:08,065 INFO L87 Difference]: Start difference. First operand 550 states. Second operand has 550 states, 545 states have (on average 1.4587155963302751) internal successors, (795), 545 states have internal predecessors, (795), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:08,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:38:08,080 INFO L93 Difference]: Finished difference Result 550 states and 799 transitions. [2022-04-28 08:38:08,080 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 799 transitions. [2022-04-28 08:38:08,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:38:08,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:38:08,082 INFO L74 IsIncluded]: Start isIncluded. First operand has 550 states, 545 states have (on average 1.4587155963302751) internal successors, (795), 545 states have internal predecessors, (795), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 550 states. [2022-04-28 08:38:08,082 INFO L87 Difference]: Start difference. First operand has 550 states, 545 states have (on average 1.4587155963302751) internal successors, (795), 545 states have internal predecessors, (795), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 550 states. [2022-04-28 08:38:08,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:38:08,097 INFO L93 Difference]: Finished difference Result 550 states and 799 transitions. [2022-04-28 08:38:08,097 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 799 transitions. [2022-04-28 08:38:08,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:38:08,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:38:08,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:38:08,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:38:08,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 545 states have (on average 1.4587155963302751) internal successors, (795), 545 states have internal predecessors, (795), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 799 transitions. [2022-04-28 08:38:08,117 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 799 transitions. Word has length 97 [2022-04-28 08:38:08,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:38:08,117 INFO L495 AbstractCegarLoop]: Abstraction has 550 states and 799 transitions. [2022-04-28 08:38:08,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:08,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 550 states and 799 transitions. [2022-04-28 08:38:08,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 799 edges. 799 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:38:08,756 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 799 transitions. [2022-04-28 08:38:08,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-28 08:38:08,758 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:38:08,758 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:38:08,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 08:38:08,758 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:38:08,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:38:08,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1108655063, now seen corresponding path program 1 times [2022-04-28 08:38:08,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:38:08,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [861262571] [2022-04-28 08:38:08,759 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:38:08,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1108655063, now seen corresponding path program 2 times [2022-04-28 08:38:08,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:38:08,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405220090] [2022-04-28 08:38:08,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:38:08,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:38:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:38:08,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:38:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:38:08,955 INFO L290 TraceCheckUtils]: 0: Hoare triple {24339#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {24333#true} is VALID [2022-04-28 08:38:08,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {24333#true} assume true; {24333#true} is VALID [2022-04-28 08:38:08,955 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24333#true} {24333#true} #593#return; {24333#true} is VALID [2022-04-28 08:38:08,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {24333#true} call ULTIMATE.init(); {24339#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:38:08,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {24339#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {24333#true} is VALID [2022-04-28 08:38:08,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {24333#true} assume true; {24333#true} is VALID [2022-04-28 08:38:08,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24333#true} {24333#true} #593#return; {24333#true} is VALID [2022-04-28 08:38:08,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {24333#true} call #t~ret158 := main(); {24333#true} is VALID [2022-04-28 08:38:08,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {24333#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {24333#true} is VALID [2022-04-28 08:38:08,956 INFO L272 TraceCheckUtils]: 6: Hoare triple {24333#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {24333#true} is VALID [2022-04-28 08:38:08,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {24333#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {24333#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {24333#true} is VALID [2022-04-28 08:38:08,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {24333#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {24333#true} is VALID [2022-04-28 08:38:08,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {24333#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {24333#true} is VALID [2022-04-28 08:38:08,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {24333#true} assume !false; {24333#true} is VALID [2022-04-28 08:38:08,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {24333#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {24333#true} assume 12292 == #t~mem49;havoc #t~mem49; {24333#true} is VALID [2022-04-28 08:38:08,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {24333#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {24333#true} is VALID [2022-04-28 08:38:08,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {24333#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {24333#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {24333#true} is VALID [2022-04-28 08:38:08,957 INFO L290 TraceCheckUtils]: 17: Hoare triple {24333#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {24333#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {24333#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {24333#true} is VALID [2022-04-28 08:38:08,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {24333#true} assume !(0 == ~tmp___4~0); {24333#true} is VALID [2022-04-28 08:38:08,965 INFO L290 TraceCheckUtils]: 21: Hoare triple {24333#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {24333#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {24333#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {24333#true} is VALID [2022-04-28 08:38:08,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {24333#true} ~skip~0 := 0; {24333#true} is VALID [2022-04-28 08:38:08,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {24333#true} assume !false; {24333#true} is VALID [2022-04-28 08:38:08,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {24333#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {24333#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,965 INFO L290 TraceCheckUtils]: 28: Hoare triple {24333#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,965 INFO L290 TraceCheckUtils]: 29: Hoare triple {24333#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,965 INFO L290 TraceCheckUtils]: 30: Hoare triple {24333#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,966 INFO L290 TraceCheckUtils]: 31: Hoare triple {24333#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,966 INFO L290 TraceCheckUtils]: 32: Hoare triple {24333#true} assume 4368 == #t~mem54;havoc #t~mem54; {24333#true} is VALID [2022-04-28 08:38:08,966 INFO L290 TraceCheckUtils]: 33: Hoare triple {24333#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {24333#true} is VALID [2022-04-28 08:38:08,966 INFO L290 TraceCheckUtils]: 34: Hoare triple {24333#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {24333#true} is VALID [2022-04-28 08:38:08,966 INFO L290 TraceCheckUtils]: 35: Hoare triple {24333#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,966 INFO L290 TraceCheckUtils]: 36: Hoare triple {24333#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {24333#true} is VALID [2022-04-28 08:38:08,966 INFO L290 TraceCheckUtils]: 37: Hoare triple {24333#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,966 INFO L290 TraceCheckUtils]: 38: Hoare triple {24333#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {24333#true} is VALID [2022-04-28 08:38:08,966 INFO L290 TraceCheckUtils]: 39: Hoare triple {24333#true} ~skip~0 := 0; {24333#true} is VALID [2022-04-28 08:38:08,966 INFO L290 TraceCheckUtils]: 40: Hoare triple {24333#true} assume !false; {24333#true} is VALID [2022-04-28 08:38:08,966 INFO L290 TraceCheckUtils]: 41: Hoare triple {24333#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,966 INFO L290 TraceCheckUtils]: 42: Hoare triple {24333#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,966 INFO L290 TraceCheckUtils]: 43: Hoare triple {24333#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,967 INFO L290 TraceCheckUtils]: 44: Hoare triple {24333#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,967 INFO L290 TraceCheckUtils]: 45: Hoare triple {24333#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,967 INFO L290 TraceCheckUtils]: 46: Hoare triple {24333#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,967 INFO L290 TraceCheckUtils]: 47: Hoare triple {24333#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,967 INFO L290 TraceCheckUtils]: 48: Hoare triple {24333#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,967 INFO L290 TraceCheckUtils]: 49: Hoare triple {24333#true} assume 4384 == #t~mem56;havoc #t~mem56; {24333#true} is VALID [2022-04-28 08:38:08,967 INFO L290 TraceCheckUtils]: 50: Hoare triple {24333#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {24333#true} is VALID [2022-04-28 08:38:08,967 INFO L290 TraceCheckUtils]: 51: Hoare triple {24333#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {24333#true} is VALID [2022-04-28 08:38:08,967 INFO L290 TraceCheckUtils]: 52: Hoare triple {24333#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,967 INFO L290 TraceCheckUtils]: 53: Hoare triple {24333#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,967 INFO L290 TraceCheckUtils]: 54: Hoare triple {24333#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,967 INFO L290 TraceCheckUtils]: 55: Hoare triple {24333#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,968 INFO L290 TraceCheckUtils]: 56: Hoare triple {24333#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {24333#true} is VALID [2022-04-28 08:38:08,968 INFO L290 TraceCheckUtils]: 57: Hoare triple {24333#true} ~skip~0 := 0; {24333#true} is VALID [2022-04-28 08:38:08,968 INFO L290 TraceCheckUtils]: 58: Hoare triple {24333#true} assume !false; {24333#true} is VALID [2022-04-28 08:38:08,968 INFO L290 TraceCheckUtils]: 59: Hoare triple {24333#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,968 INFO L290 TraceCheckUtils]: 60: Hoare triple {24333#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,968 INFO L290 TraceCheckUtils]: 61: Hoare triple {24333#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,968 INFO L290 TraceCheckUtils]: 62: Hoare triple {24333#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,968 INFO L290 TraceCheckUtils]: 63: Hoare triple {24333#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,968 INFO L290 TraceCheckUtils]: 64: Hoare triple {24333#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,968 INFO L290 TraceCheckUtils]: 65: Hoare triple {24333#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,968 INFO L290 TraceCheckUtils]: 66: Hoare triple {24333#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,968 INFO L290 TraceCheckUtils]: 67: Hoare triple {24333#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,969 INFO L290 TraceCheckUtils]: 68: Hoare triple {24333#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,969 INFO L290 TraceCheckUtils]: 69: Hoare triple {24333#true} assume 4400 == #t~mem58;havoc #t~mem58; {24333#true} is VALID [2022-04-28 08:38:08,969 INFO L290 TraceCheckUtils]: 70: Hoare triple {24333#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,969 INFO L290 TraceCheckUtils]: 71: Hoare triple {24333#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {24333#true} is VALID [2022-04-28 08:38:08,969 INFO L290 TraceCheckUtils]: 72: Hoare triple {24333#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {24333#true} is VALID [2022-04-28 08:38:08,969 INFO L290 TraceCheckUtils]: 73: Hoare triple {24333#true} assume !(~ret~0 <= 0); {24333#true} is VALID [2022-04-28 08:38:08,969 INFO L290 TraceCheckUtils]: 74: Hoare triple {24333#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,969 INFO L290 TraceCheckUtils]: 75: Hoare triple {24333#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,969 INFO L290 TraceCheckUtils]: 76: Hoare triple {24333#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {24333#true} is VALID [2022-04-28 08:38:08,969 INFO L290 TraceCheckUtils]: 77: Hoare triple {24333#true} ~skip~0 := 0; {24333#true} is VALID [2022-04-28 08:38:08,969 INFO L290 TraceCheckUtils]: 78: Hoare triple {24333#true} assume !false; {24333#true} is VALID [2022-04-28 08:38:08,969 INFO L290 TraceCheckUtils]: 79: Hoare triple {24333#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,970 INFO L290 TraceCheckUtils]: 80: Hoare triple {24333#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,970 INFO L290 TraceCheckUtils]: 81: Hoare triple {24333#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,970 INFO L290 TraceCheckUtils]: 82: Hoare triple {24333#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,970 INFO L290 TraceCheckUtils]: 83: Hoare triple {24333#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,970 INFO L290 TraceCheckUtils]: 84: Hoare triple {24333#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,970 INFO L290 TraceCheckUtils]: 85: Hoare triple {24333#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,970 INFO L290 TraceCheckUtils]: 86: Hoare triple {24333#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,970 INFO L290 TraceCheckUtils]: 87: Hoare triple {24333#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,970 INFO L290 TraceCheckUtils]: 88: Hoare triple {24333#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,970 INFO L290 TraceCheckUtils]: 89: Hoare triple {24333#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,970 INFO L290 TraceCheckUtils]: 90: Hoare triple {24333#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-28 08:38:08,971 INFO L290 TraceCheckUtils]: 91: Hoare triple {24333#true} assume 4416 == #t~mem60;havoc #t~mem60; {24333#true} is VALID [2022-04-28 08:38:08,971 INFO L290 TraceCheckUtils]: 92: Hoare triple {24333#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {24333#true} is VALID [2022-04-28 08:38:08,971 INFO L290 TraceCheckUtils]: 93: Hoare triple {24333#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:38:08,971 INFO L290 TraceCheckUtils]: 94: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:38:08,972 INFO L290 TraceCheckUtils]: 95: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == ~tmp___6~0); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:38:08,972 INFO L290 TraceCheckUtils]: 96: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:38:08,972 INFO L290 TraceCheckUtils]: 97: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:38:08,973 INFO L290 TraceCheckUtils]: 98: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} ~skip~0 := 0; {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:38:08,973 INFO L290 TraceCheckUtils]: 99: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !false; {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:38:08,973 INFO L290 TraceCheckUtils]: 100: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:38:08,973 INFO L290 TraceCheckUtils]: 101: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:38:08,974 INFO L290 TraceCheckUtils]: 102: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:38:08,974 INFO L290 TraceCheckUtils]: 103: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:38:08,974 INFO L290 TraceCheckUtils]: 104: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:38:08,975 INFO L290 TraceCheckUtils]: 105: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:38:08,975 INFO L290 TraceCheckUtils]: 106: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:38:08,975 INFO L290 TraceCheckUtils]: 107: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:38:08,975 INFO L290 TraceCheckUtils]: 108: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:38:08,976 INFO L290 TraceCheckUtils]: 109: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:38:08,976 INFO L290 TraceCheckUtils]: 110: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:38:08,976 INFO L290 TraceCheckUtils]: 111: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:38:08,977 INFO L290 TraceCheckUtils]: 112: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:38:08,977 INFO L290 TraceCheckUtils]: 113: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:38:08,977 INFO L290 TraceCheckUtils]: 114: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume 4432 == #t~mem62;havoc #t~mem62; {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:38:08,977 INFO L290 TraceCheckUtils]: 115: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:38:08,978 INFO L290 TraceCheckUtils]: 116: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume 5 == ~blastFlag~0; {24334#false} is VALID [2022-04-28 08:38:08,978 INFO L290 TraceCheckUtils]: 117: Hoare triple {24334#false} assume !false; {24334#false} is VALID [2022-04-28 08:38:08,978 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-28 08:38:08,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:38:08,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405220090] [2022-04-28 08:38:08,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405220090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:38:08,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:38:08,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:38:08,979 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:38:08,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [861262571] [2022-04-28 08:38:08,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [861262571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:38:08,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:38:08,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:38:08,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858018990] [2022-04-28 08:38:08,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:38:08,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-28 08:38:08,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:38:08,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:09,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:38:09,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:38:09,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:38:09,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:38:09,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:38:09,053 INFO L87 Difference]: Start difference. First operand 550 states and 799 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:11,074 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:38:11,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:38:11,962 INFO L93 Difference]: Finished difference Result 1103 states and 1611 transitions. [2022-04-28 08:38:11,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:38:11,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-28 08:38:11,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:38:11,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:11,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-28 08:38:11,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:11,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-28 08:38:11,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 489 transitions. [2022-04-28 08:38:12,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:38:12,309 INFO L225 Difference]: With dead ends: 1103 [2022-04-28 08:38:12,309 INFO L226 Difference]: Without dead ends: 682 [2022-04-28 08:38:12,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:38:12,310 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 127 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:38:12,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 477 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 339 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:38:12,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2022-04-28 08:38:12,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2022-04-28 08:38:12,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:38:12,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 682 states. Second operand has 682 states, 677 states have (on average 1.4579025110782866) internal successors, (987), 677 states have internal predecessors, (987), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:12,334 INFO L74 IsIncluded]: Start isIncluded. First operand 682 states. Second operand has 682 states, 677 states have (on average 1.4579025110782866) internal successors, (987), 677 states have internal predecessors, (987), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:12,335 INFO L87 Difference]: Start difference. First operand 682 states. Second operand has 682 states, 677 states have (on average 1.4579025110782866) internal successors, (987), 677 states have internal predecessors, (987), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:12,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:38:12,355 INFO L93 Difference]: Finished difference Result 682 states and 991 transitions. [2022-04-28 08:38:12,355 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 991 transitions. [2022-04-28 08:38:12,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:38:12,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:38:12,357 INFO L74 IsIncluded]: Start isIncluded. First operand has 682 states, 677 states have (on average 1.4579025110782866) internal successors, (987), 677 states have internal predecessors, (987), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 682 states. [2022-04-28 08:38:12,359 INFO L87 Difference]: Start difference. First operand has 682 states, 677 states have (on average 1.4579025110782866) internal successors, (987), 677 states have internal predecessors, (987), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 682 states. [2022-04-28 08:38:12,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:38:12,379 INFO L93 Difference]: Finished difference Result 682 states and 991 transitions. [2022-04-28 08:38:12,379 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 991 transitions. [2022-04-28 08:38:12,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:38:12,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:38:12,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:38:12,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:38:12,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 677 states have (on average 1.4579025110782866) internal successors, (987), 677 states have internal predecessors, (987), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:12,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 991 transitions. [2022-04-28 08:38:12,416 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 991 transitions. Word has length 118 [2022-04-28 08:38:12,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:38:12,416 INFO L495 AbstractCegarLoop]: Abstraction has 682 states and 991 transitions. [2022-04-28 08:38:12,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:12,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 682 states and 991 transitions. [2022-04-28 08:38:13,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 991 edges. 991 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:38:13,132 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 991 transitions. [2022-04-28 08:38:13,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-04-28 08:38:13,134 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:38:13,134 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:38:13,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 08:38:13,134 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:38:13,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:38:13,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1826850427, now seen corresponding path program 1 times [2022-04-28 08:38:13,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:38:13,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [502060922] [2022-04-28 08:38:31,471 WARN L232 SmtUtils]: Spent 14.69s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:38:40,134 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:38:40,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1826850427, now seen corresponding path program 2 times [2022-04-28 08:38:40,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:38:40,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010140052] [2022-04-28 08:38:40,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:38:40,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:38:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:38:40,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:38:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:38:40,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {29283#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {29276#true} is VALID [2022-04-28 08:38:40,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {29276#true} assume true; {29276#true} is VALID [2022-04-28 08:38:40,364 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29276#true} {29276#true} #593#return; {29276#true} is VALID [2022-04-28 08:38:40,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {29276#true} call ULTIMATE.init(); {29283#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:38:40,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {29283#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {29276#true} is VALID [2022-04-28 08:38:40,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {29276#true} assume true; {29276#true} is VALID [2022-04-28 08:38:40,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29276#true} {29276#true} #593#return; {29276#true} is VALID [2022-04-28 08:38:40,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {29276#true} call #t~ret158 := main(); {29276#true} is VALID [2022-04-28 08:38:40,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {29276#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {29276#true} is VALID [2022-04-28 08:38:40,365 INFO L272 TraceCheckUtils]: 6: Hoare triple {29276#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {29276#true} is VALID [2022-04-28 08:38:40,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {29276#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {29276#true} is VALID [2022-04-28 08:38:40,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {29276#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {29276#true} is VALID [2022-04-28 08:38:40,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {29276#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {29276#true} is VALID [2022-04-28 08:38:40,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {29276#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {29276#true} is VALID [2022-04-28 08:38:40,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {29276#true} assume !false; {29276#true} is VALID [2022-04-28 08:38:40,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {29276#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29276#true} is VALID [2022-04-28 08:38:40,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {29276#true} assume 12292 == #t~mem49;havoc #t~mem49; {29276#true} is VALID [2022-04-28 08:38:40,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {29276#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {29276#true} is VALID [2022-04-28 08:38:40,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {29276#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {29276#true} is VALID [2022-04-28 08:38:40,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {29276#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {29276#true} is VALID [2022-04-28 08:38:40,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {29276#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {29276#true} is VALID [2022-04-28 08:38:40,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {29276#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {29276#true} is VALID [2022-04-28 08:38:40,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {29276#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {29276#true} is VALID [2022-04-28 08:38:40,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {29276#true} assume !(0 == ~tmp___4~0); {29276#true} is VALID [2022-04-28 08:38:40,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {29276#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {29276#true} is VALID [2022-04-28 08:38:40,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {29276#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {29276#true} is VALID [2022-04-28 08:38:40,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {29276#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {29276#true} is VALID [2022-04-28 08:38:40,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {29276#true} ~skip~0 := 0; {29276#true} is VALID [2022-04-28 08:38:40,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {29276#true} assume !false; {29276#true} is VALID [2022-04-28 08:38:40,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {29276#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29276#true} is VALID [2022-04-28 08:38:40,367 INFO L290 TraceCheckUtils]: 27: Hoare triple {29276#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29276#true} is VALID [2022-04-28 08:38:40,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {29276#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29276#true} is VALID [2022-04-28 08:38:40,367 INFO L290 TraceCheckUtils]: 29: Hoare triple {29276#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29276#true} is VALID [2022-04-28 08:38:40,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {29276#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29276#true} is VALID [2022-04-28 08:38:40,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {29276#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29276#true} is VALID [2022-04-28 08:38:40,367 INFO L290 TraceCheckUtils]: 32: Hoare triple {29276#true} assume 4368 == #t~mem54;havoc #t~mem54; {29276#true} is VALID [2022-04-28 08:38:40,367 INFO L290 TraceCheckUtils]: 33: Hoare triple {29276#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {29276#true} is VALID [2022-04-28 08:38:40,368 INFO L290 TraceCheckUtils]: 34: Hoare triple {29276#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {29276#true} is VALID [2022-04-28 08:38:40,368 INFO L290 TraceCheckUtils]: 35: Hoare triple {29276#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {29276#true} is VALID [2022-04-28 08:38:40,368 INFO L290 TraceCheckUtils]: 36: Hoare triple {29276#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {29276#true} is VALID [2022-04-28 08:38:40,368 INFO L290 TraceCheckUtils]: 37: Hoare triple {29276#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {29276#true} is VALID [2022-04-28 08:38:40,368 INFO L290 TraceCheckUtils]: 38: Hoare triple {29276#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {29276#true} is VALID [2022-04-28 08:38:40,368 INFO L290 TraceCheckUtils]: 39: Hoare triple {29276#true} ~skip~0 := 0; {29276#true} is VALID [2022-04-28 08:38:40,368 INFO L290 TraceCheckUtils]: 40: Hoare triple {29276#true} assume !false; {29276#true} is VALID [2022-04-28 08:38:40,368 INFO L290 TraceCheckUtils]: 41: Hoare triple {29276#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29276#true} is VALID [2022-04-28 08:38:40,368 INFO L290 TraceCheckUtils]: 42: Hoare triple {29276#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29276#true} is VALID [2022-04-28 08:38:40,368 INFO L290 TraceCheckUtils]: 43: Hoare triple {29276#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29276#true} is VALID [2022-04-28 08:38:40,368 INFO L290 TraceCheckUtils]: 44: Hoare triple {29276#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29276#true} is VALID [2022-04-28 08:38:40,369 INFO L290 TraceCheckUtils]: 45: Hoare triple {29276#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29276#true} is VALID [2022-04-28 08:38:40,369 INFO L290 TraceCheckUtils]: 46: Hoare triple {29276#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29276#true} is VALID [2022-04-28 08:38:40,369 INFO L290 TraceCheckUtils]: 47: Hoare triple {29276#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29276#true} is VALID [2022-04-28 08:38:40,369 INFO L290 TraceCheckUtils]: 48: Hoare triple {29276#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29276#true} is VALID [2022-04-28 08:38:40,369 INFO L290 TraceCheckUtils]: 49: Hoare triple {29276#true} assume 4384 == #t~mem56;havoc #t~mem56; {29276#true} is VALID [2022-04-28 08:38:40,369 INFO L290 TraceCheckUtils]: 50: Hoare triple {29276#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {29276#true} is VALID [2022-04-28 08:38:40,369 INFO L290 TraceCheckUtils]: 51: Hoare triple {29276#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {29276#true} is VALID [2022-04-28 08:38:40,385 INFO L290 TraceCheckUtils]: 52: Hoare triple {29276#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {29276#true} is VALID [2022-04-28 08:38:40,387 INFO L290 TraceCheckUtils]: 53: Hoare triple {29276#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:40,388 INFO L290 TraceCheckUtils]: 54: Hoare triple {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:40,388 INFO L290 TraceCheckUtils]: 55: Hoare triple {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:40,388 INFO L290 TraceCheckUtils]: 56: Hoare triple {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:40,389 INFO L290 TraceCheckUtils]: 57: Hoare triple {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:40,389 INFO L290 TraceCheckUtils]: 58: Hoare triple {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:40,389 INFO L290 TraceCheckUtils]: 59: Hoare triple {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:40,390 INFO L290 TraceCheckUtils]: 60: Hoare triple {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:40,390 INFO L290 TraceCheckUtils]: 61: Hoare triple {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:40,390 INFO L290 TraceCheckUtils]: 62: Hoare triple {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:40,390 INFO L290 TraceCheckUtils]: 63: Hoare triple {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:40,391 INFO L290 TraceCheckUtils]: 64: Hoare triple {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:40,391 INFO L290 TraceCheckUtils]: 65: Hoare triple {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:40,391 INFO L290 TraceCheckUtils]: 66: Hoare triple {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:40,392 INFO L290 TraceCheckUtils]: 67: Hoare triple {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:40,392 INFO L290 TraceCheckUtils]: 68: Hoare triple {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29282#(not (= |ssl3_connect_#t~mem58| 4400))} is VALID [2022-04-28 08:38:40,392 INFO L290 TraceCheckUtils]: 69: Hoare triple {29282#(not (= |ssl3_connect_#t~mem58| 4400))} assume 4400 == #t~mem58;havoc #t~mem58; {29277#false} is VALID [2022-04-28 08:38:40,393 INFO L290 TraceCheckUtils]: 70: Hoare triple {29277#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,393 INFO L290 TraceCheckUtils]: 71: Hoare triple {29277#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {29277#false} is VALID [2022-04-28 08:38:40,393 INFO L290 TraceCheckUtils]: 72: Hoare triple {29277#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {29277#false} is VALID [2022-04-28 08:38:40,393 INFO L290 TraceCheckUtils]: 73: Hoare triple {29277#false} assume !(~ret~0 <= 0); {29277#false} is VALID [2022-04-28 08:38:40,393 INFO L290 TraceCheckUtils]: 74: Hoare triple {29277#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,393 INFO L290 TraceCheckUtils]: 75: Hoare triple {29277#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,393 INFO L290 TraceCheckUtils]: 76: Hoare triple {29277#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {29277#false} is VALID [2022-04-28 08:38:40,393 INFO L290 TraceCheckUtils]: 77: Hoare triple {29277#false} ~skip~0 := 0; {29277#false} is VALID [2022-04-28 08:38:40,393 INFO L290 TraceCheckUtils]: 78: Hoare triple {29277#false} assume !false; {29277#false} is VALID [2022-04-28 08:38:40,393 INFO L290 TraceCheckUtils]: 79: Hoare triple {29277#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,393 INFO L290 TraceCheckUtils]: 80: Hoare triple {29277#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,394 INFO L290 TraceCheckUtils]: 81: Hoare triple {29277#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,394 INFO L290 TraceCheckUtils]: 82: Hoare triple {29277#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,394 INFO L290 TraceCheckUtils]: 83: Hoare triple {29277#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,394 INFO L290 TraceCheckUtils]: 84: Hoare triple {29277#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,394 INFO L290 TraceCheckUtils]: 85: Hoare triple {29277#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,394 INFO L290 TraceCheckUtils]: 86: Hoare triple {29277#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,394 INFO L290 TraceCheckUtils]: 87: Hoare triple {29277#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,394 INFO L290 TraceCheckUtils]: 88: Hoare triple {29277#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,394 INFO L290 TraceCheckUtils]: 89: Hoare triple {29277#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,394 INFO L290 TraceCheckUtils]: 90: Hoare triple {29277#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,394 INFO L290 TraceCheckUtils]: 91: Hoare triple {29277#false} assume 4416 == #t~mem60;havoc #t~mem60; {29277#false} is VALID [2022-04-28 08:38:40,394 INFO L290 TraceCheckUtils]: 92: Hoare triple {29277#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {29277#false} is VALID [2022-04-28 08:38:40,395 INFO L290 TraceCheckUtils]: 93: Hoare triple {29277#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {29277#false} is VALID [2022-04-28 08:38:40,395 INFO L290 TraceCheckUtils]: 94: Hoare triple {29277#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,395 INFO L290 TraceCheckUtils]: 95: Hoare triple {29277#false} assume !(0 == ~tmp___6~0); {29277#false} is VALID [2022-04-28 08:38:40,395 INFO L290 TraceCheckUtils]: 96: Hoare triple {29277#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,395 INFO L290 TraceCheckUtils]: 97: Hoare triple {29277#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {29277#false} is VALID [2022-04-28 08:38:40,395 INFO L290 TraceCheckUtils]: 98: Hoare triple {29277#false} ~skip~0 := 0; {29277#false} is VALID [2022-04-28 08:38:40,395 INFO L290 TraceCheckUtils]: 99: Hoare triple {29277#false} assume !false; {29277#false} is VALID [2022-04-28 08:38:40,395 INFO L290 TraceCheckUtils]: 100: Hoare triple {29277#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,395 INFO L290 TraceCheckUtils]: 101: Hoare triple {29277#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,395 INFO L290 TraceCheckUtils]: 102: Hoare triple {29277#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,395 INFO L290 TraceCheckUtils]: 103: Hoare triple {29277#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,395 INFO L290 TraceCheckUtils]: 104: Hoare triple {29277#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,396 INFO L290 TraceCheckUtils]: 105: Hoare triple {29277#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,396 INFO L290 TraceCheckUtils]: 106: Hoare triple {29277#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,396 INFO L290 TraceCheckUtils]: 107: Hoare triple {29277#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,396 INFO L290 TraceCheckUtils]: 108: Hoare triple {29277#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,396 INFO L290 TraceCheckUtils]: 109: Hoare triple {29277#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,396 INFO L290 TraceCheckUtils]: 110: Hoare triple {29277#false} assume 4400 == #t~mem58;havoc #t~mem58; {29277#false} is VALID [2022-04-28 08:38:40,396 INFO L290 TraceCheckUtils]: 111: Hoare triple {29277#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,396 INFO L290 TraceCheckUtils]: 112: Hoare triple {29277#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {29277#false} is VALID [2022-04-28 08:38:40,396 INFO L290 TraceCheckUtils]: 113: Hoare triple {29277#false} assume !(2 == ~blastFlag~0); {29277#false} is VALID [2022-04-28 08:38:40,396 INFO L290 TraceCheckUtils]: 114: Hoare triple {29277#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {29277#false} is VALID [2022-04-28 08:38:40,396 INFO L290 TraceCheckUtils]: 115: Hoare triple {29277#false} assume !(~ret~0 <= 0); {29277#false} is VALID [2022-04-28 08:38:40,396 INFO L290 TraceCheckUtils]: 116: Hoare triple {29277#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,397 INFO L290 TraceCheckUtils]: 117: Hoare triple {29277#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,397 INFO L290 TraceCheckUtils]: 118: Hoare triple {29277#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {29277#false} is VALID [2022-04-28 08:38:40,397 INFO L290 TraceCheckUtils]: 119: Hoare triple {29277#false} ~skip~0 := 0; {29277#false} is VALID [2022-04-28 08:38:40,397 INFO L290 TraceCheckUtils]: 120: Hoare triple {29277#false} assume !false; {29277#false} is VALID [2022-04-28 08:38:40,397 INFO L290 TraceCheckUtils]: 121: Hoare triple {29277#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,397 INFO L290 TraceCheckUtils]: 122: Hoare triple {29277#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,397 INFO L290 TraceCheckUtils]: 123: Hoare triple {29277#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,397 INFO L290 TraceCheckUtils]: 124: Hoare triple {29277#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,397 INFO L290 TraceCheckUtils]: 125: Hoare triple {29277#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,397 INFO L290 TraceCheckUtils]: 126: Hoare triple {29277#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,397 INFO L290 TraceCheckUtils]: 127: Hoare triple {29277#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,397 INFO L290 TraceCheckUtils]: 128: Hoare triple {29277#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,398 INFO L290 TraceCheckUtils]: 129: Hoare triple {29277#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,398 INFO L290 TraceCheckUtils]: 130: Hoare triple {29277#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,398 INFO L290 TraceCheckUtils]: 131: Hoare triple {29277#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,398 INFO L290 TraceCheckUtils]: 132: Hoare triple {29277#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,398 INFO L290 TraceCheckUtils]: 133: Hoare triple {29277#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,398 INFO L290 TraceCheckUtils]: 134: Hoare triple {29277#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-28 08:38:40,398 INFO L290 TraceCheckUtils]: 135: Hoare triple {29277#false} assume 4432 == #t~mem62;havoc #t~mem62; {29277#false} is VALID [2022-04-28 08:38:40,398 INFO L290 TraceCheckUtils]: 136: Hoare triple {29277#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {29277#false} is VALID [2022-04-28 08:38:40,398 INFO L290 TraceCheckUtils]: 137: Hoare triple {29277#false} assume 5 == ~blastFlag~0; {29277#false} is VALID [2022-04-28 08:38:40,398 INFO L290 TraceCheckUtils]: 138: Hoare triple {29277#false} assume !false; {29277#false} is VALID [2022-04-28 08:38:40,399 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-28 08:38:40,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:38:40,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010140052] [2022-04-28 08:38:40,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010140052] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:38:40,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:38:40,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:38:40,399 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:38:40,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [502060922] [2022-04-28 08:38:40,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [502060922] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:38:40,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:38:40,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:38:40,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20438925] [2022-04-28 08:38:40,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:38:40,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 139 [2022-04-28 08:38:40,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:38:40,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:40,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:38:40,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:38:40,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:38:40,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:38:40,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:38:40,480 INFO L87 Difference]: Start difference. First operand 682 states and 991 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:42,505 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:38:43,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:38:43,541 INFO L93 Difference]: Finished difference Result 1802 states and 2631 transitions. [2022-04-28 08:38:43,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:38:43,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 139 [2022-04-28 08:38:43,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:38:43,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:43,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-28 08:38:43,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:43,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-28 08:38:43,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-28 08:38:43,873 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-28 08:38:43,924 INFO L225 Difference]: With dead ends: 1802 [2022-04-28 08:38:43,925 INFO L226 Difference]: Without dead ends: 1136 [2022-04-28 08:38:43,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:38:43,926 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 111 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:38:43,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 280 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:38:43,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2022-04-28 08:38:43,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 787. [2022-04-28 08:38:43,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:38:43,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1136 states. Second operand has 787 states, 782 states have (on average 1.473145780051151) internal successors, (1152), 782 states have internal predecessors, (1152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:43,962 INFO L74 IsIncluded]: Start isIncluded. First operand 1136 states. Second operand has 787 states, 782 states have (on average 1.473145780051151) internal successors, (1152), 782 states have internal predecessors, (1152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:43,963 INFO L87 Difference]: Start difference. First operand 1136 states. Second operand has 787 states, 782 states have (on average 1.473145780051151) internal successors, (1152), 782 states have internal predecessors, (1152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:44,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:38:44,006 INFO L93 Difference]: Finished difference Result 1136 states and 1655 transitions. [2022-04-28 08:38:44,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1655 transitions. [2022-04-28 08:38:44,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:38:44,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:38:44,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 787 states, 782 states have (on average 1.473145780051151) internal successors, (1152), 782 states have internal predecessors, (1152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1136 states. [2022-04-28 08:38:44,010 INFO L87 Difference]: Start difference. First operand has 787 states, 782 states have (on average 1.473145780051151) internal successors, (1152), 782 states have internal predecessors, (1152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1136 states. [2022-04-28 08:38:44,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:38:44,063 INFO L93 Difference]: Finished difference Result 1136 states and 1655 transitions. [2022-04-28 08:38:44,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1655 transitions. [2022-04-28 08:38:44,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:38:44,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:38:44,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:38:44,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:38:44,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 782 states have (on average 1.473145780051151) internal successors, (1152), 782 states have internal predecessors, (1152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:44,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1156 transitions. [2022-04-28 08:38:44,104 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1156 transitions. Word has length 139 [2022-04-28 08:38:44,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:38:44,105 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 1156 transitions. [2022-04-28 08:38:44,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:44,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 787 states and 1156 transitions. [2022-04-28 08:38:45,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1156 edges. 1156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:38:45,081 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1156 transitions. [2022-04-28 08:38:45,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-04-28 08:38:45,084 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:38:45,084 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:38:45,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 08:38:45,084 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:38:45,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:38:45,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1784272250, now seen corresponding path program 1 times [2022-04-28 08:38:45,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:38:45,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1287885340] [2022-04-28 08:38:59,860 WARN L232 SmtUtils]: Spent 11.55s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:39:09,728 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:39:09,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1784272250, now seen corresponding path program 2 times [2022-04-28 08:39:09,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:39:09,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118752092] [2022-04-28 08:39:09,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:39:09,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:39:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:09,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:39:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:09,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {36745#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {36738#true} is VALID [2022-04-28 08:39:09,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {36738#true} assume true; {36738#true} is VALID [2022-04-28 08:39:09,961 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36738#true} {36738#true} #593#return; {36738#true} is VALID [2022-04-28 08:39:09,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {36738#true} call ULTIMATE.init(); {36745#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:39:09,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {36745#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {36738#true} is VALID [2022-04-28 08:39:09,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {36738#true} assume true; {36738#true} is VALID [2022-04-28 08:39:09,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36738#true} {36738#true} #593#return; {36738#true} is VALID [2022-04-28 08:39:09,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {36738#true} call #t~ret158 := main(); {36738#true} is VALID [2022-04-28 08:39:09,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {36738#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {36738#true} is VALID [2022-04-28 08:39:09,963 INFO L272 TraceCheckUtils]: 6: Hoare triple {36738#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {36738#true} is VALID [2022-04-28 08:39:09,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {36738#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {36738#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {36738#true} is VALID [2022-04-28 08:39:09,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {36738#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {36738#true} is VALID [2022-04-28 08:39:09,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {36738#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {36738#true} is VALID [2022-04-28 08:39:09,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {36738#true} assume !false; {36738#true} is VALID [2022-04-28 08:39:09,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {36738#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {36738#true} assume 12292 == #t~mem49;havoc #t~mem49; {36738#true} is VALID [2022-04-28 08:39:09,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {36738#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {36738#true} is VALID [2022-04-28 08:39:09,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {36738#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {36738#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {36738#true} is VALID [2022-04-28 08:39:09,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {36738#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,964 INFO L290 TraceCheckUtils]: 18: Hoare triple {36738#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {36738#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {36738#true} is VALID [2022-04-28 08:39:09,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {36738#true} assume !(0 == ~tmp___4~0); {36738#true} is VALID [2022-04-28 08:39:09,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {36738#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {36738#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {36738#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {36738#true} is VALID [2022-04-28 08:39:09,964 INFO L290 TraceCheckUtils]: 24: Hoare triple {36738#true} ~skip~0 := 0; {36738#true} is VALID [2022-04-28 08:39:09,964 INFO L290 TraceCheckUtils]: 25: Hoare triple {36738#true} assume !false; {36738#true} is VALID [2022-04-28 08:39:09,964 INFO L290 TraceCheckUtils]: 26: Hoare triple {36738#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {36738#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,965 INFO L290 TraceCheckUtils]: 28: Hoare triple {36738#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,965 INFO L290 TraceCheckUtils]: 29: Hoare triple {36738#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,965 INFO L290 TraceCheckUtils]: 30: Hoare triple {36738#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,965 INFO L290 TraceCheckUtils]: 31: Hoare triple {36738#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {36738#true} assume 4368 == #t~mem54;havoc #t~mem54; {36738#true} is VALID [2022-04-28 08:39:09,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {36738#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {36738#true} is VALID [2022-04-28 08:39:09,965 INFO L290 TraceCheckUtils]: 34: Hoare triple {36738#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {36738#true} is VALID [2022-04-28 08:39:09,965 INFO L290 TraceCheckUtils]: 35: Hoare triple {36738#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,965 INFO L290 TraceCheckUtils]: 36: Hoare triple {36738#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {36738#true} is VALID [2022-04-28 08:39:09,965 INFO L290 TraceCheckUtils]: 37: Hoare triple {36738#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,966 INFO L290 TraceCheckUtils]: 38: Hoare triple {36738#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {36738#true} is VALID [2022-04-28 08:39:09,966 INFO L290 TraceCheckUtils]: 39: Hoare triple {36738#true} ~skip~0 := 0; {36738#true} is VALID [2022-04-28 08:39:09,966 INFO L290 TraceCheckUtils]: 40: Hoare triple {36738#true} assume !false; {36738#true} is VALID [2022-04-28 08:39:09,966 INFO L290 TraceCheckUtils]: 41: Hoare triple {36738#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,966 INFO L290 TraceCheckUtils]: 42: Hoare triple {36738#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,966 INFO L290 TraceCheckUtils]: 43: Hoare triple {36738#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,966 INFO L290 TraceCheckUtils]: 44: Hoare triple {36738#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,966 INFO L290 TraceCheckUtils]: 45: Hoare triple {36738#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,966 INFO L290 TraceCheckUtils]: 46: Hoare triple {36738#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,966 INFO L290 TraceCheckUtils]: 47: Hoare triple {36738#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,966 INFO L290 TraceCheckUtils]: 48: Hoare triple {36738#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,966 INFO L290 TraceCheckUtils]: 49: Hoare triple {36738#true} assume 4384 == #t~mem56;havoc #t~mem56; {36738#true} is VALID [2022-04-28 08:39:09,967 INFO L290 TraceCheckUtils]: 50: Hoare triple {36738#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {36738#true} is VALID [2022-04-28 08:39:09,967 INFO L290 TraceCheckUtils]: 51: Hoare triple {36738#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {36738#true} is VALID [2022-04-28 08:39:09,967 INFO L290 TraceCheckUtils]: 52: Hoare triple {36738#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,967 INFO L290 TraceCheckUtils]: 53: Hoare triple {36738#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,967 INFO L290 TraceCheckUtils]: 54: Hoare triple {36738#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,967 INFO L290 TraceCheckUtils]: 55: Hoare triple {36738#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,967 INFO L290 TraceCheckUtils]: 56: Hoare triple {36738#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {36738#true} is VALID [2022-04-28 08:39:09,967 INFO L290 TraceCheckUtils]: 57: Hoare triple {36738#true} ~skip~0 := 0; {36738#true} is VALID [2022-04-28 08:39:09,967 INFO L290 TraceCheckUtils]: 58: Hoare triple {36738#true} assume !false; {36738#true} is VALID [2022-04-28 08:39:09,967 INFO L290 TraceCheckUtils]: 59: Hoare triple {36738#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,967 INFO L290 TraceCheckUtils]: 60: Hoare triple {36738#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,968 INFO L290 TraceCheckUtils]: 61: Hoare triple {36738#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,968 INFO L290 TraceCheckUtils]: 62: Hoare triple {36738#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,968 INFO L290 TraceCheckUtils]: 63: Hoare triple {36738#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,968 INFO L290 TraceCheckUtils]: 64: Hoare triple {36738#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,968 INFO L290 TraceCheckUtils]: 65: Hoare triple {36738#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,968 INFO L290 TraceCheckUtils]: 66: Hoare triple {36738#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,968 INFO L290 TraceCheckUtils]: 67: Hoare triple {36738#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,968 INFO L290 TraceCheckUtils]: 68: Hoare triple {36738#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,968 INFO L290 TraceCheckUtils]: 69: Hoare triple {36738#true} assume 4400 == #t~mem58;havoc #t~mem58; {36738#true} is VALID [2022-04-28 08:39:09,968 INFO L290 TraceCheckUtils]: 70: Hoare triple {36738#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,968 INFO L290 TraceCheckUtils]: 71: Hoare triple {36738#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {36738#true} is VALID [2022-04-28 08:39:09,968 INFO L290 TraceCheckUtils]: 72: Hoare triple {36738#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {36738#true} is VALID [2022-04-28 08:39:09,969 INFO L290 TraceCheckUtils]: 73: Hoare triple {36738#true} assume !(~ret~0 <= 0); {36738#true} is VALID [2022-04-28 08:39:09,969 INFO L290 TraceCheckUtils]: 74: Hoare triple {36738#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,969 INFO L290 TraceCheckUtils]: 75: Hoare triple {36738#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,969 INFO L290 TraceCheckUtils]: 76: Hoare triple {36738#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {36738#true} is VALID [2022-04-28 08:39:09,969 INFO L290 TraceCheckUtils]: 77: Hoare triple {36738#true} ~skip~0 := 0; {36738#true} is VALID [2022-04-28 08:39:09,969 INFO L290 TraceCheckUtils]: 78: Hoare triple {36738#true} assume !false; {36738#true} is VALID [2022-04-28 08:39:09,969 INFO L290 TraceCheckUtils]: 79: Hoare triple {36738#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,969 INFO L290 TraceCheckUtils]: 80: Hoare triple {36738#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,969 INFO L290 TraceCheckUtils]: 81: Hoare triple {36738#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,969 INFO L290 TraceCheckUtils]: 82: Hoare triple {36738#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,969 INFO L290 TraceCheckUtils]: 83: Hoare triple {36738#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,969 INFO L290 TraceCheckUtils]: 84: Hoare triple {36738#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,970 INFO L290 TraceCheckUtils]: 85: Hoare triple {36738#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,970 INFO L290 TraceCheckUtils]: 86: Hoare triple {36738#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,970 INFO L290 TraceCheckUtils]: 87: Hoare triple {36738#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,970 INFO L290 TraceCheckUtils]: 88: Hoare triple {36738#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,970 INFO L290 TraceCheckUtils]: 89: Hoare triple {36738#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,970 INFO L290 TraceCheckUtils]: 90: Hoare triple {36738#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-28 08:39:09,970 INFO L290 TraceCheckUtils]: 91: Hoare triple {36738#true} assume 4416 == #t~mem60;havoc #t~mem60; {36738#true} is VALID [2022-04-28 08:39:09,970 INFO L290 TraceCheckUtils]: 92: Hoare triple {36738#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {36738#true} is VALID [2022-04-28 08:39:09,970 INFO L290 TraceCheckUtils]: 93: Hoare triple {36738#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {36738#true} is VALID [2022-04-28 08:39:09,971 INFO L290 TraceCheckUtils]: 94: Hoare triple {36738#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:09,972 INFO L290 TraceCheckUtils]: 95: Hoare triple {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:09,972 INFO L290 TraceCheckUtils]: 96: Hoare triple {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:09,972 INFO L290 TraceCheckUtils]: 97: Hoare triple {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:09,973 INFO L290 TraceCheckUtils]: 98: Hoare triple {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:09,973 INFO L290 TraceCheckUtils]: 99: Hoare triple {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:09,973 INFO L290 TraceCheckUtils]: 100: Hoare triple {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:09,974 INFO L290 TraceCheckUtils]: 101: Hoare triple {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:09,974 INFO L290 TraceCheckUtils]: 102: Hoare triple {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:09,974 INFO L290 TraceCheckUtils]: 103: Hoare triple {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:09,975 INFO L290 TraceCheckUtils]: 104: Hoare triple {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:09,975 INFO L290 TraceCheckUtils]: 105: Hoare triple {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:09,975 INFO L290 TraceCheckUtils]: 106: Hoare triple {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:09,976 INFO L290 TraceCheckUtils]: 107: Hoare triple {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:09,976 INFO L290 TraceCheckUtils]: 108: Hoare triple {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:09,976 INFO L290 TraceCheckUtils]: 109: Hoare triple {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:09,977 INFO L290 TraceCheckUtils]: 110: Hoare triple {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36744#(= |ssl3_connect_#t~mem59| 4432)} is VALID [2022-04-28 08:39:09,977 INFO L290 TraceCheckUtils]: 111: Hoare triple {36744#(= |ssl3_connect_#t~mem59| 4432)} assume 4401 == #t~mem59;havoc #t~mem59; {36739#false} is VALID [2022-04-28 08:39:09,977 INFO L290 TraceCheckUtils]: 112: Hoare triple {36739#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {36739#false} is VALID [2022-04-28 08:39:09,977 INFO L290 TraceCheckUtils]: 113: Hoare triple {36739#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {36739#false} is VALID [2022-04-28 08:39:09,977 INFO L290 TraceCheckUtils]: 114: Hoare triple {36739#false} assume !(2 == ~blastFlag~0); {36739#false} is VALID [2022-04-28 08:39:09,977 INFO L290 TraceCheckUtils]: 115: Hoare triple {36739#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {36739#false} is VALID [2022-04-28 08:39:09,977 INFO L290 TraceCheckUtils]: 116: Hoare triple {36739#false} assume !(~ret~0 <= 0); {36739#false} is VALID [2022-04-28 08:39:09,977 INFO L290 TraceCheckUtils]: 117: Hoare triple {36739#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {36739#false} is VALID [2022-04-28 08:39:09,978 INFO L290 TraceCheckUtils]: 118: Hoare triple {36739#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {36739#false} is VALID [2022-04-28 08:39:09,978 INFO L290 TraceCheckUtils]: 119: Hoare triple {36739#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {36739#false} is VALID [2022-04-28 08:39:09,978 INFO L290 TraceCheckUtils]: 120: Hoare triple {36739#false} ~skip~0 := 0; {36739#false} is VALID [2022-04-28 08:39:09,978 INFO L290 TraceCheckUtils]: 121: Hoare triple {36739#false} assume !false; {36739#false} is VALID [2022-04-28 08:39:09,978 INFO L290 TraceCheckUtils]: 122: Hoare triple {36739#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36739#false} is VALID [2022-04-28 08:39:09,978 INFO L290 TraceCheckUtils]: 123: Hoare triple {36739#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36739#false} is VALID [2022-04-28 08:39:09,978 INFO L290 TraceCheckUtils]: 124: Hoare triple {36739#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36739#false} is VALID [2022-04-28 08:39:09,978 INFO L290 TraceCheckUtils]: 125: Hoare triple {36739#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36739#false} is VALID [2022-04-28 08:39:09,978 INFO L290 TraceCheckUtils]: 126: Hoare triple {36739#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36739#false} is VALID [2022-04-28 08:39:09,978 INFO L290 TraceCheckUtils]: 127: Hoare triple {36739#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36739#false} is VALID [2022-04-28 08:39:09,978 INFO L290 TraceCheckUtils]: 128: Hoare triple {36739#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36739#false} is VALID [2022-04-28 08:39:09,978 INFO L290 TraceCheckUtils]: 129: Hoare triple {36739#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36739#false} is VALID [2022-04-28 08:39:09,979 INFO L290 TraceCheckUtils]: 130: Hoare triple {36739#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36739#false} is VALID [2022-04-28 08:39:09,979 INFO L290 TraceCheckUtils]: 131: Hoare triple {36739#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36739#false} is VALID [2022-04-28 08:39:09,979 INFO L290 TraceCheckUtils]: 132: Hoare triple {36739#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36739#false} is VALID [2022-04-28 08:39:09,979 INFO L290 TraceCheckUtils]: 133: Hoare triple {36739#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {36739#false} is VALID [2022-04-28 08:39:09,979 INFO L290 TraceCheckUtils]: 134: Hoare triple {36739#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {36739#false} is VALID [2022-04-28 08:39:09,979 INFO L290 TraceCheckUtils]: 135: Hoare triple {36739#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {36739#false} is VALID [2022-04-28 08:39:09,979 INFO L290 TraceCheckUtils]: 136: Hoare triple {36739#false} assume 4432 == #t~mem62;havoc #t~mem62; {36739#false} is VALID [2022-04-28 08:39:09,979 INFO L290 TraceCheckUtils]: 137: Hoare triple {36739#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {36739#false} is VALID [2022-04-28 08:39:09,979 INFO L290 TraceCheckUtils]: 138: Hoare triple {36739#false} assume 5 == ~blastFlag~0; {36739#false} is VALID [2022-04-28 08:39:09,979 INFO L290 TraceCheckUtils]: 139: Hoare triple {36739#false} assume !false; {36739#false} is VALID [2022-04-28 08:39:09,980 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-28 08:39:09,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:39:09,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118752092] [2022-04-28 08:39:09,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118752092] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:09,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:09,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:09,981 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:39:09,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1287885340] [2022-04-28 08:39:09,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1287885340] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:09,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:09,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:09,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965647768] [2022-04-28 08:39:09,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:39:09,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 140 [2022-04-28 08:39:09,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:39:09,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:10,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:10,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:39:10,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:10,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:39:10,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:39:10,061 INFO L87 Difference]: Start difference. First operand 787 states and 1156 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:12,098 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:39:13,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:13,475 INFO L93 Difference]: Finished difference Result 1896 states and 2793 transitions. [2022-04-28 08:39:13,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:39:13,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 140 [2022-04-28 08:39:13,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:39:13,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:13,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 462 transitions. [2022-04-28 08:39:13,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:13,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 462 transitions. [2022-04-28 08:39:13,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 462 transitions. [2022-04-28 08:39:13,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 462 edges. 462 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:13,831 INFO L225 Difference]: With dead ends: 1896 [2022-04-28 08:39:13,831 INFO L226 Difference]: Without dead ends: 1125 [2022-04-28 08:39:13,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:39:13,832 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 89 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 08:39:13,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 561 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 529 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 08:39:13,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2022-04-28 08:39:13,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 871. [2022-04-28 08:39:13,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:39:13,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1125 states. Second operand has 871 states, 866 states have (on average 1.4826789838337182) internal successors, (1284), 866 states have internal predecessors, (1284), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:13,873 INFO L74 IsIncluded]: Start isIncluded. First operand 1125 states. Second operand has 871 states, 866 states have (on average 1.4826789838337182) internal successors, (1284), 866 states have internal predecessors, (1284), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:13,874 INFO L87 Difference]: Start difference. First operand 1125 states. Second operand has 871 states, 866 states have (on average 1.4826789838337182) internal successors, (1284), 866 states have internal predecessors, (1284), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:13,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:13,913 INFO L93 Difference]: Finished difference Result 1125 states and 1653 transitions. [2022-04-28 08:39:13,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1653 transitions. [2022-04-28 08:39:13,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:39:13,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:39:13,915 INFO L74 IsIncluded]: Start isIncluded. First operand has 871 states, 866 states have (on average 1.4826789838337182) internal successors, (1284), 866 states have internal predecessors, (1284), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1125 states. [2022-04-28 08:39:13,916 INFO L87 Difference]: Start difference. First operand has 871 states, 866 states have (on average 1.4826789838337182) internal successors, (1284), 866 states have internal predecessors, (1284), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1125 states. [2022-04-28 08:39:13,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:13,969 INFO L93 Difference]: Finished difference Result 1125 states and 1653 transitions. [2022-04-28 08:39:13,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1653 transitions. [2022-04-28 08:39:13,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:39:13,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:39:13,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:39:13,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:39:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 866 states have (on average 1.4826789838337182) internal successors, (1284), 866 states have internal predecessors, (1284), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:14,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1288 transitions. [2022-04-28 08:39:14,019 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1288 transitions. Word has length 140 [2022-04-28 08:39:14,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:39:14,020 INFO L495 AbstractCegarLoop]: Abstraction has 871 states and 1288 transitions. [2022-04-28 08:39:14,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:14,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 871 states and 1288 transitions. [2022-04-28 08:39:15,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1288 edges. 1288 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:15,021 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1288 transitions. [2022-04-28 08:39:15,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-28 08:39:15,023 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:39:15,023 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:39:15,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 08:39:15,023 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:39:15,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:39:15,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1065118499, now seen corresponding path program 1 times [2022-04-28 08:39:15,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:15,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [506807415] [2022-04-28 08:39:21,902 WARN L232 SmtUtils]: Spent 6.45s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:39:34,842 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:39:34,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1065118499, now seen corresponding path program 2 times [2022-04-28 08:39:34,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:39:34,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038838941] [2022-04-28 08:39:34,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:39:34,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:39:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:35,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:39:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:35,033 INFO L290 TraceCheckUtils]: 0: Hoare triple {44541#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {44534#true} is VALID [2022-04-28 08:39:35,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {44534#true} assume true; {44534#true} is VALID [2022-04-28 08:39:35,034 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44534#true} {44534#true} #593#return; {44534#true} is VALID [2022-04-28 08:39:35,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {44534#true} call ULTIMATE.init(); {44541#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:39:35,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {44541#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {44534#true} is VALID [2022-04-28 08:39:35,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {44534#true} assume true; {44534#true} is VALID [2022-04-28 08:39:35,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44534#true} {44534#true} #593#return; {44534#true} is VALID [2022-04-28 08:39:35,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {44534#true} call #t~ret158 := main(); {44534#true} is VALID [2022-04-28 08:39:35,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {44534#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {44534#true} is VALID [2022-04-28 08:39:35,035 INFO L272 TraceCheckUtils]: 6: Hoare triple {44534#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {44534#true} is VALID [2022-04-28 08:39:35,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {44534#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {44534#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {44534#true} is VALID [2022-04-28 08:39:35,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {44534#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {44534#true} is VALID [2022-04-28 08:39:35,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {44534#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {44534#true} is VALID [2022-04-28 08:39:35,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {44534#true} assume !false; {44534#true} is VALID [2022-04-28 08:39:35,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {44534#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {44534#true} assume 12292 == #t~mem49;havoc #t~mem49; {44534#true} is VALID [2022-04-28 08:39:35,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {44534#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {44534#true} is VALID [2022-04-28 08:39:35,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {44534#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {44534#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {44534#true} is VALID [2022-04-28 08:39:35,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {44534#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {44534#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {44534#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {44534#true} is VALID [2022-04-28 08:39:35,036 INFO L290 TraceCheckUtils]: 20: Hoare triple {44534#true} assume !(0 == ~tmp___4~0); {44534#true} is VALID [2022-04-28 08:39:35,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {44534#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {44534#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,036 INFO L290 TraceCheckUtils]: 23: Hoare triple {44534#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44534#true} is VALID [2022-04-28 08:39:35,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {44534#true} ~skip~0 := 0; {44534#true} is VALID [2022-04-28 08:39:35,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {44534#true} assume !false; {44534#true} is VALID [2022-04-28 08:39:35,037 INFO L290 TraceCheckUtils]: 26: Hoare triple {44534#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,037 INFO L290 TraceCheckUtils]: 27: Hoare triple {44534#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,037 INFO L290 TraceCheckUtils]: 28: Hoare triple {44534#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,037 INFO L290 TraceCheckUtils]: 29: Hoare triple {44534#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,037 INFO L290 TraceCheckUtils]: 30: Hoare triple {44534#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,037 INFO L290 TraceCheckUtils]: 31: Hoare triple {44534#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,037 INFO L290 TraceCheckUtils]: 32: Hoare triple {44534#true} assume 4368 == #t~mem54;havoc #t~mem54; {44534#true} is VALID [2022-04-28 08:39:35,037 INFO L290 TraceCheckUtils]: 33: Hoare triple {44534#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {44534#true} is VALID [2022-04-28 08:39:35,037 INFO L290 TraceCheckUtils]: 34: Hoare triple {44534#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {44534#true} is VALID [2022-04-28 08:39:35,037 INFO L290 TraceCheckUtils]: 35: Hoare triple {44534#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,037 INFO L290 TraceCheckUtils]: 36: Hoare triple {44534#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {44534#true} is VALID [2022-04-28 08:39:35,038 INFO L290 TraceCheckUtils]: 37: Hoare triple {44534#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,038 INFO L290 TraceCheckUtils]: 38: Hoare triple {44534#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44534#true} is VALID [2022-04-28 08:39:35,038 INFO L290 TraceCheckUtils]: 39: Hoare triple {44534#true} ~skip~0 := 0; {44534#true} is VALID [2022-04-28 08:39:35,038 INFO L290 TraceCheckUtils]: 40: Hoare triple {44534#true} assume !false; {44534#true} is VALID [2022-04-28 08:39:35,038 INFO L290 TraceCheckUtils]: 41: Hoare triple {44534#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,038 INFO L290 TraceCheckUtils]: 42: Hoare triple {44534#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,038 INFO L290 TraceCheckUtils]: 43: Hoare triple {44534#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,038 INFO L290 TraceCheckUtils]: 44: Hoare triple {44534#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,038 INFO L290 TraceCheckUtils]: 45: Hoare triple {44534#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,038 INFO L290 TraceCheckUtils]: 46: Hoare triple {44534#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,039 INFO L290 TraceCheckUtils]: 47: Hoare triple {44534#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,039 INFO L290 TraceCheckUtils]: 48: Hoare triple {44534#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,039 INFO L290 TraceCheckUtils]: 49: Hoare triple {44534#true} assume 4384 == #t~mem56;havoc #t~mem56; {44534#true} is VALID [2022-04-28 08:39:35,039 INFO L290 TraceCheckUtils]: 50: Hoare triple {44534#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {44534#true} is VALID [2022-04-28 08:39:35,039 INFO L290 TraceCheckUtils]: 51: Hoare triple {44534#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {44534#true} is VALID [2022-04-28 08:39:35,039 INFO L290 TraceCheckUtils]: 52: Hoare triple {44534#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,039 INFO L290 TraceCheckUtils]: 53: Hoare triple {44534#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,039 INFO L290 TraceCheckUtils]: 54: Hoare triple {44534#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,039 INFO L290 TraceCheckUtils]: 55: Hoare triple {44534#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,039 INFO L290 TraceCheckUtils]: 56: Hoare triple {44534#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44534#true} is VALID [2022-04-28 08:39:35,039 INFO L290 TraceCheckUtils]: 57: Hoare triple {44534#true} ~skip~0 := 0; {44534#true} is VALID [2022-04-28 08:39:35,040 INFO L290 TraceCheckUtils]: 58: Hoare triple {44534#true} assume !false; {44534#true} is VALID [2022-04-28 08:39:35,040 INFO L290 TraceCheckUtils]: 59: Hoare triple {44534#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,040 INFO L290 TraceCheckUtils]: 60: Hoare triple {44534#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,040 INFO L290 TraceCheckUtils]: 61: Hoare triple {44534#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,040 INFO L290 TraceCheckUtils]: 62: Hoare triple {44534#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,040 INFO L290 TraceCheckUtils]: 63: Hoare triple {44534#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,040 INFO L290 TraceCheckUtils]: 64: Hoare triple {44534#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,040 INFO L290 TraceCheckUtils]: 65: Hoare triple {44534#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,040 INFO L290 TraceCheckUtils]: 66: Hoare triple {44534#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,040 INFO L290 TraceCheckUtils]: 67: Hoare triple {44534#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,041 INFO L290 TraceCheckUtils]: 68: Hoare triple {44534#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,041 INFO L290 TraceCheckUtils]: 69: Hoare triple {44534#true} assume 4400 == #t~mem58;havoc #t~mem58; {44534#true} is VALID [2022-04-28 08:39:35,041 INFO L290 TraceCheckUtils]: 70: Hoare triple {44534#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,041 INFO L290 TraceCheckUtils]: 71: Hoare triple {44534#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {44534#true} is VALID [2022-04-28 08:39:35,041 INFO L290 TraceCheckUtils]: 72: Hoare triple {44534#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {44534#true} is VALID [2022-04-28 08:39:35,041 INFO L290 TraceCheckUtils]: 73: Hoare triple {44534#true} assume !(~ret~0 <= 0); {44534#true} is VALID [2022-04-28 08:39:35,041 INFO L290 TraceCheckUtils]: 74: Hoare triple {44534#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,041 INFO L290 TraceCheckUtils]: 75: Hoare triple {44534#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,041 INFO L290 TraceCheckUtils]: 76: Hoare triple {44534#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44534#true} is VALID [2022-04-28 08:39:35,042 INFO L290 TraceCheckUtils]: 77: Hoare triple {44534#true} ~skip~0 := 0; {44534#true} is VALID [2022-04-28 08:39:35,042 INFO L290 TraceCheckUtils]: 78: Hoare triple {44534#true} assume !false; {44534#true} is VALID [2022-04-28 08:39:35,042 INFO L290 TraceCheckUtils]: 79: Hoare triple {44534#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,042 INFO L290 TraceCheckUtils]: 80: Hoare triple {44534#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,042 INFO L290 TraceCheckUtils]: 81: Hoare triple {44534#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,042 INFO L290 TraceCheckUtils]: 82: Hoare triple {44534#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,042 INFO L290 TraceCheckUtils]: 83: Hoare triple {44534#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,042 INFO L290 TraceCheckUtils]: 84: Hoare triple {44534#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,042 INFO L290 TraceCheckUtils]: 85: Hoare triple {44534#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,042 INFO L290 TraceCheckUtils]: 86: Hoare triple {44534#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,042 INFO L290 TraceCheckUtils]: 87: Hoare triple {44534#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,043 INFO L290 TraceCheckUtils]: 88: Hoare triple {44534#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,043 INFO L290 TraceCheckUtils]: 89: Hoare triple {44534#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,043 INFO L290 TraceCheckUtils]: 90: Hoare triple {44534#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-28 08:39:35,043 INFO L290 TraceCheckUtils]: 91: Hoare triple {44534#true} assume 4416 == #t~mem60;havoc #t~mem60; {44534#true} is VALID [2022-04-28 08:39:35,043 INFO L290 TraceCheckUtils]: 92: Hoare triple {44534#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {44534#true} is VALID [2022-04-28 08:39:35,043 INFO L290 TraceCheckUtils]: 93: Hoare triple {44534#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {44534#true} is VALID [2022-04-28 08:39:35,044 INFO L290 TraceCheckUtils]: 94: Hoare triple {44534#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {44539#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:35,045 INFO L290 TraceCheckUtils]: 95: Hoare triple {44539#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {44539#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:35,045 INFO L290 TraceCheckUtils]: 96: Hoare triple {44539#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {44539#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:35,045 INFO L290 TraceCheckUtils]: 97: Hoare triple {44539#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44539#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:35,045 INFO L290 TraceCheckUtils]: 98: Hoare triple {44539#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {44539#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:35,046 INFO L290 TraceCheckUtils]: 99: Hoare triple {44539#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {44539#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:35,046 INFO L290 TraceCheckUtils]: 100: Hoare triple {44539#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44539#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:35,046 INFO L290 TraceCheckUtils]: 101: Hoare triple {44539#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44539#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:35,047 INFO L290 TraceCheckUtils]: 102: Hoare triple {44539#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44540#(= |ssl3_connect_#t~mem51| 4432)} is VALID [2022-04-28 08:39:35,047 INFO L290 TraceCheckUtils]: 103: Hoare triple {44540#(= |ssl3_connect_#t~mem51| 4432)} assume 4096 == #t~mem51;havoc #t~mem51; {44535#false} is VALID [2022-04-28 08:39:35,047 INFO L290 TraceCheckUtils]: 104: Hoare triple {44535#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,047 INFO L290 TraceCheckUtils]: 105: Hoare triple {44535#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {44535#false} is VALID [2022-04-28 08:39:35,047 INFO L290 TraceCheckUtils]: 106: Hoare triple {44535#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,047 INFO L290 TraceCheckUtils]: 107: Hoare triple {44535#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,047 INFO L290 TraceCheckUtils]: 108: Hoare triple {44535#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {44535#false} is VALID [2022-04-28 08:39:35,048 INFO L290 TraceCheckUtils]: 109: Hoare triple {44535#false} assume !(0 == ~tmp___4~0); {44535#false} is VALID [2022-04-28 08:39:35,048 INFO L290 TraceCheckUtils]: 110: Hoare triple {44535#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,048 INFO L290 TraceCheckUtils]: 111: Hoare triple {44535#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,048 INFO L290 TraceCheckUtils]: 112: Hoare triple {44535#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44535#false} is VALID [2022-04-28 08:39:35,048 INFO L290 TraceCheckUtils]: 113: Hoare triple {44535#false} ~skip~0 := 0; {44535#false} is VALID [2022-04-28 08:39:35,048 INFO L290 TraceCheckUtils]: 114: Hoare triple {44535#false} assume !false; {44535#false} is VALID [2022-04-28 08:39:35,048 INFO L290 TraceCheckUtils]: 115: Hoare triple {44535#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,048 INFO L290 TraceCheckUtils]: 116: Hoare triple {44535#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,048 INFO L290 TraceCheckUtils]: 117: Hoare triple {44535#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,048 INFO L290 TraceCheckUtils]: 118: Hoare triple {44535#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,048 INFO L290 TraceCheckUtils]: 119: Hoare triple {44535#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,048 INFO L290 TraceCheckUtils]: 120: Hoare triple {44535#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,049 INFO L290 TraceCheckUtils]: 121: Hoare triple {44535#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,049 INFO L290 TraceCheckUtils]: 122: Hoare triple {44535#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,049 INFO L290 TraceCheckUtils]: 123: Hoare triple {44535#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,049 INFO L290 TraceCheckUtils]: 124: Hoare triple {44535#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,049 INFO L290 TraceCheckUtils]: 125: Hoare triple {44535#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,049 INFO L290 TraceCheckUtils]: 126: Hoare triple {44535#false} assume 4401 == #t~mem59;havoc #t~mem59; {44535#false} is VALID [2022-04-28 08:39:35,049 INFO L290 TraceCheckUtils]: 127: Hoare triple {44535#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,049 INFO L290 TraceCheckUtils]: 128: Hoare triple {44535#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {44535#false} is VALID [2022-04-28 08:39:35,049 INFO L290 TraceCheckUtils]: 129: Hoare triple {44535#false} assume !(2 == ~blastFlag~0); {44535#false} is VALID [2022-04-28 08:39:35,049 INFO L290 TraceCheckUtils]: 130: Hoare triple {44535#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {44535#false} is VALID [2022-04-28 08:39:35,049 INFO L290 TraceCheckUtils]: 131: Hoare triple {44535#false} assume !(~ret~0 <= 0); {44535#false} is VALID [2022-04-28 08:39:35,049 INFO L290 TraceCheckUtils]: 132: Hoare triple {44535#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,050 INFO L290 TraceCheckUtils]: 133: Hoare triple {44535#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,050 INFO L290 TraceCheckUtils]: 134: Hoare triple {44535#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44535#false} is VALID [2022-04-28 08:39:35,050 INFO L290 TraceCheckUtils]: 135: Hoare triple {44535#false} ~skip~0 := 0; {44535#false} is VALID [2022-04-28 08:39:35,050 INFO L290 TraceCheckUtils]: 136: Hoare triple {44535#false} assume !false; {44535#false} is VALID [2022-04-28 08:39:35,050 INFO L290 TraceCheckUtils]: 137: Hoare triple {44535#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,050 INFO L290 TraceCheckUtils]: 138: Hoare triple {44535#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,050 INFO L290 TraceCheckUtils]: 139: Hoare triple {44535#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,050 INFO L290 TraceCheckUtils]: 140: Hoare triple {44535#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,050 INFO L290 TraceCheckUtils]: 141: Hoare triple {44535#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,050 INFO L290 TraceCheckUtils]: 142: Hoare triple {44535#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,050 INFO L290 TraceCheckUtils]: 143: Hoare triple {44535#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,050 INFO L290 TraceCheckUtils]: 144: Hoare triple {44535#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,051 INFO L290 TraceCheckUtils]: 145: Hoare triple {44535#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,051 INFO L290 TraceCheckUtils]: 146: Hoare triple {44535#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,051 INFO L290 TraceCheckUtils]: 147: Hoare triple {44535#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,051 INFO L290 TraceCheckUtils]: 148: Hoare triple {44535#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,051 INFO L290 TraceCheckUtils]: 149: Hoare triple {44535#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,051 INFO L290 TraceCheckUtils]: 150: Hoare triple {44535#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-28 08:39:35,051 INFO L290 TraceCheckUtils]: 151: Hoare triple {44535#false} assume 4432 == #t~mem62;havoc #t~mem62; {44535#false} is VALID [2022-04-28 08:39:35,051 INFO L290 TraceCheckUtils]: 152: Hoare triple {44535#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {44535#false} is VALID [2022-04-28 08:39:35,051 INFO L290 TraceCheckUtils]: 153: Hoare triple {44535#false} assume 5 == ~blastFlag~0; {44535#false} is VALID [2022-04-28 08:39:35,051 INFO L290 TraceCheckUtils]: 154: Hoare triple {44535#false} assume !false; {44535#false} is VALID [2022-04-28 08:39:35,052 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-04-28 08:39:35,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:39:35,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038838941] [2022-04-28 08:39:35,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038838941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:35,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:35,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:35,053 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:39:35,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [506807415] [2022-04-28 08:39:35,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [506807415] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:35,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:35,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:35,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780877763] [2022-04-28 08:39:35,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:39:35,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 155 [2022-04-28 08:39:35,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:39:35,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:35,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:35,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:39:35,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:35,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:39:35,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:39:35,137 INFO L87 Difference]: Start difference. First operand 871 states and 1288 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:37,163 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:39:38,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:38,555 INFO L93 Difference]: Finished difference Result 1980 states and 2921 transitions. [2022-04-28 08:39:38,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:39:38,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 155 [2022-04-28 08:39:38,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:39:38,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:38,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-28 08:39:38,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:38,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-28 08:39:38,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 461 transitions. [2022-04-28 08:39:38,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 461 edges. 461 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:38,923 INFO L225 Difference]: With dead ends: 1980 [2022-04-28 08:39:38,924 INFO L226 Difference]: Without dead ends: 1125 [2022-04-28 08:39:38,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:39:38,925 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 96 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:39:38,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 559 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 528 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:39:38,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2022-04-28 08:39:38,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 871. [2022-04-28 08:39:38,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:39:38,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1125 states. Second operand has 871 states, 866 states have (on average 1.4780600461893765) internal successors, (1280), 866 states have internal predecessors, (1280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:38,968 INFO L74 IsIncluded]: Start isIncluded. First operand 1125 states. Second operand has 871 states, 866 states have (on average 1.4780600461893765) internal successors, (1280), 866 states have internal predecessors, (1280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:38,969 INFO L87 Difference]: Start difference. First operand 1125 states. Second operand has 871 states, 866 states have (on average 1.4780600461893765) internal successors, (1280), 866 states have internal predecessors, (1280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:39,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:39,010 INFO L93 Difference]: Finished difference Result 1125 states and 1649 transitions. [2022-04-28 08:39:39,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1649 transitions. [2022-04-28 08:39:39,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:39:39,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:39:39,013 INFO L74 IsIncluded]: Start isIncluded. First operand has 871 states, 866 states have (on average 1.4780600461893765) internal successors, (1280), 866 states have internal predecessors, (1280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1125 states. [2022-04-28 08:39:39,014 INFO L87 Difference]: Start difference. First operand has 871 states, 866 states have (on average 1.4780600461893765) internal successors, (1280), 866 states have internal predecessors, (1280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1125 states. [2022-04-28 08:39:39,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:39,065 INFO L93 Difference]: Finished difference Result 1125 states and 1649 transitions. [2022-04-28 08:39:39,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1649 transitions. [2022-04-28 08:39:39,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:39:39,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:39:39,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:39:39,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:39:39,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 866 states have (on average 1.4780600461893765) internal successors, (1280), 866 states have internal predecessors, (1280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:39,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1284 transitions. [2022-04-28 08:39:39,115 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1284 transitions. Word has length 155 [2022-04-28 08:39:39,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:39:39,116 INFO L495 AbstractCegarLoop]: Abstraction has 871 states and 1284 transitions. [2022-04-28 08:39:39,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:39,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 871 states and 1284 transitions. [2022-04-28 08:39:40,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1284 edges. 1284 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:40,240 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1284 transitions. [2022-04-28 08:39:40,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-28 08:39:40,241 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:39:40,241 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:39:40,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 08:39:40,242 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:39:40,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:39:40,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1761005295, now seen corresponding path program 1 times [2022-04-28 08:39:40,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:40,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1077608258] [2022-04-28 08:39:57,432 WARN L232 SmtUtils]: Spent 12.12s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:40:05,179 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:40:05,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1761005295, now seen corresponding path program 2 times [2022-04-28 08:40:05,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:40:05,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557999809] [2022-04-28 08:40:05,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:40:05,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:40:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:05,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:40:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:05,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {52505#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {52498#true} is VALID [2022-04-28 08:40:05,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {52498#true} assume true; {52498#true} is VALID [2022-04-28 08:40:05,380 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52498#true} {52498#true} #593#return; {52498#true} is VALID [2022-04-28 08:40:05,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {52498#true} call ULTIMATE.init(); {52505#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:40:05,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {52505#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {52498#true} is VALID [2022-04-28 08:40:05,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {52498#true} assume true; {52498#true} is VALID [2022-04-28 08:40:05,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52498#true} {52498#true} #593#return; {52498#true} is VALID [2022-04-28 08:40:05,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {52498#true} call #t~ret158 := main(); {52498#true} is VALID [2022-04-28 08:40:05,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {52498#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {52498#true} is VALID [2022-04-28 08:40:05,382 INFO L272 TraceCheckUtils]: 6: Hoare triple {52498#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {52498#true} is VALID [2022-04-28 08:40:05,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {52498#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {52498#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {52498#true} is VALID [2022-04-28 08:40:05,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {52498#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {52498#true} is VALID [2022-04-28 08:40:05,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {52498#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {52498#true} is VALID [2022-04-28 08:40:05,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {52498#true} assume !false; {52498#true} is VALID [2022-04-28 08:40:05,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {52498#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {52498#true} assume 12292 == #t~mem49;havoc #t~mem49; {52498#true} is VALID [2022-04-28 08:40:05,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {52498#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {52498#true} is VALID [2022-04-28 08:40:05,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {52498#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {52498#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {52498#true} is VALID [2022-04-28 08:40:05,383 INFO L290 TraceCheckUtils]: 17: Hoare triple {52498#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {52498#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {52498#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {52498#true} is VALID [2022-04-28 08:40:05,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {52498#true} assume !(0 == ~tmp___4~0); {52498#true} is VALID [2022-04-28 08:40:05,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {52498#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,383 INFO L290 TraceCheckUtils]: 22: Hoare triple {52498#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,383 INFO L290 TraceCheckUtils]: 23: Hoare triple {52498#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52498#true} is VALID [2022-04-28 08:40:05,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {52498#true} ~skip~0 := 0; {52498#true} is VALID [2022-04-28 08:40:05,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {52498#true} assume !false; {52498#true} is VALID [2022-04-28 08:40:05,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {52498#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,383 INFO L290 TraceCheckUtils]: 27: Hoare triple {52498#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,384 INFO L290 TraceCheckUtils]: 28: Hoare triple {52498#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,384 INFO L290 TraceCheckUtils]: 29: Hoare triple {52498#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,384 INFO L290 TraceCheckUtils]: 30: Hoare triple {52498#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,384 INFO L290 TraceCheckUtils]: 31: Hoare triple {52498#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,384 INFO L290 TraceCheckUtils]: 32: Hoare triple {52498#true} assume 4368 == #t~mem54;havoc #t~mem54; {52498#true} is VALID [2022-04-28 08:40:05,384 INFO L290 TraceCheckUtils]: 33: Hoare triple {52498#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {52498#true} is VALID [2022-04-28 08:40:05,384 INFO L290 TraceCheckUtils]: 34: Hoare triple {52498#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {52498#true} is VALID [2022-04-28 08:40:05,384 INFO L290 TraceCheckUtils]: 35: Hoare triple {52498#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,384 INFO L290 TraceCheckUtils]: 36: Hoare triple {52498#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {52498#true} is VALID [2022-04-28 08:40:05,384 INFO L290 TraceCheckUtils]: 37: Hoare triple {52498#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,384 INFO L290 TraceCheckUtils]: 38: Hoare triple {52498#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52498#true} is VALID [2022-04-28 08:40:05,384 INFO L290 TraceCheckUtils]: 39: Hoare triple {52498#true} ~skip~0 := 0; {52498#true} is VALID [2022-04-28 08:40:05,385 INFO L290 TraceCheckUtils]: 40: Hoare triple {52498#true} assume !false; {52498#true} is VALID [2022-04-28 08:40:05,385 INFO L290 TraceCheckUtils]: 41: Hoare triple {52498#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,385 INFO L290 TraceCheckUtils]: 42: Hoare triple {52498#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,385 INFO L290 TraceCheckUtils]: 43: Hoare triple {52498#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,385 INFO L290 TraceCheckUtils]: 44: Hoare triple {52498#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,385 INFO L290 TraceCheckUtils]: 45: Hoare triple {52498#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,385 INFO L290 TraceCheckUtils]: 46: Hoare triple {52498#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,385 INFO L290 TraceCheckUtils]: 47: Hoare triple {52498#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,385 INFO L290 TraceCheckUtils]: 48: Hoare triple {52498#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,385 INFO L290 TraceCheckUtils]: 49: Hoare triple {52498#true} assume 4384 == #t~mem56;havoc #t~mem56; {52498#true} is VALID [2022-04-28 08:40:05,385 INFO L290 TraceCheckUtils]: 50: Hoare triple {52498#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {52498#true} is VALID [2022-04-28 08:40:05,385 INFO L290 TraceCheckUtils]: 51: Hoare triple {52498#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {52498#true} is VALID [2022-04-28 08:40:05,386 INFO L290 TraceCheckUtils]: 52: Hoare triple {52498#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,386 INFO L290 TraceCheckUtils]: 53: Hoare triple {52498#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,386 INFO L290 TraceCheckUtils]: 54: Hoare triple {52498#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,386 INFO L290 TraceCheckUtils]: 55: Hoare triple {52498#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,386 INFO L290 TraceCheckUtils]: 56: Hoare triple {52498#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52498#true} is VALID [2022-04-28 08:40:05,386 INFO L290 TraceCheckUtils]: 57: Hoare triple {52498#true} ~skip~0 := 0; {52498#true} is VALID [2022-04-28 08:40:05,386 INFO L290 TraceCheckUtils]: 58: Hoare triple {52498#true} assume !false; {52498#true} is VALID [2022-04-28 08:40:05,386 INFO L290 TraceCheckUtils]: 59: Hoare triple {52498#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,386 INFO L290 TraceCheckUtils]: 60: Hoare triple {52498#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,386 INFO L290 TraceCheckUtils]: 61: Hoare triple {52498#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,386 INFO L290 TraceCheckUtils]: 62: Hoare triple {52498#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,386 INFO L290 TraceCheckUtils]: 63: Hoare triple {52498#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,386 INFO L290 TraceCheckUtils]: 64: Hoare triple {52498#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,387 INFO L290 TraceCheckUtils]: 65: Hoare triple {52498#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,387 INFO L290 TraceCheckUtils]: 66: Hoare triple {52498#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,387 INFO L290 TraceCheckUtils]: 67: Hoare triple {52498#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,387 INFO L290 TraceCheckUtils]: 68: Hoare triple {52498#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,387 INFO L290 TraceCheckUtils]: 69: Hoare triple {52498#true} assume 4400 == #t~mem58;havoc #t~mem58; {52498#true} is VALID [2022-04-28 08:40:05,387 INFO L290 TraceCheckUtils]: 70: Hoare triple {52498#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,387 INFO L290 TraceCheckUtils]: 71: Hoare triple {52498#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {52498#true} is VALID [2022-04-28 08:40:05,387 INFO L290 TraceCheckUtils]: 72: Hoare triple {52498#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {52498#true} is VALID [2022-04-28 08:40:05,387 INFO L290 TraceCheckUtils]: 73: Hoare triple {52498#true} assume !(~ret~0 <= 0); {52498#true} is VALID [2022-04-28 08:40:05,387 INFO L290 TraceCheckUtils]: 74: Hoare triple {52498#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,387 INFO L290 TraceCheckUtils]: 75: Hoare triple {52498#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,387 INFO L290 TraceCheckUtils]: 76: Hoare triple {52498#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52498#true} is VALID [2022-04-28 08:40:05,388 INFO L290 TraceCheckUtils]: 77: Hoare triple {52498#true} ~skip~0 := 0; {52498#true} is VALID [2022-04-28 08:40:05,388 INFO L290 TraceCheckUtils]: 78: Hoare triple {52498#true} assume !false; {52498#true} is VALID [2022-04-28 08:40:05,388 INFO L290 TraceCheckUtils]: 79: Hoare triple {52498#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,388 INFO L290 TraceCheckUtils]: 80: Hoare triple {52498#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,388 INFO L290 TraceCheckUtils]: 81: Hoare triple {52498#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,388 INFO L290 TraceCheckUtils]: 82: Hoare triple {52498#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,388 INFO L290 TraceCheckUtils]: 83: Hoare triple {52498#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,388 INFO L290 TraceCheckUtils]: 84: Hoare triple {52498#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,388 INFO L290 TraceCheckUtils]: 85: Hoare triple {52498#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,388 INFO L290 TraceCheckUtils]: 86: Hoare triple {52498#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,388 INFO L290 TraceCheckUtils]: 87: Hoare triple {52498#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,388 INFO L290 TraceCheckUtils]: 88: Hoare triple {52498#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,389 INFO L290 TraceCheckUtils]: 89: Hoare triple {52498#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,389 INFO L290 TraceCheckUtils]: 90: Hoare triple {52498#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-28 08:40:05,389 INFO L290 TraceCheckUtils]: 91: Hoare triple {52498#true} assume 4416 == #t~mem60;havoc #t~mem60; {52498#true} is VALID [2022-04-28 08:40:05,389 INFO L290 TraceCheckUtils]: 92: Hoare triple {52498#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {52498#true} is VALID [2022-04-28 08:40:05,389 INFO L290 TraceCheckUtils]: 93: Hoare triple {52498#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {52498#true} is VALID [2022-04-28 08:40:05,390 INFO L290 TraceCheckUtils]: 94: Hoare triple {52498#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:05,390 INFO L290 TraceCheckUtils]: 95: Hoare triple {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:05,391 INFO L290 TraceCheckUtils]: 96: Hoare triple {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:05,391 INFO L290 TraceCheckUtils]: 97: Hoare triple {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:05,391 INFO L290 TraceCheckUtils]: 98: Hoare triple {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:05,392 INFO L290 TraceCheckUtils]: 99: Hoare triple {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:05,392 INFO L290 TraceCheckUtils]: 100: Hoare triple {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:05,393 INFO L290 TraceCheckUtils]: 101: Hoare triple {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:05,393 INFO L290 TraceCheckUtils]: 102: Hoare triple {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:05,393 INFO L290 TraceCheckUtils]: 103: Hoare triple {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52504#(not (= |ssl3_connect_#t~mem52| 20480))} is VALID [2022-04-28 08:40:05,394 INFO L290 TraceCheckUtils]: 104: Hoare triple {52504#(not (= |ssl3_connect_#t~mem52| 20480))} assume 20480 == #t~mem52;havoc #t~mem52; {52499#false} is VALID [2022-04-28 08:40:05,394 INFO L290 TraceCheckUtils]: 105: Hoare triple {52499#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,394 INFO L290 TraceCheckUtils]: 106: Hoare triple {52499#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {52499#false} is VALID [2022-04-28 08:40:05,394 INFO L290 TraceCheckUtils]: 107: Hoare triple {52499#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,394 INFO L290 TraceCheckUtils]: 108: Hoare triple {52499#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,394 INFO L290 TraceCheckUtils]: 109: Hoare triple {52499#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {52499#false} is VALID [2022-04-28 08:40:05,394 INFO L290 TraceCheckUtils]: 110: Hoare triple {52499#false} assume !(0 == ~tmp___4~0); {52499#false} is VALID [2022-04-28 08:40:05,394 INFO L290 TraceCheckUtils]: 111: Hoare triple {52499#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,394 INFO L290 TraceCheckUtils]: 112: Hoare triple {52499#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,394 INFO L290 TraceCheckUtils]: 113: Hoare triple {52499#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52499#false} is VALID [2022-04-28 08:40:05,394 INFO L290 TraceCheckUtils]: 114: Hoare triple {52499#false} ~skip~0 := 0; {52499#false} is VALID [2022-04-28 08:40:05,395 INFO L290 TraceCheckUtils]: 115: Hoare triple {52499#false} assume !false; {52499#false} is VALID [2022-04-28 08:40:05,395 INFO L290 TraceCheckUtils]: 116: Hoare triple {52499#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,395 INFO L290 TraceCheckUtils]: 117: Hoare triple {52499#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,395 INFO L290 TraceCheckUtils]: 118: Hoare triple {52499#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,395 INFO L290 TraceCheckUtils]: 119: Hoare triple {52499#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,395 INFO L290 TraceCheckUtils]: 120: Hoare triple {52499#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,395 INFO L290 TraceCheckUtils]: 121: Hoare triple {52499#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,395 INFO L290 TraceCheckUtils]: 122: Hoare triple {52499#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,395 INFO L290 TraceCheckUtils]: 123: Hoare triple {52499#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,395 INFO L290 TraceCheckUtils]: 124: Hoare triple {52499#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,395 INFO L290 TraceCheckUtils]: 125: Hoare triple {52499#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,395 INFO L290 TraceCheckUtils]: 126: Hoare triple {52499#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,396 INFO L290 TraceCheckUtils]: 127: Hoare triple {52499#false} assume 4401 == #t~mem59;havoc #t~mem59; {52499#false} is VALID [2022-04-28 08:40:05,396 INFO L290 TraceCheckUtils]: 128: Hoare triple {52499#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,396 INFO L290 TraceCheckUtils]: 129: Hoare triple {52499#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {52499#false} is VALID [2022-04-28 08:40:05,396 INFO L290 TraceCheckUtils]: 130: Hoare triple {52499#false} assume !(2 == ~blastFlag~0); {52499#false} is VALID [2022-04-28 08:40:05,396 INFO L290 TraceCheckUtils]: 131: Hoare triple {52499#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {52499#false} is VALID [2022-04-28 08:40:05,396 INFO L290 TraceCheckUtils]: 132: Hoare triple {52499#false} assume !(~ret~0 <= 0); {52499#false} is VALID [2022-04-28 08:40:05,396 INFO L290 TraceCheckUtils]: 133: Hoare triple {52499#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,396 INFO L290 TraceCheckUtils]: 134: Hoare triple {52499#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,396 INFO L290 TraceCheckUtils]: 135: Hoare triple {52499#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52499#false} is VALID [2022-04-28 08:40:05,396 INFO L290 TraceCheckUtils]: 136: Hoare triple {52499#false} ~skip~0 := 0; {52499#false} is VALID [2022-04-28 08:40:05,396 INFO L290 TraceCheckUtils]: 137: Hoare triple {52499#false} assume !false; {52499#false} is VALID [2022-04-28 08:40:05,396 INFO L290 TraceCheckUtils]: 138: Hoare triple {52499#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,397 INFO L290 TraceCheckUtils]: 139: Hoare triple {52499#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,397 INFO L290 TraceCheckUtils]: 140: Hoare triple {52499#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,397 INFO L290 TraceCheckUtils]: 141: Hoare triple {52499#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,397 INFO L290 TraceCheckUtils]: 142: Hoare triple {52499#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,397 INFO L290 TraceCheckUtils]: 143: Hoare triple {52499#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,397 INFO L290 TraceCheckUtils]: 144: Hoare triple {52499#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,397 INFO L290 TraceCheckUtils]: 145: Hoare triple {52499#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,397 INFO L290 TraceCheckUtils]: 146: Hoare triple {52499#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,397 INFO L290 TraceCheckUtils]: 147: Hoare triple {52499#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,397 INFO L290 TraceCheckUtils]: 148: Hoare triple {52499#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,397 INFO L290 TraceCheckUtils]: 149: Hoare triple {52499#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,397 INFO L290 TraceCheckUtils]: 150: Hoare triple {52499#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,398 INFO L290 TraceCheckUtils]: 151: Hoare triple {52499#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-28 08:40:05,398 INFO L290 TraceCheckUtils]: 152: Hoare triple {52499#false} assume 4432 == #t~mem62;havoc #t~mem62; {52499#false} is VALID [2022-04-28 08:40:05,398 INFO L290 TraceCheckUtils]: 153: Hoare triple {52499#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {52499#false} is VALID [2022-04-28 08:40:05,398 INFO L290 TraceCheckUtils]: 154: Hoare triple {52499#false} assume 5 == ~blastFlag~0; {52499#false} is VALID [2022-04-28 08:40:05,398 INFO L290 TraceCheckUtils]: 155: Hoare triple {52499#false} assume !false; {52499#false} is VALID [2022-04-28 08:40:05,398 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-04-28 08:40:05,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:40:05,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557999809] [2022-04-28 08:40:05,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557999809] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:05,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:05,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:05,399 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:40:05,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1077608258] [2022-04-28 08:40:05,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1077608258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:05,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:05,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:05,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816058947] [2022-04-28 08:40:05,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:40:05,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 156 [2022-04-28 08:40:05,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:40:05,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:05,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:05,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:40:05,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:05,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:40:05,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:40:05,481 INFO L87 Difference]: Start difference. First operand 871 states and 1284 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:07,500 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:40:08,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:08,600 INFO L93 Difference]: Finished difference Result 2115 states and 3127 transitions. [2022-04-28 08:40:08,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:40:08,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 156 [2022-04-28 08:40:08,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:40:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:08,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-28 08:40:08,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:08,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-28 08:40:08,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-28 08:40:08,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:08,987 INFO L225 Difference]: With dead ends: 2115 [2022-04-28 08:40:08,987 INFO L226 Difference]: Without dead ends: 1260 [2022-04-28 08:40:08,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:40:08,988 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 116 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:40:08,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:40:08,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2022-04-28 08:40:09,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 881. [2022-04-28 08:40:09,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:40:09,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1260 states. Second operand has 881 states, 876 states have (on average 1.4680365296803652) internal successors, (1286), 876 states have internal predecessors, (1286), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:09,040 INFO L74 IsIncluded]: Start isIncluded. First operand 1260 states. Second operand has 881 states, 876 states have (on average 1.4680365296803652) internal successors, (1286), 876 states have internal predecessors, (1286), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:09,041 INFO L87 Difference]: Start difference. First operand 1260 states. Second operand has 881 states, 876 states have (on average 1.4680365296803652) internal successors, (1286), 876 states have internal predecessors, (1286), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:09,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:09,103 INFO L93 Difference]: Finished difference Result 1260 states and 1849 transitions. [2022-04-28 08:40:09,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1849 transitions. [2022-04-28 08:40:09,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:09,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:09,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 881 states, 876 states have (on average 1.4680365296803652) internal successors, (1286), 876 states have internal predecessors, (1286), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1260 states. [2022-04-28 08:40:09,107 INFO L87 Difference]: Start difference. First operand has 881 states, 876 states have (on average 1.4680365296803652) internal successors, (1286), 876 states have internal predecessors, (1286), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1260 states. [2022-04-28 08:40:09,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:09,172 INFO L93 Difference]: Finished difference Result 1260 states and 1849 transitions. [2022-04-28 08:40:09,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1849 transitions. [2022-04-28 08:40:09,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:09,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:09,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:40:09,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:40:09,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 876 states have (on average 1.4680365296803652) internal successors, (1286), 876 states have internal predecessors, (1286), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:09,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1290 transitions. [2022-04-28 08:40:09,227 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1290 transitions. Word has length 156 [2022-04-28 08:40:09,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:40:09,227 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1290 transitions. [2022-04-28 08:40:09,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:09,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 881 states and 1290 transitions. [2022-04-28 08:40:10,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1290 edges. 1290 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:10,459 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1290 transitions. [2022-04-28 08:40:10,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-28 08:40:10,460 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:40:10,461 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:40:10,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 08:40:10,461 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:40:10,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:40:10,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1272587528, now seen corresponding path program 1 times [2022-04-28 08:40:10,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:10,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [112559333] [2022-04-28 08:40:25,923 WARN L232 SmtUtils]: Spent 10.70s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:40:34,990 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:40:34,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1272587528, now seen corresponding path program 2 times [2022-04-28 08:40:34,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:40:34,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552543535] [2022-04-28 08:40:34,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:40:34,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:40:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:35,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:40:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:35,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {61029#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {61022#true} is VALID [2022-04-28 08:40:35,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {61022#true} assume true; {61022#true} is VALID [2022-04-28 08:40:35,189 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61022#true} {61022#true} #593#return; {61022#true} is VALID [2022-04-28 08:40:35,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {61022#true} call ULTIMATE.init(); {61029#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:40:35,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {61029#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {61022#true} is VALID [2022-04-28 08:40:35,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {61022#true} assume true; {61022#true} is VALID [2022-04-28 08:40:35,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61022#true} {61022#true} #593#return; {61022#true} is VALID [2022-04-28 08:40:35,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {61022#true} call #t~ret158 := main(); {61022#true} is VALID [2022-04-28 08:40:35,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {61022#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {61022#true} is VALID [2022-04-28 08:40:35,191 INFO L272 TraceCheckUtils]: 6: Hoare triple {61022#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {61022#true} is VALID [2022-04-28 08:40:35,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {61022#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {61022#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {61022#true} is VALID [2022-04-28 08:40:35,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {61022#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {61022#true} is VALID [2022-04-28 08:40:35,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {61022#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {61022#true} is VALID [2022-04-28 08:40:35,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {61022#true} assume !false; {61022#true} is VALID [2022-04-28 08:40:35,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {61022#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {61022#true} assume 12292 == #t~mem49;havoc #t~mem49; {61022#true} is VALID [2022-04-28 08:40:35,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {61022#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {61022#true} is VALID [2022-04-28 08:40:35,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {61022#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {61022#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {61022#true} is VALID [2022-04-28 08:40:35,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {61022#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {61022#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {61022#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {61022#true} is VALID [2022-04-28 08:40:35,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {61022#true} assume !(0 == ~tmp___4~0); {61022#true} is VALID [2022-04-28 08:40:35,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {61022#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {61022#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {61022#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {61022#true} is VALID [2022-04-28 08:40:35,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {61022#true} ~skip~0 := 0; {61022#true} is VALID [2022-04-28 08:40:35,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {61022#true} assume !false; {61022#true} is VALID [2022-04-28 08:40:35,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {61022#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {61022#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,192 INFO L290 TraceCheckUtils]: 28: Hoare triple {61022#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {61022#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {61022#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {61022#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {61022#true} assume 4368 == #t~mem54;havoc #t~mem54; {61022#true} is VALID [2022-04-28 08:40:35,193 INFO L290 TraceCheckUtils]: 33: Hoare triple {61022#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {61022#true} is VALID [2022-04-28 08:40:35,193 INFO L290 TraceCheckUtils]: 34: Hoare triple {61022#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {61022#true} is VALID [2022-04-28 08:40:35,193 INFO L290 TraceCheckUtils]: 35: Hoare triple {61022#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,193 INFO L290 TraceCheckUtils]: 36: Hoare triple {61022#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {61022#true} is VALID [2022-04-28 08:40:35,193 INFO L290 TraceCheckUtils]: 37: Hoare triple {61022#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,193 INFO L290 TraceCheckUtils]: 38: Hoare triple {61022#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {61022#true} is VALID [2022-04-28 08:40:35,193 INFO L290 TraceCheckUtils]: 39: Hoare triple {61022#true} ~skip~0 := 0; {61022#true} is VALID [2022-04-28 08:40:35,193 INFO L290 TraceCheckUtils]: 40: Hoare triple {61022#true} assume !false; {61022#true} is VALID [2022-04-28 08:40:35,194 INFO L290 TraceCheckUtils]: 41: Hoare triple {61022#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,194 INFO L290 TraceCheckUtils]: 42: Hoare triple {61022#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,194 INFO L290 TraceCheckUtils]: 43: Hoare triple {61022#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,194 INFO L290 TraceCheckUtils]: 44: Hoare triple {61022#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,194 INFO L290 TraceCheckUtils]: 45: Hoare triple {61022#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,194 INFO L290 TraceCheckUtils]: 46: Hoare triple {61022#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,194 INFO L290 TraceCheckUtils]: 47: Hoare triple {61022#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,194 INFO L290 TraceCheckUtils]: 48: Hoare triple {61022#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,194 INFO L290 TraceCheckUtils]: 49: Hoare triple {61022#true} assume 4384 == #t~mem56;havoc #t~mem56; {61022#true} is VALID [2022-04-28 08:40:35,194 INFO L290 TraceCheckUtils]: 50: Hoare triple {61022#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {61022#true} is VALID [2022-04-28 08:40:35,194 INFO L290 TraceCheckUtils]: 51: Hoare triple {61022#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {61022#true} is VALID [2022-04-28 08:40:35,194 INFO L290 TraceCheckUtils]: 52: Hoare triple {61022#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,195 INFO L290 TraceCheckUtils]: 53: Hoare triple {61022#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,195 INFO L290 TraceCheckUtils]: 54: Hoare triple {61022#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,195 INFO L290 TraceCheckUtils]: 55: Hoare triple {61022#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,195 INFO L290 TraceCheckUtils]: 56: Hoare triple {61022#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {61022#true} is VALID [2022-04-28 08:40:35,195 INFO L290 TraceCheckUtils]: 57: Hoare triple {61022#true} ~skip~0 := 0; {61022#true} is VALID [2022-04-28 08:40:35,195 INFO L290 TraceCheckUtils]: 58: Hoare triple {61022#true} assume !false; {61022#true} is VALID [2022-04-28 08:40:35,195 INFO L290 TraceCheckUtils]: 59: Hoare triple {61022#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,195 INFO L290 TraceCheckUtils]: 60: Hoare triple {61022#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,195 INFO L290 TraceCheckUtils]: 61: Hoare triple {61022#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,195 INFO L290 TraceCheckUtils]: 62: Hoare triple {61022#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,195 INFO L290 TraceCheckUtils]: 63: Hoare triple {61022#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,195 INFO L290 TraceCheckUtils]: 64: Hoare triple {61022#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,195 INFO L290 TraceCheckUtils]: 65: Hoare triple {61022#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,196 INFO L290 TraceCheckUtils]: 66: Hoare triple {61022#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,196 INFO L290 TraceCheckUtils]: 67: Hoare triple {61022#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,196 INFO L290 TraceCheckUtils]: 68: Hoare triple {61022#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,196 INFO L290 TraceCheckUtils]: 69: Hoare triple {61022#true} assume 4400 == #t~mem58;havoc #t~mem58; {61022#true} is VALID [2022-04-28 08:40:35,196 INFO L290 TraceCheckUtils]: 70: Hoare triple {61022#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,196 INFO L290 TraceCheckUtils]: 71: Hoare triple {61022#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {61022#true} is VALID [2022-04-28 08:40:35,196 INFO L290 TraceCheckUtils]: 72: Hoare triple {61022#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {61022#true} is VALID [2022-04-28 08:40:35,196 INFO L290 TraceCheckUtils]: 73: Hoare triple {61022#true} assume !(~ret~0 <= 0); {61022#true} is VALID [2022-04-28 08:40:35,196 INFO L290 TraceCheckUtils]: 74: Hoare triple {61022#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,196 INFO L290 TraceCheckUtils]: 75: Hoare triple {61022#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,196 INFO L290 TraceCheckUtils]: 76: Hoare triple {61022#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {61022#true} is VALID [2022-04-28 08:40:35,196 INFO L290 TraceCheckUtils]: 77: Hoare triple {61022#true} ~skip~0 := 0; {61022#true} is VALID [2022-04-28 08:40:35,196 INFO L290 TraceCheckUtils]: 78: Hoare triple {61022#true} assume !false; {61022#true} is VALID [2022-04-28 08:40:35,197 INFO L290 TraceCheckUtils]: 79: Hoare triple {61022#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,197 INFO L290 TraceCheckUtils]: 80: Hoare triple {61022#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,197 INFO L290 TraceCheckUtils]: 81: Hoare triple {61022#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,197 INFO L290 TraceCheckUtils]: 82: Hoare triple {61022#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,197 INFO L290 TraceCheckUtils]: 83: Hoare triple {61022#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,197 INFO L290 TraceCheckUtils]: 84: Hoare triple {61022#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,197 INFO L290 TraceCheckUtils]: 85: Hoare triple {61022#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,197 INFO L290 TraceCheckUtils]: 86: Hoare triple {61022#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,197 INFO L290 TraceCheckUtils]: 87: Hoare triple {61022#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,197 INFO L290 TraceCheckUtils]: 88: Hoare triple {61022#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,197 INFO L290 TraceCheckUtils]: 89: Hoare triple {61022#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,197 INFO L290 TraceCheckUtils]: 90: Hoare triple {61022#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-28 08:40:35,197 INFO L290 TraceCheckUtils]: 91: Hoare triple {61022#true} assume 4416 == #t~mem60;havoc #t~mem60; {61022#true} is VALID [2022-04-28 08:40:35,198 INFO L290 TraceCheckUtils]: 92: Hoare triple {61022#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {61022#true} is VALID [2022-04-28 08:40:35,198 INFO L290 TraceCheckUtils]: 93: Hoare triple {61022#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {61022#true} is VALID [2022-04-28 08:40:35,199 INFO L290 TraceCheckUtils]: 94: Hoare triple {61022#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:35,199 INFO L290 TraceCheckUtils]: 95: Hoare triple {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:35,199 INFO L290 TraceCheckUtils]: 96: Hoare triple {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:35,200 INFO L290 TraceCheckUtils]: 97: Hoare triple {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:35,200 INFO L290 TraceCheckUtils]: 98: Hoare triple {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:35,200 INFO L290 TraceCheckUtils]: 99: Hoare triple {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:35,200 INFO L290 TraceCheckUtils]: 100: Hoare triple {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:35,201 INFO L290 TraceCheckUtils]: 101: Hoare triple {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:35,201 INFO L290 TraceCheckUtils]: 102: Hoare triple {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:35,201 INFO L290 TraceCheckUtils]: 103: Hoare triple {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:35,202 INFO L290 TraceCheckUtils]: 104: Hoare triple {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61028#(not (= |ssl3_connect_#t~mem53| 4099))} is VALID [2022-04-28 08:40:35,202 INFO L290 TraceCheckUtils]: 105: Hoare triple {61028#(not (= |ssl3_connect_#t~mem53| 4099))} assume 4099 == #t~mem53;havoc #t~mem53; {61023#false} is VALID [2022-04-28 08:40:35,202 INFO L290 TraceCheckUtils]: 106: Hoare triple {61023#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,202 INFO L290 TraceCheckUtils]: 107: Hoare triple {61023#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {61023#false} is VALID [2022-04-28 08:40:35,202 INFO L290 TraceCheckUtils]: 108: Hoare triple {61023#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,202 INFO L290 TraceCheckUtils]: 109: Hoare triple {61023#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,202 INFO L290 TraceCheckUtils]: 110: Hoare triple {61023#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {61023#false} is VALID [2022-04-28 08:40:35,203 INFO L290 TraceCheckUtils]: 111: Hoare triple {61023#false} assume !(0 == ~tmp___4~0); {61023#false} is VALID [2022-04-28 08:40:35,203 INFO L290 TraceCheckUtils]: 112: Hoare triple {61023#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,203 INFO L290 TraceCheckUtils]: 113: Hoare triple {61023#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,203 INFO L290 TraceCheckUtils]: 114: Hoare triple {61023#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {61023#false} is VALID [2022-04-28 08:40:35,203 INFO L290 TraceCheckUtils]: 115: Hoare triple {61023#false} ~skip~0 := 0; {61023#false} is VALID [2022-04-28 08:40:35,203 INFO L290 TraceCheckUtils]: 116: Hoare triple {61023#false} assume !false; {61023#false} is VALID [2022-04-28 08:40:35,203 INFO L290 TraceCheckUtils]: 117: Hoare triple {61023#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,203 INFO L290 TraceCheckUtils]: 118: Hoare triple {61023#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,203 INFO L290 TraceCheckUtils]: 119: Hoare triple {61023#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,203 INFO L290 TraceCheckUtils]: 120: Hoare triple {61023#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,203 INFO L290 TraceCheckUtils]: 121: Hoare triple {61023#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,203 INFO L290 TraceCheckUtils]: 122: Hoare triple {61023#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,203 INFO L290 TraceCheckUtils]: 123: Hoare triple {61023#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,204 INFO L290 TraceCheckUtils]: 124: Hoare triple {61023#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,204 INFO L290 TraceCheckUtils]: 125: Hoare triple {61023#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,204 INFO L290 TraceCheckUtils]: 126: Hoare triple {61023#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,204 INFO L290 TraceCheckUtils]: 127: Hoare triple {61023#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,204 INFO L290 TraceCheckUtils]: 128: Hoare triple {61023#false} assume 4401 == #t~mem59;havoc #t~mem59; {61023#false} is VALID [2022-04-28 08:40:35,204 INFO L290 TraceCheckUtils]: 129: Hoare triple {61023#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,204 INFO L290 TraceCheckUtils]: 130: Hoare triple {61023#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {61023#false} is VALID [2022-04-28 08:40:35,204 INFO L290 TraceCheckUtils]: 131: Hoare triple {61023#false} assume !(2 == ~blastFlag~0); {61023#false} is VALID [2022-04-28 08:40:35,204 INFO L290 TraceCheckUtils]: 132: Hoare triple {61023#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {61023#false} is VALID [2022-04-28 08:40:35,204 INFO L290 TraceCheckUtils]: 133: Hoare triple {61023#false} assume !(~ret~0 <= 0); {61023#false} is VALID [2022-04-28 08:40:35,204 INFO L290 TraceCheckUtils]: 134: Hoare triple {61023#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,204 INFO L290 TraceCheckUtils]: 135: Hoare triple {61023#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,205 INFO L290 TraceCheckUtils]: 136: Hoare triple {61023#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {61023#false} is VALID [2022-04-28 08:40:35,205 INFO L290 TraceCheckUtils]: 137: Hoare triple {61023#false} ~skip~0 := 0; {61023#false} is VALID [2022-04-28 08:40:35,205 INFO L290 TraceCheckUtils]: 138: Hoare triple {61023#false} assume !false; {61023#false} is VALID [2022-04-28 08:40:35,205 INFO L290 TraceCheckUtils]: 139: Hoare triple {61023#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,205 INFO L290 TraceCheckUtils]: 140: Hoare triple {61023#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,205 INFO L290 TraceCheckUtils]: 141: Hoare triple {61023#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,205 INFO L290 TraceCheckUtils]: 142: Hoare triple {61023#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,205 INFO L290 TraceCheckUtils]: 143: Hoare triple {61023#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,205 INFO L290 TraceCheckUtils]: 144: Hoare triple {61023#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,205 INFO L290 TraceCheckUtils]: 145: Hoare triple {61023#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,205 INFO L290 TraceCheckUtils]: 146: Hoare triple {61023#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,205 INFO L290 TraceCheckUtils]: 147: Hoare triple {61023#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,206 INFO L290 TraceCheckUtils]: 148: Hoare triple {61023#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,206 INFO L290 TraceCheckUtils]: 149: Hoare triple {61023#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,206 INFO L290 TraceCheckUtils]: 150: Hoare triple {61023#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,206 INFO L290 TraceCheckUtils]: 151: Hoare triple {61023#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,206 INFO L290 TraceCheckUtils]: 152: Hoare triple {61023#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-28 08:40:35,206 INFO L290 TraceCheckUtils]: 153: Hoare triple {61023#false} assume 4432 == #t~mem62;havoc #t~mem62; {61023#false} is VALID [2022-04-28 08:40:35,206 INFO L290 TraceCheckUtils]: 154: Hoare triple {61023#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {61023#false} is VALID [2022-04-28 08:40:35,206 INFO L290 TraceCheckUtils]: 155: Hoare triple {61023#false} assume 5 == ~blastFlag~0; {61023#false} is VALID [2022-04-28 08:40:35,206 INFO L290 TraceCheckUtils]: 156: Hoare triple {61023#false} assume !false; {61023#false} is VALID [2022-04-28 08:40:35,207 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-04-28 08:40:35,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:40:35,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552543535] [2022-04-28 08:40:35,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552543535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:35,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:35,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:35,207 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:40:35,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [112559333] [2022-04-28 08:40:35,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [112559333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:35,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:35,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:35,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042857355] [2022-04-28 08:40:35,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:40:35,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 157 [2022-04-28 08:40:35,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:40:35,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:35,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:35,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:40:35,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:35,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:40:35,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:40:35,291 INFO L87 Difference]: Start difference. First operand 881 states and 1290 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:37,316 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:40:38,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:38,435 INFO L93 Difference]: Finished difference Result 2125 states and 3119 transitions. [2022-04-28 08:40:38,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:40:38,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 157 [2022-04-28 08:40:38,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:40:38,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:38,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-28 08:40:38,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:38,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-28 08:40:38,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-28 08:40:38,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:38,830 INFO L225 Difference]: With dead ends: 2125 [2022-04-28 08:40:38,830 INFO L226 Difference]: Without dead ends: 1260 [2022-04-28 08:40:38,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:40:38,832 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 114 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:40:38,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:40:38,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2022-04-28 08:40:38,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 886. [2022-04-28 08:40:38,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:40:38,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1260 states. Second operand has 886 states, 881 states have (on average 1.4551645856980704) internal successors, (1282), 881 states have internal predecessors, (1282), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:38,888 INFO L74 IsIncluded]: Start isIncluded. First operand 1260 states. Second operand has 886 states, 881 states have (on average 1.4551645856980704) internal successors, (1282), 881 states have internal predecessors, (1282), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:38,889 INFO L87 Difference]: Start difference. First operand 1260 states. Second operand has 886 states, 881 states have (on average 1.4551645856980704) internal successors, (1282), 881 states have internal predecessors, (1282), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:38,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:38,941 INFO L93 Difference]: Finished difference Result 1260 states and 1835 transitions. [2022-04-28 08:40:38,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1835 transitions. [2022-04-28 08:40:38,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:38,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:38,943 INFO L74 IsIncluded]: Start isIncluded. First operand has 886 states, 881 states have (on average 1.4551645856980704) internal successors, (1282), 881 states have internal predecessors, (1282), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1260 states. [2022-04-28 08:40:38,944 INFO L87 Difference]: Start difference. First operand has 886 states, 881 states have (on average 1.4551645856980704) internal successors, (1282), 881 states have internal predecessors, (1282), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1260 states. [2022-04-28 08:40:38,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:38,998 INFO L93 Difference]: Finished difference Result 1260 states and 1835 transitions. [2022-04-28 08:40:38,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1835 transitions. [2022-04-28 08:40:39,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:39,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:39,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:40:39,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:40:39,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 881 states have (on average 1.4551645856980704) internal successors, (1282), 881 states have internal predecessors, (1282), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:39,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1286 transitions. [2022-04-28 08:40:39,044 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1286 transitions. Word has length 157 [2022-04-28 08:40:39,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:40:39,044 INFO L495 AbstractCegarLoop]: Abstraction has 886 states and 1286 transitions. [2022-04-28 08:40:39,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:39,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 886 states and 1286 transitions. [2022-04-28 08:40:40,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1286 edges. 1286 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:40,146 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1286 transitions. [2022-04-28 08:40:40,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-28 08:40:40,147 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:40:40,147 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:40:40,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 08:40:40,147 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:40:40,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:40:40,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1472512973, now seen corresponding path program 1 times [2022-04-28 08:40:40,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:40,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [190422560] [2022-04-28 08:40:51,673 WARN L232 SmtUtils]: Spent 7.89s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:41:00,297 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:41:00,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1472512973, now seen corresponding path program 2 times [2022-04-28 08:41:00,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:41:00,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340172158] [2022-04-28 08:41:00,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:41:00,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:41:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:00,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:41:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:00,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {69583#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {69576#true} is VALID [2022-04-28 08:41:00,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {69576#true} assume true; {69576#true} is VALID [2022-04-28 08:41:00,491 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {69576#true} {69576#true} #593#return; {69576#true} is VALID [2022-04-28 08:41:00,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {69576#true} call ULTIMATE.init(); {69583#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:41:00,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {69583#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {69576#true} is VALID [2022-04-28 08:41:00,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {69576#true} assume true; {69576#true} is VALID [2022-04-28 08:41:00,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69576#true} {69576#true} #593#return; {69576#true} is VALID [2022-04-28 08:41:00,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {69576#true} call #t~ret158 := main(); {69576#true} is VALID [2022-04-28 08:41:00,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {69576#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {69576#true} is VALID [2022-04-28 08:41:00,492 INFO L272 TraceCheckUtils]: 6: Hoare triple {69576#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {69576#true} is VALID [2022-04-28 08:41:00,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {69576#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {69576#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {69576#true} is VALID [2022-04-28 08:41:00,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {69576#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {69576#true} is VALID [2022-04-28 08:41:00,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {69576#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {69576#true} is VALID [2022-04-28 08:41:00,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {69576#true} assume !false; {69576#true} is VALID [2022-04-28 08:41:00,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {69576#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {69576#true} assume 12292 == #t~mem49;havoc #t~mem49; {69576#true} is VALID [2022-04-28 08:41:00,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {69576#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {69576#true} is VALID [2022-04-28 08:41:00,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {69576#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {69576#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {69576#true} is VALID [2022-04-28 08:41:00,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {69576#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {69576#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {69576#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {69576#true} is VALID [2022-04-28 08:41:00,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {69576#true} assume !(0 == ~tmp___4~0); {69576#true} is VALID [2022-04-28 08:41:00,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {69576#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {69576#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {69576#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {69576#true} is VALID [2022-04-28 08:41:00,496 INFO L290 TraceCheckUtils]: 24: Hoare triple {69576#true} ~skip~0 := 0; {69576#true} is VALID [2022-04-28 08:41:00,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {69576#true} assume !false; {69576#true} is VALID [2022-04-28 08:41:00,497 INFO L290 TraceCheckUtils]: 26: Hoare triple {69576#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,497 INFO L290 TraceCheckUtils]: 27: Hoare triple {69576#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,497 INFO L290 TraceCheckUtils]: 28: Hoare triple {69576#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {69576#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {69576#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,497 INFO L290 TraceCheckUtils]: 31: Hoare triple {69576#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,497 INFO L290 TraceCheckUtils]: 32: Hoare triple {69576#true} assume 4368 == #t~mem54;havoc #t~mem54; {69576#true} is VALID [2022-04-28 08:41:00,497 INFO L290 TraceCheckUtils]: 33: Hoare triple {69576#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {69576#true} is VALID [2022-04-28 08:41:00,497 INFO L290 TraceCheckUtils]: 34: Hoare triple {69576#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {69576#true} is VALID [2022-04-28 08:41:00,497 INFO L290 TraceCheckUtils]: 35: Hoare triple {69576#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,497 INFO L290 TraceCheckUtils]: 36: Hoare triple {69576#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {69576#true} is VALID [2022-04-28 08:41:00,497 INFO L290 TraceCheckUtils]: 37: Hoare triple {69576#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,498 INFO L290 TraceCheckUtils]: 38: Hoare triple {69576#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {69576#true} is VALID [2022-04-28 08:41:00,498 INFO L290 TraceCheckUtils]: 39: Hoare triple {69576#true} ~skip~0 := 0; {69576#true} is VALID [2022-04-28 08:41:00,498 INFO L290 TraceCheckUtils]: 40: Hoare triple {69576#true} assume !false; {69576#true} is VALID [2022-04-28 08:41:00,498 INFO L290 TraceCheckUtils]: 41: Hoare triple {69576#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,498 INFO L290 TraceCheckUtils]: 42: Hoare triple {69576#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,498 INFO L290 TraceCheckUtils]: 43: Hoare triple {69576#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,498 INFO L290 TraceCheckUtils]: 44: Hoare triple {69576#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,498 INFO L290 TraceCheckUtils]: 45: Hoare triple {69576#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,498 INFO L290 TraceCheckUtils]: 46: Hoare triple {69576#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,498 INFO L290 TraceCheckUtils]: 47: Hoare triple {69576#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,498 INFO L290 TraceCheckUtils]: 48: Hoare triple {69576#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,498 INFO L290 TraceCheckUtils]: 49: Hoare triple {69576#true} assume 4384 == #t~mem56;havoc #t~mem56; {69576#true} is VALID [2022-04-28 08:41:00,498 INFO L290 TraceCheckUtils]: 50: Hoare triple {69576#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {69576#true} is VALID [2022-04-28 08:41:00,499 INFO L290 TraceCheckUtils]: 51: Hoare triple {69576#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {69576#true} is VALID [2022-04-28 08:41:00,499 INFO L290 TraceCheckUtils]: 52: Hoare triple {69576#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,499 INFO L290 TraceCheckUtils]: 53: Hoare triple {69576#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,499 INFO L290 TraceCheckUtils]: 54: Hoare triple {69576#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,499 INFO L290 TraceCheckUtils]: 55: Hoare triple {69576#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,499 INFO L290 TraceCheckUtils]: 56: Hoare triple {69576#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {69576#true} is VALID [2022-04-28 08:41:00,499 INFO L290 TraceCheckUtils]: 57: Hoare triple {69576#true} ~skip~0 := 0; {69576#true} is VALID [2022-04-28 08:41:00,499 INFO L290 TraceCheckUtils]: 58: Hoare triple {69576#true} assume !false; {69576#true} is VALID [2022-04-28 08:41:00,499 INFO L290 TraceCheckUtils]: 59: Hoare triple {69576#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,499 INFO L290 TraceCheckUtils]: 60: Hoare triple {69576#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,499 INFO L290 TraceCheckUtils]: 61: Hoare triple {69576#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,499 INFO L290 TraceCheckUtils]: 62: Hoare triple {69576#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,500 INFO L290 TraceCheckUtils]: 63: Hoare triple {69576#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,500 INFO L290 TraceCheckUtils]: 64: Hoare triple {69576#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,500 INFO L290 TraceCheckUtils]: 65: Hoare triple {69576#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,500 INFO L290 TraceCheckUtils]: 66: Hoare triple {69576#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,500 INFO L290 TraceCheckUtils]: 67: Hoare triple {69576#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,500 INFO L290 TraceCheckUtils]: 68: Hoare triple {69576#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,500 INFO L290 TraceCheckUtils]: 69: Hoare triple {69576#true} assume 4400 == #t~mem58;havoc #t~mem58; {69576#true} is VALID [2022-04-28 08:41:00,500 INFO L290 TraceCheckUtils]: 70: Hoare triple {69576#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,500 INFO L290 TraceCheckUtils]: 71: Hoare triple {69576#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {69576#true} is VALID [2022-04-28 08:41:00,500 INFO L290 TraceCheckUtils]: 72: Hoare triple {69576#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {69576#true} is VALID [2022-04-28 08:41:00,500 INFO L290 TraceCheckUtils]: 73: Hoare triple {69576#true} assume !(~ret~0 <= 0); {69576#true} is VALID [2022-04-28 08:41:00,500 INFO L290 TraceCheckUtils]: 74: Hoare triple {69576#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,501 INFO L290 TraceCheckUtils]: 75: Hoare triple {69576#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,501 INFO L290 TraceCheckUtils]: 76: Hoare triple {69576#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {69576#true} is VALID [2022-04-28 08:41:00,501 INFO L290 TraceCheckUtils]: 77: Hoare triple {69576#true} ~skip~0 := 0; {69576#true} is VALID [2022-04-28 08:41:00,501 INFO L290 TraceCheckUtils]: 78: Hoare triple {69576#true} assume !false; {69576#true} is VALID [2022-04-28 08:41:00,501 INFO L290 TraceCheckUtils]: 79: Hoare triple {69576#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,501 INFO L290 TraceCheckUtils]: 80: Hoare triple {69576#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,501 INFO L290 TraceCheckUtils]: 81: Hoare triple {69576#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,501 INFO L290 TraceCheckUtils]: 82: Hoare triple {69576#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,501 INFO L290 TraceCheckUtils]: 83: Hoare triple {69576#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,501 INFO L290 TraceCheckUtils]: 84: Hoare triple {69576#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,501 INFO L290 TraceCheckUtils]: 85: Hoare triple {69576#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,501 INFO L290 TraceCheckUtils]: 86: Hoare triple {69576#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,502 INFO L290 TraceCheckUtils]: 87: Hoare triple {69576#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,502 INFO L290 TraceCheckUtils]: 88: Hoare triple {69576#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,502 INFO L290 TraceCheckUtils]: 89: Hoare triple {69576#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,502 INFO L290 TraceCheckUtils]: 90: Hoare triple {69576#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-28 08:41:00,502 INFO L290 TraceCheckUtils]: 91: Hoare triple {69576#true} assume 4416 == #t~mem60;havoc #t~mem60; {69576#true} is VALID [2022-04-28 08:41:00,502 INFO L290 TraceCheckUtils]: 92: Hoare triple {69576#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {69576#true} is VALID [2022-04-28 08:41:00,502 INFO L290 TraceCheckUtils]: 93: Hoare triple {69576#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {69576#true} is VALID [2022-04-28 08:41:00,503 INFO L290 TraceCheckUtils]: 94: Hoare triple {69576#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:00,503 INFO L290 TraceCheckUtils]: 95: Hoare triple {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:00,504 INFO L290 TraceCheckUtils]: 96: Hoare triple {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:00,504 INFO L290 TraceCheckUtils]: 97: Hoare triple {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:00,504 INFO L290 TraceCheckUtils]: 98: Hoare triple {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:00,504 INFO L290 TraceCheckUtils]: 99: Hoare triple {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:00,505 INFO L290 TraceCheckUtils]: 100: Hoare triple {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:00,505 INFO L290 TraceCheckUtils]: 101: Hoare triple {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:00,505 INFO L290 TraceCheckUtils]: 102: Hoare triple {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:00,506 INFO L290 TraceCheckUtils]: 103: Hoare triple {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:00,506 INFO L290 TraceCheckUtils]: 104: Hoare triple {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:00,506 INFO L290 TraceCheckUtils]: 105: Hoare triple {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:00,507 INFO L290 TraceCheckUtils]: 106: Hoare triple {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:00,507 INFO L290 TraceCheckUtils]: 107: Hoare triple {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {69582#(= |ssl3_connect_#t~mem56| 4432)} is VALID [2022-04-28 08:41:00,507 INFO L290 TraceCheckUtils]: 108: Hoare triple {69582#(= |ssl3_connect_#t~mem56| 4432)} assume 4384 == #t~mem56;havoc #t~mem56; {69577#false} is VALID [2022-04-28 08:41:00,507 INFO L290 TraceCheckUtils]: 109: Hoare triple {69577#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {69577#false} is VALID [2022-04-28 08:41:00,508 INFO L290 TraceCheckUtils]: 110: Hoare triple {69577#false} assume !(1 == ~blastFlag~0); {69577#false} is VALID [2022-04-28 08:41:00,508 INFO L290 TraceCheckUtils]: 111: Hoare triple {69577#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,508 INFO L290 TraceCheckUtils]: 112: Hoare triple {69577#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,508 INFO L290 TraceCheckUtils]: 113: Hoare triple {69577#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,508 INFO L290 TraceCheckUtils]: 114: Hoare triple {69577#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,508 INFO L290 TraceCheckUtils]: 115: Hoare triple {69577#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {69577#false} is VALID [2022-04-28 08:41:00,508 INFO L290 TraceCheckUtils]: 116: Hoare triple {69577#false} ~skip~0 := 0; {69577#false} is VALID [2022-04-28 08:41:00,508 INFO L290 TraceCheckUtils]: 117: Hoare triple {69577#false} assume !false; {69577#false} is VALID [2022-04-28 08:41:00,508 INFO L290 TraceCheckUtils]: 118: Hoare triple {69577#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,508 INFO L290 TraceCheckUtils]: 119: Hoare triple {69577#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,508 INFO L290 TraceCheckUtils]: 120: Hoare triple {69577#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,508 INFO L290 TraceCheckUtils]: 121: Hoare triple {69577#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,509 INFO L290 TraceCheckUtils]: 122: Hoare triple {69577#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,509 INFO L290 TraceCheckUtils]: 123: Hoare triple {69577#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,509 INFO L290 TraceCheckUtils]: 124: Hoare triple {69577#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,509 INFO L290 TraceCheckUtils]: 125: Hoare triple {69577#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,509 INFO L290 TraceCheckUtils]: 126: Hoare triple {69577#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,509 INFO L290 TraceCheckUtils]: 127: Hoare triple {69577#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,509 INFO L290 TraceCheckUtils]: 128: Hoare triple {69577#false} assume 4400 == #t~mem58;havoc #t~mem58; {69577#false} is VALID [2022-04-28 08:41:00,509 INFO L290 TraceCheckUtils]: 129: Hoare triple {69577#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,509 INFO L290 TraceCheckUtils]: 130: Hoare triple {69577#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {69577#false} is VALID [2022-04-28 08:41:00,509 INFO L290 TraceCheckUtils]: 131: Hoare triple {69577#false} assume !(2 == ~blastFlag~0); {69577#false} is VALID [2022-04-28 08:41:00,509 INFO L290 TraceCheckUtils]: 132: Hoare triple {69577#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {69577#false} is VALID [2022-04-28 08:41:00,509 INFO L290 TraceCheckUtils]: 133: Hoare triple {69577#false} assume !(~ret~0 <= 0); {69577#false} is VALID [2022-04-28 08:41:00,510 INFO L290 TraceCheckUtils]: 134: Hoare triple {69577#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,510 INFO L290 TraceCheckUtils]: 135: Hoare triple {69577#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,510 INFO L290 TraceCheckUtils]: 136: Hoare triple {69577#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {69577#false} is VALID [2022-04-28 08:41:00,510 INFO L290 TraceCheckUtils]: 137: Hoare triple {69577#false} ~skip~0 := 0; {69577#false} is VALID [2022-04-28 08:41:00,510 INFO L290 TraceCheckUtils]: 138: Hoare triple {69577#false} assume !false; {69577#false} is VALID [2022-04-28 08:41:00,510 INFO L290 TraceCheckUtils]: 139: Hoare triple {69577#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,510 INFO L290 TraceCheckUtils]: 140: Hoare triple {69577#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,510 INFO L290 TraceCheckUtils]: 141: Hoare triple {69577#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,510 INFO L290 TraceCheckUtils]: 142: Hoare triple {69577#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,510 INFO L290 TraceCheckUtils]: 143: Hoare triple {69577#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,510 INFO L290 TraceCheckUtils]: 144: Hoare triple {69577#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,511 INFO L290 TraceCheckUtils]: 145: Hoare triple {69577#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,511 INFO L290 TraceCheckUtils]: 146: Hoare triple {69577#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,511 INFO L290 TraceCheckUtils]: 147: Hoare triple {69577#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,511 INFO L290 TraceCheckUtils]: 148: Hoare triple {69577#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,511 INFO L290 TraceCheckUtils]: 149: Hoare triple {69577#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,511 INFO L290 TraceCheckUtils]: 150: Hoare triple {69577#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,511 INFO L290 TraceCheckUtils]: 151: Hoare triple {69577#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,511 INFO L290 TraceCheckUtils]: 152: Hoare triple {69577#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-28 08:41:00,511 INFO L290 TraceCheckUtils]: 153: Hoare triple {69577#false} assume 4432 == #t~mem62;havoc #t~mem62; {69577#false} is VALID [2022-04-28 08:41:00,511 INFO L290 TraceCheckUtils]: 154: Hoare triple {69577#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {69577#false} is VALID [2022-04-28 08:41:00,511 INFO L290 TraceCheckUtils]: 155: Hoare triple {69577#false} assume 5 == ~blastFlag~0; {69577#false} is VALID [2022-04-28 08:41:00,511 INFO L290 TraceCheckUtils]: 156: Hoare triple {69577#false} assume !false; {69577#false} is VALID [2022-04-28 08:41:00,512 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-04-28 08:41:00,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:41:00,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340172158] [2022-04-28 08:41:00,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340172158] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:41:00,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:41:00,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:41:00,513 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:41:00,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [190422560] [2022-04-28 08:41:00,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [190422560] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:41:00,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:41:00,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:41:00,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023392576] [2022-04-28 08:41:00,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:41:00,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 157 [2022-04-28 08:41:00,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:41:00,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:00,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:00,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:41:00,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:00,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:41:00,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:41:00,599 INFO L87 Difference]: Start difference. First operand 886 states and 1286 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:02,623 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:41:03,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:03,920 INFO L93 Difference]: Finished difference Result 1974 states and 2873 transitions. [2022-04-28 08:41:03,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:41:03,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 157 [2022-04-28 08:41:03,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:41:03,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:03,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 447 transitions. [2022-04-28 08:41:03,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:03,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 447 transitions. [2022-04-28 08:41:03,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 447 transitions. [2022-04-28 08:41:04,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 447 edges. 447 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:04,262 INFO L225 Difference]: With dead ends: 1974 [2022-04-28 08:41:04,262 INFO L226 Difference]: Without dead ends: 1104 [2022-04-28 08:41:04,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:41:04,263 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 81 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:41:04,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 541 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 503 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:41:04,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2022-04-28 08:41:04,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 886. [2022-04-28 08:41:04,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:41:04,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1104 states. Second operand has 886 states, 881 states have (on average 1.4506242905788875) internal successors, (1278), 881 states have internal predecessors, (1278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:04,319 INFO L74 IsIncluded]: Start isIncluded. First operand 1104 states. Second operand has 886 states, 881 states have (on average 1.4506242905788875) internal successors, (1278), 881 states have internal predecessors, (1278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:04,319 INFO L87 Difference]: Start difference. First operand 1104 states. Second operand has 886 states, 881 states have (on average 1.4506242905788875) internal successors, (1278), 881 states have internal predecessors, (1278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:04,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:04,368 INFO L93 Difference]: Finished difference Result 1104 states and 1603 transitions. [2022-04-28 08:41:04,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1603 transitions. [2022-04-28 08:41:04,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:04,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:04,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 886 states, 881 states have (on average 1.4506242905788875) internal successors, (1278), 881 states have internal predecessors, (1278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1104 states. [2022-04-28 08:41:04,371 INFO L87 Difference]: Start difference. First operand has 886 states, 881 states have (on average 1.4506242905788875) internal successors, (1278), 881 states have internal predecessors, (1278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1104 states. [2022-04-28 08:41:04,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:04,420 INFO L93 Difference]: Finished difference Result 1104 states and 1603 transitions. [2022-04-28 08:41:04,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1603 transitions. [2022-04-28 08:41:04,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:04,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:04,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:41:04,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:41:04,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 881 states have (on average 1.4506242905788875) internal successors, (1278), 881 states have internal predecessors, (1278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:04,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1282 transitions. [2022-04-28 08:41:04,460 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1282 transitions. Word has length 157 [2022-04-28 08:41:04,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:41:04,461 INFO L495 AbstractCegarLoop]: Abstraction has 886 states and 1282 transitions. [2022-04-28 08:41:04,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:04,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 886 states and 1282 transitions. [2022-04-28 08:41:05,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1282 edges. 1282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:05,599 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1282 transitions. [2022-04-28 08:41:05,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-04-28 08:41:05,600 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:41:05,600 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 4, 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-28 08:41:05,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 08:41:05,600 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:41:05,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:41:05,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1600786980, now seen corresponding path program 1 times [2022-04-28 08:41:05,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:05,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1117413233] [2022-04-28 08:41:19,624 WARN L232 SmtUtils]: Spent 10.25s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:41:27,453 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:41:27,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1600786980, now seen corresponding path program 2 times [2022-04-28 08:41:27,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:41:27,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198417187] [2022-04-28 08:41:27,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:41:27,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:41:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:27,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:41:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:27,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {77523#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {77516#true} is VALID [2022-04-28 08:41:27,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {77516#true} assume true; {77516#true} is VALID [2022-04-28 08:41:27,637 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77516#true} {77516#true} #593#return; {77516#true} is VALID [2022-04-28 08:41:27,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {77516#true} call ULTIMATE.init(); {77523#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:41:27,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {77523#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {77516#true} is VALID [2022-04-28 08:41:27,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {77516#true} assume true; {77516#true} is VALID [2022-04-28 08:41:27,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77516#true} {77516#true} #593#return; {77516#true} is VALID [2022-04-28 08:41:27,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {77516#true} call #t~ret158 := main(); {77516#true} is VALID [2022-04-28 08:41:27,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {77516#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {77516#true} is VALID [2022-04-28 08:41:27,638 INFO L272 TraceCheckUtils]: 6: Hoare triple {77516#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {77516#true} is VALID [2022-04-28 08:41:27,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {77516#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {77516#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {77516#true} is VALID [2022-04-28 08:41:27,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {77516#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {77516#true} is VALID [2022-04-28 08:41:27,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {77516#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {77516#true} is VALID [2022-04-28 08:41:27,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {77516#true} assume !false; {77516#true} is VALID [2022-04-28 08:41:27,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {77516#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {77516#true} assume 12292 == #t~mem49;havoc #t~mem49; {77516#true} is VALID [2022-04-28 08:41:27,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {77516#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {77516#true} is VALID [2022-04-28 08:41:27,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {77516#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {77516#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {77516#true} is VALID [2022-04-28 08:41:27,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {77516#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {77516#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {77516#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {77516#true} is VALID [2022-04-28 08:41:27,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {77516#true} assume !(0 == ~tmp___4~0); {77516#true} is VALID [2022-04-28 08:41:27,640 INFO L290 TraceCheckUtils]: 21: Hoare triple {77516#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {77516#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {77516#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77516#true} is VALID [2022-04-28 08:41:27,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {77516#true} ~skip~0 := 0; {77516#true} is VALID [2022-04-28 08:41:27,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {77516#true} assume !false; {77516#true} is VALID [2022-04-28 08:41:27,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {77516#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,640 INFO L290 TraceCheckUtils]: 27: Hoare triple {77516#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,640 INFO L290 TraceCheckUtils]: 28: Hoare triple {77516#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,640 INFO L290 TraceCheckUtils]: 29: Hoare triple {77516#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,640 INFO L290 TraceCheckUtils]: 30: Hoare triple {77516#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,640 INFO L290 TraceCheckUtils]: 31: Hoare triple {77516#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,640 INFO L290 TraceCheckUtils]: 32: Hoare triple {77516#true} assume 4368 == #t~mem54;havoc #t~mem54; {77516#true} is VALID [2022-04-28 08:41:27,641 INFO L290 TraceCheckUtils]: 33: Hoare triple {77516#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {77516#true} is VALID [2022-04-28 08:41:27,641 INFO L290 TraceCheckUtils]: 34: Hoare triple {77516#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {77516#true} is VALID [2022-04-28 08:41:27,641 INFO L290 TraceCheckUtils]: 35: Hoare triple {77516#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,641 INFO L290 TraceCheckUtils]: 36: Hoare triple {77516#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {77516#true} is VALID [2022-04-28 08:41:27,641 INFO L290 TraceCheckUtils]: 37: Hoare triple {77516#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,641 INFO L290 TraceCheckUtils]: 38: Hoare triple {77516#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77516#true} is VALID [2022-04-28 08:41:27,641 INFO L290 TraceCheckUtils]: 39: Hoare triple {77516#true} ~skip~0 := 0; {77516#true} is VALID [2022-04-28 08:41:27,641 INFO L290 TraceCheckUtils]: 40: Hoare triple {77516#true} assume !false; {77516#true} is VALID [2022-04-28 08:41:27,641 INFO L290 TraceCheckUtils]: 41: Hoare triple {77516#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,641 INFO L290 TraceCheckUtils]: 42: Hoare triple {77516#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,641 INFO L290 TraceCheckUtils]: 43: Hoare triple {77516#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,641 INFO L290 TraceCheckUtils]: 44: Hoare triple {77516#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,642 INFO L290 TraceCheckUtils]: 45: Hoare triple {77516#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,642 INFO L290 TraceCheckUtils]: 46: Hoare triple {77516#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,642 INFO L290 TraceCheckUtils]: 47: Hoare triple {77516#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,642 INFO L290 TraceCheckUtils]: 48: Hoare triple {77516#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,642 INFO L290 TraceCheckUtils]: 49: Hoare triple {77516#true} assume 4384 == #t~mem56;havoc #t~mem56; {77516#true} is VALID [2022-04-28 08:41:27,642 INFO L290 TraceCheckUtils]: 50: Hoare triple {77516#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {77516#true} is VALID [2022-04-28 08:41:27,642 INFO L290 TraceCheckUtils]: 51: Hoare triple {77516#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {77516#true} is VALID [2022-04-28 08:41:27,642 INFO L290 TraceCheckUtils]: 52: Hoare triple {77516#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,642 INFO L290 TraceCheckUtils]: 53: Hoare triple {77516#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,642 INFO L290 TraceCheckUtils]: 54: Hoare triple {77516#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,642 INFO L290 TraceCheckUtils]: 55: Hoare triple {77516#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,643 INFO L290 TraceCheckUtils]: 56: Hoare triple {77516#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77516#true} is VALID [2022-04-28 08:41:27,643 INFO L290 TraceCheckUtils]: 57: Hoare triple {77516#true} ~skip~0 := 0; {77516#true} is VALID [2022-04-28 08:41:27,643 INFO L290 TraceCheckUtils]: 58: Hoare triple {77516#true} assume !false; {77516#true} is VALID [2022-04-28 08:41:27,643 INFO L290 TraceCheckUtils]: 59: Hoare triple {77516#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,643 INFO L290 TraceCheckUtils]: 60: Hoare triple {77516#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,643 INFO L290 TraceCheckUtils]: 61: Hoare triple {77516#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,643 INFO L290 TraceCheckUtils]: 62: Hoare triple {77516#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,643 INFO L290 TraceCheckUtils]: 63: Hoare triple {77516#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,643 INFO L290 TraceCheckUtils]: 64: Hoare triple {77516#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,643 INFO L290 TraceCheckUtils]: 65: Hoare triple {77516#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,643 INFO L290 TraceCheckUtils]: 66: Hoare triple {77516#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,644 INFO L290 TraceCheckUtils]: 67: Hoare triple {77516#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,644 INFO L290 TraceCheckUtils]: 68: Hoare triple {77516#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,644 INFO L290 TraceCheckUtils]: 69: Hoare triple {77516#true} assume 4400 == #t~mem58;havoc #t~mem58; {77516#true} is VALID [2022-04-28 08:41:27,644 INFO L290 TraceCheckUtils]: 70: Hoare triple {77516#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,644 INFO L290 TraceCheckUtils]: 71: Hoare triple {77516#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {77516#true} is VALID [2022-04-28 08:41:27,644 INFO L290 TraceCheckUtils]: 72: Hoare triple {77516#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {77516#true} is VALID [2022-04-28 08:41:27,644 INFO L290 TraceCheckUtils]: 73: Hoare triple {77516#true} assume !(~ret~0 <= 0); {77516#true} is VALID [2022-04-28 08:41:27,644 INFO L290 TraceCheckUtils]: 74: Hoare triple {77516#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,644 INFO L290 TraceCheckUtils]: 75: Hoare triple {77516#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,644 INFO L290 TraceCheckUtils]: 76: Hoare triple {77516#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77516#true} is VALID [2022-04-28 08:41:27,644 INFO L290 TraceCheckUtils]: 77: Hoare triple {77516#true} ~skip~0 := 0; {77516#true} is VALID [2022-04-28 08:41:27,644 INFO L290 TraceCheckUtils]: 78: Hoare triple {77516#true} assume !false; {77516#true} is VALID [2022-04-28 08:41:27,645 INFO L290 TraceCheckUtils]: 79: Hoare triple {77516#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,645 INFO L290 TraceCheckUtils]: 80: Hoare triple {77516#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,645 INFO L290 TraceCheckUtils]: 81: Hoare triple {77516#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,645 INFO L290 TraceCheckUtils]: 82: Hoare triple {77516#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,645 INFO L290 TraceCheckUtils]: 83: Hoare triple {77516#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,645 INFO L290 TraceCheckUtils]: 84: Hoare triple {77516#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,645 INFO L290 TraceCheckUtils]: 85: Hoare triple {77516#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,645 INFO L290 TraceCheckUtils]: 86: Hoare triple {77516#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,645 INFO L290 TraceCheckUtils]: 87: Hoare triple {77516#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,645 INFO L290 TraceCheckUtils]: 88: Hoare triple {77516#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,645 INFO L290 TraceCheckUtils]: 89: Hoare triple {77516#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,645 INFO L290 TraceCheckUtils]: 90: Hoare triple {77516#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-28 08:41:27,645 INFO L290 TraceCheckUtils]: 91: Hoare triple {77516#true} assume 4416 == #t~mem60;havoc #t~mem60; {77516#true} is VALID [2022-04-28 08:41:27,646 INFO L290 TraceCheckUtils]: 92: Hoare triple {77516#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {77516#true} is VALID [2022-04-28 08:41:27,646 INFO L290 TraceCheckUtils]: 93: Hoare triple {77516#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {77516#true} is VALID [2022-04-28 08:41:27,647 INFO L290 TraceCheckUtils]: 94: Hoare triple {77516#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:27,647 INFO L290 TraceCheckUtils]: 95: Hoare triple {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:27,647 INFO L290 TraceCheckUtils]: 96: Hoare triple {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:27,648 INFO L290 TraceCheckUtils]: 97: Hoare triple {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:27,648 INFO L290 TraceCheckUtils]: 98: Hoare triple {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:27,648 INFO L290 TraceCheckUtils]: 99: Hoare triple {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:27,649 INFO L290 TraceCheckUtils]: 100: Hoare triple {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:27,649 INFO L290 TraceCheckUtils]: 101: Hoare triple {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:27,649 INFO L290 TraceCheckUtils]: 102: Hoare triple {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:27,650 INFO L290 TraceCheckUtils]: 103: Hoare triple {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:27,650 INFO L290 TraceCheckUtils]: 104: Hoare triple {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:27,650 INFO L290 TraceCheckUtils]: 105: Hoare triple {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:27,650 INFO L290 TraceCheckUtils]: 106: Hoare triple {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:27,651 INFO L290 TraceCheckUtils]: 107: Hoare triple {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:27,651 INFO L290 TraceCheckUtils]: 108: Hoare triple {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {77522#(= |ssl3_connect_#t~mem57| 4432)} is VALID [2022-04-28 08:41:27,652 INFO L290 TraceCheckUtils]: 109: Hoare triple {77522#(= |ssl3_connect_#t~mem57| 4432)} assume 4385 == #t~mem57;havoc #t~mem57; {77517#false} is VALID [2022-04-28 08:41:27,652 INFO L290 TraceCheckUtils]: 110: Hoare triple {77517#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {77517#false} is VALID [2022-04-28 08:41:27,652 INFO L290 TraceCheckUtils]: 111: Hoare triple {77517#false} assume !(1 == ~blastFlag~0); {77517#false} is VALID [2022-04-28 08:41:27,652 INFO L290 TraceCheckUtils]: 112: Hoare triple {77517#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,652 INFO L290 TraceCheckUtils]: 113: Hoare triple {77517#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,652 INFO L290 TraceCheckUtils]: 114: Hoare triple {77517#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,652 INFO L290 TraceCheckUtils]: 115: Hoare triple {77517#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,652 INFO L290 TraceCheckUtils]: 116: Hoare triple {77517#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77517#false} is VALID [2022-04-28 08:41:27,652 INFO L290 TraceCheckUtils]: 117: Hoare triple {77517#false} ~skip~0 := 0; {77517#false} is VALID [2022-04-28 08:41:27,652 INFO L290 TraceCheckUtils]: 118: Hoare triple {77517#false} assume !false; {77517#false} is VALID [2022-04-28 08:41:27,653 INFO L290 TraceCheckUtils]: 119: Hoare triple {77517#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,653 INFO L290 TraceCheckUtils]: 120: Hoare triple {77517#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,653 INFO L290 TraceCheckUtils]: 121: Hoare triple {77517#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,653 INFO L290 TraceCheckUtils]: 122: Hoare triple {77517#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,653 INFO L290 TraceCheckUtils]: 123: Hoare triple {77517#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,653 INFO L290 TraceCheckUtils]: 124: Hoare triple {77517#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,653 INFO L290 TraceCheckUtils]: 125: Hoare triple {77517#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,653 INFO L290 TraceCheckUtils]: 126: Hoare triple {77517#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,653 INFO L290 TraceCheckUtils]: 127: Hoare triple {77517#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,653 INFO L290 TraceCheckUtils]: 128: Hoare triple {77517#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,654 INFO L290 TraceCheckUtils]: 129: Hoare triple {77517#false} assume 4400 == #t~mem58;havoc #t~mem58; {77517#false} is VALID [2022-04-28 08:41:27,654 INFO L290 TraceCheckUtils]: 130: Hoare triple {77517#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,654 INFO L290 TraceCheckUtils]: 131: Hoare triple {77517#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {77517#false} is VALID [2022-04-28 08:41:27,654 INFO L290 TraceCheckUtils]: 132: Hoare triple {77517#false} assume !(2 == ~blastFlag~0); {77517#false} is VALID [2022-04-28 08:41:27,654 INFO L290 TraceCheckUtils]: 133: Hoare triple {77517#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {77517#false} is VALID [2022-04-28 08:41:27,654 INFO L290 TraceCheckUtils]: 134: Hoare triple {77517#false} assume !(~ret~0 <= 0); {77517#false} is VALID [2022-04-28 08:41:27,654 INFO L290 TraceCheckUtils]: 135: Hoare triple {77517#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,654 INFO L290 TraceCheckUtils]: 136: Hoare triple {77517#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,654 INFO L290 TraceCheckUtils]: 137: Hoare triple {77517#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77517#false} is VALID [2022-04-28 08:41:27,654 INFO L290 TraceCheckUtils]: 138: Hoare triple {77517#false} ~skip~0 := 0; {77517#false} is VALID [2022-04-28 08:41:27,655 INFO L290 TraceCheckUtils]: 139: Hoare triple {77517#false} assume !false; {77517#false} is VALID [2022-04-28 08:41:27,655 INFO L290 TraceCheckUtils]: 140: Hoare triple {77517#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,655 INFO L290 TraceCheckUtils]: 141: Hoare triple {77517#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,655 INFO L290 TraceCheckUtils]: 142: Hoare triple {77517#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,655 INFO L290 TraceCheckUtils]: 143: Hoare triple {77517#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,655 INFO L290 TraceCheckUtils]: 144: Hoare triple {77517#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,655 INFO L290 TraceCheckUtils]: 145: Hoare triple {77517#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,655 INFO L290 TraceCheckUtils]: 146: Hoare triple {77517#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,655 INFO L290 TraceCheckUtils]: 147: Hoare triple {77517#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,655 INFO L290 TraceCheckUtils]: 148: Hoare triple {77517#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,655 INFO L290 TraceCheckUtils]: 149: Hoare triple {77517#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,656 INFO L290 TraceCheckUtils]: 150: Hoare triple {77517#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,656 INFO L290 TraceCheckUtils]: 151: Hoare triple {77517#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,656 INFO L290 TraceCheckUtils]: 152: Hoare triple {77517#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,656 INFO L290 TraceCheckUtils]: 153: Hoare triple {77517#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-28 08:41:27,656 INFO L290 TraceCheckUtils]: 154: Hoare triple {77517#false} assume 4432 == #t~mem62;havoc #t~mem62; {77517#false} is VALID [2022-04-28 08:41:27,656 INFO L290 TraceCheckUtils]: 155: Hoare triple {77517#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {77517#false} is VALID [2022-04-28 08:41:27,656 INFO L290 TraceCheckUtils]: 156: Hoare triple {77517#false} assume 5 == ~blastFlag~0; {77517#false} is VALID [2022-04-28 08:41:27,656 INFO L290 TraceCheckUtils]: 157: Hoare triple {77517#false} assume !false; {77517#false} is VALID [2022-04-28 08:41:27,657 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-04-28 08:41:27,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:41:27,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198417187] [2022-04-28 08:41:27,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198417187] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:41:27,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:41:27,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:41:27,657 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:41:27,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1117413233] [2022-04-28 08:41:27,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1117413233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:41:27,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:41:27,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:41:27,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247953711] [2022-04-28 08:41:27,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:41:27,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 158 [2022-04-28 08:41:27,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:41:27,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:27,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:27,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:41:27,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:27,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:41:27,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:41:27,747 INFO L87 Difference]: Start difference. First operand 886 states and 1282 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:29,768 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:41:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:31,064 INFO L93 Difference]: Finished difference Result 1958 states and 2844 transitions. [2022-04-28 08:41:31,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:41:31,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 158 [2022-04-28 08:41:31,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:41:31,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-28 08:41:31,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:31,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-28 08:41:31,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 440 transitions. [2022-04-28 08:41:31,361 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-28 08:41:31,405 INFO L225 Difference]: With dead ends: 1958 [2022-04-28 08:41:31,405 INFO L226 Difference]: Without dead ends: 1088 [2022-04-28 08:41:31,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:41:31,407 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 75 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:41:31,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 533 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 488 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:41:31,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2022-04-28 08:41:31,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 886. [2022-04-28 08:41:31,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:41:31,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1088 states. Second operand has 886 states, 881 states have (on average 1.446083995459705) internal successors, (1274), 881 states have internal predecessors, (1274), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:31,465 INFO L74 IsIncluded]: Start isIncluded. First operand 1088 states. Second operand has 886 states, 881 states have (on average 1.446083995459705) internal successors, (1274), 881 states have internal predecessors, (1274), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:31,466 INFO L87 Difference]: Start difference. First operand 1088 states. Second operand has 886 states, 881 states have (on average 1.446083995459705) internal successors, (1274), 881 states have internal predecessors, (1274), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:31,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:31,501 INFO L93 Difference]: Finished difference Result 1088 states and 1578 transitions. [2022-04-28 08:41:31,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1578 transitions. [2022-04-28 08:41:31,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:31,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:31,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 886 states, 881 states have (on average 1.446083995459705) internal successors, (1274), 881 states have internal predecessors, (1274), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1088 states. [2022-04-28 08:41:31,503 INFO L87 Difference]: Start difference. First operand has 886 states, 881 states have (on average 1.446083995459705) internal successors, (1274), 881 states have internal predecessors, (1274), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1088 states. [2022-04-28 08:41:31,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:31,544 INFO L93 Difference]: Finished difference Result 1088 states and 1578 transitions. [2022-04-28 08:41:31,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1578 transitions. [2022-04-28 08:41:31,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:31,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:31,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:41:31,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:41:31,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 881 states have (on average 1.446083995459705) internal successors, (1274), 881 states have internal predecessors, (1274), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:31,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1278 transitions. [2022-04-28 08:41:31,617 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1278 transitions. Word has length 158 [2022-04-28 08:41:31,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:41:31,617 INFO L495 AbstractCegarLoop]: Abstraction has 886 states and 1278 transitions. [2022-04-28 08:41:31,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:31,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 886 states and 1278 transitions. [2022-04-28 08:41:32,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1278 edges. 1278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:32,739 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1278 transitions. [2022-04-28 08:41:32,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-04-28 08:41:32,741 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:41:32,741 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:41:32,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 08:41:32,741 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:41:32,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:41:32,741 INFO L85 PathProgramCache]: Analyzing trace with hash -500107939, now seen corresponding path program 1 times [2022-04-28 08:41:32,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:32,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1921421257] [2022-04-28 08:41:44,579 WARN L232 SmtUtils]: Spent 7.87s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:41:52,252 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:41:52,252 INFO L85 PathProgramCache]: Analyzing trace with hash -500107939, now seen corresponding path program 2 times [2022-04-28 08:41:52,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:41:52,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133942590] [2022-04-28 08:41:52,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:41:52,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:41:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:52,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:41:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:52,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {85402#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {85392#true} is VALID [2022-04-28 08:41:52,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {85392#true} assume true; {85392#true} is VALID [2022-04-28 08:41:52,517 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {85392#true} {85392#true} #593#return; {85392#true} is VALID [2022-04-28 08:41:52,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {85392#true} call ULTIMATE.init(); {85402#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:41:52,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {85402#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {85392#true} is VALID [2022-04-28 08:41:52,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {85392#true} assume true; {85392#true} is VALID [2022-04-28 08:41:52,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85392#true} {85392#true} #593#return; {85392#true} is VALID [2022-04-28 08:41:52,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {85392#true} call #t~ret158 := main(); {85392#true} is VALID [2022-04-28 08:41:52,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {85392#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {85392#true} is VALID [2022-04-28 08:41:52,518 INFO L272 TraceCheckUtils]: 6: Hoare triple {85392#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {85392#true} is VALID [2022-04-28 08:41:52,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {85392#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {85392#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {85392#true} is VALID [2022-04-28 08:41:52,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {85392#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {85392#true} is VALID [2022-04-28 08:41:52,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {85392#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {85392#true} is VALID [2022-04-28 08:41:52,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-28 08:41:52,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {85392#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {85392#true} assume 12292 == #t~mem49;havoc #t~mem49; {85392#true} is VALID [2022-04-28 08:41:52,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {85392#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {85392#true} is VALID [2022-04-28 08:41:52,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {85392#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {85392#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {85392#true} is VALID [2022-04-28 08:41:52,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {85392#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {85392#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {85392#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {85392#true} is VALID [2022-04-28 08:41:52,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {85392#true} assume !(0 == ~tmp___4~0); {85392#true} is VALID [2022-04-28 08:41:52,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {85392#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {85392#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-28 08:41:52,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-28 08:41:52,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-28 08:41:52,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {85392#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,520 INFO L290 TraceCheckUtils]: 28: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,520 INFO L290 TraceCheckUtils]: 29: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,520 INFO L290 TraceCheckUtils]: 31: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,520 INFO L290 TraceCheckUtils]: 32: Hoare triple {85392#true} assume 4368 == #t~mem54;havoc #t~mem54; {85392#true} is VALID [2022-04-28 08:41:52,520 INFO L290 TraceCheckUtils]: 33: Hoare triple {85392#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {85392#true} is VALID [2022-04-28 08:41:52,521 INFO L290 TraceCheckUtils]: 34: Hoare triple {85392#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {85392#true} is VALID [2022-04-28 08:41:52,521 INFO L290 TraceCheckUtils]: 35: Hoare triple {85392#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,521 INFO L290 TraceCheckUtils]: 36: Hoare triple {85392#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {85392#true} is VALID [2022-04-28 08:41:52,521 INFO L290 TraceCheckUtils]: 37: Hoare triple {85392#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,521 INFO L290 TraceCheckUtils]: 38: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-28 08:41:52,521 INFO L290 TraceCheckUtils]: 39: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-28 08:41:52,521 INFO L290 TraceCheckUtils]: 40: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-28 08:41:52,521 INFO L290 TraceCheckUtils]: 41: Hoare triple {85392#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,521 INFO L290 TraceCheckUtils]: 42: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,521 INFO L290 TraceCheckUtils]: 43: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,521 INFO L290 TraceCheckUtils]: 44: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,521 INFO L290 TraceCheckUtils]: 45: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,522 INFO L290 TraceCheckUtils]: 46: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,522 INFO L290 TraceCheckUtils]: 47: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,522 INFO L290 TraceCheckUtils]: 48: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,522 INFO L290 TraceCheckUtils]: 49: Hoare triple {85392#true} assume 4384 == #t~mem56;havoc #t~mem56; {85392#true} is VALID [2022-04-28 08:41:52,522 INFO L290 TraceCheckUtils]: 50: Hoare triple {85392#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {85392#true} is VALID [2022-04-28 08:41:52,522 INFO L290 TraceCheckUtils]: 51: Hoare triple {85392#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {85392#true} is VALID [2022-04-28 08:41:52,522 INFO L290 TraceCheckUtils]: 52: Hoare triple {85392#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,522 INFO L290 TraceCheckUtils]: 53: Hoare triple {85392#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,522 INFO L290 TraceCheckUtils]: 54: Hoare triple {85392#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,522 INFO L290 TraceCheckUtils]: 55: Hoare triple {85392#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,522 INFO L290 TraceCheckUtils]: 56: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-28 08:41:52,522 INFO L290 TraceCheckUtils]: 57: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-28 08:41:52,523 INFO L290 TraceCheckUtils]: 58: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-28 08:41:52,523 INFO L290 TraceCheckUtils]: 59: Hoare triple {85392#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,523 INFO L290 TraceCheckUtils]: 60: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,523 INFO L290 TraceCheckUtils]: 61: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,523 INFO L290 TraceCheckUtils]: 62: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,523 INFO L290 TraceCheckUtils]: 63: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,523 INFO L290 TraceCheckUtils]: 64: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,523 INFO L290 TraceCheckUtils]: 65: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,523 INFO L290 TraceCheckUtils]: 66: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,523 INFO L290 TraceCheckUtils]: 67: Hoare triple {85392#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,523 INFO L290 TraceCheckUtils]: 68: Hoare triple {85392#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,523 INFO L290 TraceCheckUtils]: 69: Hoare triple {85392#true} assume 4400 == #t~mem58;havoc #t~mem58; {85392#true} is VALID [2022-04-28 08:41:52,523 INFO L290 TraceCheckUtils]: 70: Hoare triple {85392#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,524 INFO L290 TraceCheckUtils]: 71: Hoare triple {85392#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {85392#true} is VALID [2022-04-28 08:41:52,524 INFO L290 TraceCheckUtils]: 72: Hoare triple {85392#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {85392#true} is VALID [2022-04-28 08:41:52,524 INFO L290 TraceCheckUtils]: 73: Hoare triple {85392#true} assume !(~ret~0 <= 0); {85392#true} is VALID [2022-04-28 08:41:52,524 INFO L290 TraceCheckUtils]: 74: Hoare triple {85392#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,524 INFO L290 TraceCheckUtils]: 75: Hoare triple {85392#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,524 INFO L290 TraceCheckUtils]: 76: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-28 08:41:52,524 INFO L290 TraceCheckUtils]: 77: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-28 08:41:52,524 INFO L290 TraceCheckUtils]: 78: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-28 08:41:52,524 INFO L290 TraceCheckUtils]: 79: Hoare triple {85392#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,524 INFO L290 TraceCheckUtils]: 80: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,524 INFO L290 TraceCheckUtils]: 81: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,524 INFO L290 TraceCheckUtils]: 82: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,525 INFO L290 TraceCheckUtils]: 83: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,525 INFO L290 TraceCheckUtils]: 84: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,525 INFO L290 TraceCheckUtils]: 85: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,525 INFO L290 TraceCheckUtils]: 86: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,525 INFO L290 TraceCheckUtils]: 87: Hoare triple {85392#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,525 INFO L290 TraceCheckUtils]: 88: Hoare triple {85392#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,525 INFO L290 TraceCheckUtils]: 89: Hoare triple {85392#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,525 INFO L290 TraceCheckUtils]: 90: Hoare triple {85392#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,525 INFO L290 TraceCheckUtils]: 91: Hoare triple {85392#true} assume 4416 == #t~mem60;havoc #t~mem60; {85392#true} is VALID [2022-04-28 08:41:52,525 INFO L290 TraceCheckUtils]: 92: Hoare triple {85392#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {85392#true} is VALID [2022-04-28 08:41:52,525 INFO L290 TraceCheckUtils]: 93: Hoare triple {85392#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {85392#true} is VALID [2022-04-28 08:41:52,525 INFO L290 TraceCheckUtils]: 94: Hoare triple {85392#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,525 INFO L290 TraceCheckUtils]: 95: Hoare triple {85392#true} assume !(0 == ~tmp___6~0); {85392#true} is VALID [2022-04-28 08:41:52,526 INFO L290 TraceCheckUtils]: 96: Hoare triple {85392#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,526 INFO L290 TraceCheckUtils]: 97: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-28 08:41:52,526 INFO L290 TraceCheckUtils]: 98: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-28 08:41:52,526 INFO L290 TraceCheckUtils]: 99: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-28 08:41:52,526 INFO L290 TraceCheckUtils]: 100: Hoare triple {85392#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,526 INFO L290 TraceCheckUtils]: 101: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,526 INFO L290 TraceCheckUtils]: 102: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,526 INFO L290 TraceCheckUtils]: 103: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,526 INFO L290 TraceCheckUtils]: 104: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,526 INFO L290 TraceCheckUtils]: 105: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,526 INFO L290 TraceCheckUtils]: 106: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,526 INFO L290 TraceCheckUtils]: 107: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,526 INFO L290 TraceCheckUtils]: 108: Hoare triple {85392#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,527 INFO L290 TraceCheckUtils]: 109: Hoare triple {85392#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,527 INFO L290 TraceCheckUtils]: 110: Hoare triple {85392#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,527 INFO L290 TraceCheckUtils]: 111: Hoare triple {85392#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {85397#(= |ssl3_connect_#t~mem60| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:52,527 INFO L290 TraceCheckUtils]: 112: Hoare triple {85397#(= |ssl3_connect_#t~mem60| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {85398#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:52,528 INFO L290 TraceCheckUtils]: 113: Hoare triple {85398#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {85399#(not (= |ssl3_connect_#t~mem62| 4416))} is VALID [2022-04-28 08:41:52,528 INFO L290 TraceCheckUtils]: 114: Hoare triple {85399#(not (= |ssl3_connect_#t~mem62| 4416))} assume 4432 == #t~mem62;havoc #t~mem62; {85392#true} is VALID [2022-04-28 08:41:52,528 INFO L290 TraceCheckUtils]: 115: Hoare triple {85392#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {85392#true} is VALID [2022-04-28 08:41:52,528 INFO L290 TraceCheckUtils]: 116: Hoare triple {85392#true} assume !(5 == ~blastFlag~0); {85392#true} is VALID [2022-04-28 08:41:52,528 INFO L290 TraceCheckUtils]: 117: Hoare triple {85392#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,528 INFO L290 TraceCheckUtils]: 118: Hoare triple {85392#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,528 INFO L290 TraceCheckUtils]: 119: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-28 08:41:52,529 INFO L290 TraceCheckUtils]: 120: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-28 08:41:52,529 INFO L290 TraceCheckUtils]: 121: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-28 08:41:52,529 INFO L290 TraceCheckUtils]: 122: Hoare triple {85392#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,529 INFO L290 TraceCheckUtils]: 123: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,529 INFO L290 TraceCheckUtils]: 124: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,529 INFO L290 TraceCheckUtils]: 125: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,529 INFO L290 TraceCheckUtils]: 126: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,529 INFO L290 TraceCheckUtils]: 127: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,529 INFO L290 TraceCheckUtils]: 128: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,529 INFO L290 TraceCheckUtils]: 129: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,529 INFO L290 TraceCheckUtils]: 130: Hoare triple {85392#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,529 INFO L290 TraceCheckUtils]: 131: Hoare triple {85392#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,530 INFO L290 TraceCheckUtils]: 132: Hoare triple {85392#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,530 INFO L290 TraceCheckUtils]: 133: Hoare triple {85392#true} assume 4401 == #t~mem59;havoc #t~mem59; {85392#true} is VALID [2022-04-28 08:41:52,530 INFO L290 TraceCheckUtils]: 134: Hoare triple {85392#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {85392#true} is VALID [2022-04-28 08:41:52,530 INFO L290 TraceCheckUtils]: 135: Hoare triple {85392#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {85392#true} is VALID [2022-04-28 08:41:52,530 INFO L290 TraceCheckUtils]: 136: Hoare triple {85392#true} assume !(2 == ~blastFlag~0); {85392#true} is VALID [2022-04-28 08:41:52,530 INFO L290 TraceCheckUtils]: 137: Hoare triple {85392#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {85392#true} is VALID [2022-04-28 08:41:52,530 INFO L290 TraceCheckUtils]: 138: Hoare triple {85392#true} assume !(~ret~0 <= 0); {85392#true} is VALID [2022-04-28 08:41:52,531 INFO L290 TraceCheckUtils]: 139: Hoare triple {85392#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:52,531 INFO L290 TraceCheckUtils]: 140: Hoare triple {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:52,532 INFO L290 TraceCheckUtils]: 141: Hoare triple {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:52,532 INFO L290 TraceCheckUtils]: 142: Hoare triple {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:52,532 INFO L290 TraceCheckUtils]: 143: Hoare triple {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:52,532 INFO L290 TraceCheckUtils]: 144: Hoare triple {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:52,533 INFO L290 TraceCheckUtils]: 145: Hoare triple {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:52,533 INFO L290 TraceCheckUtils]: 146: Hoare triple {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:52,533 INFO L290 TraceCheckUtils]: 147: Hoare triple {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:52,534 INFO L290 TraceCheckUtils]: 148: Hoare triple {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:52,534 INFO L290 TraceCheckUtils]: 149: Hoare triple {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:52,534 INFO L290 TraceCheckUtils]: 150: Hoare triple {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:52,534 INFO L290 TraceCheckUtils]: 151: Hoare triple {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:52,535 INFO L290 TraceCheckUtils]: 152: Hoare triple {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:52,535 INFO L290 TraceCheckUtils]: 153: Hoare triple {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:52,535 INFO L290 TraceCheckUtils]: 154: Hoare triple {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:52,536 INFO L290 TraceCheckUtils]: 155: Hoare triple {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:52,536 INFO L290 TraceCheckUtils]: 156: Hoare triple {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:52,536 INFO L290 TraceCheckUtils]: 157: Hoare triple {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {85401#(not (= |ssl3_connect_#t~mem62| 4432))} is VALID [2022-04-28 08:41:52,537 INFO L290 TraceCheckUtils]: 158: Hoare triple {85401#(not (= |ssl3_connect_#t~mem62| 4432))} assume 4432 == #t~mem62;havoc #t~mem62; {85393#false} is VALID [2022-04-28 08:41:52,537 INFO L290 TraceCheckUtils]: 159: Hoare triple {85393#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {85393#false} is VALID [2022-04-28 08:41:52,537 INFO L290 TraceCheckUtils]: 160: Hoare triple {85393#false} assume 5 == ~blastFlag~0; {85393#false} is VALID [2022-04-28 08:41:52,537 INFO L290 TraceCheckUtils]: 161: Hoare triple {85393#false} assume !false; {85393#false} is VALID [2022-04-28 08:41:52,537 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 94 proven. 3 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-28 08:41:52,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:41:52,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133942590] [2022-04-28 08:41:52,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133942590] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 08:41:52,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067737527] [2022-04-28 08:41:52,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 08:41:52,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:41:52,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:41:52,543 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 08:41:52,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 08:42:32,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 08:42:32,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 08:42:32,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 1477 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 08:42:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:42:32,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 08:42:32,175 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-28 08:42:32,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 143 [2022-04-28 08:42:32,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 63 [2022-04-28 08:42:32,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-28 08:42:32,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-28 08:42:32,372 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-04-28 08:42:32,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 21 [2022-04-28 08:42:32,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-04-28 08:42:32,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-04-28 08:42:32,449 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-28 08:42:32,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-04-28 08:42:32,724 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-28 08:42:32,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-04-28 08:42:32,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-04-28 08:42:32,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {85392#true} call ULTIMATE.init(); {85392#true} is VALID [2022-04-28 08:42:32,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {85392#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {85392#true} is VALID [2022-04-28 08:42:32,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {85392#true} assume true; {85392#true} is VALID [2022-04-28 08:42:32,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85392#true} {85392#true} #593#return; {85392#true} is VALID [2022-04-28 08:42:32,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {85392#true} call #t~ret158 := main(); {85392#true} is VALID [2022-04-28 08:42:32,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {85392#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {85392#true} is VALID [2022-04-28 08:42:32,882 INFO L272 TraceCheckUtils]: 6: Hoare triple {85392#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {85392#true} is VALID [2022-04-28 08:42:32,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {85392#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {85392#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {85392#true} is VALID [2022-04-28 08:42:32,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {85392#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {85392#true} is VALID [2022-04-28 08:42:32,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {85392#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {85392#true} is VALID [2022-04-28 08:42:32,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-28 08:42:32,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {85392#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {85392#true} assume 12292 == #t~mem49;havoc #t~mem49; {85392#true} is VALID [2022-04-28 08:42:32,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {85392#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {85392#true} is VALID [2022-04-28 08:42:32,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {85392#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {85392#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {85392#true} is VALID [2022-04-28 08:42:32,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {85392#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {85392#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,884 INFO L290 TraceCheckUtils]: 19: Hoare triple {85392#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {85392#true} is VALID [2022-04-28 08:42:32,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {85392#true} assume !(0 == ~tmp___4~0); {85392#true} is VALID [2022-04-28 08:42:32,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {85392#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:32,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:32,890 INFO L290 TraceCheckUtils]: 23: Hoare triple {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:32,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} ~skip~0 := 0; {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:32,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !false; {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:32,891 INFO L290 TraceCheckUtils]: 26: Hoare triple {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:32,891 INFO L290 TraceCheckUtils]: 27: Hoare triple {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:32,892 INFO L290 TraceCheckUtils]: 28: Hoare triple {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:32,893 INFO L290 TraceCheckUtils]: 29: Hoare triple {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:32,893 INFO L290 TraceCheckUtils]: 30: Hoare triple {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:32,893 INFO L290 TraceCheckUtils]: 31: Hoare triple {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,893 INFO L290 TraceCheckUtils]: 32: Hoare triple {85392#true} assume 4368 == #t~mem54;havoc #t~mem54; {85392#true} is VALID [2022-04-28 08:42:32,893 INFO L290 TraceCheckUtils]: 33: Hoare triple {85392#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {85392#true} is VALID [2022-04-28 08:42:32,894 INFO L290 TraceCheckUtils]: 34: Hoare triple {85392#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {85392#true} is VALID [2022-04-28 08:42:32,894 INFO L290 TraceCheckUtils]: 35: Hoare triple {85392#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,894 INFO L290 TraceCheckUtils]: 36: Hoare triple {85392#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {85392#true} is VALID [2022-04-28 08:42:32,894 INFO L290 TraceCheckUtils]: 37: Hoare triple {85392#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,894 INFO L290 TraceCheckUtils]: 38: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-28 08:42:32,894 INFO L290 TraceCheckUtils]: 39: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-28 08:42:32,894 INFO L290 TraceCheckUtils]: 40: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-28 08:42:32,894 INFO L290 TraceCheckUtils]: 41: Hoare triple {85392#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,894 INFO L290 TraceCheckUtils]: 42: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,895 INFO L290 TraceCheckUtils]: 43: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,895 INFO L290 TraceCheckUtils]: 44: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,895 INFO L290 TraceCheckUtils]: 45: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,895 INFO L290 TraceCheckUtils]: 46: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,895 INFO L290 TraceCheckUtils]: 47: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,895 INFO L290 TraceCheckUtils]: 48: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,895 INFO L290 TraceCheckUtils]: 49: Hoare triple {85392#true} assume 4384 == #t~mem56;havoc #t~mem56; {85392#true} is VALID [2022-04-28 08:42:32,895 INFO L290 TraceCheckUtils]: 50: Hoare triple {85392#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {85392#true} is VALID [2022-04-28 08:42:32,895 INFO L290 TraceCheckUtils]: 51: Hoare triple {85392#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {85392#true} is VALID [2022-04-28 08:42:32,895 INFO L290 TraceCheckUtils]: 52: Hoare triple {85392#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,896 INFO L290 TraceCheckUtils]: 53: Hoare triple {85392#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,896 INFO L290 TraceCheckUtils]: 54: Hoare triple {85392#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,896 INFO L290 TraceCheckUtils]: 55: Hoare triple {85392#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,896 INFO L290 TraceCheckUtils]: 56: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-28 08:42:32,896 INFO L290 TraceCheckUtils]: 57: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-28 08:42:32,896 INFO L290 TraceCheckUtils]: 58: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-28 08:42:32,896 INFO L290 TraceCheckUtils]: 59: Hoare triple {85392#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,896 INFO L290 TraceCheckUtils]: 60: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,896 INFO L290 TraceCheckUtils]: 61: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,896 INFO L290 TraceCheckUtils]: 62: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,898 INFO L290 TraceCheckUtils]: 63: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,899 INFO L290 TraceCheckUtils]: 64: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,902 INFO L290 TraceCheckUtils]: 65: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,902 INFO L290 TraceCheckUtils]: 66: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,902 INFO L290 TraceCheckUtils]: 67: Hoare triple {85392#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,903 INFO L290 TraceCheckUtils]: 68: Hoare triple {85392#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,903 INFO L290 TraceCheckUtils]: 69: Hoare triple {85392#true} assume 4400 == #t~mem58;havoc #t~mem58; {85392#true} is VALID [2022-04-28 08:42:32,903 INFO L290 TraceCheckUtils]: 70: Hoare triple {85392#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,903 INFO L290 TraceCheckUtils]: 71: Hoare triple {85392#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {85392#true} is VALID [2022-04-28 08:42:32,903 INFO L290 TraceCheckUtils]: 72: Hoare triple {85392#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {85392#true} is VALID [2022-04-28 08:42:32,903 INFO L290 TraceCheckUtils]: 73: Hoare triple {85392#true} assume !(~ret~0 <= 0); {85392#true} is VALID [2022-04-28 08:42:32,903 INFO L290 TraceCheckUtils]: 74: Hoare triple {85392#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,903 INFO L290 TraceCheckUtils]: 75: Hoare triple {85392#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,903 INFO L290 TraceCheckUtils]: 76: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-28 08:42:32,903 INFO L290 TraceCheckUtils]: 77: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-28 08:42:32,904 INFO L290 TraceCheckUtils]: 78: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-28 08:42:32,904 INFO L290 TraceCheckUtils]: 79: Hoare triple {85392#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,904 INFO L290 TraceCheckUtils]: 80: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,904 INFO L290 TraceCheckUtils]: 81: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,904 INFO L290 TraceCheckUtils]: 82: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,904 INFO L290 TraceCheckUtils]: 83: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,904 INFO L290 TraceCheckUtils]: 84: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,904 INFO L290 TraceCheckUtils]: 85: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,904 INFO L290 TraceCheckUtils]: 86: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,905 INFO L290 TraceCheckUtils]: 87: Hoare triple {85392#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,905 INFO L290 TraceCheckUtils]: 88: Hoare triple {85392#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,905 INFO L290 TraceCheckUtils]: 89: Hoare triple {85392#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,905 INFO L290 TraceCheckUtils]: 90: Hoare triple {85392#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,905 INFO L290 TraceCheckUtils]: 91: Hoare triple {85392#true} assume 4416 == #t~mem60;havoc #t~mem60; {85392#true} is VALID [2022-04-28 08:42:32,905 INFO L290 TraceCheckUtils]: 92: Hoare triple {85392#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {85392#true} is VALID [2022-04-28 08:42:32,905 INFO L290 TraceCheckUtils]: 93: Hoare triple {85392#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {85392#true} is VALID [2022-04-28 08:42:32,905 INFO L290 TraceCheckUtils]: 94: Hoare triple {85392#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,905 INFO L290 TraceCheckUtils]: 95: Hoare triple {85392#true} assume !(0 == ~tmp___6~0); {85392#true} is VALID [2022-04-28 08:42:32,905 INFO L290 TraceCheckUtils]: 96: Hoare triple {85392#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,906 INFO L290 TraceCheckUtils]: 97: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-28 08:42:32,906 INFO L290 TraceCheckUtils]: 98: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-28 08:42:32,906 INFO L290 TraceCheckUtils]: 99: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-28 08:42:32,906 INFO L290 TraceCheckUtils]: 100: Hoare triple {85392#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,906 INFO L290 TraceCheckUtils]: 101: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,906 INFO L290 TraceCheckUtils]: 102: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,906 INFO L290 TraceCheckUtils]: 103: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,906 INFO L290 TraceCheckUtils]: 104: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,906 INFO L290 TraceCheckUtils]: 105: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,906 INFO L290 TraceCheckUtils]: 106: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,906 INFO L290 TraceCheckUtils]: 107: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,907 INFO L290 TraceCheckUtils]: 108: Hoare triple {85392#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,907 INFO L290 TraceCheckUtils]: 109: Hoare triple {85392#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,907 INFO L290 TraceCheckUtils]: 110: Hoare triple {85392#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,907 INFO L290 TraceCheckUtils]: 111: Hoare triple {85392#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,907 INFO L290 TraceCheckUtils]: 112: Hoare triple {85392#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,907 INFO L290 TraceCheckUtils]: 113: Hoare triple {85392#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,907 INFO L290 TraceCheckUtils]: 114: Hoare triple {85392#true} assume 4432 == #t~mem62;havoc #t~mem62; {85392#true} is VALID [2022-04-28 08:42:32,907 INFO L290 TraceCheckUtils]: 115: Hoare triple {85392#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {85392#true} is VALID [2022-04-28 08:42:32,907 INFO L290 TraceCheckUtils]: 116: Hoare triple {85392#true} assume !(5 == ~blastFlag~0); {85392#true} is VALID [2022-04-28 08:42:32,907 INFO L290 TraceCheckUtils]: 117: Hoare triple {85392#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,907 INFO L290 TraceCheckUtils]: 118: Hoare triple {85392#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,908 INFO L290 TraceCheckUtils]: 119: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-28 08:42:32,908 INFO L290 TraceCheckUtils]: 120: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-28 08:42:32,908 INFO L290 TraceCheckUtils]: 121: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-28 08:42:32,908 INFO L290 TraceCheckUtils]: 122: Hoare triple {85392#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,908 INFO L290 TraceCheckUtils]: 123: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,908 INFO L290 TraceCheckUtils]: 124: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,908 INFO L290 TraceCheckUtils]: 125: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,908 INFO L290 TraceCheckUtils]: 126: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,908 INFO L290 TraceCheckUtils]: 127: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,908 INFO L290 TraceCheckUtils]: 128: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,909 INFO L290 TraceCheckUtils]: 129: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,909 INFO L290 TraceCheckUtils]: 130: Hoare triple {85392#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,909 INFO L290 TraceCheckUtils]: 131: Hoare triple {85392#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,909 INFO L290 TraceCheckUtils]: 132: Hoare triple {85392#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,909 INFO L290 TraceCheckUtils]: 133: Hoare triple {85392#true} assume 4401 == #t~mem59;havoc #t~mem59; {85392#true} is VALID [2022-04-28 08:42:32,909 INFO L290 TraceCheckUtils]: 134: Hoare triple {85392#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {85392#true} is VALID [2022-04-28 08:42:32,909 INFO L290 TraceCheckUtils]: 135: Hoare triple {85392#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {85392#true} is VALID [2022-04-28 08:42:32,909 INFO L290 TraceCheckUtils]: 136: Hoare triple {85392#true} assume !(2 == ~blastFlag~0); {85392#true} is VALID [2022-04-28 08:42:32,909 INFO L290 TraceCheckUtils]: 137: Hoare triple {85392#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {85392#true} is VALID [2022-04-28 08:42:32,909 INFO L290 TraceCheckUtils]: 138: Hoare triple {85392#true} assume !(~ret~0 <= 0); {85392#true} is VALID [2022-04-28 08:42:32,911 INFO L290 TraceCheckUtils]: 139: Hoare triple {85392#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-28 08:42:32,911 INFO L290 TraceCheckUtils]: 140: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-28 08:42:32,911 INFO L290 TraceCheckUtils]: 141: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-28 08:42:32,912 INFO L290 TraceCheckUtils]: 142: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} ~skip~0 := 0; {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-28 08:42:32,912 INFO L290 TraceCheckUtils]: 143: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !false; {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-28 08:42:32,912 INFO L290 TraceCheckUtils]: 144: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-28 08:42:32,912 INFO L290 TraceCheckUtils]: 145: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-28 08:42:32,913 INFO L290 TraceCheckUtils]: 146: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-28 08:42:32,913 INFO L290 TraceCheckUtils]: 147: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-28 08:42:32,913 INFO L290 TraceCheckUtils]: 148: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-28 08:42:32,914 INFO L290 TraceCheckUtils]: 149: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-28 08:42:32,914 INFO L290 TraceCheckUtils]: 150: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-28 08:42:32,914 INFO L290 TraceCheckUtils]: 151: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-28 08:42:32,915 INFO L290 TraceCheckUtils]: 152: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-28 08:42:32,915 INFO L290 TraceCheckUtils]: 153: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-28 08:42:32,915 INFO L290 TraceCheckUtils]: 154: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-28 08:42:32,916 INFO L290 TraceCheckUtils]: 155: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-28 08:42:32,916 INFO L290 TraceCheckUtils]: 156: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-28 08:42:32,916 INFO L290 TraceCheckUtils]: 157: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {85879#(<= |ssl3_connect_#t~mem62| 4416)} is VALID [2022-04-28 08:42:32,917 INFO L290 TraceCheckUtils]: 158: Hoare triple {85879#(<= |ssl3_connect_#t~mem62| 4416)} assume 4432 == #t~mem62;havoc #t~mem62; {85393#false} is VALID [2022-04-28 08:42:32,917 INFO L290 TraceCheckUtils]: 159: Hoare triple {85393#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {85393#false} is VALID [2022-04-28 08:42:32,917 INFO L290 TraceCheckUtils]: 160: Hoare triple {85393#false} assume 5 == ~blastFlag~0; {85393#false} is VALID [2022-04-28 08:42:32,917 INFO L290 TraceCheckUtils]: 161: Hoare triple {85393#false} assume !false; {85393#false} is VALID [2022-04-28 08:42:32,918 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 89 proven. 60 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-04-28 08:42:32,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 08:42:33,250 INFO L290 TraceCheckUtils]: 161: Hoare triple {85393#false} assume !false; {85393#false} is VALID [2022-04-28 08:42:33,250 INFO L290 TraceCheckUtils]: 160: Hoare triple {85393#false} assume 5 == ~blastFlag~0; {85393#false} is VALID [2022-04-28 08:42:33,251 INFO L290 TraceCheckUtils]: 159: Hoare triple {85393#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {85393#false} is VALID [2022-04-28 08:42:33,251 INFO L290 TraceCheckUtils]: 158: Hoare triple {85901#(not (<= 4432 |ssl3_connect_#t~mem62|))} assume 4432 == #t~mem62;havoc #t~mem62; {85393#false} is VALID [2022-04-28 08:42:33,251 INFO L290 TraceCheckUtils]: 157: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {85901#(not (<= 4432 |ssl3_connect_#t~mem62|))} is VALID [2022-04-28 08:42:33,252 INFO L290 TraceCheckUtils]: 156: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:42:33,252 INFO L290 TraceCheckUtils]: 155: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:42:33,253 INFO L290 TraceCheckUtils]: 154: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:42:33,253 INFO L290 TraceCheckUtils]: 153: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:42:33,253 INFO L290 TraceCheckUtils]: 152: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:42:33,254 INFO L290 TraceCheckUtils]: 151: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:42:33,254 INFO L290 TraceCheckUtils]: 150: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:42:33,254 INFO L290 TraceCheckUtils]: 149: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:42:33,255 INFO L290 TraceCheckUtils]: 148: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:42:33,255 INFO L290 TraceCheckUtils]: 147: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:42:33,255 INFO L290 TraceCheckUtils]: 146: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:42:33,256 INFO L290 TraceCheckUtils]: 145: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:42:33,256 INFO L290 TraceCheckUtils]: 144: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:42:33,256 INFO L290 TraceCheckUtils]: 143: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !false; {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:42:33,257 INFO L290 TraceCheckUtils]: 142: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} ~skip~0 := 0; {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:42:33,257 INFO L290 TraceCheckUtils]: 141: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:42:33,257 INFO L290 TraceCheckUtils]: 140: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:42:33,259 INFO L290 TraceCheckUtils]: 139: Hoare triple {85392#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:42:33,259 INFO L290 TraceCheckUtils]: 138: Hoare triple {85392#true} assume !(~ret~0 <= 0); {85392#true} is VALID [2022-04-28 08:42:33,259 INFO L290 TraceCheckUtils]: 137: Hoare triple {85392#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {85392#true} is VALID [2022-04-28 08:42:33,259 INFO L290 TraceCheckUtils]: 136: Hoare triple {85392#true} assume !(2 == ~blastFlag~0); {85392#true} is VALID [2022-04-28 08:42:33,259 INFO L290 TraceCheckUtils]: 135: Hoare triple {85392#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {85392#true} is VALID [2022-04-28 08:42:33,259 INFO L290 TraceCheckUtils]: 134: Hoare triple {85392#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,259 INFO L290 TraceCheckUtils]: 133: Hoare triple {85392#true} assume 4401 == #t~mem59;havoc #t~mem59; {85392#true} is VALID [2022-04-28 08:42:33,259 INFO L290 TraceCheckUtils]: 132: Hoare triple {85392#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,259 INFO L290 TraceCheckUtils]: 131: Hoare triple {85392#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,260 INFO L290 TraceCheckUtils]: 130: Hoare triple {85392#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,260 INFO L290 TraceCheckUtils]: 129: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,260 INFO L290 TraceCheckUtils]: 128: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,260 INFO L290 TraceCheckUtils]: 127: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,260 INFO L290 TraceCheckUtils]: 126: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,260 INFO L290 TraceCheckUtils]: 125: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,260 INFO L290 TraceCheckUtils]: 124: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,260 INFO L290 TraceCheckUtils]: 123: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,260 INFO L290 TraceCheckUtils]: 122: Hoare triple {85392#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,260 INFO L290 TraceCheckUtils]: 121: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-28 08:42:33,261 INFO L290 TraceCheckUtils]: 120: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-28 08:42:33,261 INFO L290 TraceCheckUtils]: 119: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-28 08:42:33,261 INFO L290 TraceCheckUtils]: 118: Hoare triple {85392#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,261 INFO L290 TraceCheckUtils]: 117: Hoare triple {85392#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,261 INFO L290 TraceCheckUtils]: 116: Hoare triple {85392#true} assume !(5 == ~blastFlag~0); {85392#true} is VALID [2022-04-28 08:42:33,261 INFO L290 TraceCheckUtils]: 115: Hoare triple {85392#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {85392#true} is VALID [2022-04-28 08:42:33,261 INFO L290 TraceCheckUtils]: 114: Hoare triple {85392#true} assume 4432 == #t~mem62;havoc #t~mem62; {85392#true} is VALID [2022-04-28 08:42:33,261 INFO L290 TraceCheckUtils]: 113: Hoare triple {85392#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,261 INFO L290 TraceCheckUtils]: 112: Hoare triple {85392#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,262 INFO L290 TraceCheckUtils]: 111: Hoare triple {85392#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,262 INFO L290 TraceCheckUtils]: 110: Hoare triple {85392#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,262 INFO L290 TraceCheckUtils]: 109: Hoare triple {85392#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,262 INFO L290 TraceCheckUtils]: 108: Hoare triple {85392#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,262 INFO L290 TraceCheckUtils]: 107: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,262 INFO L290 TraceCheckUtils]: 106: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,262 INFO L290 TraceCheckUtils]: 105: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,262 INFO L290 TraceCheckUtils]: 104: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,262 INFO L290 TraceCheckUtils]: 103: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,263 INFO L290 TraceCheckUtils]: 102: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,263 INFO L290 TraceCheckUtils]: 101: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,263 INFO L290 TraceCheckUtils]: 100: Hoare triple {85392#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,263 INFO L290 TraceCheckUtils]: 99: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-28 08:42:33,263 INFO L290 TraceCheckUtils]: 98: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-28 08:42:33,263 INFO L290 TraceCheckUtils]: 97: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-28 08:42:33,263 INFO L290 TraceCheckUtils]: 96: Hoare triple {85392#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,263 INFO L290 TraceCheckUtils]: 95: Hoare triple {85392#true} assume !(0 == ~tmp___6~0); {85392#true} is VALID [2022-04-28 08:42:33,263 INFO L290 TraceCheckUtils]: 94: Hoare triple {85392#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,263 INFO L290 TraceCheckUtils]: 93: Hoare triple {85392#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {85392#true} is VALID [2022-04-28 08:42:33,264 INFO L290 TraceCheckUtils]: 92: Hoare triple {85392#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {85392#true} is VALID [2022-04-28 08:42:33,264 INFO L290 TraceCheckUtils]: 91: Hoare triple {85392#true} assume 4416 == #t~mem60;havoc #t~mem60; {85392#true} is VALID [2022-04-28 08:42:33,264 INFO L290 TraceCheckUtils]: 90: Hoare triple {85392#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,264 INFO L290 TraceCheckUtils]: 89: Hoare triple {85392#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,264 INFO L290 TraceCheckUtils]: 88: Hoare triple {85392#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,264 INFO L290 TraceCheckUtils]: 87: Hoare triple {85392#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,264 INFO L290 TraceCheckUtils]: 86: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,264 INFO L290 TraceCheckUtils]: 85: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,264 INFO L290 TraceCheckUtils]: 84: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,264 INFO L290 TraceCheckUtils]: 83: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,265 INFO L290 TraceCheckUtils]: 82: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,265 INFO L290 TraceCheckUtils]: 81: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,265 INFO L290 TraceCheckUtils]: 80: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,265 INFO L290 TraceCheckUtils]: 79: Hoare triple {85392#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,265 INFO L290 TraceCheckUtils]: 78: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-28 08:42:33,265 INFO L290 TraceCheckUtils]: 77: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-28 08:42:33,265 INFO L290 TraceCheckUtils]: 76: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-28 08:42:33,265 INFO L290 TraceCheckUtils]: 75: Hoare triple {85392#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,265 INFO L290 TraceCheckUtils]: 74: Hoare triple {85392#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,265 INFO L290 TraceCheckUtils]: 73: Hoare triple {85392#true} assume !(~ret~0 <= 0); {85392#true} is VALID [2022-04-28 08:42:33,266 INFO L290 TraceCheckUtils]: 72: Hoare triple {85392#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {85392#true} is VALID [2022-04-28 08:42:33,266 INFO L290 TraceCheckUtils]: 71: Hoare triple {85392#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {85392#true} is VALID [2022-04-28 08:42:33,266 INFO L290 TraceCheckUtils]: 70: Hoare triple {85392#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,266 INFO L290 TraceCheckUtils]: 69: Hoare triple {85392#true} assume 4400 == #t~mem58;havoc #t~mem58; {85392#true} is VALID [2022-04-28 08:42:33,266 INFO L290 TraceCheckUtils]: 68: Hoare triple {85392#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,266 INFO L290 TraceCheckUtils]: 67: Hoare triple {85392#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,266 INFO L290 TraceCheckUtils]: 66: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,266 INFO L290 TraceCheckUtils]: 65: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,266 INFO L290 TraceCheckUtils]: 64: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,266 INFO L290 TraceCheckUtils]: 63: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,266 INFO L290 TraceCheckUtils]: 62: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,267 INFO L290 TraceCheckUtils]: 61: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,267 INFO L290 TraceCheckUtils]: 60: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,267 INFO L290 TraceCheckUtils]: 59: Hoare triple {85392#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,267 INFO L290 TraceCheckUtils]: 58: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-28 08:42:33,267 INFO L290 TraceCheckUtils]: 57: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-28 08:42:33,267 INFO L290 TraceCheckUtils]: 56: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-28 08:42:33,267 INFO L290 TraceCheckUtils]: 55: Hoare triple {85392#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,267 INFO L290 TraceCheckUtils]: 54: Hoare triple {85392#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,267 INFO L290 TraceCheckUtils]: 53: Hoare triple {85392#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,267 INFO L290 TraceCheckUtils]: 52: Hoare triple {85392#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,268 INFO L290 TraceCheckUtils]: 51: Hoare triple {85392#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {85392#true} is VALID [2022-04-28 08:42:33,268 INFO L290 TraceCheckUtils]: 50: Hoare triple {85392#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {85392#true} is VALID [2022-04-28 08:42:33,268 INFO L290 TraceCheckUtils]: 49: Hoare triple {85392#true} assume 4384 == #t~mem56;havoc #t~mem56; {85392#true} is VALID [2022-04-28 08:42:33,268 INFO L290 TraceCheckUtils]: 48: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,268 INFO L290 TraceCheckUtils]: 47: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,268 INFO L290 TraceCheckUtils]: 46: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,268 INFO L290 TraceCheckUtils]: 45: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,268 INFO L290 TraceCheckUtils]: 44: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,268 INFO L290 TraceCheckUtils]: 43: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,268 INFO L290 TraceCheckUtils]: 42: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,268 INFO L290 TraceCheckUtils]: 41: Hoare triple {85392#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,269 INFO L290 TraceCheckUtils]: 40: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-28 08:42:33,269 INFO L290 TraceCheckUtils]: 39: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-28 08:42:33,269 INFO L290 TraceCheckUtils]: 38: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-28 08:42:33,269 INFO L290 TraceCheckUtils]: 37: Hoare triple {85392#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,269 INFO L290 TraceCheckUtils]: 36: Hoare triple {85392#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {85392#true} is VALID [2022-04-28 08:42:33,269 INFO L290 TraceCheckUtils]: 35: Hoare triple {85392#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,269 INFO L290 TraceCheckUtils]: 34: Hoare triple {85392#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {85392#true} is VALID [2022-04-28 08:42:33,269 INFO L290 TraceCheckUtils]: 33: Hoare triple {85392#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {85392#true} is VALID [2022-04-28 08:42:33,269 INFO L290 TraceCheckUtils]: 32: Hoare triple {85392#true} assume 4368 == #t~mem54;havoc #t~mem54; {85392#true} is VALID [2022-04-28 08:42:33,269 INFO L290 TraceCheckUtils]: 31: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,270 INFO L290 TraceCheckUtils]: 30: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,270 INFO L290 TraceCheckUtils]: 29: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,270 INFO L290 TraceCheckUtils]: 28: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,270 INFO L290 TraceCheckUtils]: 27: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,270 INFO L290 TraceCheckUtils]: 26: Hoare triple {85392#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-28 08:42:33,270 INFO L290 TraceCheckUtils]: 24: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-28 08:42:33,270 INFO L290 TraceCheckUtils]: 23: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-28 08:42:33,270 INFO L290 TraceCheckUtils]: 22: Hoare triple {85392#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {85392#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {85392#true} assume !(0 == ~tmp___4~0); {85392#true} is VALID [2022-04-28 08:42:33,271 INFO L290 TraceCheckUtils]: 19: Hoare triple {85392#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {85392#true} is VALID [2022-04-28 08:42:33,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {85392#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {85392#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {85392#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {85392#true} is VALID [2022-04-28 08:42:33,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {85392#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {85392#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {85392#true} is VALID [2022-04-28 08:42:33,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {85392#true} assume 12292 == #t~mem49;havoc #t~mem49; {85392#true} is VALID [2022-04-28 08:42:33,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {85392#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-28 08:42:33,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {85392#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {85392#true} is VALID [2022-04-28 08:42:33,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {85392#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {85392#true} is VALID [2022-04-28 08:42:33,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {85392#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {85392#true} is VALID [2022-04-28 08:42:33,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {85392#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {85392#true} is VALID [2022-04-28 08:42:33,272 INFO L272 TraceCheckUtils]: 6: Hoare triple {85392#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {85392#true} is VALID [2022-04-28 08:42:33,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {85392#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {85392#true} is VALID [2022-04-28 08:42:33,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {85392#true} call #t~ret158 := main(); {85392#true} is VALID [2022-04-28 08:42:33,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85392#true} {85392#true} #593#return; {85392#true} is VALID [2022-04-28 08:42:33,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {85392#true} assume true; {85392#true} is VALID [2022-04-28 08:42:33,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {85392#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {85392#true} is VALID [2022-04-28 08:42:33,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {85392#true} call ULTIMATE.init(); {85392#true} is VALID [2022-04-28 08:42:33,273 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-28 08:42:33,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067737527] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 08:42:33,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 08:42:33,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8, 5] total 13 [2022-04-28 08:42:33,274 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:42:33,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1921421257] [2022-04-28 08:42:33,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1921421257] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:42:33,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:42:33,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:42:33,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541965818] [2022-04-28 08:42:33,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:42:33,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 162 [2022-04-28 08:42:33,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:42:33,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:33,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:42:33,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:42:33,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:42:33,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:42:33,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-04-28 08:42:33,365 INFO L87 Difference]: Start difference. First operand 886 states and 1278 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:39,438 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:42:40,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:40,634 INFO L93 Difference]: Finished difference Result 2234 states and 3239 transitions. [2022-04-28 08:42:40,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:42:40,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 162 [2022-04-28 08:42:40,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:42:40,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:40,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2022-04-28 08:42:40,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:40,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2022-04-28 08:42:40,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 472 transitions. [2022-04-28 08:42:40,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:42:41,045 INFO L225 Difference]: With dead ends: 2234 [2022-04-28 08:42:41,045 INFO L226 Difference]: Without dead ends: 1364 [2022-04-28 08:42:41,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-28 08:42:41,047 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 95 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:42:41,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 312 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 08:42:41,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2022-04-28 08:42:41,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1036. [2022-04-28 08:42:41,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:42:41,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1364 states. Second operand has 1036 states, 1031 states have (on average 1.4684772065955383) internal successors, (1514), 1031 states have internal predecessors, (1514), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:41,403 INFO L74 IsIncluded]: Start isIncluded. First operand 1364 states. Second operand has 1036 states, 1031 states have (on average 1.4684772065955383) internal successors, (1514), 1031 states have internal predecessors, (1514), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:41,404 INFO L87 Difference]: Start difference. First operand 1364 states. Second operand has 1036 states, 1031 states have (on average 1.4684772065955383) internal successors, (1514), 1031 states have internal predecessors, (1514), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:41,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:41,456 INFO L93 Difference]: Finished difference Result 1364 states and 1976 transitions. [2022-04-28 08:42:41,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1976 transitions. [2022-04-28 08:42:41,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:42:41,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:42:41,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 1036 states, 1031 states have (on average 1.4684772065955383) internal successors, (1514), 1031 states have internal predecessors, (1514), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1364 states. [2022-04-28 08:42:41,459 INFO L87 Difference]: Start difference. First operand has 1036 states, 1031 states have (on average 1.4684772065955383) internal successors, (1514), 1031 states have internal predecessors, (1514), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1364 states. [2022-04-28 08:42:41,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:41,505 INFO L93 Difference]: Finished difference Result 1364 states and 1976 transitions. [2022-04-28 08:42:41,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1976 transitions. [2022-04-28 08:42:41,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:42:41,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:42:41,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:42:41,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:42:41,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 1031 states have (on average 1.4684772065955383) internal successors, (1514), 1031 states have internal predecessors, (1514), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:41,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1518 transitions. [2022-04-28 08:42:41,549 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1518 transitions. Word has length 162 [2022-04-28 08:42:41,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:42:41,549 INFO L495 AbstractCegarLoop]: Abstraction has 1036 states and 1518 transitions. [2022-04-28 08:42:41,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:41,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1036 states and 1518 transitions. [2022-04-28 08:42:42,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1518 edges. 1518 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:42:42,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1518 transitions. [2022-04-28 08:42:42,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-28 08:42:42,933 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:42:42,933 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:42:42,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 08:42:43,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:42:43,134 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:42:43,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:42:43,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1671837310, now seen corresponding path program 1 times [2022-04-28 08:42:43,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:42:43,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1060648209] [2022-04-28 08:43:02,114 WARN L232 SmtUtils]: Spent 14.72s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:43:10,459 WARN L232 SmtUtils]: Spent 5.48s on a formula simplification that was a NOOP. DAG size: 153 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:43:12,528 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:43:12,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1671837310, now seen corresponding path program 2 times [2022-04-28 08:43:12,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:43:12,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934537023] [2022-04-28 08:43:12,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:43:12,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:43:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:43:12,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:43:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:43:12,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {95656#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {95649#true} is VALID [2022-04-28 08:43:12,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {95649#true} assume true; {95649#true} is VALID [2022-04-28 08:43:12,725 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {95649#true} {95649#true} #593#return; {95649#true} is VALID [2022-04-28 08:43:12,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {95649#true} call ULTIMATE.init(); {95656#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:43:12,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {95656#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {95649#true} is VALID [2022-04-28 08:43:12,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {95649#true} assume true; {95649#true} is VALID [2022-04-28 08:43:12,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95649#true} {95649#true} #593#return; {95649#true} is VALID [2022-04-28 08:43:12,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {95649#true} call #t~ret158 := main(); {95649#true} is VALID [2022-04-28 08:43:12,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {95649#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {95649#true} is VALID [2022-04-28 08:43:12,727 INFO L272 TraceCheckUtils]: 6: Hoare triple {95649#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {95649#true} is VALID [2022-04-28 08:43:12,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {95649#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {95649#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {95649#true} is VALID [2022-04-28 08:43:12,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {95649#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {95649#true} is VALID [2022-04-28 08:43:12,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {95649#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {95649#true} is VALID [2022-04-28 08:43:12,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {95649#true} assume !false; {95649#true} is VALID [2022-04-28 08:43:12,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {95649#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {95649#true} assume 12292 == #t~mem49;havoc #t~mem49; {95649#true} is VALID [2022-04-28 08:43:12,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {95649#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {95649#true} is VALID [2022-04-28 08:43:12,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {95649#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {95649#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {95649#true} is VALID [2022-04-28 08:43:12,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {95649#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {95649#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {95649#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {95649#true} is VALID [2022-04-28 08:43:12,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {95649#true} assume !(0 == ~tmp___4~0); {95649#true} is VALID [2022-04-28 08:43:12,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {95649#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {95649#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,728 INFO L290 TraceCheckUtils]: 23: Hoare triple {95649#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {95649#true} is VALID [2022-04-28 08:43:12,728 INFO L290 TraceCheckUtils]: 24: Hoare triple {95649#true} ~skip~0 := 0; {95649#true} is VALID [2022-04-28 08:43:12,728 INFO L290 TraceCheckUtils]: 25: Hoare triple {95649#true} assume !false; {95649#true} is VALID [2022-04-28 08:43:12,728 INFO L290 TraceCheckUtils]: 26: Hoare triple {95649#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,728 INFO L290 TraceCheckUtils]: 27: Hoare triple {95649#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,728 INFO L290 TraceCheckUtils]: 28: Hoare triple {95649#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {95649#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,729 INFO L290 TraceCheckUtils]: 30: Hoare triple {95649#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,729 INFO L290 TraceCheckUtils]: 31: Hoare triple {95649#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,729 INFO L290 TraceCheckUtils]: 32: Hoare triple {95649#true} assume 4368 == #t~mem54;havoc #t~mem54; {95649#true} is VALID [2022-04-28 08:43:12,729 INFO L290 TraceCheckUtils]: 33: Hoare triple {95649#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {95649#true} is VALID [2022-04-28 08:43:12,729 INFO L290 TraceCheckUtils]: 34: Hoare triple {95649#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {95649#true} is VALID [2022-04-28 08:43:12,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {95649#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,729 INFO L290 TraceCheckUtils]: 36: Hoare triple {95649#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {95649#true} is VALID [2022-04-28 08:43:12,729 INFO L290 TraceCheckUtils]: 37: Hoare triple {95649#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,729 INFO L290 TraceCheckUtils]: 38: Hoare triple {95649#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {95649#true} is VALID [2022-04-28 08:43:12,729 INFO L290 TraceCheckUtils]: 39: Hoare triple {95649#true} ~skip~0 := 0; {95649#true} is VALID [2022-04-28 08:43:12,729 INFO L290 TraceCheckUtils]: 40: Hoare triple {95649#true} assume !false; {95649#true} is VALID [2022-04-28 08:43:12,730 INFO L290 TraceCheckUtils]: 41: Hoare triple {95649#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,730 INFO L290 TraceCheckUtils]: 42: Hoare triple {95649#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,730 INFO L290 TraceCheckUtils]: 43: Hoare triple {95649#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,730 INFO L290 TraceCheckUtils]: 44: Hoare triple {95649#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,730 INFO L290 TraceCheckUtils]: 45: Hoare triple {95649#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,730 INFO L290 TraceCheckUtils]: 46: Hoare triple {95649#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,730 INFO L290 TraceCheckUtils]: 47: Hoare triple {95649#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,730 INFO L290 TraceCheckUtils]: 48: Hoare triple {95649#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,730 INFO L290 TraceCheckUtils]: 49: Hoare triple {95649#true} assume 4384 == #t~mem56;havoc #t~mem56; {95649#true} is VALID [2022-04-28 08:43:12,730 INFO L290 TraceCheckUtils]: 50: Hoare triple {95649#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {95649#true} is VALID [2022-04-28 08:43:12,730 INFO L290 TraceCheckUtils]: 51: Hoare triple {95649#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {95649#true} is VALID [2022-04-28 08:43:12,730 INFO L290 TraceCheckUtils]: 52: Hoare triple {95649#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,731 INFO L290 TraceCheckUtils]: 53: Hoare triple {95649#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,731 INFO L290 TraceCheckUtils]: 54: Hoare triple {95649#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,731 INFO L290 TraceCheckUtils]: 55: Hoare triple {95649#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,731 INFO L290 TraceCheckUtils]: 56: Hoare triple {95649#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {95649#true} is VALID [2022-04-28 08:43:12,731 INFO L290 TraceCheckUtils]: 57: Hoare triple {95649#true} ~skip~0 := 0; {95649#true} is VALID [2022-04-28 08:43:12,731 INFO L290 TraceCheckUtils]: 58: Hoare triple {95649#true} assume !false; {95649#true} is VALID [2022-04-28 08:43:12,731 INFO L290 TraceCheckUtils]: 59: Hoare triple {95649#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,731 INFO L290 TraceCheckUtils]: 60: Hoare triple {95649#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,731 INFO L290 TraceCheckUtils]: 61: Hoare triple {95649#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,731 INFO L290 TraceCheckUtils]: 62: Hoare triple {95649#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,731 INFO L290 TraceCheckUtils]: 63: Hoare triple {95649#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,731 INFO L290 TraceCheckUtils]: 64: Hoare triple {95649#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,732 INFO L290 TraceCheckUtils]: 65: Hoare triple {95649#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,732 INFO L290 TraceCheckUtils]: 66: Hoare triple {95649#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,732 INFO L290 TraceCheckUtils]: 67: Hoare triple {95649#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,732 INFO L290 TraceCheckUtils]: 68: Hoare triple {95649#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,732 INFO L290 TraceCheckUtils]: 69: Hoare triple {95649#true} assume 4400 == #t~mem58;havoc #t~mem58; {95649#true} is VALID [2022-04-28 08:43:12,732 INFO L290 TraceCheckUtils]: 70: Hoare triple {95649#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,732 INFO L290 TraceCheckUtils]: 71: Hoare triple {95649#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {95649#true} is VALID [2022-04-28 08:43:12,732 INFO L290 TraceCheckUtils]: 72: Hoare triple {95649#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {95649#true} is VALID [2022-04-28 08:43:12,732 INFO L290 TraceCheckUtils]: 73: Hoare triple {95649#true} assume !(~ret~0 <= 0); {95649#true} is VALID [2022-04-28 08:43:12,732 INFO L290 TraceCheckUtils]: 74: Hoare triple {95649#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,732 INFO L290 TraceCheckUtils]: 75: Hoare triple {95649#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,732 INFO L290 TraceCheckUtils]: 76: Hoare triple {95649#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {95649#true} is VALID [2022-04-28 08:43:12,733 INFO L290 TraceCheckUtils]: 77: Hoare triple {95649#true} ~skip~0 := 0; {95649#true} is VALID [2022-04-28 08:43:12,733 INFO L290 TraceCheckUtils]: 78: Hoare triple {95649#true} assume !false; {95649#true} is VALID [2022-04-28 08:43:12,733 INFO L290 TraceCheckUtils]: 79: Hoare triple {95649#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,733 INFO L290 TraceCheckUtils]: 80: Hoare triple {95649#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,733 INFO L290 TraceCheckUtils]: 81: Hoare triple {95649#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,733 INFO L290 TraceCheckUtils]: 82: Hoare triple {95649#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,733 INFO L290 TraceCheckUtils]: 83: Hoare triple {95649#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,733 INFO L290 TraceCheckUtils]: 84: Hoare triple {95649#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,733 INFO L290 TraceCheckUtils]: 85: Hoare triple {95649#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,733 INFO L290 TraceCheckUtils]: 86: Hoare triple {95649#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,733 INFO L290 TraceCheckUtils]: 87: Hoare triple {95649#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,733 INFO L290 TraceCheckUtils]: 88: Hoare triple {95649#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,733 INFO L290 TraceCheckUtils]: 89: Hoare triple {95649#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,734 INFO L290 TraceCheckUtils]: 90: Hoare triple {95649#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,734 INFO L290 TraceCheckUtils]: 91: Hoare triple {95649#true} assume 4416 == #t~mem60;havoc #t~mem60; {95649#true} is VALID [2022-04-28 08:43:12,734 INFO L290 TraceCheckUtils]: 92: Hoare triple {95649#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {95649#true} is VALID [2022-04-28 08:43:12,734 INFO L290 TraceCheckUtils]: 93: Hoare triple {95649#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {95649#true} is VALID [2022-04-28 08:43:12,734 INFO L290 TraceCheckUtils]: 94: Hoare triple {95649#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,734 INFO L290 TraceCheckUtils]: 95: Hoare triple {95649#true} assume !(0 == ~tmp___6~0); {95649#true} is VALID [2022-04-28 08:43:12,734 INFO L290 TraceCheckUtils]: 96: Hoare triple {95649#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,734 INFO L290 TraceCheckUtils]: 97: Hoare triple {95649#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {95649#true} is VALID [2022-04-28 08:43:12,734 INFO L290 TraceCheckUtils]: 98: Hoare triple {95649#true} ~skip~0 := 0; {95649#true} is VALID [2022-04-28 08:43:12,734 INFO L290 TraceCheckUtils]: 99: Hoare triple {95649#true} assume !false; {95649#true} is VALID [2022-04-28 08:43:12,734 INFO L290 TraceCheckUtils]: 100: Hoare triple {95649#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,734 INFO L290 TraceCheckUtils]: 101: Hoare triple {95649#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,735 INFO L290 TraceCheckUtils]: 102: Hoare triple {95649#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,735 INFO L290 TraceCheckUtils]: 103: Hoare triple {95649#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,735 INFO L290 TraceCheckUtils]: 104: Hoare triple {95649#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,735 INFO L290 TraceCheckUtils]: 105: Hoare triple {95649#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,735 INFO L290 TraceCheckUtils]: 106: Hoare triple {95649#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,735 INFO L290 TraceCheckUtils]: 107: Hoare triple {95649#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,735 INFO L290 TraceCheckUtils]: 108: Hoare triple {95649#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,735 INFO L290 TraceCheckUtils]: 109: Hoare triple {95649#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,735 INFO L290 TraceCheckUtils]: 110: Hoare triple {95649#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,735 INFO L290 TraceCheckUtils]: 111: Hoare triple {95649#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,735 INFO L290 TraceCheckUtils]: 112: Hoare triple {95649#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,735 INFO L290 TraceCheckUtils]: 113: Hoare triple {95649#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,735 INFO L290 TraceCheckUtils]: 114: Hoare triple {95649#true} assume 4432 == #t~mem62;havoc #t~mem62; {95649#true} is VALID [2022-04-28 08:43:12,736 INFO L290 TraceCheckUtils]: 115: Hoare triple {95649#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {95649#true} is VALID [2022-04-28 08:43:12,736 INFO L290 TraceCheckUtils]: 116: Hoare triple {95649#true} assume !(5 == ~blastFlag~0); {95649#true} is VALID [2022-04-28 08:43:12,736 INFO L290 TraceCheckUtils]: 117: Hoare triple {95649#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,736 INFO L290 TraceCheckUtils]: 118: Hoare triple {95649#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,736 INFO L290 TraceCheckUtils]: 119: Hoare triple {95649#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {95649#true} is VALID [2022-04-28 08:43:12,736 INFO L290 TraceCheckUtils]: 120: Hoare triple {95649#true} ~skip~0 := 0; {95649#true} is VALID [2022-04-28 08:43:12,736 INFO L290 TraceCheckUtils]: 121: Hoare triple {95649#true} assume !false; {95649#true} is VALID [2022-04-28 08:43:12,736 INFO L290 TraceCheckUtils]: 122: Hoare triple {95649#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,736 INFO L290 TraceCheckUtils]: 123: Hoare triple {95649#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,736 INFO L290 TraceCheckUtils]: 124: Hoare triple {95649#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,736 INFO L290 TraceCheckUtils]: 125: Hoare triple {95649#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,736 INFO L290 TraceCheckUtils]: 126: Hoare triple {95649#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,737 INFO L290 TraceCheckUtils]: 127: Hoare triple {95649#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,737 INFO L290 TraceCheckUtils]: 128: Hoare triple {95649#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,737 INFO L290 TraceCheckUtils]: 129: Hoare triple {95649#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,737 INFO L290 TraceCheckUtils]: 130: Hoare triple {95649#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,737 INFO L290 TraceCheckUtils]: 131: Hoare triple {95649#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,737 INFO L290 TraceCheckUtils]: 132: Hoare triple {95649#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,737 INFO L290 TraceCheckUtils]: 133: Hoare triple {95649#true} assume 4401 == #t~mem59;havoc #t~mem59; {95649#true} is VALID [2022-04-28 08:43:12,737 INFO L290 TraceCheckUtils]: 134: Hoare triple {95649#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {95649#true} is VALID [2022-04-28 08:43:12,737 INFO L290 TraceCheckUtils]: 135: Hoare triple {95649#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {95649#true} is VALID [2022-04-28 08:43:12,737 INFO L290 TraceCheckUtils]: 136: Hoare triple {95649#true} assume !(2 == ~blastFlag~0); {95649#true} is VALID [2022-04-28 08:43:12,737 INFO L290 TraceCheckUtils]: 137: Hoare triple {95649#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {95649#true} is VALID [2022-04-28 08:43:12,737 INFO L290 TraceCheckUtils]: 138: Hoare triple {95649#true} assume !(~ret~0 <= 0); {95649#true} is VALID [2022-04-28 08:43:12,739 INFO L290 TraceCheckUtils]: 139: Hoare triple {95649#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:12,739 INFO L290 TraceCheckUtils]: 140: Hoare triple {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:12,739 INFO L290 TraceCheckUtils]: 141: Hoare triple {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:12,740 INFO L290 TraceCheckUtils]: 142: Hoare triple {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:12,740 INFO L290 TraceCheckUtils]: 143: Hoare triple {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:12,741 INFO L290 TraceCheckUtils]: 144: Hoare triple {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:12,741 INFO L290 TraceCheckUtils]: 145: Hoare triple {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:12,741 INFO L290 TraceCheckUtils]: 146: Hoare triple {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:12,742 INFO L290 TraceCheckUtils]: 147: Hoare triple {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:12,742 INFO L290 TraceCheckUtils]: 148: Hoare triple {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:12,743 INFO L290 TraceCheckUtils]: 149: Hoare triple {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:12,743 INFO L290 TraceCheckUtils]: 150: Hoare triple {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:12,743 INFO L290 TraceCheckUtils]: 151: Hoare triple {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:12,744 INFO L290 TraceCheckUtils]: 152: Hoare triple {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:12,744 INFO L290 TraceCheckUtils]: 153: Hoare triple {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:12,745 INFO L290 TraceCheckUtils]: 154: Hoare triple {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:12,745 INFO L290 TraceCheckUtils]: 155: Hoare triple {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {95655#(= |ssl3_connect_#t~mem60| 4416)} is VALID [2022-04-28 08:43:12,745 INFO L290 TraceCheckUtils]: 156: Hoare triple {95655#(= |ssl3_connect_#t~mem60| 4416)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {95650#false} is VALID [2022-04-28 08:43:12,745 INFO L290 TraceCheckUtils]: 157: Hoare triple {95650#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {95650#false} is VALID [2022-04-28 08:43:12,746 INFO L290 TraceCheckUtils]: 158: Hoare triple {95650#false} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {95650#false} is VALID [2022-04-28 08:43:12,746 INFO L290 TraceCheckUtils]: 159: Hoare triple {95650#false} assume 4433 == #t~mem63;havoc #t~mem63; {95650#false} is VALID [2022-04-28 08:43:12,746 INFO L290 TraceCheckUtils]: 160: Hoare triple {95650#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {95650#false} is VALID [2022-04-28 08:43:12,746 INFO L290 TraceCheckUtils]: 161: Hoare triple {95650#false} assume 5 == ~blastFlag~0; {95650#false} is VALID [2022-04-28 08:43:12,746 INFO L290 TraceCheckUtils]: 162: Hoare triple {95650#false} assume !false; {95650#false} is VALID [2022-04-28 08:43:12,746 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-28 08:43:12,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:43:12,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934537023] [2022-04-28 08:43:12,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934537023] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:43:12,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:43:12,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:43:12,747 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:43:12,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1060648209] [2022-04-28 08:43:12,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1060648209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:43:12,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:43:12,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:43:12,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72802594] [2022-04-28 08:43:12,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:43:12,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 163 [2022-04-28 08:43:12,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:43:12,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:12,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:43:12,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:43:12,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:43:12,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:43:12,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:43:12,828 INFO L87 Difference]: Start difference. First operand 1036 states and 1518 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:14,848 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:43:16,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:43:16,570 INFO L93 Difference]: Finished difference Result 2287 states and 3332 transitions. [2022-04-28 08:43:16,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:43:16,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 163 [2022-04-28 08:43:16,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:43:16,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:16,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 401 transitions. [2022-04-28 08:43:16,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:16,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 401 transitions. [2022-04-28 08:43:16,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 401 transitions. [2022-04-28 08:43:16,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 401 edges. 401 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:43:16,924 INFO L225 Difference]: With dead ends: 2287 [2022-04-28 08:43:16,924 INFO L226 Difference]: Without dead ends: 1267 [2022-04-28 08:43:16,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:43:16,925 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 40 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:43:16,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 506 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 388 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:43:16,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2022-04-28 08:43:17,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1146. [2022-04-28 08:43:17,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:43:17,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1267 states. Second operand has 1146 states, 1141 states have (on average 1.4715162138475022) internal successors, (1679), 1141 states have internal predecessors, (1679), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:17,356 INFO L74 IsIncluded]: Start isIncluded. First operand 1267 states. Second operand has 1146 states, 1141 states have (on average 1.4715162138475022) internal successors, (1679), 1141 states have internal predecessors, (1679), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:17,357 INFO L87 Difference]: Start difference. First operand 1267 states. Second operand has 1146 states, 1141 states have (on average 1.4715162138475022) internal successors, (1679), 1141 states have internal predecessors, (1679), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:17,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:43:17,400 INFO L93 Difference]: Finished difference Result 1267 states and 1829 transitions. [2022-04-28 08:43:17,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1829 transitions. [2022-04-28 08:43:17,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:43:17,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:43:17,403 INFO L74 IsIncluded]: Start isIncluded. First operand has 1146 states, 1141 states have (on average 1.4715162138475022) internal successors, (1679), 1141 states have internal predecessors, (1679), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1267 states. [2022-04-28 08:43:17,403 INFO L87 Difference]: Start difference. First operand has 1146 states, 1141 states have (on average 1.4715162138475022) internal successors, (1679), 1141 states have internal predecessors, (1679), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1267 states. [2022-04-28 08:43:17,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:43:17,446 INFO L93 Difference]: Finished difference Result 1267 states and 1829 transitions. [2022-04-28 08:43:17,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1829 transitions. [2022-04-28 08:43:17,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:43:17,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:43:17,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:43:17,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:43:17,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1141 states have (on average 1.4715162138475022) internal successors, (1679), 1141 states have internal predecessors, (1679), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:17,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1683 transitions. [2022-04-28 08:43:17,517 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1683 transitions. Word has length 163 [2022-04-28 08:43:17,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:43:17,517 INFO L495 AbstractCegarLoop]: Abstraction has 1146 states and 1683 transitions. [2022-04-28 08:43:17,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:17,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1146 states and 1683 transitions. [2022-04-28 08:43:19,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1683 edges. 1683 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:43:19,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1683 transitions. [2022-04-28 08:43:19,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-04-28 08:43:19,193 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:43:19,193 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:43:19,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 08:43:19,193 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:43:19,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:43:19,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1665276355, now seen corresponding path program 1 times [2022-04-28 08:43:19,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:43:19,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [92192030] [2022-04-28 08:43:31,128 WARN L232 SmtUtils]: Spent 11.12s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:43:44,606 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:43:44,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1665276355, now seen corresponding path program 2 times [2022-04-28 08:43:44,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:43:44,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067402152] [2022-04-28 08:43:44,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:43:44,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:43:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:43:44,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:43:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:43:44,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {105070#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {105061#true} is VALID [2022-04-28 08:43:44,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {105061#true} assume true; {105061#true} is VALID [2022-04-28 08:43:44,883 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {105061#true} {105061#true} #593#return; {105061#true} is VALID [2022-04-28 08:43:44,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {105061#true} call ULTIMATE.init(); {105070#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:43:44,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {105070#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {105061#true} is VALID [2022-04-28 08:43:44,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {105061#true} assume true; {105061#true} is VALID [2022-04-28 08:43:44,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {105061#true} {105061#true} #593#return; {105061#true} is VALID [2022-04-28 08:43:44,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {105061#true} call #t~ret158 := main(); {105061#true} is VALID [2022-04-28 08:43:44,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {105061#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {105061#true} is VALID [2022-04-28 08:43:44,884 INFO L272 TraceCheckUtils]: 6: Hoare triple {105061#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {105061#true} is VALID [2022-04-28 08:43:44,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {105061#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {105061#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {105061#true} is VALID [2022-04-28 08:43:44,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {105061#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {105061#true} is VALID [2022-04-28 08:43:44,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {105061#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {105061#true} is VALID [2022-04-28 08:43:44,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-28 08:43:44,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {105061#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {105061#true} assume 12292 == #t~mem49;havoc #t~mem49; {105061#true} is VALID [2022-04-28 08:43:44,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {105061#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {105061#true} is VALID [2022-04-28 08:43:44,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {105061#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {105061#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {105061#true} is VALID [2022-04-28 08:43:44,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {105061#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {105061#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {105061#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {105061#true} is VALID [2022-04-28 08:43:44,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {105061#true} assume !(0 == ~tmp___4~0); {105061#true} is VALID [2022-04-28 08:43:44,885 INFO L290 TraceCheckUtils]: 21: Hoare triple {105061#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,885 INFO L290 TraceCheckUtils]: 22: Hoare triple {105061#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,885 INFO L290 TraceCheckUtils]: 23: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-28 08:43:44,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-28 08:43:44,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-28 08:43:44,886 INFO L290 TraceCheckUtils]: 26: Hoare triple {105061#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,886 INFO L290 TraceCheckUtils]: 27: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,886 INFO L290 TraceCheckUtils]: 28: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,886 INFO L290 TraceCheckUtils]: 29: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,886 INFO L290 TraceCheckUtils]: 30: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,886 INFO L290 TraceCheckUtils]: 31: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,886 INFO L290 TraceCheckUtils]: 32: Hoare triple {105061#true} assume 4368 == #t~mem54;havoc #t~mem54; {105061#true} is VALID [2022-04-28 08:43:44,886 INFO L290 TraceCheckUtils]: 33: Hoare triple {105061#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {105061#true} is VALID [2022-04-28 08:43:44,887 INFO L290 TraceCheckUtils]: 34: Hoare triple {105061#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {105061#true} is VALID [2022-04-28 08:43:44,887 INFO L290 TraceCheckUtils]: 35: Hoare triple {105061#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,887 INFO L290 TraceCheckUtils]: 36: Hoare triple {105061#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {105061#true} is VALID [2022-04-28 08:43:44,887 INFO L290 TraceCheckUtils]: 37: Hoare triple {105061#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,887 INFO L290 TraceCheckUtils]: 38: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-28 08:43:44,887 INFO L290 TraceCheckUtils]: 39: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-28 08:43:44,887 INFO L290 TraceCheckUtils]: 40: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-28 08:43:44,887 INFO L290 TraceCheckUtils]: 41: Hoare triple {105061#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,887 INFO L290 TraceCheckUtils]: 42: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,887 INFO L290 TraceCheckUtils]: 43: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,887 INFO L290 TraceCheckUtils]: 44: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,888 INFO L290 TraceCheckUtils]: 45: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,888 INFO L290 TraceCheckUtils]: 46: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,888 INFO L290 TraceCheckUtils]: 47: Hoare triple {105061#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,888 INFO L290 TraceCheckUtils]: 48: Hoare triple {105061#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,888 INFO L290 TraceCheckUtils]: 49: Hoare triple {105061#true} assume 4384 == #t~mem56;havoc #t~mem56; {105061#true} is VALID [2022-04-28 08:43:44,888 INFO L290 TraceCheckUtils]: 50: Hoare triple {105061#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {105061#true} is VALID [2022-04-28 08:43:44,888 INFO L290 TraceCheckUtils]: 51: Hoare triple {105061#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {105061#true} is VALID [2022-04-28 08:43:44,888 INFO L290 TraceCheckUtils]: 52: Hoare triple {105061#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,888 INFO L290 TraceCheckUtils]: 53: Hoare triple {105061#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,888 INFO L290 TraceCheckUtils]: 54: Hoare triple {105061#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,888 INFO L290 TraceCheckUtils]: 55: Hoare triple {105061#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,888 INFO L290 TraceCheckUtils]: 56: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-28 08:43:44,889 INFO L290 TraceCheckUtils]: 57: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-28 08:43:44,889 INFO L290 TraceCheckUtils]: 58: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-28 08:43:44,889 INFO L290 TraceCheckUtils]: 59: Hoare triple {105061#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,889 INFO L290 TraceCheckUtils]: 60: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,889 INFO L290 TraceCheckUtils]: 61: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,889 INFO L290 TraceCheckUtils]: 62: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,889 INFO L290 TraceCheckUtils]: 63: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,889 INFO L290 TraceCheckUtils]: 64: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,889 INFO L290 TraceCheckUtils]: 65: Hoare triple {105061#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,889 INFO L290 TraceCheckUtils]: 66: Hoare triple {105061#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,889 INFO L290 TraceCheckUtils]: 67: Hoare triple {105061#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,889 INFO L290 TraceCheckUtils]: 68: Hoare triple {105061#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,890 INFO L290 TraceCheckUtils]: 69: Hoare triple {105061#true} assume 4400 == #t~mem58;havoc #t~mem58; {105061#true} is VALID [2022-04-28 08:43:44,890 INFO L290 TraceCheckUtils]: 70: Hoare triple {105061#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,890 INFO L290 TraceCheckUtils]: 71: Hoare triple {105061#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {105061#true} is VALID [2022-04-28 08:43:44,890 INFO L290 TraceCheckUtils]: 72: Hoare triple {105061#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {105061#true} is VALID [2022-04-28 08:43:44,890 INFO L290 TraceCheckUtils]: 73: Hoare triple {105061#true} assume !(~ret~0 <= 0); {105061#true} is VALID [2022-04-28 08:43:44,890 INFO L290 TraceCheckUtils]: 74: Hoare triple {105061#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,890 INFO L290 TraceCheckUtils]: 75: Hoare triple {105061#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,890 INFO L290 TraceCheckUtils]: 76: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-28 08:43:44,890 INFO L290 TraceCheckUtils]: 77: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-28 08:43:44,890 INFO L290 TraceCheckUtils]: 78: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-28 08:43:44,890 INFO L290 TraceCheckUtils]: 79: Hoare triple {105061#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,890 INFO L290 TraceCheckUtils]: 80: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,891 INFO L290 TraceCheckUtils]: 81: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105066#(= |ssl3_connect_#t~mem51| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:44,891 INFO L290 TraceCheckUtils]: 82: Hoare triple {105066#(= |ssl3_connect_#t~mem51| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:43:44,892 INFO L290 TraceCheckUtils]: 83: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:43:44,892 INFO L290 TraceCheckUtils]: 84: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:43:44,893 INFO L290 TraceCheckUtils]: 85: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:43:44,893 INFO L290 TraceCheckUtils]: 86: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:43:44,893 INFO L290 TraceCheckUtils]: 87: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:43:44,894 INFO L290 TraceCheckUtils]: 88: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:43:44,894 INFO L290 TraceCheckUtils]: 89: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:43:44,895 INFO L290 TraceCheckUtils]: 90: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {105068#(not (= |ssl3_connect_#t~mem60| 4096))} is VALID [2022-04-28 08:43:44,895 INFO L290 TraceCheckUtils]: 91: Hoare triple {105068#(not (= |ssl3_connect_#t~mem60| 4096))} assume 4416 == #t~mem60;havoc #t~mem60; {105061#true} is VALID [2022-04-28 08:43:44,895 INFO L290 TraceCheckUtils]: 92: Hoare triple {105061#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {105061#true} is VALID [2022-04-28 08:43:44,895 INFO L290 TraceCheckUtils]: 93: Hoare triple {105061#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {105061#true} is VALID [2022-04-28 08:43:44,895 INFO L290 TraceCheckUtils]: 94: Hoare triple {105061#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,895 INFO L290 TraceCheckUtils]: 95: Hoare triple {105061#true} assume !(0 == ~tmp___6~0); {105061#true} is VALID [2022-04-28 08:43:44,895 INFO L290 TraceCheckUtils]: 96: Hoare triple {105061#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,895 INFO L290 TraceCheckUtils]: 97: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-28 08:43:44,895 INFO L290 TraceCheckUtils]: 98: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-28 08:43:44,895 INFO L290 TraceCheckUtils]: 99: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-28 08:43:44,895 INFO L290 TraceCheckUtils]: 100: Hoare triple {105061#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,896 INFO L290 TraceCheckUtils]: 101: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,896 INFO L290 TraceCheckUtils]: 102: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,896 INFO L290 TraceCheckUtils]: 103: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,896 INFO L290 TraceCheckUtils]: 104: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,896 INFO L290 TraceCheckUtils]: 105: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,896 INFO L290 TraceCheckUtils]: 106: Hoare triple {105061#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,896 INFO L290 TraceCheckUtils]: 107: Hoare triple {105061#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,896 INFO L290 TraceCheckUtils]: 108: Hoare triple {105061#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,896 INFO L290 TraceCheckUtils]: 109: Hoare triple {105061#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,896 INFO L290 TraceCheckUtils]: 110: Hoare triple {105061#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,896 INFO L290 TraceCheckUtils]: 111: Hoare triple {105061#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,896 INFO L290 TraceCheckUtils]: 112: Hoare triple {105061#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,897 INFO L290 TraceCheckUtils]: 113: Hoare triple {105061#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,897 INFO L290 TraceCheckUtils]: 114: Hoare triple {105061#true} assume 4432 == #t~mem62;havoc #t~mem62; {105061#true} is VALID [2022-04-28 08:43:44,897 INFO L290 TraceCheckUtils]: 115: Hoare triple {105061#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {105061#true} is VALID [2022-04-28 08:43:44,897 INFO L290 TraceCheckUtils]: 116: Hoare triple {105061#true} assume !(5 == ~blastFlag~0); {105061#true} is VALID [2022-04-28 08:43:44,897 INFO L290 TraceCheckUtils]: 117: Hoare triple {105061#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,897 INFO L290 TraceCheckUtils]: 118: Hoare triple {105061#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,897 INFO L290 TraceCheckUtils]: 119: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-28 08:43:44,897 INFO L290 TraceCheckUtils]: 120: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-28 08:43:44,897 INFO L290 TraceCheckUtils]: 121: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-28 08:43:44,897 INFO L290 TraceCheckUtils]: 122: Hoare triple {105061#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,897 INFO L290 TraceCheckUtils]: 123: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,898 INFO L290 TraceCheckUtils]: 124: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,898 INFO L290 TraceCheckUtils]: 125: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,898 INFO L290 TraceCheckUtils]: 126: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,898 INFO L290 TraceCheckUtils]: 127: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,898 INFO L290 TraceCheckUtils]: 128: Hoare triple {105061#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,898 INFO L290 TraceCheckUtils]: 129: Hoare triple {105061#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,898 INFO L290 TraceCheckUtils]: 130: Hoare triple {105061#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,898 INFO L290 TraceCheckUtils]: 131: Hoare triple {105061#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,898 INFO L290 TraceCheckUtils]: 132: Hoare triple {105061#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,898 INFO L290 TraceCheckUtils]: 133: Hoare triple {105061#true} assume 4401 == #t~mem59;havoc #t~mem59; {105061#true} is VALID [2022-04-28 08:43:44,898 INFO L290 TraceCheckUtils]: 134: Hoare triple {105061#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {105061#true} is VALID [2022-04-28 08:43:44,898 INFO L290 TraceCheckUtils]: 135: Hoare triple {105061#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {105061#true} is VALID [2022-04-28 08:43:44,899 INFO L290 TraceCheckUtils]: 136: Hoare triple {105061#true} assume !(2 == ~blastFlag~0); {105061#true} is VALID [2022-04-28 08:43:44,899 INFO L290 TraceCheckUtils]: 137: Hoare triple {105061#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {105061#true} is VALID [2022-04-28 08:43:44,899 INFO L290 TraceCheckUtils]: 138: Hoare triple {105061#true} assume !(~ret~0 <= 0); {105061#true} is VALID [2022-04-28 08:43:44,900 INFO L290 TraceCheckUtils]: 139: Hoare triple {105061#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:43:44,900 INFO L290 TraceCheckUtils]: 140: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:43:44,901 INFO L290 TraceCheckUtils]: 141: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:43:44,901 INFO L290 TraceCheckUtils]: 142: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:43:44,901 INFO L290 TraceCheckUtils]: 143: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:43:44,902 INFO L290 TraceCheckUtils]: 144: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:43:44,902 INFO L290 TraceCheckUtils]: 145: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:43:44,903 INFO L290 TraceCheckUtils]: 146: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105069#(not (= |ssl3_connect_#t~mem51| 4096))} is VALID [2022-04-28 08:43:44,903 INFO L290 TraceCheckUtils]: 147: Hoare triple {105069#(not (= |ssl3_connect_#t~mem51| 4096))} assume 4096 == #t~mem51;havoc #t~mem51; {105062#false} is VALID [2022-04-28 08:43:44,903 INFO L290 TraceCheckUtils]: 148: Hoare triple {105062#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:43:44,903 INFO L290 TraceCheckUtils]: 149: Hoare triple {105062#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {105062#false} is VALID [2022-04-28 08:43:44,903 INFO L290 TraceCheckUtils]: 150: Hoare triple {105062#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:43:44,903 INFO L290 TraceCheckUtils]: 151: Hoare triple {105062#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:43:44,903 INFO L290 TraceCheckUtils]: 152: Hoare triple {105062#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {105062#false} is VALID [2022-04-28 08:43:44,904 INFO L290 TraceCheckUtils]: 153: Hoare triple {105062#false} assume !(0 == ~tmp___4~0); {105062#false} is VALID [2022-04-28 08:43:44,904 INFO L290 TraceCheckUtils]: 154: Hoare triple {105062#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:43:44,904 INFO L290 TraceCheckUtils]: 155: Hoare triple {105062#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {105062#false} is VALID [2022-04-28 08:43:44,904 INFO L290 TraceCheckUtils]: 156: Hoare triple {105062#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105062#false} is VALID [2022-04-28 08:43:44,904 INFO L290 TraceCheckUtils]: 157: Hoare triple {105062#false} ~skip~0 := 0; {105062#false} is VALID [2022-04-28 08:43:44,904 INFO L290 TraceCheckUtils]: 158: Hoare triple {105062#false} assume !false; {105062#false} is VALID [2022-04-28 08:43:44,904 INFO L290 TraceCheckUtils]: 159: Hoare triple {105062#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:43:44,904 INFO L290 TraceCheckUtils]: 160: Hoare triple {105062#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:43:44,904 INFO L290 TraceCheckUtils]: 161: Hoare triple {105062#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:43:44,904 INFO L290 TraceCheckUtils]: 162: Hoare triple {105062#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:43:44,904 INFO L290 TraceCheckUtils]: 163: Hoare triple {105062#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:43:44,904 INFO L290 TraceCheckUtils]: 164: Hoare triple {105062#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:43:44,904 INFO L290 TraceCheckUtils]: 165: Hoare triple {105062#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:43:44,905 INFO L290 TraceCheckUtils]: 166: Hoare triple {105062#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:43:44,905 INFO L290 TraceCheckUtils]: 167: Hoare triple {105062#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:43:44,905 INFO L290 TraceCheckUtils]: 168: Hoare triple {105062#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:43:44,905 INFO L290 TraceCheckUtils]: 169: Hoare triple {105062#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:43:44,905 INFO L290 TraceCheckUtils]: 170: Hoare triple {105062#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:43:44,905 INFO L290 TraceCheckUtils]: 171: Hoare triple {105062#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:43:44,905 INFO L290 TraceCheckUtils]: 172: Hoare triple {105062#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:43:44,905 INFO L290 TraceCheckUtils]: 173: Hoare triple {105062#false} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:43:44,905 INFO L290 TraceCheckUtils]: 174: Hoare triple {105062#false} assume 4433 == #t~mem63;havoc #t~mem63; {105062#false} is VALID [2022-04-28 08:43:44,905 INFO L290 TraceCheckUtils]: 175: Hoare triple {105062#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {105062#false} is VALID [2022-04-28 08:43:44,905 INFO L290 TraceCheckUtils]: 176: Hoare triple {105062#false} assume 5 == ~blastFlag~0; {105062#false} is VALID [2022-04-28 08:43:44,905 INFO L290 TraceCheckUtils]: 177: Hoare triple {105062#false} assume !false; {105062#false} is VALID [2022-04-28 08:43:44,906 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 179 proven. 20 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2022-04-28 08:43:44,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:43:44,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067402152] [2022-04-28 08:43:44,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067402152] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 08:43:44,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351172927] [2022-04-28 08:43:44,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 08:43:44,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:43:44,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:43:44,914 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 08:43:44,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 08:44:24,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 08:44:24,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 08:44:24,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 1590 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 08:44:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:44:24,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 08:44:24,298 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-28 08:44:24,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 143 [2022-04-28 08:44:24,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 63 [2022-04-28 08:44:24,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-28 08:44:24,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-28 08:44:24,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2022-04-28 08:44:24,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-04-28 08:44:24,511 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-28 08:44:24,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-04-28 08:44:24,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-04-28 08:44:24,745 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-28 08:44:24,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-04-28 08:44:24,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-04-28 08:44:24,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {105061#true} call ULTIMATE.init(); {105061#true} is VALID [2022-04-28 08:44:24,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {105061#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {105061#true} is VALID [2022-04-28 08:44:24,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {105061#true} assume true; {105061#true} is VALID [2022-04-28 08:44:24,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {105061#true} {105061#true} #593#return; {105061#true} is VALID [2022-04-28 08:44:24,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {105061#true} call #t~ret158 := main(); {105061#true} is VALID [2022-04-28 08:44:24,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {105061#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {105061#true} is VALID [2022-04-28 08:44:24,854 INFO L272 TraceCheckUtils]: 6: Hoare triple {105061#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {105061#true} is VALID [2022-04-28 08:44:24,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {105061#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {105061#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {105061#true} is VALID [2022-04-28 08:44:24,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {105061#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {105061#true} is VALID [2022-04-28 08:44:24,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {105061#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {105061#true} is VALID [2022-04-28 08:44:24,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-28 08:44:24,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {105061#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {105061#true} assume 12292 == #t~mem49;havoc #t~mem49; {105061#true} is VALID [2022-04-28 08:44:24,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {105061#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {105061#true} is VALID [2022-04-28 08:44:24,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {105061#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {105061#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {105061#true} is VALID [2022-04-28 08:44:24,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {105061#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,855 INFO L290 TraceCheckUtils]: 18: Hoare triple {105061#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {105061#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {105061#true} is VALID [2022-04-28 08:44:24,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {105061#true} assume !(0 == ~tmp___4~0); {105061#true} is VALID [2022-04-28 08:44:24,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {105061#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:24,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:24,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:24,866 INFO L290 TraceCheckUtils]: 24: Hoare triple {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} ~skip~0 := 0; {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:24,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !false; {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:24,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:24,868 INFO L290 TraceCheckUtils]: 27: Hoare triple {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:24,868 INFO L290 TraceCheckUtils]: 28: Hoare triple {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:24,869 INFO L290 TraceCheckUtils]: 29: Hoare triple {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:24,869 INFO L290 TraceCheckUtils]: 30: Hoare triple {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:24,869 INFO L290 TraceCheckUtils]: 31: Hoare triple {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,869 INFO L290 TraceCheckUtils]: 32: Hoare triple {105061#true} assume 4368 == #t~mem54;havoc #t~mem54; {105061#true} is VALID [2022-04-28 08:44:24,869 INFO L290 TraceCheckUtils]: 33: Hoare triple {105061#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {105061#true} is VALID [2022-04-28 08:44:24,869 INFO L290 TraceCheckUtils]: 34: Hoare triple {105061#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {105061#true} is VALID [2022-04-28 08:44:24,869 INFO L290 TraceCheckUtils]: 35: Hoare triple {105061#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,870 INFO L290 TraceCheckUtils]: 36: Hoare triple {105061#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {105061#true} is VALID [2022-04-28 08:44:24,870 INFO L290 TraceCheckUtils]: 37: Hoare triple {105061#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,870 INFO L290 TraceCheckUtils]: 38: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-28 08:44:24,870 INFO L290 TraceCheckUtils]: 39: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-28 08:44:24,870 INFO L290 TraceCheckUtils]: 40: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-28 08:44:24,870 INFO L290 TraceCheckUtils]: 41: Hoare triple {105061#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,870 INFO L290 TraceCheckUtils]: 42: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,870 INFO L290 TraceCheckUtils]: 43: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,870 INFO L290 TraceCheckUtils]: 44: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,870 INFO L290 TraceCheckUtils]: 45: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,870 INFO L290 TraceCheckUtils]: 46: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,870 INFO L290 TraceCheckUtils]: 47: Hoare triple {105061#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,870 INFO L290 TraceCheckUtils]: 48: Hoare triple {105061#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,871 INFO L290 TraceCheckUtils]: 49: Hoare triple {105061#true} assume 4384 == #t~mem56;havoc #t~mem56; {105061#true} is VALID [2022-04-28 08:44:24,871 INFO L290 TraceCheckUtils]: 50: Hoare triple {105061#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {105061#true} is VALID [2022-04-28 08:44:24,871 INFO L290 TraceCheckUtils]: 51: Hoare triple {105061#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {105061#true} is VALID [2022-04-28 08:44:24,871 INFO L290 TraceCheckUtils]: 52: Hoare triple {105061#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,871 INFO L290 TraceCheckUtils]: 53: Hoare triple {105061#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,871 INFO L290 TraceCheckUtils]: 54: Hoare triple {105061#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,871 INFO L290 TraceCheckUtils]: 55: Hoare triple {105061#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,871 INFO L290 TraceCheckUtils]: 56: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-28 08:44:24,871 INFO L290 TraceCheckUtils]: 57: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-28 08:44:24,871 INFO L290 TraceCheckUtils]: 58: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-28 08:44:24,871 INFO L290 TraceCheckUtils]: 59: Hoare triple {105061#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,871 INFO L290 TraceCheckUtils]: 60: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,872 INFO L290 TraceCheckUtils]: 61: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,872 INFO L290 TraceCheckUtils]: 62: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,872 INFO L290 TraceCheckUtils]: 63: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,872 INFO L290 TraceCheckUtils]: 64: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,872 INFO L290 TraceCheckUtils]: 65: Hoare triple {105061#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,872 INFO L290 TraceCheckUtils]: 66: Hoare triple {105061#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,872 INFO L290 TraceCheckUtils]: 67: Hoare triple {105061#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,872 INFO L290 TraceCheckUtils]: 68: Hoare triple {105061#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,872 INFO L290 TraceCheckUtils]: 69: Hoare triple {105061#true} assume 4400 == #t~mem58;havoc #t~mem58; {105061#true} is VALID [2022-04-28 08:44:24,872 INFO L290 TraceCheckUtils]: 70: Hoare triple {105061#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,872 INFO L290 TraceCheckUtils]: 71: Hoare triple {105061#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {105061#true} is VALID [2022-04-28 08:44:24,872 INFO L290 TraceCheckUtils]: 72: Hoare triple {105061#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {105061#true} is VALID [2022-04-28 08:44:24,873 INFO L290 TraceCheckUtils]: 73: Hoare triple {105061#true} assume !(~ret~0 <= 0); {105061#true} is VALID [2022-04-28 08:44:24,873 INFO L290 TraceCheckUtils]: 74: Hoare triple {105061#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,873 INFO L290 TraceCheckUtils]: 75: Hoare triple {105061#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,873 INFO L290 TraceCheckUtils]: 76: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-28 08:44:24,873 INFO L290 TraceCheckUtils]: 77: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-28 08:44:24,873 INFO L290 TraceCheckUtils]: 78: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-28 08:44:24,873 INFO L290 TraceCheckUtils]: 79: Hoare triple {105061#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,873 INFO L290 TraceCheckUtils]: 80: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,873 INFO L290 TraceCheckUtils]: 81: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105066#(= |ssl3_connect_#t~mem51| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:24,874 INFO L290 TraceCheckUtils]: 82: Hoare triple {105066#(= |ssl3_connect_#t~mem51| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:24,874 INFO L290 TraceCheckUtils]: 83: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:24,875 INFO L290 TraceCheckUtils]: 84: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:24,875 INFO L290 TraceCheckUtils]: 85: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:24,876 INFO L290 TraceCheckUtils]: 86: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:24,876 INFO L290 TraceCheckUtils]: 87: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:24,876 INFO L290 TraceCheckUtils]: 88: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:24,877 INFO L290 TraceCheckUtils]: 89: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:24,877 INFO L290 TraceCheckUtils]: 90: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {105068#(not (= |ssl3_connect_#t~mem60| 4096))} is VALID [2022-04-28 08:44:24,878 INFO L290 TraceCheckUtils]: 91: Hoare triple {105068#(not (= |ssl3_connect_#t~mem60| 4096))} assume 4416 == #t~mem60;havoc #t~mem60; {105061#true} is VALID [2022-04-28 08:44:24,878 INFO L290 TraceCheckUtils]: 92: Hoare triple {105061#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {105061#true} is VALID [2022-04-28 08:44:24,878 INFO L290 TraceCheckUtils]: 93: Hoare triple {105061#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {105061#true} is VALID [2022-04-28 08:44:24,878 INFO L290 TraceCheckUtils]: 94: Hoare triple {105061#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,878 INFO L290 TraceCheckUtils]: 95: Hoare triple {105061#true} assume !(0 == ~tmp___6~0); {105061#true} is VALID [2022-04-28 08:44:24,878 INFO L290 TraceCheckUtils]: 96: Hoare triple {105061#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,878 INFO L290 TraceCheckUtils]: 97: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-28 08:44:24,878 INFO L290 TraceCheckUtils]: 98: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-28 08:44:24,878 INFO L290 TraceCheckUtils]: 99: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-28 08:44:24,878 INFO L290 TraceCheckUtils]: 100: Hoare triple {105061#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,878 INFO L290 TraceCheckUtils]: 101: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,878 INFO L290 TraceCheckUtils]: 102: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,879 INFO L290 TraceCheckUtils]: 103: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,879 INFO L290 TraceCheckUtils]: 104: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,879 INFO L290 TraceCheckUtils]: 105: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,879 INFO L290 TraceCheckUtils]: 106: Hoare triple {105061#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,879 INFO L290 TraceCheckUtils]: 107: Hoare triple {105061#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,879 INFO L290 TraceCheckUtils]: 108: Hoare triple {105061#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,879 INFO L290 TraceCheckUtils]: 109: Hoare triple {105061#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,879 INFO L290 TraceCheckUtils]: 110: Hoare triple {105061#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,879 INFO L290 TraceCheckUtils]: 111: Hoare triple {105061#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,879 INFO L290 TraceCheckUtils]: 112: Hoare triple {105061#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,879 INFO L290 TraceCheckUtils]: 113: Hoare triple {105061#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,879 INFO L290 TraceCheckUtils]: 114: Hoare triple {105061#true} assume 4432 == #t~mem62;havoc #t~mem62; {105061#true} is VALID [2022-04-28 08:44:24,880 INFO L290 TraceCheckUtils]: 115: Hoare triple {105061#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {105061#true} is VALID [2022-04-28 08:44:24,880 INFO L290 TraceCheckUtils]: 116: Hoare triple {105061#true} assume !(5 == ~blastFlag~0); {105061#true} is VALID [2022-04-28 08:44:24,880 INFO L290 TraceCheckUtils]: 117: Hoare triple {105061#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,880 INFO L290 TraceCheckUtils]: 118: Hoare triple {105061#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,880 INFO L290 TraceCheckUtils]: 119: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-28 08:44:24,880 INFO L290 TraceCheckUtils]: 120: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-28 08:44:24,880 INFO L290 TraceCheckUtils]: 121: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-28 08:44:24,880 INFO L290 TraceCheckUtils]: 122: Hoare triple {105061#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,880 INFO L290 TraceCheckUtils]: 123: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,880 INFO L290 TraceCheckUtils]: 124: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,880 INFO L290 TraceCheckUtils]: 125: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,880 INFO L290 TraceCheckUtils]: 126: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,880 INFO L290 TraceCheckUtils]: 127: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,881 INFO L290 TraceCheckUtils]: 128: Hoare triple {105061#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,881 INFO L290 TraceCheckUtils]: 129: Hoare triple {105061#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,881 INFO L290 TraceCheckUtils]: 130: Hoare triple {105061#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,881 INFO L290 TraceCheckUtils]: 131: Hoare triple {105061#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,881 INFO L290 TraceCheckUtils]: 132: Hoare triple {105061#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,881 INFO L290 TraceCheckUtils]: 133: Hoare triple {105061#true} assume 4401 == #t~mem59;havoc #t~mem59; {105061#true} is VALID [2022-04-28 08:44:24,881 INFO L290 TraceCheckUtils]: 134: Hoare triple {105061#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {105061#true} is VALID [2022-04-28 08:44:24,881 INFO L290 TraceCheckUtils]: 135: Hoare triple {105061#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {105061#true} is VALID [2022-04-28 08:44:24,881 INFO L290 TraceCheckUtils]: 136: Hoare triple {105061#true} assume !(2 == ~blastFlag~0); {105061#true} is VALID [2022-04-28 08:44:24,881 INFO L290 TraceCheckUtils]: 137: Hoare triple {105061#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {105061#true} is VALID [2022-04-28 08:44:24,881 INFO L290 TraceCheckUtils]: 138: Hoare triple {105061#true} assume !(~ret~0 <= 0); {105061#true} is VALID [2022-04-28 08:44:24,882 INFO L290 TraceCheckUtils]: 139: Hoare triple {105061#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {105492#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:24,883 INFO L290 TraceCheckUtils]: 140: Hoare triple {105492#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {105492#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:24,883 INFO L290 TraceCheckUtils]: 141: Hoare triple {105492#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105492#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:24,884 INFO L290 TraceCheckUtils]: 142: Hoare triple {105492#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {105492#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:24,884 INFO L290 TraceCheckUtils]: 143: Hoare triple {105492#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {105492#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:24,884 INFO L290 TraceCheckUtils]: 144: Hoare triple {105492#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105492#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:24,885 INFO L290 TraceCheckUtils]: 145: Hoare triple {105492#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105492#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:24,885 INFO L290 TraceCheckUtils]: 146: Hoare triple {105492#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105514#(= |ssl3_connect_#t~mem51| 4416)} is VALID [2022-04-28 08:44:24,886 INFO L290 TraceCheckUtils]: 147: Hoare triple {105514#(= |ssl3_connect_#t~mem51| 4416)} assume 4096 == #t~mem51;havoc #t~mem51; {105062#false} is VALID [2022-04-28 08:44:24,886 INFO L290 TraceCheckUtils]: 148: Hoare triple {105062#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:24,886 INFO L290 TraceCheckUtils]: 149: Hoare triple {105062#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {105062#false} is VALID [2022-04-28 08:44:24,886 INFO L290 TraceCheckUtils]: 150: Hoare triple {105062#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:24,886 INFO L290 TraceCheckUtils]: 151: Hoare triple {105062#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:24,886 INFO L290 TraceCheckUtils]: 152: Hoare triple {105062#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {105062#false} is VALID [2022-04-28 08:44:24,886 INFO L290 TraceCheckUtils]: 153: Hoare triple {105062#false} assume !(0 == ~tmp___4~0); {105062#false} is VALID [2022-04-28 08:44:24,886 INFO L290 TraceCheckUtils]: 154: Hoare triple {105062#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:24,886 INFO L290 TraceCheckUtils]: 155: Hoare triple {105062#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {105062#false} is VALID [2022-04-28 08:44:24,886 INFO L290 TraceCheckUtils]: 156: Hoare triple {105062#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105062#false} is VALID [2022-04-28 08:44:24,886 INFO L290 TraceCheckUtils]: 157: Hoare triple {105062#false} ~skip~0 := 0; {105062#false} is VALID [2022-04-28 08:44:24,887 INFO L290 TraceCheckUtils]: 158: Hoare triple {105062#false} assume !false; {105062#false} is VALID [2022-04-28 08:44:24,887 INFO L290 TraceCheckUtils]: 159: Hoare triple {105062#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:24,887 INFO L290 TraceCheckUtils]: 160: Hoare triple {105062#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:24,887 INFO L290 TraceCheckUtils]: 161: Hoare triple {105062#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:24,887 INFO L290 TraceCheckUtils]: 162: Hoare triple {105062#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:24,887 INFO L290 TraceCheckUtils]: 163: Hoare triple {105062#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:24,887 INFO L290 TraceCheckUtils]: 164: Hoare triple {105062#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:24,887 INFO L290 TraceCheckUtils]: 165: Hoare triple {105062#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:24,887 INFO L290 TraceCheckUtils]: 166: Hoare triple {105062#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:24,887 INFO L290 TraceCheckUtils]: 167: Hoare triple {105062#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:24,887 INFO L290 TraceCheckUtils]: 168: Hoare triple {105062#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:24,887 INFO L290 TraceCheckUtils]: 169: Hoare triple {105062#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:24,888 INFO L290 TraceCheckUtils]: 170: Hoare triple {105062#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:24,888 INFO L290 TraceCheckUtils]: 171: Hoare triple {105062#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:24,888 INFO L290 TraceCheckUtils]: 172: Hoare triple {105062#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:24,888 INFO L290 TraceCheckUtils]: 173: Hoare triple {105062#false} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:24,888 INFO L290 TraceCheckUtils]: 174: Hoare triple {105062#false} assume 4433 == #t~mem63;havoc #t~mem63; {105062#false} is VALID [2022-04-28 08:44:24,888 INFO L290 TraceCheckUtils]: 175: Hoare triple {105062#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {105062#false} is VALID [2022-04-28 08:44:24,888 INFO L290 TraceCheckUtils]: 176: Hoare triple {105062#false} assume 5 == ~blastFlag~0; {105062#false} is VALID [2022-04-28 08:44:24,888 INFO L290 TraceCheckUtils]: 177: Hoare triple {105062#false} assume !false; {105062#false} is VALID [2022-04-28 08:44:24,889 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 171 proven. 78 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-04-28 08:44:24,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 08:44:25,209 INFO L290 TraceCheckUtils]: 177: Hoare triple {105062#false} assume !false; {105062#false} is VALID [2022-04-28 08:44:25,210 INFO L290 TraceCheckUtils]: 176: Hoare triple {105062#false} assume 5 == ~blastFlag~0; {105062#false} is VALID [2022-04-28 08:44:25,210 INFO L290 TraceCheckUtils]: 175: Hoare triple {105062#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {105062#false} is VALID [2022-04-28 08:44:25,210 INFO L290 TraceCheckUtils]: 174: Hoare triple {105062#false} assume 4433 == #t~mem63;havoc #t~mem63; {105062#false} is VALID [2022-04-28 08:44:25,210 INFO L290 TraceCheckUtils]: 173: Hoare triple {105062#false} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:25,210 INFO L290 TraceCheckUtils]: 172: Hoare triple {105062#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:25,210 INFO L290 TraceCheckUtils]: 171: Hoare triple {105062#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:25,210 INFO L290 TraceCheckUtils]: 170: Hoare triple {105062#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:25,210 INFO L290 TraceCheckUtils]: 169: Hoare triple {105062#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:25,210 INFO L290 TraceCheckUtils]: 168: Hoare triple {105062#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:25,210 INFO L290 TraceCheckUtils]: 167: Hoare triple {105062#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:25,211 INFO L290 TraceCheckUtils]: 166: Hoare triple {105062#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:25,211 INFO L290 TraceCheckUtils]: 165: Hoare triple {105062#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:25,211 INFO L290 TraceCheckUtils]: 164: Hoare triple {105062#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:25,211 INFO L290 TraceCheckUtils]: 163: Hoare triple {105062#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:25,211 INFO L290 TraceCheckUtils]: 162: Hoare triple {105062#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:25,211 INFO L290 TraceCheckUtils]: 161: Hoare triple {105062#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:25,211 INFO L290 TraceCheckUtils]: 160: Hoare triple {105062#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:25,211 INFO L290 TraceCheckUtils]: 159: Hoare triple {105062#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:25,211 INFO L290 TraceCheckUtils]: 158: Hoare triple {105062#false} assume !false; {105062#false} is VALID [2022-04-28 08:44:25,211 INFO L290 TraceCheckUtils]: 157: Hoare triple {105062#false} ~skip~0 := 0; {105062#false} is VALID [2022-04-28 08:44:25,211 INFO L290 TraceCheckUtils]: 156: Hoare triple {105062#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105062#false} is VALID [2022-04-28 08:44:25,212 INFO L290 TraceCheckUtils]: 155: Hoare triple {105062#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {105062#false} is VALID [2022-04-28 08:44:25,212 INFO L290 TraceCheckUtils]: 154: Hoare triple {105062#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:25,212 INFO L290 TraceCheckUtils]: 153: Hoare triple {105062#false} assume !(0 == ~tmp___4~0); {105062#false} is VALID [2022-04-28 08:44:25,212 INFO L290 TraceCheckUtils]: 152: Hoare triple {105062#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {105062#false} is VALID [2022-04-28 08:44:25,212 INFO L290 TraceCheckUtils]: 151: Hoare triple {105062#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:25,212 INFO L290 TraceCheckUtils]: 150: Hoare triple {105062#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:25,212 INFO L290 TraceCheckUtils]: 149: Hoare triple {105062#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {105062#false} is VALID [2022-04-28 08:44:25,212 INFO L290 TraceCheckUtils]: 148: Hoare triple {105062#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {105062#false} is VALID [2022-04-28 08:44:25,213 INFO L290 TraceCheckUtils]: 147: Hoare triple {105069#(not (= |ssl3_connect_#t~mem51| 4096))} assume 4096 == #t~mem51;havoc #t~mem51; {105062#false} is VALID [2022-04-28 08:44:25,213 INFO L290 TraceCheckUtils]: 146: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105069#(not (= |ssl3_connect_#t~mem51| 4096))} is VALID [2022-04-28 08:44:25,214 INFO L290 TraceCheckUtils]: 145: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:25,214 INFO L290 TraceCheckUtils]: 144: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:25,214 INFO L290 TraceCheckUtils]: 143: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:25,215 INFO L290 TraceCheckUtils]: 142: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:25,215 INFO L290 TraceCheckUtils]: 141: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:25,216 INFO L290 TraceCheckUtils]: 140: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:25,217 INFO L290 TraceCheckUtils]: 139: Hoare triple {105061#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:25,217 INFO L290 TraceCheckUtils]: 138: Hoare triple {105061#true} assume !(~ret~0 <= 0); {105061#true} is VALID [2022-04-28 08:44:25,217 INFO L290 TraceCheckUtils]: 137: Hoare triple {105061#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {105061#true} is VALID [2022-04-28 08:44:25,217 INFO L290 TraceCheckUtils]: 136: Hoare triple {105061#true} assume !(2 == ~blastFlag~0); {105061#true} is VALID [2022-04-28 08:44:25,217 INFO L290 TraceCheckUtils]: 135: Hoare triple {105061#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {105061#true} is VALID [2022-04-28 08:44:25,218 INFO L290 TraceCheckUtils]: 134: Hoare triple {105061#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,218 INFO L290 TraceCheckUtils]: 133: Hoare triple {105061#true} assume 4401 == #t~mem59;havoc #t~mem59; {105061#true} is VALID [2022-04-28 08:44:25,218 INFO L290 TraceCheckUtils]: 132: Hoare triple {105061#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,218 INFO L290 TraceCheckUtils]: 131: Hoare triple {105061#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,219 INFO L290 TraceCheckUtils]: 130: Hoare triple {105061#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,219 INFO L290 TraceCheckUtils]: 129: Hoare triple {105061#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,220 INFO L290 TraceCheckUtils]: 128: Hoare triple {105061#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,221 INFO L290 TraceCheckUtils]: 127: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,222 INFO L290 TraceCheckUtils]: 126: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,225 INFO L290 TraceCheckUtils]: 125: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,225 INFO L290 TraceCheckUtils]: 124: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,225 INFO L290 TraceCheckUtils]: 123: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,225 INFO L290 TraceCheckUtils]: 122: Hoare triple {105061#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,226 INFO L290 TraceCheckUtils]: 121: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-28 08:44:25,226 INFO L290 TraceCheckUtils]: 120: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-28 08:44:25,226 INFO L290 TraceCheckUtils]: 119: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-28 08:44:25,226 INFO L290 TraceCheckUtils]: 118: Hoare triple {105061#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,226 INFO L290 TraceCheckUtils]: 117: Hoare triple {105061#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,226 INFO L290 TraceCheckUtils]: 116: Hoare triple {105061#true} assume !(5 == ~blastFlag~0); {105061#true} is VALID [2022-04-28 08:44:25,226 INFO L290 TraceCheckUtils]: 115: Hoare triple {105061#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {105061#true} is VALID [2022-04-28 08:44:25,226 INFO L290 TraceCheckUtils]: 114: Hoare triple {105061#true} assume 4432 == #t~mem62;havoc #t~mem62; {105061#true} is VALID [2022-04-28 08:44:25,226 INFO L290 TraceCheckUtils]: 113: Hoare triple {105061#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,227 INFO L290 TraceCheckUtils]: 112: Hoare triple {105061#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,227 INFO L290 TraceCheckUtils]: 111: Hoare triple {105061#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,227 INFO L290 TraceCheckUtils]: 110: Hoare triple {105061#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,227 INFO L290 TraceCheckUtils]: 109: Hoare triple {105061#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,227 INFO L290 TraceCheckUtils]: 108: Hoare triple {105061#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,227 INFO L290 TraceCheckUtils]: 107: Hoare triple {105061#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,227 INFO L290 TraceCheckUtils]: 106: Hoare triple {105061#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,227 INFO L290 TraceCheckUtils]: 105: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,227 INFO L290 TraceCheckUtils]: 104: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,227 INFO L290 TraceCheckUtils]: 103: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,227 INFO L290 TraceCheckUtils]: 102: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,227 INFO L290 TraceCheckUtils]: 101: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,228 INFO L290 TraceCheckUtils]: 100: Hoare triple {105061#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,228 INFO L290 TraceCheckUtils]: 99: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-28 08:44:25,228 INFO L290 TraceCheckUtils]: 98: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-28 08:44:25,228 INFO L290 TraceCheckUtils]: 97: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-28 08:44:25,228 INFO L290 TraceCheckUtils]: 96: Hoare triple {105061#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,228 INFO L290 TraceCheckUtils]: 95: Hoare triple {105061#true} assume !(0 == ~tmp___6~0); {105061#true} is VALID [2022-04-28 08:44:25,228 INFO L290 TraceCheckUtils]: 94: Hoare triple {105061#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,228 INFO L290 TraceCheckUtils]: 93: Hoare triple {105061#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {105061#true} is VALID [2022-04-28 08:44:25,228 INFO L290 TraceCheckUtils]: 92: Hoare triple {105061#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {105061#true} is VALID [2022-04-28 08:44:25,228 INFO L290 TraceCheckUtils]: 91: Hoare triple {105061#true} assume 4416 == #t~mem60;havoc #t~mem60; {105061#true} is VALID [2022-04-28 08:44:25,228 INFO L290 TraceCheckUtils]: 90: Hoare triple {105061#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,228 INFO L290 TraceCheckUtils]: 89: Hoare triple {105061#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,229 INFO L290 TraceCheckUtils]: 88: Hoare triple {105061#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,229 INFO L290 TraceCheckUtils]: 87: Hoare triple {105061#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,229 INFO L290 TraceCheckUtils]: 86: Hoare triple {105061#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,229 INFO L290 TraceCheckUtils]: 85: Hoare triple {105061#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,229 INFO L290 TraceCheckUtils]: 84: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,229 INFO L290 TraceCheckUtils]: 83: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,229 INFO L290 TraceCheckUtils]: 82: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,229 INFO L290 TraceCheckUtils]: 81: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,229 INFO L290 TraceCheckUtils]: 80: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,229 INFO L290 TraceCheckUtils]: 79: Hoare triple {105061#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,229 INFO L290 TraceCheckUtils]: 78: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-28 08:44:25,229 INFO L290 TraceCheckUtils]: 77: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-28 08:44:25,229 INFO L290 TraceCheckUtils]: 76: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-28 08:44:25,230 INFO L290 TraceCheckUtils]: 75: Hoare triple {105061#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,230 INFO L290 TraceCheckUtils]: 74: Hoare triple {105061#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,230 INFO L290 TraceCheckUtils]: 73: Hoare triple {105061#true} assume !(~ret~0 <= 0); {105061#true} is VALID [2022-04-28 08:44:25,230 INFO L290 TraceCheckUtils]: 72: Hoare triple {105061#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {105061#true} is VALID [2022-04-28 08:44:25,230 INFO L290 TraceCheckUtils]: 71: Hoare triple {105061#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {105061#true} is VALID [2022-04-28 08:44:25,230 INFO L290 TraceCheckUtils]: 70: Hoare triple {105061#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,230 INFO L290 TraceCheckUtils]: 69: Hoare triple {105061#true} assume 4400 == #t~mem58;havoc #t~mem58; {105061#true} is VALID [2022-04-28 08:44:25,230 INFO L290 TraceCheckUtils]: 68: Hoare triple {105061#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,230 INFO L290 TraceCheckUtils]: 67: Hoare triple {105061#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,230 INFO L290 TraceCheckUtils]: 66: Hoare triple {105061#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,230 INFO L290 TraceCheckUtils]: 65: Hoare triple {105061#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,230 INFO L290 TraceCheckUtils]: 64: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,230 INFO L290 TraceCheckUtils]: 63: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,231 INFO L290 TraceCheckUtils]: 62: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,231 INFO L290 TraceCheckUtils]: 61: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,231 INFO L290 TraceCheckUtils]: 60: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,231 INFO L290 TraceCheckUtils]: 59: Hoare triple {105061#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,231 INFO L290 TraceCheckUtils]: 58: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-28 08:44:25,231 INFO L290 TraceCheckUtils]: 57: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-28 08:44:25,231 INFO L290 TraceCheckUtils]: 56: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-28 08:44:25,231 INFO L290 TraceCheckUtils]: 55: Hoare triple {105061#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,231 INFO L290 TraceCheckUtils]: 54: Hoare triple {105061#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,231 INFO L290 TraceCheckUtils]: 53: Hoare triple {105061#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,231 INFO L290 TraceCheckUtils]: 52: Hoare triple {105061#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,231 INFO L290 TraceCheckUtils]: 51: Hoare triple {105061#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {105061#true} is VALID [2022-04-28 08:44:25,231 INFO L290 TraceCheckUtils]: 50: Hoare triple {105061#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {105061#true} is VALID [2022-04-28 08:44:25,232 INFO L290 TraceCheckUtils]: 49: Hoare triple {105061#true} assume 4384 == #t~mem56;havoc #t~mem56; {105061#true} is VALID [2022-04-28 08:44:25,232 INFO L290 TraceCheckUtils]: 48: Hoare triple {105061#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,232 INFO L290 TraceCheckUtils]: 47: Hoare triple {105061#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,232 INFO L290 TraceCheckUtils]: 46: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,232 INFO L290 TraceCheckUtils]: 45: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,232 INFO L290 TraceCheckUtils]: 44: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,232 INFO L290 TraceCheckUtils]: 43: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,232 INFO L290 TraceCheckUtils]: 42: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,232 INFO L290 TraceCheckUtils]: 41: Hoare triple {105061#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-28 08:44:25,232 INFO L290 TraceCheckUtils]: 39: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-28 08:44:25,232 INFO L290 TraceCheckUtils]: 38: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-28 08:44:25,232 INFO L290 TraceCheckUtils]: 37: Hoare triple {105061#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,233 INFO L290 TraceCheckUtils]: 36: Hoare triple {105061#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {105061#true} is VALID [2022-04-28 08:44:25,233 INFO L290 TraceCheckUtils]: 35: Hoare triple {105061#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {105061#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {105061#true} is VALID [2022-04-28 08:44:25,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {105061#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {105061#true} is VALID [2022-04-28 08:44:25,233 INFO L290 TraceCheckUtils]: 32: Hoare triple {105061#true} assume 4368 == #t~mem54;havoc #t~mem54; {105061#true} is VALID [2022-04-28 08:44:25,233 INFO L290 TraceCheckUtils]: 31: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,233 INFO L290 TraceCheckUtils]: 29: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,233 INFO L290 TraceCheckUtils]: 28: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,233 INFO L290 TraceCheckUtils]: 27: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {105061#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-28 08:44:25,233 INFO L290 TraceCheckUtils]: 24: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-28 08:44:25,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-28 08:44:25,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {105061#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {105061#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {105061#true} assume !(0 == ~tmp___4~0); {105061#true} is VALID [2022-04-28 08:44:25,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {105061#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {105061#true} is VALID [2022-04-28 08:44:25,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {105061#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,234 INFO L290 TraceCheckUtils]: 17: Hoare triple {105061#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,234 INFO L290 TraceCheckUtils]: 16: Hoare triple {105061#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {105061#true} is VALID [2022-04-28 08:44:25,234 INFO L290 TraceCheckUtils]: 15: Hoare triple {105061#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {105061#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {105061#true} is VALID [2022-04-28 08:44:25,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {105061#true} assume 12292 == #t~mem49;havoc #t~mem49; {105061#true} is VALID [2022-04-28 08:44:25,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {105061#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-28 08:44:25,234 INFO L290 TraceCheckUtils]: 10: Hoare triple {105061#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {105061#true} is VALID [2022-04-28 08:44:25,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {105061#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {105061#true} is VALID [2022-04-28 08:44:25,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {105061#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {105061#true} is VALID [2022-04-28 08:44:25,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {105061#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {105061#true} is VALID [2022-04-28 08:44:25,235 INFO L272 TraceCheckUtils]: 6: Hoare triple {105061#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {105061#true} is VALID [2022-04-28 08:44:25,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {105061#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {105061#true} is VALID [2022-04-28 08:44:25,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {105061#true} call #t~ret158 := main(); {105061#true} is VALID [2022-04-28 08:44:25,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {105061#true} {105061#true} #593#return; {105061#true} is VALID [2022-04-28 08:44:25,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {105061#true} assume true; {105061#true} is VALID [2022-04-28 08:44:25,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {105061#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {105061#true} is VALID [2022-04-28 08:44:25,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {105061#true} call ULTIMATE.init(); {105061#true} is VALID [2022-04-28 08:44:25,236 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-28 08:44:25,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351172927] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 08:44:25,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 08:44:25,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 8] total 10 [2022-04-28 08:44:25,238 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:44:25,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [92192030] [2022-04-28 08:44:25,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [92192030] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:44:25,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:44:25,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:44:25,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473787024] [2022-04-28 08:44:25,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:44:25,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 178 [2022-04-28 08:44:25,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:44:25,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:44:25,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:44:25,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:44:25,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:44:25,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:44:25,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-28 08:44:25,337 INFO L87 Difference]: Start difference. First operand 1146 states and 1683 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:44:29,378 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:44:32,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:44:32,891 INFO L93 Difference]: Finished difference Result 2580 states and 3790 transitions. [2022-04-28 08:44:32,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:44:32,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 178 [2022-04-28 08:44:32,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:44:32,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:44:32,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 461 transitions. [2022-04-28 08:44:32,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:44:32,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 461 transitions. [2022-04-28 08:44:32,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 461 transitions. [2022-04-28 08:44:33,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 461 edges. 461 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:44:33,327 INFO L225 Difference]: With dead ends: 2580 [2022-04-28 08:44:33,328 INFO L226 Difference]: Without dead ends: 1450 [2022-04-28 08:44:33,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-28 08:44:33,329 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 109 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 38 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:44:33,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 292 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 200 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 08:44:33,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2022-04-28 08:44:33,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1146. [2022-04-28 08:44:33,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:44:33,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1450 states. Second operand has 1146 states, 1141 states have (on average 1.4539877300613497) internal successors, (1659), 1141 states have internal predecessors, (1659), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:44:33,776 INFO L74 IsIncluded]: Start isIncluded. First operand 1450 states. Second operand has 1146 states, 1141 states have (on average 1.4539877300613497) internal successors, (1659), 1141 states have internal predecessors, (1659), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:44:33,777 INFO L87 Difference]: Start difference. First operand 1450 states. Second operand has 1146 states, 1141 states have (on average 1.4539877300613497) internal successors, (1659), 1141 states have internal predecessors, (1659), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:44:33,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:44:33,836 INFO L93 Difference]: Finished difference Result 1450 states and 2107 transitions. [2022-04-28 08:44:33,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 2107 transitions. [2022-04-28 08:44:33,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:44:33,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:44:33,839 INFO L74 IsIncluded]: Start isIncluded. First operand has 1146 states, 1141 states have (on average 1.4539877300613497) internal successors, (1659), 1141 states have internal predecessors, (1659), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1450 states. [2022-04-28 08:44:33,840 INFO L87 Difference]: Start difference. First operand has 1146 states, 1141 states have (on average 1.4539877300613497) internal successors, (1659), 1141 states have internal predecessors, (1659), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1450 states. [2022-04-28 08:44:33,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:44:33,892 INFO L93 Difference]: Finished difference Result 1450 states and 2107 transitions. [2022-04-28 08:44:33,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 2107 transitions. [2022-04-28 08:44:33,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:44:33,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:44:33,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:44:33,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:44:33,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1141 states have (on average 1.4539877300613497) internal successors, (1659), 1141 states have internal predecessors, (1659), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:44:33,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1663 transitions. [2022-04-28 08:44:33,958 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1663 transitions. Word has length 178 [2022-04-28 08:44:33,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:44:33,958 INFO L495 AbstractCegarLoop]: Abstraction has 1146 states and 1663 transitions. [2022-04-28 08:44:33,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:44:33,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1146 states and 1663 transitions. [2022-04-28 08:44:35,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1663 edges. 1663 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:44:35,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1663 transitions. [2022-04-28 08:44:35,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-04-28 08:44:35,652 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:44:35,652 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:44:35,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 08:44:35,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-28 08:44:35,853 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:44:35,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:44:35,854 INFO L85 PathProgramCache]: Analyzing trace with hash -543824043, now seen corresponding path program 1 times [2022-04-28 08:44:35,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:44:35,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1758446703] [2022-04-28 08:44:50,277 WARN L232 SmtUtils]: Spent 9.68s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:44:59,471 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:44:59,471 INFO L85 PathProgramCache]: Analyzing trace with hash -543824043, now seen corresponding path program 2 times [2022-04-28 08:44:59,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:44:59,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325595768] [2022-04-28 08:44:59,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:44:59,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:44:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:44:59,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:44:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:44:59,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {116504#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {116495#true} is VALID [2022-04-28 08:44:59,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {116495#true} assume true; {116495#true} is VALID [2022-04-28 08:44:59,712 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {116495#true} {116495#true} #593#return; {116495#true} is VALID [2022-04-28 08:44:59,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {116495#true} call ULTIMATE.init(); {116504#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:44:59,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {116504#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {116495#true} is VALID [2022-04-28 08:44:59,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {116495#true} assume true; {116495#true} is VALID [2022-04-28 08:44:59,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116495#true} {116495#true} #593#return; {116495#true} is VALID [2022-04-28 08:44:59,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {116495#true} call #t~ret158 := main(); {116495#true} is VALID [2022-04-28 08:44:59,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {116495#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {116495#true} is VALID [2022-04-28 08:44:59,713 INFO L272 TraceCheckUtils]: 6: Hoare triple {116495#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {116495#true} is VALID [2022-04-28 08:44:59,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {116495#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {116495#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {116495#true} is VALID [2022-04-28 08:44:59,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {116495#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {116495#true} is VALID [2022-04-28 08:44:59,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {116495#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {116495#true} is VALID [2022-04-28 08:44:59,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-28 08:44:59,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {116495#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {116495#true} assume 12292 == #t~mem49;havoc #t~mem49; {116495#true} is VALID [2022-04-28 08:44:59,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {116495#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {116495#true} is VALID [2022-04-28 08:44:59,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {116495#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {116495#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {116495#true} is VALID [2022-04-28 08:44:59,714 INFO L290 TraceCheckUtils]: 17: Hoare triple {116495#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {116495#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {116495#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {116495#true} is VALID [2022-04-28 08:44:59,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {116495#true} assume !(0 == ~tmp___4~0); {116495#true} is VALID [2022-04-28 08:44:59,714 INFO L290 TraceCheckUtils]: 21: Hoare triple {116495#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {116495#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-28 08:44:59,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-28 08:44:59,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-28 08:44:59,715 INFO L290 TraceCheckUtils]: 26: Hoare triple {116495#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,715 INFO L290 TraceCheckUtils]: 27: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,715 INFO L290 TraceCheckUtils]: 28: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,715 INFO L290 TraceCheckUtils]: 29: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,715 INFO L290 TraceCheckUtils]: 30: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,715 INFO L290 TraceCheckUtils]: 31: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,715 INFO L290 TraceCheckUtils]: 32: Hoare triple {116495#true} assume 4368 == #t~mem54;havoc #t~mem54; {116495#true} is VALID [2022-04-28 08:44:59,716 INFO L290 TraceCheckUtils]: 33: Hoare triple {116495#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {116495#true} is VALID [2022-04-28 08:44:59,716 INFO L290 TraceCheckUtils]: 34: Hoare triple {116495#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {116495#true} is VALID [2022-04-28 08:44:59,716 INFO L290 TraceCheckUtils]: 35: Hoare triple {116495#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,716 INFO L290 TraceCheckUtils]: 36: Hoare triple {116495#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {116495#true} is VALID [2022-04-28 08:44:59,716 INFO L290 TraceCheckUtils]: 37: Hoare triple {116495#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,716 INFO L290 TraceCheckUtils]: 38: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-28 08:44:59,716 INFO L290 TraceCheckUtils]: 39: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-28 08:44:59,716 INFO L290 TraceCheckUtils]: 40: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-28 08:44:59,716 INFO L290 TraceCheckUtils]: 41: Hoare triple {116495#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,716 INFO L290 TraceCheckUtils]: 42: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,716 INFO L290 TraceCheckUtils]: 43: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,716 INFO L290 TraceCheckUtils]: 44: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,717 INFO L290 TraceCheckUtils]: 45: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,717 INFO L290 TraceCheckUtils]: 46: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,717 INFO L290 TraceCheckUtils]: 47: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,717 INFO L290 TraceCheckUtils]: 48: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,717 INFO L290 TraceCheckUtils]: 49: Hoare triple {116495#true} assume 4384 == #t~mem56;havoc #t~mem56; {116495#true} is VALID [2022-04-28 08:44:59,717 INFO L290 TraceCheckUtils]: 50: Hoare triple {116495#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {116495#true} is VALID [2022-04-28 08:44:59,717 INFO L290 TraceCheckUtils]: 51: Hoare triple {116495#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {116495#true} is VALID [2022-04-28 08:44:59,717 INFO L290 TraceCheckUtils]: 52: Hoare triple {116495#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,717 INFO L290 TraceCheckUtils]: 53: Hoare triple {116495#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,717 INFO L290 TraceCheckUtils]: 54: Hoare triple {116495#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,717 INFO L290 TraceCheckUtils]: 55: Hoare triple {116495#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,717 INFO L290 TraceCheckUtils]: 56: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-28 08:44:59,717 INFO L290 TraceCheckUtils]: 57: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-28 08:44:59,718 INFO L290 TraceCheckUtils]: 58: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-28 08:44:59,718 INFO L290 TraceCheckUtils]: 59: Hoare triple {116495#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,718 INFO L290 TraceCheckUtils]: 60: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,718 INFO L290 TraceCheckUtils]: 61: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,718 INFO L290 TraceCheckUtils]: 62: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,718 INFO L290 TraceCheckUtils]: 63: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,718 INFO L290 TraceCheckUtils]: 64: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,718 INFO L290 TraceCheckUtils]: 65: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,718 INFO L290 TraceCheckUtils]: 66: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,718 INFO L290 TraceCheckUtils]: 67: Hoare triple {116495#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,718 INFO L290 TraceCheckUtils]: 68: Hoare triple {116495#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,718 INFO L290 TraceCheckUtils]: 69: Hoare triple {116495#true} assume 4400 == #t~mem58;havoc #t~mem58; {116495#true} is VALID [2022-04-28 08:44:59,719 INFO L290 TraceCheckUtils]: 70: Hoare triple {116495#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,719 INFO L290 TraceCheckUtils]: 71: Hoare triple {116495#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {116495#true} is VALID [2022-04-28 08:44:59,719 INFO L290 TraceCheckUtils]: 72: Hoare triple {116495#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {116495#true} is VALID [2022-04-28 08:44:59,719 INFO L290 TraceCheckUtils]: 73: Hoare triple {116495#true} assume !(~ret~0 <= 0); {116495#true} is VALID [2022-04-28 08:44:59,719 INFO L290 TraceCheckUtils]: 74: Hoare triple {116495#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,719 INFO L290 TraceCheckUtils]: 75: Hoare triple {116495#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,719 INFO L290 TraceCheckUtils]: 76: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-28 08:44:59,719 INFO L290 TraceCheckUtils]: 77: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-28 08:44:59,719 INFO L290 TraceCheckUtils]: 78: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-28 08:44:59,719 INFO L290 TraceCheckUtils]: 79: Hoare triple {116495#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,719 INFO L290 TraceCheckUtils]: 80: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,719 INFO L290 TraceCheckUtils]: 81: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,720 INFO L290 TraceCheckUtils]: 82: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,720 INFO L290 TraceCheckUtils]: 83: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,720 INFO L290 TraceCheckUtils]: 84: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,720 INFO L290 TraceCheckUtils]: 85: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,723 INFO L290 TraceCheckUtils]: 86: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116500#(= |ssl3_connect_#t~mem56| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:59,724 INFO L290 TraceCheckUtils]: 87: Hoare triple {116500#(= |ssl3_connect_#t~mem56| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:59,724 INFO L290 TraceCheckUtils]: 88: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:59,725 INFO L290 TraceCheckUtils]: 89: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:59,725 INFO L290 TraceCheckUtils]: 90: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {116502#(not (= |ssl3_connect_#t~mem60| 4384))} is VALID [2022-04-28 08:44:59,725 INFO L290 TraceCheckUtils]: 91: Hoare triple {116502#(not (= |ssl3_connect_#t~mem60| 4384))} assume 4416 == #t~mem60;havoc #t~mem60; {116495#true} is VALID [2022-04-28 08:44:59,725 INFO L290 TraceCheckUtils]: 92: Hoare triple {116495#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {116495#true} is VALID [2022-04-28 08:44:59,725 INFO L290 TraceCheckUtils]: 93: Hoare triple {116495#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {116495#true} is VALID [2022-04-28 08:44:59,725 INFO L290 TraceCheckUtils]: 94: Hoare triple {116495#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,725 INFO L290 TraceCheckUtils]: 95: Hoare triple {116495#true} assume !(0 == ~tmp___6~0); {116495#true} is VALID [2022-04-28 08:44:59,725 INFO L290 TraceCheckUtils]: 96: Hoare triple {116495#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,726 INFO L290 TraceCheckUtils]: 97: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-28 08:44:59,726 INFO L290 TraceCheckUtils]: 98: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-28 08:44:59,726 INFO L290 TraceCheckUtils]: 99: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-28 08:44:59,726 INFO L290 TraceCheckUtils]: 100: Hoare triple {116495#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,726 INFO L290 TraceCheckUtils]: 101: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,726 INFO L290 TraceCheckUtils]: 102: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,726 INFO L290 TraceCheckUtils]: 103: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,726 INFO L290 TraceCheckUtils]: 104: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,726 INFO L290 TraceCheckUtils]: 105: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,726 INFO L290 TraceCheckUtils]: 106: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,726 INFO L290 TraceCheckUtils]: 107: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,726 INFO L290 TraceCheckUtils]: 108: Hoare triple {116495#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,727 INFO L290 TraceCheckUtils]: 109: Hoare triple {116495#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,727 INFO L290 TraceCheckUtils]: 110: Hoare triple {116495#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,727 INFO L290 TraceCheckUtils]: 111: Hoare triple {116495#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,727 INFO L290 TraceCheckUtils]: 112: Hoare triple {116495#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,727 INFO L290 TraceCheckUtils]: 113: Hoare triple {116495#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,727 INFO L290 TraceCheckUtils]: 114: Hoare triple {116495#true} assume 4432 == #t~mem62;havoc #t~mem62; {116495#true} is VALID [2022-04-28 08:44:59,727 INFO L290 TraceCheckUtils]: 115: Hoare triple {116495#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {116495#true} is VALID [2022-04-28 08:44:59,727 INFO L290 TraceCheckUtils]: 116: Hoare triple {116495#true} assume !(5 == ~blastFlag~0); {116495#true} is VALID [2022-04-28 08:44:59,727 INFO L290 TraceCheckUtils]: 117: Hoare triple {116495#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,727 INFO L290 TraceCheckUtils]: 118: Hoare triple {116495#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,727 INFO L290 TraceCheckUtils]: 119: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-28 08:44:59,727 INFO L290 TraceCheckUtils]: 120: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-28 08:44:59,728 INFO L290 TraceCheckUtils]: 121: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-28 08:44:59,728 INFO L290 TraceCheckUtils]: 122: Hoare triple {116495#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,728 INFO L290 TraceCheckUtils]: 123: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,728 INFO L290 TraceCheckUtils]: 124: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,728 INFO L290 TraceCheckUtils]: 125: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,728 INFO L290 TraceCheckUtils]: 126: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,728 INFO L290 TraceCheckUtils]: 127: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,728 INFO L290 TraceCheckUtils]: 128: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,728 INFO L290 TraceCheckUtils]: 129: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,728 INFO L290 TraceCheckUtils]: 130: Hoare triple {116495#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,728 INFO L290 TraceCheckUtils]: 131: Hoare triple {116495#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,728 INFO L290 TraceCheckUtils]: 132: Hoare triple {116495#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,728 INFO L290 TraceCheckUtils]: 133: Hoare triple {116495#true} assume 4401 == #t~mem59;havoc #t~mem59; {116495#true} is VALID [2022-04-28 08:44:59,729 INFO L290 TraceCheckUtils]: 134: Hoare triple {116495#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {116495#true} is VALID [2022-04-28 08:44:59,729 INFO L290 TraceCheckUtils]: 135: Hoare triple {116495#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {116495#true} is VALID [2022-04-28 08:44:59,729 INFO L290 TraceCheckUtils]: 136: Hoare triple {116495#true} assume !(2 == ~blastFlag~0); {116495#true} is VALID [2022-04-28 08:44:59,729 INFO L290 TraceCheckUtils]: 137: Hoare triple {116495#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {116495#true} is VALID [2022-04-28 08:44:59,729 INFO L290 TraceCheckUtils]: 138: Hoare triple {116495#true} assume !(~ret~0 <= 0); {116495#true} is VALID [2022-04-28 08:44:59,730 INFO L290 TraceCheckUtils]: 139: Hoare triple {116495#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:59,731 INFO L290 TraceCheckUtils]: 140: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:59,731 INFO L290 TraceCheckUtils]: 141: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:59,731 INFO L290 TraceCheckUtils]: 142: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:59,732 INFO L290 TraceCheckUtils]: 143: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:59,732 INFO L290 TraceCheckUtils]: 144: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:59,732 INFO L290 TraceCheckUtils]: 145: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:59,733 INFO L290 TraceCheckUtils]: 146: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:59,733 INFO L290 TraceCheckUtils]: 147: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:59,733 INFO L290 TraceCheckUtils]: 148: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:59,734 INFO L290 TraceCheckUtils]: 149: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:59,734 INFO L290 TraceCheckUtils]: 150: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:44:59,734 INFO L290 TraceCheckUtils]: 151: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116503#(not (= |ssl3_connect_#t~mem56| 4384))} is VALID [2022-04-28 08:44:59,735 INFO L290 TraceCheckUtils]: 152: Hoare triple {116503#(not (= |ssl3_connect_#t~mem56| 4384))} assume 4384 == #t~mem56;havoc #t~mem56; {116496#false} is VALID [2022-04-28 08:44:59,735 INFO L290 TraceCheckUtils]: 153: Hoare triple {116496#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {116496#false} is VALID [2022-04-28 08:44:59,735 INFO L290 TraceCheckUtils]: 154: Hoare triple {116496#false} assume !(1 == ~blastFlag~0); {116496#false} is VALID [2022-04-28 08:44:59,735 INFO L290 TraceCheckUtils]: 155: Hoare triple {116496#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:44:59,735 INFO L290 TraceCheckUtils]: 156: Hoare triple {116496#false} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:44:59,735 INFO L290 TraceCheckUtils]: 157: Hoare triple {116496#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:44:59,735 INFO L290 TraceCheckUtils]: 158: Hoare triple {116496#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {116496#false} is VALID [2022-04-28 08:44:59,735 INFO L290 TraceCheckUtils]: 159: Hoare triple {116496#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116496#false} is VALID [2022-04-28 08:44:59,735 INFO L290 TraceCheckUtils]: 160: Hoare triple {116496#false} ~skip~0 := 0; {116496#false} is VALID [2022-04-28 08:44:59,735 INFO L290 TraceCheckUtils]: 161: Hoare triple {116496#false} assume !false; {116496#false} is VALID [2022-04-28 08:44:59,735 INFO L290 TraceCheckUtils]: 162: Hoare triple {116496#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:44:59,735 INFO L290 TraceCheckUtils]: 163: Hoare triple {116496#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:44:59,735 INFO L290 TraceCheckUtils]: 164: Hoare triple {116496#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:44:59,735 INFO L290 TraceCheckUtils]: 165: Hoare triple {116496#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:44:59,735 INFO L290 TraceCheckUtils]: 166: Hoare triple {116496#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:44:59,736 INFO L290 TraceCheckUtils]: 167: Hoare triple {116496#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:44:59,736 INFO L290 TraceCheckUtils]: 168: Hoare triple {116496#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:44:59,736 INFO L290 TraceCheckUtils]: 169: Hoare triple {116496#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:44:59,736 INFO L290 TraceCheckUtils]: 170: Hoare triple {116496#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:44:59,736 INFO L290 TraceCheckUtils]: 171: Hoare triple {116496#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:44:59,736 INFO L290 TraceCheckUtils]: 172: Hoare triple {116496#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:44:59,736 INFO L290 TraceCheckUtils]: 173: Hoare triple {116496#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:44:59,736 INFO L290 TraceCheckUtils]: 174: Hoare triple {116496#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:44:59,736 INFO L290 TraceCheckUtils]: 175: Hoare triple {116496#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:44:59,736 INFO L290 TraceCheckUtils]: 176: Hoare triple {116496#false} assume 4432 == #t~mem62;havoc #t~mem62; {116496#false} is VALID [2022-04-28 08:44:59,736 INFO L290 TraceCheckUtils]: 177: Hoare triple {116496#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {116496#false} is VALID [2022-04-28 08:44:59,736 INFO L290 TraceCheckUtils]: 178: Hoare triple {116496#false} assume 5 == ~blastFlag~0; {116496#false} is VALID [2022-04-28 08:44:59,736 INFO L290 TraceCheckUtils]: 179: Hoare triple {116496#false} assume !false; {116496#false} is VALID [2022-04-28 08:44:59,737 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 196 proven. 10 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2022-04-28 08:44:59,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:44:59,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325595768] [2022-04-28 08:44:59,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325595768] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 08:44:59,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997332279] [2022-04-28 08:44:59,737 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 08:44:59,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:44:59,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:44:59,738 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 08:44:59,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 08:45:43,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 08:45:43,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 08:45:43,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 1547 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 08:45:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:45:43,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 08:45:43,712 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-28 08:45:43,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 143 [2022-04-28 08:45:43,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 63 [2022-04-28 08:45:43,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-28 08:45:43,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-28 08:45:43,852 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-04-28 08:45:43,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-04-28 08:45:43,918 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-28 08:45:43,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-04-28 08:45:44,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-04-28 08:45:44,162 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-28 08:45:44,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-04-28 08:45:44,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-04-28 08:45:44,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {116495#true} call ULTIMATE.init(); {116495#true} is VALID [2022-04-28 08:45:44,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {116495#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {116495#true} is VALID [2022-04-28 08:45:44,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {116495#true} assume true; {116495#true} is VALID [2022-04-28 08:45:44,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116495#true} {116495#true} #593#return; {116495#true} is VALID [2022-04-28 08:45:44,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {116495#true} call #t~ret158 := main(); {116495#true} is VALID [2022-04-28 08:45:44,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {116495#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {116495#true} is VALID [2022-04-28 08:45:44,290 INFO L272 TraceCheckUtils]: 6: Hoare triple {116495#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {116495#true} is VALID [2022-04-28 08:45:44,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {116495#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {116495#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {116495#true} is VALID [2022-04-28 08:45:44,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {116495#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {116495#true} is VALID [2022-04-28 08:45:44,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {116495#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {116495#true} is VALID [2022-04-28 08:45:44,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-28 08:45:44,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {116495#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {116495#true} assume 12292 == #t~mem49;havoc #t~mem49; {116495#true} is VALID [2022-04-28 08:45:44,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {116495#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {116495#true} is VALID [2022-04-28 08:45:44,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {116495#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {116495#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {116495#true} is VALID [2022-04-28 08:45:44,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {116495#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {116495#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {116495#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {116495#true} is VALID [2022-04-28 08:45:44,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {116495#true} assume !(0 == ~tmp___4~0); {116495#true} is VALID [2022-04-28 08:45:44,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {116495#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:45:44,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:45:44,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:45:44,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} ~skip~0 := 0; {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:45:44,295 INFO L290 TraceCheckUtils]: 25: Hoare triple {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !false; {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:45:44,295 INFO L290 TraceCheckUtils]: 26: Hoare triple {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:45:44,296 INFO L290 TraceCheckUtils]: 27: Hoare triple {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:45:44,296 INFO L290 TraceCheckUtils]: 28: Hoare triple {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:45:44,297 INFO L290 TraceCheckUtils]: 29: Hoare triple {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:45:44,297 INFO L290 TraceCheckUtils]: 30: Hoare triple {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:45:44,297 INFO L290 TraceCheckUtils]: 31: Hoare triple {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,297 INFO L290 TraceCheckUtils]: 32: Hoare triple {116495#true} assume 4368 == #t~mem54;havoc #t~mem54; {116495#true} is VALID [2022-04-28 08:45:44,297 INFO L290 TraceCheckUtils]: 33: Hoare triple {116495#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {116495#true} is VALID [2022-04-28 08:45:44,297 INFO L290 TraceCheckUtils]: 34: Hoare triple {116495#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {116495#true} is VALID [2022-04-28 08:45:44,298 INFO L290 TraceCheckUtils]: 35: Hoare triple {116495#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,298 INFO L290 TraceCheckUtils]: 36: Hoare triple {116495#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {116495#true} is VALID [2022-04-28 08:45:44,298 INFO L290 TraceCheckUtils]: 37: Hoare triple {116495#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,298 INFO L290 TraceCheckUtils]: 38: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-28 08:45:44,298 INFO L290 TraceCheckUtils]: 39: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-28 08:45:44,298 INFO L290 TraceCheckUtils]: 40: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-28 08:45:44,298 INFO L290 TraceCheckUtils]: 41: Hoare triple {116495#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,298 INFO L290 TraceCheckUtils]: 42: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,298 INFO L290 TraceCheckUtils]: 43: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,298 INFO L290 TraceCheckUtils]: 44: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,298 INFO L290 TraceCheckUtils]: 45: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,298 INFO L290 TraceCheckUtils]: 46: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,298 INFO L290 TraceCheckUtils]: 47: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,299 INFO L290 TraceCheckUtils]: 48: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,299 INFO L290 TraceCheckUtils]: 49: Hoare triple {116495#true} assume 4384 == #t~mem56;havoc #t~mem56; {116495#true} is VALID [2022-04-28 08:45:44,299 INFO L290 TraceCheckUtils]: 50: Hoare triple {116495#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {116495#true} is VALID [2022-04-28 08:45:44,299 INFO L290 TraceCheckUtils]: 51: Hoare triple {116495#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {116495#true} is VALID [2022-04-28 08:45:44,299 INFO L290 TraceCheckUtils]: 52: Hoare triple {116495#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,299 INFO L290 TraceCheckUtils]: 53: Hoare triple {116495#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,299 INFO L290 TraceCheckUtils]: 54: Hoare triple {116495#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,299 INFO L290 TraceCheckUtils]: 55: Hoare triple {116495#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,299 INFO L290 TraceCheckUtils]: 56: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-28 08:45:44,299 INFO L290 TraceCheckUtils]: 57: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-28 08:45:44,299 INFO L290 TraceCheckUtils]: 58: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-28 08:45:44,299 INFO L290 TraceCheckUtils]: 59: Hoare triple {116495#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,299 INFO L290 TraceCheckUtils]: 60: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,300 INFO L290 TraceCheckUtils]: 61: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,300 INFO L290 TraceCheckUtils]: 62: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,300 INFO L290 TraceCheckUtils]: 63: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,300 INFO L290 TraceCheckUtils]: 64: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,300 INFO L290 TraceCheckUtils]: 65: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,300 INFO L290 TraceCheckUtils]: 66: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,300 INFO L290 TraceCheckUtils]: 67: Hoare triple {116495#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,300 INFO L290 TraceCheckUtils]: 68: Hoare triple {116495#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,300 INFO L290 TraceCheckUtils]: 69: Hoare triple {116495#true} assume 4400 == #t~mem58;havoc #t~mem58; {116495#true} is VALID [2022-04-28 08:45:44,300 INFO L290 TraceCheckUtils]: 70: Hoare triple {116495#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,300 INFO L290 TraceCheckUtils]: 71: Hoare triple {116495#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {116495#true} is VALID [2022-04-28 08:45:44,300 INFO L290 TraceCheckUtils]: 72: Hoare triple {116495#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {116495#true} is VALID [2022-04-28 08:45:44,300 INFO L290 TraceCheckUtils]: 73: Hoare triple {116495#true} assume !(~ret~0 <= 0); {116495#true} is VALID [2022-04-28 08:45:44,301 INFO L290 TraceCheckUtils]: 74: Hoare triple {116495#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,301 INFO L290 TraceCheckUtils]: 75: Hoare triple {116495#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,301 INFO L290 TraceCheckUtils]: 76: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-28 08:45:44,301 INFO L290 TraceCheckUtils]: 77: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-28 08:45:44,301 INFO L290 TraceCheckUtils]: 78: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-28 08:45:44,301 INFO L290 TraceCheckUtils]: 79: Hoare triple {116495#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,301 INFO L290 TraceCheckUtils]: 80: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,301 INFO L290 TraceCheckUtils]: 81: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,301 INFO L290 TraceCheckUtils]: 82: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,301 INFO L290 TraceCheckUtils]: 83: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,301 INFO L290 TraceCheckUtils]: 84: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,301 INFO L290 TraceCheckUtils]: 85: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,302 INFO L290 TraceCheckUtils]: 86: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116500#(= |ssl3_connect_#t~mem56| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:45:44,302 INFO L290 TraceCheckUtils]: 87: Hoare triple {116500#(= |ssl3_connect_#t~mem56| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:45:44,303 INFO L290 TraceCheckUtils]: 88: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:45:44,303 INFO L290 TraceCheckUtils]: 89: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:45:44,304 INFO L290 TraceCheckUtils]: 90: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {116502#(not (= |ssl3_connect_#t~mem60| 4384))} is VALID [2022-04-28 08:45:44,304 INFO L290 TraceCheckUtils]: 91: Hoare triple {116502#(not (= |ssl3_connect_#t~mem60| 4384))} assume 4416 == #t~mem60;havoc #t~mem60; {116495#true} is VALID [2022-04-28 08:45:44,304 INFO L290 TraceCheckUtils]: 92: Hoare triple {116495#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {116495#true} is VALID [2022-04-28 08:45:44,304 INFO L290 TraceCheckUtils]: 93: Hoare triple {116495#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {116495#true} is VALID [2022-04-28 08:45:44,304 INFO L290 TraceCheckUtils]: 94: Hoare triple {116495#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,304 INFO L290 TraceCheckUtils]: 95: Hoare triple {116495#true} assume !(0 == ~tmp___6~0); {116495#true} is VALID [2022-04-28 08:45:44,304 INFO L290 TraceCheckUtils]: 96: Hoare triple {116495#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,304 INFO L290 TraceCheckUtils]: 97: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-28 08:45:44,304 INFO L290 TraceCheckUtils]: 98: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-28 08:45:44,304 INFO L290 TraceCheckUtils]: 99: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-28 08:45:44,304 INFO L290 TraceCheckUtils]: 100: Hoare triple {116495#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,305 INFO L290 TraceCheckUtils]: 101: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,305 INFO L290 TraceCheckUtils]: 102: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,305 INFO L290 TraceCheckUtils]: 103: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,305 INFO L290 TraceCheckUtils]: 104: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,305 INFO L290 TraceCheckUtils]: 105: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,305 INFO L290 TraceCheckUtils]: 106: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,305 INFO L290 TraceCheckUtils]: 107: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,305 INFO L290 TraceCheckUtils]: 108: Hoare triple {116495#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,305 INFO L290 TraceCheckUtils]: 109: Hoare triple {116495#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,305 INFO L290 TraceCheckUtils]: 110: Hoare triple {116495#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,305 INFO L290 TraceCheckUtils]: 111: Hoare triple {116495#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,305 INFO L290 TraceCheckUtils]: 112: Hoare triple {116495#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,305 INFO L290 TraceCheckUtils]: 113: Hoare triple {116495#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,306 INFO L290 TraceCheckUtils]: 114: Hoare triple {116495#true} assume 4432 == #t~mem62;havoc #t~mem62; {116495#true} is VALID [2022-04-28 08:45:44,306 INFO L290 TraceCheckUtils]: 115: Hoare triple {116495#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {116495#true} is VALID [2022-04-28 08:45:44,306 INFO L290 TraceCheckUtils]: 116: Hoare triple {116495#true} assume !(5 == ~blastFlag~0); {116495#true} is VALID [2022-04-28 08:45:44,306 INFO L290 TraceCheckUtils]: 117: Hoare triple {116495#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,306 INFO L290 TraceCheckUtils]: 118: Hoare triple {116495#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,306 INFO L290 TraceCheckUtils]: 119: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-28 08:45:44,306 INFO L290 TraceCheckUtils]: 120: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-28 08:45:44,306 INFO L290 TraceCheckUtils]: 121: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-28 08:45:44,306 INFO L290 TraceCheckUtils]: 122: Hoare triple {116495#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,306 INFO L290 TraceCheckUtils]: 123: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,306 INFO L290 TraceCheckUtils]: 124: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,306 INFO L290 TraceCheckUtils]: 125: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,306 INFO L290 TraceCheckUtils]: 126: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,307 INFO L290 TraceCheckUtils]: 127: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,307 INFO L290 TraceCheckUtils]: 128: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,307 INFO L290 TraceCheckUtils]: 129: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,307 INFO L290 TraceCheckUtils]: 130: Hoare triple {116495#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,307 INFO L290 TraceCheckUtils]: 131: Hoare triple {116495#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,307 INFO L290 TraceCheckUtils]: 132: Hoare triple {116495#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,307 INFO L290 TraceCheckUtils]: 133: Hoare triple {116495#true} assume 4401 == #t~mem59;havoc #t~mem59; {116495#true} is VALID [2022-04-28 08:45:44,307 INFO L290 TraceCheckUtils]: 134: Hoare triple {116495#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,307 INFO L290 TraceCheckUtils]: 135: Hoare triple {116495#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {116495#true} is VALID [2022-04-28 08:45:44,307 INFO L290 TraceCheckUtils]: 136: Hoare triple {116495#true} assume !(2 == ~blastFlag~0); {116495#true} is VALID [2022-04-28 08:45:44,307 INFO L290 TraceCheckUtils]: 137: Hoare triple {116495#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {116495#true} is VALID [2022-04-28 08:45:44,307 INFO L290 TraceCheckUtils]: 138: Hoare triple {116495#true} assume !(~ret~0 <= 0); {116495#true} is VALID [2022-04-28 08:45:44,308 INFO L290 TraceCheckUtils]: 139: Hoare triple {116495#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:45:44,309 INFO L290 TraceCheckUtils]: 140: Hoare triple {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:45:44,309 INFO L290 TraceCheckUtils]: 141: Hoare triple {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:45:44,310 INFO L290 TraceCheckUtils]: 142: Hoare triple {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:45:44,310 INFO L290 TraceCheckUtils]: 143: Hoare triple {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:45:44,311 INFO L290 TraceCheckUtils]: 144: Hoare triple {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:45:44,311 INFO L290 TraceCheckUtils]: 145: Hoare triple {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:45:44,311 INFO L290 TraceCheckUtils]: 146: Hoare triple {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:45:44,312 INFO L290 TraceCheckUtils]: 147: Hoare triple {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:45:44,312 INFO L290 TraceCheckUtils]: 148: Hoare triple {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:45:44,313 INFO L290 TraceCheckUtils]: 149: Hoare triple {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:45:44,313 INFO L290 TraceCheckUtils]: 150: Hoare triple {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:45:44,314 INFO L290 TraceCheckUtils]: 151: Hoare triple {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116963#(= |ssl3_connect_#t~mem56| 4416)} is VALID [2022-04-28 08:45:44,314 INFO L290 TraceCheckUtils]: 152: Hoare triple {116963#(= |ssl3_connect_#t~mem56| 4416)} assume 4384 == #t~mem56;havoc #t~mem56; {116496#false} is VALID [2022-04-28 08:45:44,314 INFO L290 TraceCheckUtils]: 153: Hoare triple {116496#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {116496#false} is VALID [2022-04-28 08:45:44,314 INFO L290 TraceCheckUtils]: 154: Hoare triple {116496#false} assume !(1 == ~blastFlag~0); {116496#false} is VALID [2022-04-28 08:45:44,314 INFO L290 TraceCheckUtils]: 155: Hoare triple {116496#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,314 INFO L290 TraceCheckUtils]: 156: Hoare triple {116496#false} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,314 INFO L290 TraceCheckUtils]: 157: Hoare triple {116496#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,314 INFO L290 TraceCheckUtils]: 158: Hoare triple {116496#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,314 INFO L290 TraceCheckUtils]: 159: Hoare triple {116496#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116496#false} is VALID [2022-04-28 08:45:44,315 INFO L290 TraceCheckUtils]: 160: Hoare triple {116496#false} ~skip~0 := 0; {116496#false} is VALID [2022-04-28 08:45:44,315 INFO L290 TraceCheckUtils]: 161: Hoare triple {116496#false} assume !false; {116496#false} is VALID [2022-04-28 08:45:44,315 INFO L290 TraceCheckUtils]: 162: Hoare triple {116496#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,315 INFO L290 TraceCheckUtils]: 163: Hoare triple {116496#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,315 INFO L290 TraceCheckUtils]: 164: Hoare triple {116496#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,315 INFO L290 TraceCheckUtils]: 165: Hoare triple {116496#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,315 INFO L290 TraceCheckUtils]: 166: Hoare triple {116496#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,315 INFO L290 TraceCheckUtils]: 167: Hoare triple {116496#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,315 INFO L290 TraceCheckUtils]: 168: Hoare triple {116496#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,315 INFO L290 TraceCheckUtils]: 169: Hoare triple {116496#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,315 INFO L290 TraceCheckUtils]: 170: Hoare triple {116496#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,315 INFO L290 TraceCheckUtils]: 171: Hoare triple {116496#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,315 INFO L290 TraceCheckUtils]: 172: Hoare triple {116496#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,316 INFO L290 TraceCheckUtils]: 173: Hoare triple {116496#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,316 INFO L290 TraceCheckUtils]: 174: Hoare triple {116496#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,316 INFO L290 TraceCheckUtils]: 175: Hoare triple {116496#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,316 INFO L290 TraceCheckUtils]: 176: Hoare triple {116496#false} assume 4432 == #t~mem62;havoc #t~mem62; {116496#false} is VALID [2022-04-28 08:45:44,316 INFO L290 TraceCheckUtils]: 177: Hoare triple {116496#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {116496#false} is VALID [2022-04-28 08:45:44,316 INFO L290 TraceCheckUtils]: 178: Hoare triple {116496#false} assume 5 == ~blastFlag~0; {116496#false} is VALID [2022-04-28 08:45:44,316 INFO L290 TraceCheckUtils]: 179: Hoare triple {116496#false} assume !false; {116496#false} is VALID [2022-04-28 08:45:44,317 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 189 proven. 70 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2022-04-28 08:45:44,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 08:45:44,677 INFO L290 TraceCheckUtils]: 179: Hoare triple {116496#false} assume !false; {116496#false} is VALID [2022-04-28 08:45:44,677 INFO L290 TraceCheckUtils]: 178: Hoare triple {116496#false} assume 5 == ~blastFlag~0; {116496#false} is VALID [2022-04-28 08:45:44,677 INFO L290 TraceCheckUtils]: 177: Hoare triple {116496#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {116496#false} is VALID [2022-04-28 08:45:44,677 INFO L290 TraceCheckUtils]: 176: Hoare triple {116496#false} assume 4432 == #t~mem62;havoc #t~mem62; {116496#false} is VALID [2022-04-28 08:45:44,677 INFO L290 TraceCheckUtils]: 175: Hoare triple {116496#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,677 INFO L290 TraceCheckUtils]: 174: Hoare triple {116496#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,677 INFO L290 TraceCheckUtils]: 173: Hoare triple {116496#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,677 INFO L290 TraceCheckUtils]: 172: Hoare triple {116496#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,677 INFO L290 TraceCheckUtils]: 171: Hoare triple {116496#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,677 INFO L290 TraceCheckUtils]: 170: Hoare triple {116496#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,678 INFO L290 TraceCheckUtils]: 169: Hoare triple {116496#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,678 INFO L290 TraceCheckUtils]: 168: Hoare triple {116496#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,678 INFO L290 TraceCheckUtils]: 167: Hoare triple {116496#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,678 INFO L290 TraceCheckUtils]: 166: Hoare triple {116496#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,678 INFO L290 TraceCheckUtils]: 165: Hoare triple {116496#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,678 INFO L290 TraceCheckUtils]: 164: Hoare triple {116496#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,678 INFO L290 TraceCheckUtils]: 163: Hoare triple {116496#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,678 INFO L290 TraceCheckUtils]: 162: Hoare triple {116496#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,678 INFO L290 TraceCheckUtils]: 161: Hoare triple {116496#false} assume !false; {116496#false} is VALID [2022-04-28 08:45:44,678 INFO L290 TraceCheckUtils]: 160: Hoare triple {116496#false} ~skip~0 := 0; {116496#false} is VALID [2022-04-28 08:45:44,678 INFO L290 TraceCheckUtils]: 159: Hoare triple {116496#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116496#false} is VALID [2022-04-28 08:45:44,678 INFO L290 TraceCheckUtils]: 158: Hoare triple {116496#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,678 INFO L290 TraceCheckUtils]: 157: Hoare triple {116496#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,679 INFO L290 TraceCheckUtils]: 156: Hoare triple {116496#false} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,679 INFO L290 TraceCheckUtils]: 155: Hoare triple {116496#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {116496#false} is VALID [2022-04-28 08:45:44,679 INFO L290 TraceCheckUtils]: 154: Hoare triple {116496#false} assume !(1 == ~blastFlag~0); {116496#false} is VALID [2022-04-28 08:45:44,679 INFO L290 TraceCheckUtils]: 153: Hoare triple {116496#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {116496#false} is VALID [2022-04-28 08:45:44,679 INFO L290 TraceCheckUtils]: 152: Hoare triple {116503#(not (= |ssl3_connect_#t~mem56| 4384))} assume 4384 == #t~mem56;havoc #t~mem56; {116496#false} is VALID [2022-04-28 08:45:44,680 INFO L290 TraceCheckUtils]: 151: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116503#(not (= |ssl3_connect_#t~mem56| 4384))} is VALID [2022-04-28 08:45:44,680 INFO L290 TraceCheckUtils]: 150: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:45:44,680 INFO L290 TraceCheckUtils]: 149: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:45:44,681 INFO L290 TraceCheckUtils]: 148: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:45:44,681 INFO L290 TraceCheckUtils]: 147: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:45:44,682 INFO L290 TraceCheckUtils]: 146: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:45:44,682 INFO L290 TraceCheckUtils]: 145: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:45:44,682 INFO L290 TraceCheckUtils]: 144: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:45:44,683 INFO L290 TraceCheckUtils]: 143: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:45:44,683 INFO L290 TraceCheckUtils]: 142: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:45:44,684 INFO L290 TraceCheckUtils]: 141: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:45:44,684 INFO L290 TraceCheckUtils]: 140: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:45:44,685 INFO L290 TraceCheckUtils]: 139: Hoare triple {116495#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:45:44,685 INFO L290 TraceCheckUtils]: 138: Hoare triple {116495#true} assume !(~ret~0 <= 0); {116495#true} is VALID [2022-04-28 08:45:44,685 INFO L290 TraceCheckUtils]: 137: Hoare triple {116495#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {116495#true} is VALID [2022-04-28 08:45:44,685 INFO L290 TraceCheckUtils]: 136: Hoare triple {116495#true} assume !(2 == ~blastFlag~0); {116495#true} is VALID [2022-04-28 08:45:44,685 INFO L290 TraceCheckUtils]: 135: Hoare triple {116495#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {116495#true} is VALID [2022-04-28 08:45:44,685 INFO L290 TraceCheckUtils]: 134: Hoare triple {116495#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,685 INFO L290 TraceCheckUtils]: 133: Hoare triple {116495#true} assume 4401 == #t~mem59;havoc #t~mem59; {116495#true} is VALID [2022-04-28 08:45:44,686 INFO L290 TraceCheckUtils]: 132: Hoare triple {116495#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,686 INFO L290 TraceCheckUtils]: 131: Hoare triple {116495#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,686 INFO L290 TraceCheckUtils]: 130: Hoare triple {116495#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,686 INFO L290 TraceCheckUtils]: 129: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,686 INFO L290 TraceCheckUtils]: 128: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,686 INFO L290 TraceCheckUtils]: 127: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,686 INFO L290 TraceCheckUtils]: 126: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,686 INFO L290 TraceCheckUtils]: 125: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,686 INFO L290 TraceCheckUtils]: 124: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,686 INFO L290 TraceCheckUtils]: 123: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,686 INFO L290 TraceCheckUtils]: 122: Hoare triple {116495#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,686 INFO L290 TraceCheckUtils]: 121: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-28 08:45:44,686 INFO L290 TraceCheckUtils]: 120: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-28 08:45:44,686 INFO L290 TraceCheckUtils]: 119: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-28 08:45:44,687 INFO L290 TraceCheckUtils]: 118: Hoare triple {116495#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,687 INFO L290 TraceCheckUtils]: 117: Hoare triple {116495#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,687 INFO L290 TraceCheckUtils]: 116: Hoare triple {116495#true} assume !(5 == ~blastFlag~0); {116495#true} is VALID [2022-04-28 08:45:44,687 INFO L290 TraceCheckUtils]: 115: Hoare triple {116495#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {116495#true} is VALID [2022-04-28 08:45:44,687 INFO L290 TraceCheckUtils]: 114: Hoare triple {116495#true} assume 4432 == #t~mem62;havoc #t~mem62; {116495#true} is VALID [2022-04-28 08:45:44,687 INFO L290 TraceCheckUtils]: 113: Hoare triple {116495#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,687 INFO L290 TraceCheckUtils]: 112: Hoare triple {116495#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,687 INFO L290 TraceCheckUtils]: 111: Hoare triple {116495#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,687 INFO L290 TraceCheckUtils]: 110: Hoare triple {116495#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,687 INFO L290 TraceCheckUtils]: 109: Hoare triple {116495#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,687 INFO L290 TraceCheckUtils]: 108: Hoare triple {116495#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,687 INFO L290 TraceCheckUtils]: 107: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,687 INFO L290 TraceCheckUtils]: 106: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,688 INFO L290 TraceCheckUtils]: 105: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,688 INFO L290 TraceCheckUtils]: 104: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,688 INFO L290 TraceCheckUtils]: 103: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,688 INFO L290 TraceCheckUtils]: 102: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,688 INFO L290 TraceCheckUtils]: 101: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,688 INFO L290 TraceCheckUtils]: 100: Hoare triple {116495#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,688 INFO L290 TraceCheckUtils]: 99: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-28 08:45:44,688 INFO L290 TraceCheckUtils]: 98: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-28 08:45:44,688 INFO L290 TraceCheckUtils]: 97: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-28 08:45:44,688 INFO L290 TraceCheckUtils]: 96: Hoare triple {116495#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,688 INFO L290 TraceCheckUtils]: 95: Hoare triple {116495#true} assume !(0 == ~tmp___6~0); {116495#true} is VALID [2022-04-28 08:45:44,688 INFO L290 TraceCheckUtils]: 94: Hoare triple {116495#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,688 INFO L290 TraceCheckUtils]: 93: Hoare triple {116495#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {116495#true} is VALID [2022-04-28 08:45:44,689 INFO L290 TraceCheckUtils]: 92: Hoare triple {116495#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {116495#true} is VALID [2022-04-28 08:45:44,689 INFO L290 TraceCheckUtils]: 91: Hoare triple {116495#true} assume 4416 == #t~mem60;havoc #t~mem60; {116495#true} is VALID [2022-04-28 08:45:44,689 INFO L290 TraceCheckUtils]: 90: Hoare triple {116495#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,689 INFO L290 TraceCheckUtils]: 89: Hoare triple {116495#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,689 INFO L290 TraceCheckUtils]: 88: Hoare triple {116495#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,689 INFO L290 TraceCheckUtils]: 87: Hoare triple {116495#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,689 INFO L290 TraceCheckUtils]: 86: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,689 INFO L290 TraceCheckUtils]: 85: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,689 INFO L290 TraceCheckUtils]: 84: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,689 INFO L290 TraceCheckUtils]: 83: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,689 INFO L290 TraceCheckUtils]: 82: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,689 INFO L290 TraceCheckUtils]: 81: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,690 INFO L290 TraceCheckUtils]: 80: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,690 INFO L290 TraceCheckUtils]: 79: Hoare triple {116495#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,690 INFO L290 TraceCheckUtils]: 78: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-28 08:45:44,690 INFO L290 TraceCheckUtils]: 77: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-28 08:45:44,690 INFO L290 TraceCheckUtils]: 76: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-28 08:45:44,690 INFO L290 TraceCheckUtils]: 75: Hoare triple {116495#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,690 INFO L290 TraceCheckUtils]: 74: Hoare triple {116495#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,690 INFO L290 TraceCheckUtils]: 73: Hoare triple {116495#true} assume !(~ret~0 <= 0); {116495#true} is VALID [2022-04-28 08:45:44,690 INFO L290 TraceCheckUtils]: 72: Hoare triple {116495#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {116495#true} is VALID [2022-04-28 08:45:44,690 INFO L290 TraceCheckUtils]: 71: Hoare triple {116495#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {116495#true} is VALID [2022-04-28 08:45:44,690 INFO L290 TraceCheckUtils]: 70: Hoare triple {116495#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,690 INFO L290 TraceCheckUtils]: 69: Hoare triple {116495#true} assume 4400 == #t~mem58;havoc #t~mem58; {116495#true} is VALID [2022-04-28 08:45:44,690 INFO L290 TraceCheckUtils]: 68: Hoare triple {116495#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,691 INFO L290 TraceCheckUtils]: 67: Hoare triple {116495#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,691 INFO L290 TraceCheckUtils]: 66: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,691 INFO L290 TraceCheckUtils]: 65: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,691 INFO L290 TraceCheckUtils]: 64: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,691 INFO L290 TraceCheckUtils]: 63: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,691 INFO L290 TraceCheckUtils]: 62: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,691 INFO L290 TraceCheckUtils]: 61: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,691 INFO L290 TraceCheckUtils]: 60: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,691 INFO L290 TraceCheckUtils]: 59: Hoare triple {116495#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,691 INFO L290 TraceCheckUtils]: 58: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-28 08:45:44,691 INFO L290 TraceCheckUtils]: 57: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-28 08:45:44,691 INFO L290 TraceCheckUtils]: 56: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-28 08:45:44,692 INFO L290 TraceCheckUtils]: 55: Hoare triple {116495#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,692 INFO L290 TraceCheckUtils]: 54: Hoare triple {116495#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,692 INFO L290 TraceCheckUtils]: 53: Hoare triple {116495#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,692 INFO L290 TraceCheckUtils]: 52: Hoare triple {116495#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,692 INFO L290 TraceCheckUtils]: 51: Hoare triple {116495#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {116495#true} is VALID [2022-04-28 08:45:44,692 INFO L290 TraceCheckUtils]: 50: Hoare triple {116495#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {116495#true} is VALID [2022-04-28 08:45:44,692 INFO L290 TraceCheckUtils]: 49: Hoare triple {116495#true} assume 4384 == #t~mem56;havoc #t~mem56; {116495#true} is VALID [2022-04-28 08:45:44,692 INFO L290 TraceCheckUtils]: 48: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,692 INFO L290 TraceCheckUtils]: 47: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,692 INFO L290 TraceCheckUtils]: 46: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,692 INFO L290 TraceCheckUtils]: 45: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,692 INFO L290 TraceCheckUtils]: 44: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,693 INFO L290 TraceCheckUtils]: 43: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,693 INFO L290 TraceCheckUtils]: 42: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,693 INFO L290 TraceCheckUtils]: 41: Hoare triple {116495#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,693 INFO L290 TraceCheckUtils]: 40: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-28 08:45:44,693 INFO L290 TraceCheckUtils]: 39: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-28 08:45:44,693 INFO L290 TraceCheckUtils]: 38: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-28 08:45:44,693 INFO L290 TraceCheckUtils]: 37: Hoare triple {116495#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,693 INFO L290 TraceCheckUtils]: 36: Hoare triple {116495#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {116495#true} is VALID [2022-04-28 08:45:44,693 INFO L290 TraceCheckUtils]: 35: Hoare triple {116495#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,693 INFO L290 TraceCheckUtils]: 34: Hoare triple {116495#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {116495#true} is VALID [2022-04-28 08:45:44,693 INFO L290 TraceCheckUtils]: 33: Hoare triple {116495#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {116495#true} is VALID [2022-04-28 08:45:44,693 INFO L290 TraceCheckUtils]: 32: Hoare triple {116495#true} assume 4368 == #t~mem54;havoc #t~mem54; {116495#true} is VALID [2022-04-28 08:45:44,694 INFO L290 TraceCheckUtils]: 31: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,694 INFO L290 TraceCheckUtils]: 30: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,694 INFO L290 TraceCheckUtils]: 29: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,694 INFO L290 TraceCheckUtils]: 28: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,694 INFO L290 TraceCheckUtils]: 27: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {116495#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-28 08:45:44,694 INFO L290 TraceCheckUtils]: 24: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-28 08:45:44,694 INFO L290 TraceCheckUtils]: 23: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-28 08:45:44,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {116495#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {116495#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {116495#true} assume !(0 == ~tmp___4~0); {116495#true} is VALID [2022-04-28 08:45:44,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {116495#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {116495#true} is VALID [2022-04-28 08:45:44,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {116495#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {116495#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {116495#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {116495#true} is VALID [2022-04-28 08:45:44,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {116495#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {116495#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {116495#true} is VALID [2022-04-28 08:45:44,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {116495#true} assume 12292 == #t~mem49;havoc #t~mem49; {116495#true} is VALID [2022-04-28 08:45:44,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {116495#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-28 08:45:44,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {116495#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {116495#true} is VALID [2022-04-28 08:45:44,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {116495#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {116495#true} is VALID [2022-04-28 08:45:44,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {116495#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {116495#true} is VALID [2022-04-28 08:45:44,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {116495#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {116495#true} is VALID [2022-04-28 08:45:44,695 INFO L272 TraceCheckUtils]: 6: Hoare triple {116495#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {116495#true} is VALID [2022-04-28 08:45:44,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {116495#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {116495#true} is VALID [2022-04-28 08:45:44,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {116495#true} call #t~ret158 := main(); {116495#true} is VALID [2022-04-28 08:45:44,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116495#true} {116495#true} #593#return; {116495#true} is VALID [2022-04-28 08:45:44,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {116495#true} assume true; {116495#true} is VALID [2022-04-28 08:45:44,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {116495#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {116495#true} is VALID [2022-04-28 08:45:44,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {116495#true} call ULTIMATE.init(); {116495#true} is VALID [2022-04-28 08:45:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-28 08:45:44,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997332279] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 08:45:44,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 08:45:44,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 8] total 10 [2022-04-28 08:45:44,697 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:45:44,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1758446703] [2022-04-28 08:45:44,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1758446703] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:45:44,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:45:44,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:45:44,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33516815] [2022-04-28 08:45:44,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:45:44,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 180 [2022-04-28 08:45:44,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:45:44,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:44,779 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-28 08:45:44,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:45:44,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:45:44,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:45:44,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-28 08:45:44,780 INFO L87 Difference]: Start difference. First operand 1146 states and 1663 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:48,826 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:45:52,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:45:52,399 INFO L93 Difference]: Finished difference Result 2625 states and 3805 transitions. [2022-04-28 08:45:52,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:45:52,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 180 [2022-04-28 08:45:52,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:45:52,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:52,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2022-04-28 08:45:52,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:52,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2022-04-28 08:45:52,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 471 transitions. [2022-04-28 08:45:52,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:45:52,837 INFO L225 Difference]: With dead ends: 2625 [2022-04-28 08:45:52,837 INFO L226 Difference]: Without dead ends: 1495 [2022-04-28 08:45:52,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-28 08:45:52,839 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 108 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:45:52,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 288 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 08:45:52,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2022-04-28 08:45:53,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1146. [2022-04-28 08:45:53,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:45:53,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1495 states. Second operand has 1146 states, 1141 states have (on average 1.4364592462751973) internal successors, (1639), 1141 states have internal predecessors, (1639), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:53,285 INFO L74 IsIncluded]: Start isIncluded. First operand 1495 states. Second operand has 1146 states, 1141 states have (on average 1.4364592462751973) internal successors, (1639), 1141 states have internal predecessors, (1639), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:53,286 INFO L87 Difference]: Start difference. First operand 1495 states. Second operand has 1146 states, 1141 states have (on average 1.4364592462751973) internal successors, (1639), 1141 states have internal predecessors, (1639), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:53,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:45:53,360 INFO L93 Difference]: Finished difference Result 1495 states and 2142 transitions. [2022-04-28 08:45:53,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 2142 transitions. [2022-04-28 08:45:53,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:45:53,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:45:53,363 INFO L74 IsIncluded]: Start isIncluded. First operand has 1146 states, 1141 states have (on average 1.4364592462751973) internal successors, (1639), 1141 states have internal predecessors, (1639), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1495 states. [2022-04-28 08:45:53,363 INFO L87 Difference]: Start difference. First operand has 1146 states, 1141 states have (on average 1.4364592462751973) internal successors, (1639), 1141 states have internal predecessors, (1639), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1495 states. [2022-04-28 08:45:53,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:45:53,417 INFO L93 Difference]: Finished difference Result 1495 states and 2142 transitions. [2022-04-28 08:45:53,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 2142 transitions. [2022-04-28 08:45:53,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:45:53,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:45:53,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:45:53,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:45:53,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1141 states have (on average 1.4364592462751973) internal successors, (1639), 1141 states have internal predecessors, (1639), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:53,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1643 transitions. [2022-04-28 08:45:53,482 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1643 transitions. Word has length 180 [2022-04-28 08:45:53,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:45:53,482 INFO L495 AbstractCegarLoop]: Abstraction has 1146 states and 1643 transitions. [2022-04-28 08:45:53,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:53,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1146 states and 1643 transitions. [2022-04-28 08:45:55,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1643 edges. 1643 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:45:55,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1643 transitions. [2022-04-28 08:45:55,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-04-28 08:45:55,214 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:45:55,214 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:45:55,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 08:45:55,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:45:55,415 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:45:55,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:45:55,416 INFO L85 PathProgramCache]: Analyzing trace with hash -684613610, now seen corresponding path program 1 times [2022-04-28 08:45:55,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:45:55,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1997633308] [2022-04-28 08:46:12,044 WARN L232 SmtUtils]: Spent 11.73s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:46:20,314 WARN L232 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 153 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:46:22,321 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:46:22,321 INFO L85 PathProgramCache]: Analyzing trace with hash -684613610, now seen corresponding path program 2 times [2022-04-28 08:46:22,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:46:22,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428352357] [2022-04-28 08:46:22,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:46:22,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:46:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:46:22,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:46:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:46:22,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {128130#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {128121#true} is VALID [2022-04-28 08:46:22,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {128121#true} assume true; {128121#true} is VALID [2022-04-28 08:46:22,549 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {128121#true} {128121#true} #593#return; {128121#true} is VALID [2022-04-28 08:46:22,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {128121#true} call ULTIMATE.init(); {128130#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:46:22,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {128130#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {128121#true} is VALID [2022-04-28 08:46:22,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {128121#true} assume true; {128121#true} is VALID [2022-04-28 08:46:22,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128121#true} {128121#true} #593#return; {128121#true} is VALID [2022-04-28 08:46:22,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {128121#true} call #t~ret158 := main(); {128121#true} is VALID [2022-04-28 08:46:22,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {128121#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {128121#true} is VALID [2022-04-28 08:46:22,550 INFO L272 TraceCheckUtils]: 6: Hoare triple {128121#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {128121#true} is VALID [2022-04-28 08:46:22,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {128121#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {128121#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {128121#true} is VALID [2022-04-28 08:46:22,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {128121#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {128121#true} is VALID [2022-04-28 08:46:22,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {128121#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {128121#true} is VALID [2022-04-28 08:46:22,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-28 08:46:22,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {128121#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {128121#true} assume 12292 == #t~mem49;havoc #t~mem49; {128121#true} is VALID [2022-04-28 08:46:22,551 INFO L290 TraceCheckUtils]: 14: Hoare triple {128121#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {128121#true} is VALID [2022-04-28 08:46:22,551 INFO L290 TraceCheckUtils]: 15: Hoare triple {128121#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,551 INFO L290 TraceCheckUtils]: 16: Hoare triple {128121#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {128121#true} is VALID [2022-04-28 08:46:22,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {128121#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {128121#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {128121#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {128121#true} is VALID [2022-04-28 08:46:22,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {128121#true} assume !(0 == ~tmp___4~0); {128121#true} is VALID [2022-04-28 08:46:22,552 INFO L290 TraceCheckUtils]: 21: Hoare triple {128121#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {128121#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-28 08:46:22,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-28 08:46:22,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-28 08:46:22,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {128121#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,552 INFO L290 TraceCheckUtils]: 27: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,552 INFO L290 TraceCheckUtils]: 28: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,552 INFO L290 TraceCheckUtils]: 31: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,552 INFO L290 TraceCheckUtils]: 32: Hoare triple {128121#true} assume 4368 == #t~mem54;havoc #t~mem54; {128121#true} is VALID [2022-04-28 08:46:22,552 INFO L290 TraceCheckUtils]: 33: Hoare triple {128121#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {128121#true} is VALID [2022-04-28 08:46:22,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {128121#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {128121#true} is VALID [2022-04-28 08:46:22,553 INFO L290 TraceCheckUtils]: 35: Hoare triple {128121#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,553 INFO L290 TraceCheckUtils]: 36: Hoare triple {128121#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {128121#true} is VALID [2022-04-28 08:46:22,553 INFO L290 TraceCheckUtils]: 37: Hoare triple {128121#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,553 INFO L290 TraceCheckUtils]: 38: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-28 08:46:22,553 INFO L290 TraceCheckUtils]: 39: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-28 08:46:22,553 INFO L290 TraceCheckUtils]: 40: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-28 08:46:22,553 INFO L290 TraceCheckUtils]: 41: Hoare triple {128121#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,553 INFO L290 TraceCheckUtils]: 42: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,553 INFO L290 TraceCheckUtils]: 43: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,553 INFO L290 TraceCheckUtils]: 44: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,553 INFO L290 TraceCheckUtils]: 45: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,553 INFO L290 TraceCheckUtils]: 46: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,554 INFO L290 TraceCheckUtils]: 47: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,554 INFO L290 TraceCheckUtils]: 48: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,554 INFO L290 TraceCheckUtils]: 49: Hoare triple {128121#true} assume 4384 == #t~mem56;havoc #t~mem56; {128121#true} is VALID [2022-04-28 08:46:22,554 INFO L290 TraceCheckUtils]: 50: Hoare triple {128121#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {128121#true} is VALID [2022-04-28 08:46:22,554 INFO L290 TraceCheckUtils]: 51: Hoare triple {128121#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {128121#true} is VALID [2022-04-28 08:46:22,554 INFO L290 TraceCheckUtils]: 52: Hoare triple {128121#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,554 INFO L290 TraceCheckUtils]: 53: Hoare triple {128121#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,554 INFO L290 TraceCheckUtils]: 54: Hoare triple {128121#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,554 INFO L290 TraceCheckUtils]: 55: Hoare triple {128121#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,554 INFO L290 TraceCheckUtils]: 56: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-28 08:46:22,554 INFO L290 TraceCheckUtils]: 57: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-28 08:46:22,554 INFO L290 TraceCheckUtils]: 58: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-28 08:46:22,555 INFO L290 TraceCheckUtils]: 59: Hoare triple {128121#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,555 INFO L290 TraceCheckUtils]: 60: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,555 INFO L290 TraceCheckUtils]: 61: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,555 INFO L290 TraceCheckUtils]: 62: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,555 INFO L290 TraceCheckUtils]: 63: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,555 INFO L290 TraceCheckUtils]: 64: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,555 INFO L290 TraceCheckUtils]: 65: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,555 INFO L290 TraceCheckUtils]: 66: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,555 INFO L290 TraceCheckUtils]: 67: Hoare triple {128121#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,555 INFO L290 TraceCheckUtils]: 68: Hoare triple {128121#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,555 INFO L290 TraceCheckUtils]: 69: Hoare triple {128121#true} assume 4400 == #t~mem58;havoc #t~mem58; {128121#true} is VALID [2022-04-28 08:46:22,555 INFO L290 TraceCheckUtils]: 70: Hoare triple {128121#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,555 INFO L290 TraceCheckUtils]: 71: Hoare triple {128121#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {128121#true} is VALID [2022-04-28 08:46:22,556 INFO L290 TraceCheckUtils]: 72: Hoare triple {128121#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {128121#true} is VALID [2022-04-28 08:46:22,556 INFO L290 TraceCheckUtils]: 73: Hoare triple {128121#true} assume !(~ret~0 <= 0); {128121#true} is VALID [2022-04-28 08:46:22,556 INFO L290 TraceCheckUtils]: 74: Hoare triple {128121#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,556 INFO L290 TraceCheckUtils]: 75: Hoare triple {128121#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,556 INFO L290 TraceCheckUtils]: 76: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-28 08:46:22,556 INFO L290 TraceCheckUtils]: 77: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-28 08:46:22,556 INFO L290 TraceCheckUtils]: 78: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-28 08:46:22,556 INFO L290 TraceCheckUtils]: 79: Hoare triple {128121#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,556 INFO L290 TraceCheckUtils]: 80: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,556 INFO L290 TraceCheckUtils]: 81: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,556 INFO L290 TraceCheckUtils]: 82: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,556 INFO L290 TraceCheckUtils]: 83: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,556 INFO L290 TraceCheckUtils]: 84: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,557 INFO L290 TraceCheckUtils]: 85: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,557 INFO L290 TraceCheckUtils]: 86: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,557 INFO L290 TraceCheckUtils]: 87: Hoare triple {128121#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128126#(= |ssl3_connect_#t~mem57| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:46:22,557 INFO L290 TraceCheckUtils]: 88: Hoare triple {128126#(= |ssl3_connect_#t~mem57| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:46:22,558 INFO L290 TraceCheckUtils]: 89: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:46:22,558 INFO L290 TraceCheckUtils]: 90: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {128128#(not (= |ssl3_connect_#t~mem60| 4385))} is VALID [2022-04-28 08:46:22,558 INFO L290 TraceCheckUtils]: 91: Hoare triple {128128#(not (= |ssl3_connect_#t~mem60| 4385))} assume 4416 == #t~mem60;havoc #t~mem60; {128121#true} is VALID [2022-04-28 08:46:22,558 INFO L290 TraceCheckUtils]: 92: Hoare triple {128121#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {128121#true} is VALID [2022-04-28 08:46:22,558 INFO L290 TraceCheckUtils]: 93: Hoare triple {128121#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {128121#true} is VALID [2022-04-28 08:46:22,559 INFO L290 TraceCheckUtils]: 94: Hoare triple {128121#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,559 INFO L290 TraceCheckUtils]: 95: Hoare triple {128121#true} assume !(0 == ~tmp___6~0); {128121#true} is VALID [2022-04-28 08:46:22,559 INFO L290 TraceCheckUtils]: 96: Hoare triple {128121#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,559 INFO L290 TraceCheckUtils]: 97: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-28 08:46:22,559 INFO L290 TraceCheckUtils]: 98: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-28 08:46:22,559 INFO L290 TraceCheckUtils]: 99: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-28 08:46:22,559 INFO L290 TraceCheckUtils]: 100: Hoare triple {128121#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,559 INFO L290 TraceCheckUtils]: 101: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,559 INFO L290 TraceCheckUtils]: 102: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,559 INFO L290 TraceCheckUtils]: 103: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,559 INFO L290 TraceCheckUtils]: 104: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,559 INFO L290 TraceCheckUtils]: 105: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,559 INFO L290 TraceCheckUtils]: 106: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,560 INFO L290 TraceCheckUtils]: 107: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,560 INFO L290 TraceCheckUtils]: 108: Hoare triple {128121#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,560 INFO L290 TraceCheckUtils]: 109: Hoare triple {128121#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,560 INFO L290 TraceCheckUtils]: 110: Hoare triple {128121#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,560 INFO L290 TraceCheckUtils]: 111: Hoare triple {128121#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,560 INFO L290 TraceCheckUtils]: 112: Hoare triple {128121#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,560 INFO L290 TraceCheckUtils]: 113: Hoare triple {128121#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,560 INFO L290 TraceCheckUtils]: 114: Hoare triple {128121#true} assume 4432 == #t~mem62;havoc #t~mem62; {128121#true} is VALID [2022-04-28 08:46:22,560 INFO L290 TraceCheckUtils]: 115: Hoare triple {128121#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {128121#true} is VALID [2022-04-28 08:46:22,560 INFO L290 TraceCheckUtils]: 116: Hoare triple {128121#true} assume !(5 == ~blastFlag~0); {128121#true} is VALID [2022-04-28 08:46:22,560 INFO L290 TraceCheckUtils]: 117: Hoare triple {128121#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,560 INFO L290 TraceCheckUtils]: 118: Hoare triple {128121#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,560 INFO L290 TraceCheckUtils]: 119: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-28 08:46:22,561 INFO L290 TraceCheckUtils]: 120: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-28 08:46:22,561 INFO L290 TraceCheckUtils]: 121: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-28 08:46:22,561 INFO L290 TraceCheckUtils]: 122: Hoare triple {128121#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,561 INFO L290 TraceCheckUtils]: 123: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,561 INFO L290 TraceCheckUtils]: 124: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,561 INFO L290 TraceCheckUtils]: 125: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,561 INFO L290 TraceCheckUtils]: 126: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,561 INFO L290 TraceCheckUtils]: 127: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,561 INFO L290 TraceCheckUtils]: 128: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,561 INFO L290 TraceCheckUtils]: 129: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,561 INFO L290 TraceCheckUtils]: 130: Hoare triple {128121#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,561 INFO L290 TraceCheckUtils]: 131: Hoare triple {128121#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,561 INFO L290 TraceCheckUtils]: 132: Hoare triple {128121#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,562 INFO L290 TraceCheckUtils]: 133: Hoare triple {128121#true} assume 4401 == #t~mem59;havoc #t~mem59; {128121#true} is VALID [2022-04-28 08:46:22,562 INFO L290 TraceCheckUtils]: 134: Hoare triple {128121#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {128121#true} is VALID [2022-04-28 08:46:22,562 INFO L290 TraceCheckUtils]: 135: Hoare triple {128121#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {128121#true} is VALID [2022-04-28 08:46:22,562 INFO L290 TraceCheckUtils]: 136: Hoare triple {128121#true} assume !(2 == ~blastFlag~0); {128121#true} is VALID [2022-04-28 08:46:22,562 INFO L290 TraceCheckUtils]: 137: Hoare triple {128121#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {128121#true} is VALID [2022-04-28 08:46:22,562 INFO L290 TraceCheckUtils]: 138: Hoare triple {128121#true} assume !(~ret~0 <= 0); {128121#true} is VALID [2022-04-28 08:46:22,563 INFO L290 TraceCheckUtils]: 139: Hoare triple {128121#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:46:22,563 INFO L290 TraceCheckUtils]: 140: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:46:22,564 INFO L290 TraceCheckUtils]: 141: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:46:22,564 INFO L290 TraceCheckUtils]: 142: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:46:22,564 INFO L290 TraceCheckUtils]: 143: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:46:22,565 INFO L290 TraceCheckUtils]: 144: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:46:22,565 INFO L290 TraceCheckUtils]: 145: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:46:22,565 INFO L290 TraceCheckUtils]: 146: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:46:22,566 INFO L290 TraceCheckUtils]: 147: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:46:22,566 INFO L290 TraceCheckUtils]: 148: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:46:22,566 INFO L290 TraceCheckUtils]: 149: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:46:22,567 INFO L290 TraceCheckUtils]: 150: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:46:22,567 INFO L290 TraceCheckUtils]: 151: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:46:22,567 INFO L290 TraceCheckUtils]: 152: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128129#(not (= |ssl3_connect_#t~mem57| 4385))} is VALID [2022-04-28 08:46:22,568 INFO L290 TraceCheckUtils]: 153: Hoare triple {128129#(not (= |ssl3_connect_#t~mem57| 4385))} assume 4385 == #t~mem57;havoc #t~mem57; {128122#false} is VALID [2022-04-28 08:46:22,568 INFO L290 TraceCheckUtils]: 154: Hoare triple {128122#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {128122#false} is VALID [2022-04-28 08:46:22,568 INFO L290 TraceCheckUtils]: 155: Hoare triple {128122#false} assume !(1 == ~blastFlag~0); {128122#false} is VALID [2022-04-28 08:46:22,568 INFO L290 TraceCheckUtils]: 156: Hoare triple {128122#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:46:22,568 INFO L290 TraceCheckUtils]: 157: Hoare triple {128122#false} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:46:22,568 INFO L290 TraceCheckUtils]: 158: Hoare triple {128122#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:46:22,568 INFO L290 TraceCheckUtils]: 159: Hoare triple {128122#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {128122#false} is VALID [2022-04-28 08:46:22,568 INFO L290 TraceCheckUtils]: 160: Hoare triple {128122#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128122#false} is VALID [2022-04-28 08:46:22,568 INFO L290 TraceCheckUtils]: 161: Hoare triple {128122#false} ~skip~0 := 0; {128122#false} is VALID [2022-04-28 08:46:22,568 INFO L290 TraceCheckUtils]: 162: Hoare triple {128122#false} assume !false; {128122#false} is VALID [2022-04-28 08:46:22,568 INFO L290 TraceCheckUtils]: 163: Hoare triple {128122#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:46:22,569 INFO L290 TraceCheckUtils]: 164: Hoare triple {128122#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:46:22,569 INFO L290 TraceCheckUtils]: 165: Hoare triple {128122#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:46:22,569 INFO L290 TraceCheckUtils]: 166: Hoare triple {128122#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:46:22,569 INFO L290 TraceCheckUtils]: 167: Hoare triple {128122#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:46:22,569 INFO L290 TraceCheckUtils]: 168: Hoare triple {128122#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:46:22,569 INFO L290 TraceCheckUtils]: 169: Hoare triple {128122#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:46:22,569 INFO L290 TraceCheckUtils]: 170: Hoare triple {128122#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:46:22,569 INFO L290 TraceCheckUtils]: 171: Hoare triple {128122#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:46:22,569 INFO L290 TraceCheckUtils]: 172: Hoare triple {128122#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:46:22,569 INFO L290 TraceCheckUtils]: 173: Hoare triple {128122#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:46:22,569 INFO L290 TraceCheckUtils]: 174: Hoare triple {128122#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:46:22,569 INFO L290 TraceCheckUtils]: 175: Hoare triple {128122#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:46:22,569 INFO L290 TraceCheckUtils]: 176: Hoare triple {128122#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:46:22,569 INFO L290 TraceCheckUtils]: 177: Hoare triple {128122#false} assume 4432 == #t~mem62;havoc #t~mem62; {128122#false} is VALID [2022-04-28 08:46:22,569 INFO L290 TraceCheckUtils]: 178: Hoare triple {128122#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {128122#false} is VALID [2022-04-28 08:46:22,569 INFO L290 TraceCheckUtils]: 179: Hoare triple {128122#false} assume 5 == ~blastFlag~0; {128122#false} is VALID [2022-04-28 08:46:22,570 INFO L290 TraceCheckUtils]: 180: Hoare triple {128122#false} assume !false; {128122#false} is VALID [2022-04-28 08:46:22,570 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 199 proven. 8 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2022-04-28 08:46:22,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:46:22,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428352357] [2022-04-28 08:46:22,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428352357] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 08:46:22,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803466872] [2022-04-28 08:46:22,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 08:46:22,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:46:22,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:46:22,573 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 08:46:22,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 08:47:17,819 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 08:47:17,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 08:47:17,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 1550 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 08:47:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:47:17,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 08:47:17,970 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-28 08:47:17,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 143 [2022-04-28 08:47:17,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 63 [2022-04-28 08:47:17,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-28 08:47:17,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-28 08:47:18,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2022-04-28 08:47:18,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-04-28 08:47:18,157 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-28 08:47:18,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-04-28 08:47:18,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-04-28 08:47:18,400 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-28 08:47:18,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-04-28 08:47:18,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-04-28 08:47:18,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {128121#true} call ULTIMATE.init(); {128121#true} is VALID [2022-04-28 08:47:18,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {128121#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {128121#true} is VALID [2022-04-28 08:47:18,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {128121#true} assume true; {128121#true} is VALID [2022-04-28 08:47:18,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128121#true} {128121#true} #593#return; {128121#true} is VALID [2022-04-28 08:47:18,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {128121#true} call #t~ret158 := main(); {128121#true} is VALID [2022-04-28 08:47:18,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {128121#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {128121#true} is VALID [2022-04-28 08:47:18,516 INFO L272 TraceCheckUtils]: 6: Hoare triple {128121#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {128121#true} is VALID [2022-04-28 08:47:18,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {128121#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {128121#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {128121#true} is VALID [2022-04-28 08:47:18,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {128121#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {128121#true} is VALID [2022-04-28 08:47:18,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {128121#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {128121#true} is VALID [2022-04-28 08:47:18,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-28 08:47:18,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {128121#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {128121#true} assume 12292 == #t~mem49;havoc #t~mem49; {128121#true} is VALID [2022-04-28 08:47:18,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {128121#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {128121#true} is VALID [2022-04-28 08:47:18,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {128121#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {128121#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {128121#true} is VALID [2022-04-28 08:47:18,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {128121#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {128121#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {128121#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {128121#true} is VALID [2022-04-28 08:47:18,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {128121#true} assume !(0 == ~tmp___4~0); {128121#true} is VALID [2022-04-28 08:47:18,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {128121#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:18,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:18,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:18,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} ~skip~0 := 0; {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:18,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !false; {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:18,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:18,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:18,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:18,521 INFO L290 TraceCheckUtils]: 29: Hoare triple {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:18,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:18,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {128121#true} assume 4368 == #t~mem54;havoc #t~mem54; {128121#true} is VALID [2022-04-28 08:47:18,522 INFO L290 TraceCheckUtils]: 33: Hoare triple {128121#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {128121#true} is VALID [2022-04-28 08:47:18,522 INFO L290 TraceCheckUtils]: 34: Hoare triple {128121#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {128121#true} is VALID [2022-04-28 08:47:18,522 INFO L290 TraceCheckUtils]: 35: Hoare triple {128121#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,522 INFO L290 TraceCheckUtils]: 36: Hoare triple {128121#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {128121#true} is VALID [2022-04-28 08:47:18,522 INFO L290 TraceCheckUtils]: 37: Hoare triple {128121#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,522 INFO L290 TraceCheckUtils]: 38: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-28 08:47:18,522 INFO L290 TraceCheckUtils]: 39: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-28 08:47:18,522 INFO L290 TraceCheckUtils]: 40: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-28 08:47:18,522 INFO L290 TraceCheckUtils]: 41: Hoare triple {128121#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,522 INFO L290 TraceCheckUtils]: 42: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,522 INFO L290 TraceCheckUtils]: 43: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,522 INFO L290 TraceCheckUtils]: 44: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,522 INFO L290 TraceCheckUtils]: 45: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,523 INFO L290 TraceCheckUtils]: 46: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,523 INFO L290 TraceCheckUtils]: 47: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,523 INFO L290 TraceCheckUtils]: 48: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,523 INFO L290 TraceCheckUtils]: 49: Hoare triple {128121#true} assume 4384 == #t~mem56;havoc #t~mem56; {128121#true} is VALID [2022-04-28 08:47:18,523 INFO L290 TraceCheckUtils]: 50: Hoare triple {128121#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {128121#true} is VALID [2022-04-28 08:47:18,523 INFO L290 TraceCheckUtils]: 51: Hoare triple {128121#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {128121#true} is VALID [2022-04-28 08:47:18,523 INFO L290 TraceCheckUtils]: 52: Hoare triple {128121#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,523 INFO L290 TraceCheckUtils]: 53: Hoare triple {128121#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,523 INFO L290 TraceCheckUtils]: 54: Hoare triple {128121#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,523 INFO L290 TraceCheckUtils]: 55: Hoare triple {128121#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,523 INFO L290 TraceCheckUtils]: 56: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-28 08:47:18,523 INFO L290 TraceCheckUtils]: 57: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-28 08:47:18,523 INFO L290 TraceCheckUtils]: 58: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-28 08:47:18,523 INFO L290 TraceCheckUtils]: 59: Hoare triple {128121#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,523 INFO L290 TraceCheckUtils]: 60: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,523 INFO L290 TraceCheckUtils]: 61: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,523 INFO L290 TraceCheckUtils]: 62: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,523 INFO L290 TraceCheckUtils]: 63: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,524 INFO L290 TraceCheckUtils]: 64: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,524 INFO L290 TraceCheckUtils]: 65: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,524 INFO L290 TraceCheckUtils]: 66: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,524 INFO L290 TraceCheckUtils]: 67: Hoare triple {128121#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,524 INFO L290 TraceCheckUtils]: 68: Hoare triple {128121#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,524 INFO L290 TraceCheckUtils]: 69: Hoare triple {128121#true} assume 4400 == #t~mem58;havoc #t~mem58; {128121#true} is VALID [2022-04-28 08:47:18,524 INFO L290 TraceCheckUtils]: 70: Hoare triple {128121#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,524 INFO L290 TraceCheckUtils]: 71: Hoare triple {128121#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {128121#true} is VALID [2022-04-28 08:47:18,524 INFO L290 TraceCheckUtils]: 72: Hoare triple {128121#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {128121#true} is VALID [2022-04-28 08:47:18,524 INFO L290 TraceCheckUtils]: 73: Hoare triple {128121#true} assume !(~ret~0 <= 0); {128121#true} is VALID [2022-04-28 08:47:18,524 INFO L290 TraceCheckUtils]: 74: Hoare triple {128121#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,524 INFO L290 TraceCheckUtils]: 75: Hoare triple {128121#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,524 INFO L290 TraceCheckUtils]: 76: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-28 08:47:18,524 INFO L290 TraceCheckUtils]: 77: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-28 08:47:18,524 INFO L290 TraceCheckUtils]: 78: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-28 08:47:18,524 INFO L290 TraceCheckUtils]: 79: Hoare triple {128121#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,524 INFO L290 TraceCheckUtils]: 80: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,524 INFO L290 TraceCheckUtils]: 81: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,525 INFO L290 TraceCheckUtils]: 82: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,525 INFO L290 TraceCheckUtils]: 83: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,525 INFO L290 TraceCheckUtils]: 84: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,525 INFO L290 TraceCheckUtils]: 85: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,525 INFO L290 TraceCheckUtils]: 86: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,525 INFO L290 TraceCheckUtils]: 87: Hoare triple {128121#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128126#(= |ssl3_connect_#t~mem57| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:18,525 INFO L290 TraceCheckUtils]: 88: Hoare triple {128126#(= |ssl3_connect_#t~mem57| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:47:18,526 INFO L290 TraceCheckUtils]: 89: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:47:18,526 INFO L290 TraceCheckUtils]: 90: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {128128#(not (= |ssl3_connect_#t~mem60| 4385))} is VALID [2022-04-28 08:47:18,526 INFO L290 TraceCheckUtils]: 91: Hoare triple {128128#(not (= |ssl3_connect_#t~mem60| 4385))} assume 4416 == #t~mem60;havoc #t~mem60; {128121#true} is VALID [2022-04-28 08:47:18,526 INFO L290 TraceCheckUtils]: 92: Hoare triple {128121#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {128121#true} is VALID [2022-04-28 08:47:18,526 INFO L290 TraceCheckUtils]: 93: Hoare triple {128121#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {128121#true} is VALID [2022-04-28 08:47:18,526 INFO L290 TraceCheckUtils]: 94: Hoare triple {128121#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,526 INFO L290 TraceCheckUtils]: 95: Hoare triple {128121#true} assume !(0 == ~tmp___6~0); {128121#true} is VALID [2022-04-28 08:47:18,526 INFO L290 TraceCheckUtils]: 96: Hoare triple {128121#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,526 INFO L290 TraceCheckUtils]: 97: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-28 08:47:18,526 INFO L290 TraceCheckUtils]: 98: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-28 08:47:18,527 INFO L290 TraceCheckUtils]: 99: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-28 08:47:18,527 INFO L290 TraceCheckUtils]: 100: Hoare triple {128121#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,527 INFO L290 TraceCheckUtils]: 101: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,527 INFO L290 TraceCheckUtils]: 102: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,527 INFO L290 TraceCheckUtils]: 103: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,527 INFO L290 TraceCheckUtils]: 104: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,527 INFO L290 TraceCheckUtils]: 105: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,527 INFO L290 TraceCheckUtils]: 106: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,527 INFO L290 TraceCheckUtils]: 107: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,527 INFO L290 TraceCheckUtils]: 108: Hoare triple {128121#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,527 INFO L290 TraceCheckUtils]: 109: Hoare triple {128121#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,527 INFO L290 TraceCheckUtils]: 110: Hoare triple {128121#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,527 INFO L290 TraceCheckUtils]: 111: Hoare triple {128121#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,527 INFO L290 TraceCheckUtils]: 112: Hoare triple {128121#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,527 INFO L290 TraceCheckUtils]: 113: Hoare triple {128121#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,527 INFO L290 TraceCheckUtils]: 114: Hoare triple {128121#true} assume 4432 == #t~mem62;havoc #t~mem62; {128121#true} is VALID [2022-04-28 08:47:18,527 INFO L290 TraceCheckUtils]: 115: Hoare triple {128121#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {128121#true} is VALID [2022-04-28 08:47:18,527 INFO L290 TraceCheckUtils]: 116: Hoare triple {128121#true} assume !(5 == ~blastFlag~0); {128121#true} is VALID [2022-04-28 08:47:18,527 INFO L290 TraceCheckUtils]: 117: Hoare triple {128121#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,528 INFO L290 TraceCheckUtils]: 118: Hoare triple {128121#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,528 INFO L290 TraceCheckUtils]: 119: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-28 08:47:18,528 INFO L290 TraceCheckUtils]: 120: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-28 08:47:18,528 INFO L290 TraceCheckUtils]: 121: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-28 08:47:18,528 INFO L290 TraceCheckUtils]: 122: Hoare triple {128121#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,528 INFO L290 TraceCheckUtils]: 123: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,528 INFO L290 TraceCheckUtils]: 124: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,528 INFO L290 TraceCheckUtils]: 125: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,528 INFO L290 TraceCheckUtils]: 126: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,528 INFO L290 TraceCheckUtils]: 127: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,528 INFO L290 TraceCheckUtils]: 128: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,528 INFO L290 TraceCheckUtils]: 129: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,528 INFO L290 TraceCheckUtils]: 130: Hoare triple {128121#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,528 INFO L290 TraceCheckUtils]: 131: Hoare triple {128121#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,528 INFO L290 TraceCheckUtils]: 132: Hoare triple {128121#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,528 INFO L290 TraceCheckUtils]: 133: Hoare triple {128121#true} assume 4401 == #t~mem59;havoc #t~mem59; {128121#true} is VALID [2022-04-28 08:47:18,528 INFO L290 TraceCheckUtils]: 134: Hoare triple {128121#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,528 INFO L290 TraceCheckUtils]: 135: Hoare triple {128121#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {128121#true} is VALID [2022-04-28 08:47:18,528 INFO L290 TraceCheckUtils]: 136: Hoare triple {128121#true} assume !(2 == ~blastFlag~0); {128121#true} is VALID [2022-04-28 08:47:18,529 INFO L290 TraceCheckUtils]: 137: Hoare triple {128121#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {128121#true} is VALID [2022-04-28 08:47:18,529 INFO L290 TraceCheckUtils]: 138: Hoare triple {128121#true} assume !(~ret~0 <= 0); {128121#true} is VALID [2022-04-28 08:47:18,529 INFO L290 TraceCheckUtils]: 139: Hoare triple {128121#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:18,530 INFO L290 TraceCheckUtils]: 140: Hoare triple {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:18,530 INFO L290 TraceCheckUtils]: 141: Hoare triple {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:18,530 INFO L290 TraceCheckUtils]: 142: Hoare triple {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:18,531 INFO L290 TraceCheckUtils]: 143: Hoare triple {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:18,531 INFO L290 TraceCheckUtils]: 144: Hoare triple {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:18,531 INFO L290 TraceCheckUtils]: 145: Hoare triple {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:18,532 INFO L290 TraceCheckUtils]: 146: Hoare triple {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:18,532 INFO L290 TraceCheckUtils]: 147: Hoare triple {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:18,533 INFO L290 TraceCheckUtils]: 148: Hoare triple {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:18,533 INFO L290 TraceCheckUtils]: 149: Hoare triple {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:18,533 INFO L290 TraceCheckUtils]: 150: Hoare triple {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:18,534 INFO L290 TraceCheckUtils]: 151: Hoare triple {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:18,534 INFO L290 TraceCheckUtils]: 152: Hoare triple {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128592#(= |ssl3_connect_#t~mem57| 4416)} is VALID [2022-04-28 08:47:18,534 INFO L290 TraceCheckUtils]: 153: Hoare triple {128592#(= |ssl3_connect_#t~mem57| 4416)} assume 4385 == #t~mem57;havoc #t~mem57; {128122#false} is VALID [2022-04-28 08:47:18,534 INFO L290 TraceCheckUtils]: 154: Hoare triple {128122#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {128122#false} is VALID [2022-04-28 08:47:18,534 INFO L290 TraceCheckUtils]: 155: Hoare triple {128122#false} assume !(1 == ~blastFlag~0); {128122#false} is VALID [2022-04-28 08:47:18,534 INFO L290 TraceCheckUtils]: 156: Hoare triple {128122#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,535 INFO L290 TraceCheckUtils]: 157: Hoare triple {128122#false} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,535 INFO L290 TraceCheckUtils]: 158: Hoare triple {128122#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,535 INFO L290 TraceCheckUtils]: 159: Hoare triple {128122#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,535 INFO L290 TraceCheckUtils]: 160: Hoare triple {128122#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128122#false} is VALID [2022-04-28 08:47:18,535 INFO L290 TraceCheckUtils]: 161: Hoare triple {128122#false} ~skip~0 := 0; {128122#false} is VALID [2022-04-28 08:47:18,535 INFO L290 TraceCheckUtils]: 162: Hoare triple {128122#false} assume !false; {128122#false} is VALID [2022-04-28 08:47:18,535 INFO L290 TraceCheckUtils]: 163: Hoare triple {128122#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,535 INFO L290 TraceCheckUtils]: 164: Hoare triple {128122#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,535 INFO L290 TraceCheckUtils]: 165: Hoare triple {128122#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,535 INFO L290 TraceCheckUtils]: 166: Hoare triple {128122#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,535 INFO L290 TraceCheckUtils]: 167: Hoare triple {128122#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,535 INFO L290 TraceCheckUtils]: 168: Hoare triple {128122#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,535 INFO L290 TraceCheckUtils]: 169: Hoare triple {128122#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,535 INFO L290 TraceCheckUtils]: 170: Hoare triple {128122#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,536 INFO L290 TraceCheckUtils]: 171: Hoare triple {128122#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,536 INFO L290 TraceCheckUtils]: 172: Hoare triple {128122#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,536 INFO L290 TraceCheckUtils]: 173: Hoare triple {128122#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,536 INFO L290 TraceCheckUtils]: 174: Hoare triple {128122#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,536 INFO L290 TraceCheckUtils]: 175: Hoare triple {128122#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,536 INFO L290 TraceCheckUtils]: 176: Hoare triple {128122#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,536 INFO L290 TraceCheckUtils]: 177: Hoare triple {128122#false} assume 4432 == #t~mem62;havoc #t~mem62; {128122#false} is VALID [2022-04-28 08:47:18,536 INFO L290 TraceCheckUtils]: 178: Hoare triple {128122#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {128122#false} is VALID [2022-04-28 08:47:18,536 INFO L290 TraceCheckUtils]: 179: Hoare triple {128122#false} assume 5 == ~blastFlag~0; {128122#false} is VALID [2022-04-28 08:47:18,536 INFO L290 TraceCheckUtils]: 180: Hoare triple {128122#false} assume !false; {128122#false} is VALID [2022-04-28 08:47:18,537 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 192 proven. 68 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-04-28 08:47:18,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 08:47:18,913 INFO L290 TraceCheckUtils]: 180: Hoare triple {128122#false} assume !false; {128122#false} is VALID [2022-04-28 08:47:18,913 INFO L290 TraceCheckUtils]: 179: Hoare triple {128122#false} assume 5 == ~blastFlag~0; {128122#false} is VALID [2022-04-28 08:47:18,913 INFO L290 TraceCheckUtils]: 178: Hoare triple {128122#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {128122#false} is VALID [2022-04-28 08:47:18,913 INFO L290 TraceCheckUtils]: 177: Hoare triple {128122#false} assume 4432 == #t~mem62;havoc #t~mem62; {128122#false} is VALID [2022-04-28 08:47:18,913 INFO L290 TraceCheckUtils]: 176: Hoare triple {128122#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,913 INFO L290 TraceCheckUtils]: 175: Hoare triple {128122#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,913 INFO L290 TraceCheckUtils]: 174: Hoare triple {128122#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,914 INFO L290 TraceCheckUtils]: 173: Hoare triple {128122#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,914 INFO L290 TraceCheckUtils]: 172: Hoare triple {128122#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,914 INFO L290 TraceCheckUtils]: 171: Hoare triple {128122#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,914 INFO L290 TraceCheckUtils]: 170: Hoare triple {128122#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,914 INFO L290 TraceCheckUtils]: 169: Hoare triple {128122#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,914 INFO L290 TraceCheckUtils]: 168: Hoare triple {128122#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,914 INFO L290 TraceCheckUtils]: 167: Hoare triple {128122#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,914 INFO L290 TraceCheckUtils]: 166: Hoare triple {128122#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,914 INFO L290 TraceCheckUtils]: 165: Hoare triple {128122#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,914 INFO L290 TraceCheckUtils]: 164: Hoare triple {128122#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,914 INFO L290 TraceCheckUtils]: 163: Hoare triple {128122#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,914 INFO L290 TraceCheckUtils]: 162: Hoare triple {128122#false} assume !false; {128122#false} is VALID [2022-04-28 08:47:18,915 INFO L290 TraceCheckUtils]: 161: Hoare triple {128122#false} ~skip~0 := 0; {128122#false} is VALID [2022-04-28 08:47:18,915 INFO L290 TraceCheckUtils]: 160: Hoare triple {128122#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128122#false} is VALID [2022-04-28 08:47:18,915 INFO L290 TraceCheckUtils]: 159: Hoare triple {128122#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,915 INFO L290 TraceCheckUtils]: 158: Hoare triple {128122#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,915 INFO L290 TraceCheckUtils]: 157: Hoare triple {128122#false} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,915 INFO L290 TraceCheckUtils]: 156: Hoare triple {128122#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {128122#false} is VALID [2022-04-28 08:47:18,915 INFO L290 TraceCheckUtils]: 155: Hoare triple {128122#false} assume !(1 == ~blastFlag~0); {128122#false} is VALID [2022-04-28 08:47:18,915 INFO L290 TraceCheckUtils]: 154: Hoare triple {128122#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {128122#false} is VALID [2022-04-28 08:47:18,916 INFO L290 TraceCheckUtils]: 153: Hoare triple {128129#(not (= |ssl3_connect_#t~mem57| 4385))} assume 4385 == #t~mem57;havoc #t~mem57; {128122#false} is VALID [2022-04-28 08:47:18,916 INFO L290 TraceCheckUtils]: 152: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128129#(not (= |ssl3_connect_#t~mem57| 4385))} is VALID [2022-04-28 08:47:18,916 INFO L290 TraceCheckUtils]: 151: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:47:18,917 INFO L290 TraceCheckUtils]: 150: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:47:18,917 INFO L290 TraceCheckUtils]: 149: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:47:18,917 INFO L290 TraceCheckUtils]: 148: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:47:18,918 INFO L290 TraceCheckUtils]: 147: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:47:18,918 INFO L290 TraceCheckUtils]: 146: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:47:18,918 INFO L290 TraceCheckUtils]: 145: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:47:18,919 INFO L290 TraceCheckUtils]: 144: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:47:18,919 INFO L290 TraceCheckUtils]: 143: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:47:18,919 INFO L290 TraceCheckUtils]: 142: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:47:18,920 INFO L290 TraceCheckUtils]: 141: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:47:18,920 INFO L290 TraceCheckUtils]: 140: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:47:18,921 INFO L290 TraceCheckUtils]: 139: Hoare triple {128121#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:47:18,921 INFO L290 TraceCheckUtils]: 138: Hoare triple {128121#true} assume !(~ret~0 <= 0); {128121#true} is VALID [2022-04-28 08:47:18,921 INFO L290 TraceCheckUtils]: 137: Hoare triple {128121#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {128121#true} is VALID [2022-04-28 08:47:18,921 INFO L290 TraceCheckUtils]: 136: Hoare triple {128121#true} assume !(2 == ~blastFlag~0); {128121#true} is VALID [2022-04-28 08:47:18,921 INFO L290 TraceCheckUtils]: 135: Hoare triple {128121#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {128121#true} is VALID [2022-04-28 08:47:18,922 INFO L290 TraceCheckUtils]: 134: Hoare triple {128121#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,922 INFO L290 TraceCheckUtils]: 133: Hoare triple {128121#true} assume 4401 == #t~mem59;havoc #t~mem59; {128121#true} is VALID [2022-04-28 08:47:18,922 INFO L290 TraceCheckUtils]: 132: Hoare triple {128121#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,922 INFO L290 TraceCheckUtils]: 131: Hoare triple {128121#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,922 INFO L290 TraceCheckUtils]: 130: Hoare triple {128121#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,922 INFO L290 TraceCheckUtils]: 129: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,922 INFO L290 TraceCheckUtils]: 128: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,922 INFO L290 TraceCheckUtils]: 127: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,922 INFO L290 TraceCheckUtils]: 126: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,922 INFO L290 TraceCheckUtils]: 125: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,922 INFO L290 TraceCheckUtils]: 124: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,922 INFO L290 TraceCheckUtils]: 123: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,922 INFO L290 TraceCheckUtils]: 122: Hoare triple {128121#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,923 INFO L290 TraceCheckUtils]: 121: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-28 08:47:18,923 INFO L290 TraceCheckUtils]: 120: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-28 08:47:18,923 INFO L290 TraceCheckUtils]: 119: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-28 08:47:18,923 INFO L290 TraceCheckUtils]: 118: Hoare triple {128121#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,923 INFO L290 TraceCheckUtils]: 117: Hoare triple {128121#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,923 INFO L290 TraceCheckUtils]: 116: Hoare triple {128121#true} assume !(5 == ~blastFlag~0); {128121#true} is VALID [2022-04-28 08:47:18,923 INFO L290 TraceCheckUtils]: 115: Hoare triple {128121#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {128121#true} is VALID [2022-04-28 08:47:18,923 INFO L290 TraceCheckUtils]: 114: Hoare triple {128121#true} assume 4432 == #t~mem62;havoc #t~mem62; {128121#true} is VALID [2022-04-28 08:47:18,923 INFO L290 TraceCheckUtils]: 113: Hoare triple {128121#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,923 INFO L290 TraceCheckUtils]: 112: Hoare triple {128121#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,923 INFO L290 TraceCheckUtils]: 111: Hoare triple {128121#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,923 INFO L290 TraceCheckUtils]: 110: Hoare triple {128121#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,924 INFO L290 TraceCheckUtils]: 109: Hoare triple {128121#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,924 INFO L290 TraceCheckUtils]: 108: Hoare triple {128121#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,924 INFO L290 TraceCheckUtils]: 107: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,924 INFO L290 TraceCheckUtils]: 106: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,924 INFO L290 TraceCheckUtils]: 105: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,924 INFO L290 TraceCheckUtils]: 104: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,924 INFO L290 TraceCheckUtils]: 103: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,924 INFO L290 TraceCheckUtils]: 102: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,924 INFO L290 TraceCheckUtils]: 101: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,924 INFO L290 TraceCheckUtils]: 100: Hoare triple {128121#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,924 INFO L290 TraceCheckUtils]: 99: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-28 08:47:18,924 INFO L290 TraceCheckUtils]: 98: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-28 08:47:18,924 INFO L290 TraceCheckUtils]: 97: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-28 08:47:18,925 INFO L290 TraceCheckUtils]: 96: Hoare triple {128121#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,925 INFO L290 TraceCheckUtils]: 95: Hoare triple {128121#true} assume !(0 == ~tmp___6~0); {128121#true} is VALID [2022-04-28 08:47:18,925 INFO L290 TraceCheckUtils]: 94: Hoare triple {128121#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,925 INFO L290 TraceCheckUtils]: 93: Hoare triple {128121#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {128121#true} is VALID [2022-04-28 08:47:18,925 INFO L290 TraceCheckUtils]: 92: Hoare triple {128121#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {128121#true} is VALID [2022-04-28 08:47:18,925 INFO L290 TraceCheckUtils]: 91: Hoare triple {128121#true} assume 4416 == #t~mem60;havoc #t~mem60; {128121#true} is VALID [2022-04-28 08:47:18,925 INFO L290 TraceCheckUtils]: 90: Hoare triple {128121#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,925 INFO L290 TraceCheckUtils]: 89: Hoare triple {128121#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,925 INFO L290 TraceCheckUtils]: 88: Hoare triple {128121#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,925 INFO L290 TraceCheckUtils]: 87: Hoare triple {128121#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,925 INFO L290 TraceCheckUtils]: 86: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,925 INFO L290 TraceCheckUtils]: 85: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,926 INFO L290 TraceCheckUtils]: 84: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,926 INFO L290 TraceCheckUtils]: 83: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,926 INFO L290 TraceCheckUtils]: 82: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,926 INFO L290 TraceCheckUtils]: 81: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,926 INFO L290 TraceCheckUtils]: 80: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,926 INFO L290 TraceCheckUtils]: 79: Hoare triple {128121#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,926 INFO L290 TraceCheckUtils]: 78: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-28 08:47:18,926 INFO L290 TraceCheckUtils]: 77: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-28 08:47:18,926 INFO L290 TraceCheckUtils]: 76: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-28 08:47:18,926 INFO L290 TraceCheckUtils]: 75: Hoare triple {128121#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,926 INFO L290 TraceCheckUtils]: 74: Hoare triple {128121#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,926 INFO L290 TraceCheckUtils]: 73: Hoare triple {128121#true} assume !(~ret~0 <= 0); {128121#true} is VALID [2022-04-28 08:47:18,927 INFO L290 TraceCheckUtils]: 72: Hoare triple {128121#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {128121#true} is VALID [2022-04-28 08:47:18,927 INFO L290 TraceCheckUtils]: 71: Hoare triple {128121#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {128121#true} is VALID [2022-04-28 08:47:18,927 INFO L290 TraceCheckUtils]: 70: Hoare triple {128121#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,927 INFO L290 TraceCheckUtils]: 69: Hoare triple {128121#true} assume 4400 == #t~mem58;havoc #t~mem58; {128121#true} is VALID [2022-04-28 08:47:18,927 INFO L290 TraceCheckUtils]: 68: Hoare triple {128121#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,927 INFO L290 TraceCheckUtils]: 67: Hoare triple {128121#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,927 INFO L290 TraceCheckUtils]: 66: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,927 INFO L290 TraceCheckUtils]: 65: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,927 INFO L290 TraceCheckUtils]: 64: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,927 INFO L290 TraceCheckUtils]: 63: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,927 INFO L290 TraceCheckUtils]: 62: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,927 INFO L290 TraceCheckUtils]: 61: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,927 INFO L290 TraceCheckUtils]: 60: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,928 INFO L290 TraceCheckUtils]: 59: Hoare triple {128121#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,928 INFO L290 TraceCheckUtils]: 58: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-28 08:47:18,928 INFO L290 TraceCheckUtils]: 57: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-28 08:47:18,928 INFO L290 TraceCheckUtils]: 56: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-28 08:47:18,928 INFO L290 TraceCheckUtils]: 55: Hoare triple {128121#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,928 INFO L290 TraceCheckUtils]: 54: Hoare triple {128121#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,928 INFO L290 TraceCheckUtils]: 53: Hoare triple {128121#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,928 INFO L290 TraceCheckUtils]: 52: Hoare triple {128121#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,928 INFO L290 TraceCheckUtils]: 51: Hoare triple {128121#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {128121#true} is VALID [2022-04-28 08:47:18,928 INFO L290 TraceCheckUtils]: 50: Hoare triple {128121#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {128121#true} is VALID [2022-04-28 08:47:18,928 INFO L290 TraceCheckUtils]: 49: Hoare triple {128121#true} assume 4384 == #t~mem56;havoc #t~mem56; {128121#true} is VALID [2022-04-28 08:47:18,928 INFO L290 TraceCheckUtils]: 48: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,929 INFO L290 TraceCheckUtils]: 47: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,929 INFO L290 TraceCheckUtils]: 46: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,929 INFO L290 TraceCheckUtils]: 45: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,929 INFO L290 TraceCheckUtils]: 44: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,929 INFO L290 TraceCheckUtils]: 43: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,929 INFO L290 TraceCheckUtils]: 42: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,929 INFO L290 TraceCheckUtils]: 41: Hoare triple {128121#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,929 INFO L290 TraceCheckUtils]: 40: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-28 08:47:18,929 INFO L290 TraceCheckUtils]: 39: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-28 08:47:18,929 INFO L290 TraceCheckUtils]: 38: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-28 08:47:18,929 INFO L290 TraceCheckUtils]: 37: Hoare triple {128121#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,929 INFO L290 TraceCheckUtils]: 36: Hoare triple {128121#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {128121#true} is VALID [2022-04-28 08:47:18,929 INFO L290 TraceCheckUtils]: 35: Hoare triple {128121#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,930 INFO L290 TraceCheckUtils]: 34: Hoare triple {128121#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {128121#true} is VALID [2022-04-28 08:47:18,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {128121#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {128121#true} is VALID [2022-04-28 08:47:18,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {128121#true} assume 4368 == #t~mem54;havoc #t~mem54; {128121#true} is VALID [2022-04-28 08:47:18,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,930 INFO L290 TraceCheckUtils]: 28: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,930 INFO L290 TraceCheckUtils]: 27: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,930 INFO L290 TraceCheckUtils]: 26: Hoare triple {128121#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-28 08:47:18,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-28 08:47:18,930 INFO L290 TraceCheckUtils]: 23: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-28 08:47:18,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {128121#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {128121#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {128121#true} assume !(0 == ~tmp___4~0); {128121#true} is VALID [2022-04-28 08:47:18,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {128121#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {128121#true} is VALID [2022-04-28 08:47:18,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {128121#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {128121#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {128121#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {128121#true} is VALID [2022-04-28 08:47:18,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {128121#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {128121#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {128121#true} is VALID [2022-04-28 08:47:18,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {128121#true} assume 12292 == #t~mem49;havoc #t~mem49; {128121#true} is VALID [2022-04-28 08:47:18,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {128121#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-28 08:47:18,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {128121#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {128121#true} is VALID [2022-04-28 08:47:18,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {128121#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {128121#true} is VALID [2022-04-28 08:47:18,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {128121#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {128121#true} is VALID [2022-04-28 08:47:18,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {128121#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {128121#true} is VALID [2022-04-28 08:47:18,932 INFO L272 TraceCheckUtils]: 6: Hoare triple {128121#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {128121#true} is VALID [2022-04-28 08:47:18,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {128121#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {128121#true} is VALID [2022-04-28 08:47:18,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {128121#true} call #t~ret158 := main(); {128121#true} is VALID [2022-04-28 08:47:18,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128121#true} {128121#true} #593#return; {128121#true} is VALID [2022-04-28 08:47:18,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {128121#true} assume true; {128121#true} is VALID [2022-04-28 08:47:18,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {128121#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {128121#true} is VALID [2022-04-28 08:47:18,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {128121#true} call ULTIMATE.init(); {128121#true} is VALID [2022-04-28 08:47:18,933 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-28 08:47:18,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803466872] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 08:47:18,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 08:47:18,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 8] total 10 [2022-04-28 08:47:18,933 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:47:18,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1997633308] [2022-04-28 08:47:18,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1997633308] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:47:18,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:47:18,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:47:18,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744297689] [2022-04-28 08:47:18,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:47:18,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 181 [2022-04-28 08:47:18,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:47:18,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:19,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:47:19,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:47:19,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:47:19,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:47:19,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-28 08:47:19,030 INFO L87 Difference]: Start difference. First operand 1146 states and 1643 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:25,112 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:47:26,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:26,655 INFO L93 Difference]: Finished difference Result 2621 states and 3760 transitions. [2022-04-28 08:47:26,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:47:26,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 181 [2022-04-28 08:47:26,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:47:26,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:26,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2022-04-28 08:47:26,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:26,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2022-04-28 08:47:26,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 471 transitions. [2022-04-28 08:47:27,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:47:27,085 INFO L225 Difference]: With dead ends: 2621 [2022-04-28 08:47:27,086 INFO L226 Difference]: Without dead ends: 1491 [2022-04-28 08:47:27,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-28 08:47:27,087 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 109 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:47:27,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 284 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 08:47:27,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2022-04-28 08:47:27,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1146. [2022-04-28 08:47:27,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:47:27,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1491 states. Second operand has 1146 states, 1141 states have (on average 1.4189307624890446) internal successors, (1619), 1141 states have internal predecessors, (1619), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:27,535 INFO L74 IsIncluded]: Start isIncluded. First operand 1491 states. Second operand has 1146 states, 1141 states have (on average 1.4189307624890446) internal successors, (1619), 1141 states have internal predecessors, (1619), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:27,536 INFO L87 Difference]: Start difference. First operand 1491 states. Second operand has 1146 states, 1141 states have (on average 1.4189307624890446) internal successors, (1619), 1141 states have internal predecessors, (1619), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:27,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:27,587 INFO L93 Difference]: Finished difference Result 1491 states and 2117 transitions. [2022-04-28 08:47:27,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 2117 transitions. [2022-04-28 08:47:27,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:47:27,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:47:27,589 INFO L74 IsIncluded]: Start isIncluded. First operand has 1146 states, 1141 states have (on average 1.4189307624890446) internal successors, (1619), 1141 states have internal predecessors, (1619), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1491 states. [2022-04-28 08:47:27,590 INFO L87 Difference]: Start difference. First operand has 1146 states, 1141 states have (on average 1.4189307624890446) internal successors, (1619), 1141 states have internal predecessors, (1619), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1491 states. [2022-04-28 08:47:27,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:27,652 INFO L93 Difference]: Finished difference Result 1491 states and 2117 transitions. [2022-04-28 08:47:27,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 2117 transitions. [2022-04-28 08:47:27,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:47:27,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:47:27,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:47:27,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:47:27,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1141 states have (on average 1.4189307624890446) internal successors, (1619), 1141 states have internal predecessors, (1619), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:27,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1623 transitions. [2022-04-28 08:47:27,702 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1623 transitions. Word has length 181 [2022-04-28 08:47:27,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:47:27,702 INFO L495 AbstractCegarLoop]: Abstraction has 1146 states and 1623 transitions. [2022-04-28 08:47:27,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:27,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1146 states and 1623 transitions. [2022-04-28 08:47:29,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1623 edges. 1623 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:47:29,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1623 transitions. [2022-04-28 08:47:29,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-04-28 08:47:29,454 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:47:29,454 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 4, 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-28 08:47:29,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 08:47:29,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:47:29,654 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:47:29,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:47:29,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1572475012, now seen corresponding path program 1 times [2022-04-28 08:47:29,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:47:29,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1509793820] [2022-04-28 08:47:43,560 WARN L232 SmtUtils]: Spent 9.31s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:47:52,982 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:47:52,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1572475012, now seen corresponding path program 2 times [2022-04-28 08:47:52,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:47:52,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528718089] [2022-04-28 08:47:52,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:47:52,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:47:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:47:53,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:47:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:47:53,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {139744#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {139737#true} is VALID [2022-04-28 08:47:53,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {139737#true} assume true; {139737#true} is VALID [2022-04-28 08:47:53,190 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {139737#true} {139737#true} #593#return; {139737#true} is VALID [2022-04-28 08:47:53,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {139737#true} call ULTIMATE.init(); {139744#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:47:53,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {139744#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {139737#true} is VALID [2022-04-28 08:47:53,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {139737#true} assume true; {139737#true} is VALID [2022-04-28 08:47:53,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139737#true} {139737#true} #593#return; {139737#true} is VALID [2022-04-28 08:47:53,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {139737#true} call #t~ret158 := main(); {139737#true} is VALID [2022-04-28 08:47:53,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {139737#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {139737#true} is VALID [2022-04-28 08:47:53,191 INFO L272 TraceCheckUtils]: 6: Hoare triple {139737#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {139737#true} is VALID [2022-04-28 08:47:53,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {139737#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {139737#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {139737#true} is VALID [2022-04-28 08:47:53,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {139737#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {139737#true} is VALID [2022-04-28 08:47:53,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {139737#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {139737#true} is VALID [2022-04-28 08:47:53,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {139737#true} assume !false; {139737#true} is VALID [2022-04-28 08:47:53,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {139737#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {139737#true} assume 12292 == #t~mem49;havoc #t~mem49; {139737#true} is VALID [2022-04-28 08:47:53,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {139737#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {139737#true} is VALID [2022-04-28 08:47:53,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {139737#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {139737#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {139737#true} is VALID [2022-04-28 08:47:53,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {139737#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {139737#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {139737#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {139737#true} is VALID [2022-04-28 08:47:53,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {139737#true} assume !(0 == ~tmp___4~0); {139737#true} is VALID [2022-04-28 08:47:53,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {139737#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {139737#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,193 INFO L290 TraceCheckUtils]: 23: Hoare triple {139737#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {139737#true} is VALID [2022-04-28 08:47:53,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {139737#true} ~skip~0 := 0; {139737#true} is VALID [2022-04-28 08:47:53,193 INFO L290 TraceCheckUtils]: 25: Hoare triple {139737#true} assume !false; {139737#true} is VALID [2022-04-28 08:47:53,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {139737#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {139737#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {139737#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {139737#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {139737#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {139737#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {139737#true} assume 4368 == #t~mem54;havoc #t~mem54; {139737#true} is VALID [2022-04-28 08:47:53,193 INFO L290 TraceCheckUtils]: 33: Hoare triple {139737#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {139737#true} is VALID [2022-04-28 08:47:53,193 INFO L290 TraceCheckUtils]: 34: Hoare triple {139737#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {139737#true} is VALID [2022-04-28 08:47:53,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {139737#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,194 INFO L290 TraceCheckUtils]: 36: Hoare triple {139737#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {139737#true} is VALID [2022-04-28 08:47:53,194 INFO L290 TraceCheckUtils]: 37: Hoare triple {139737#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,194 INFO L290 TraceCheckUtils]: 38: Hoare triple {139737#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {139737#true} is VALID [2022-04-28 08:47:53,194 INFO L290 TraceCheckUtils]: 39: Hoare triple {139737#true} ~skip~0 := 0; {139737#true} is VALID [2022-04-28 08:47:53,194 INFO L290 TraceCheckUtils]: 40: Hoare triple {139737#true} assume !false; {139737#true} is VALID [2022-04-28 08:47:53,194 INFO L290 TraceCheckUtils]: 41: Hoare triple {139737#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,194 INFO L290 TraceCheckUtils]: 42: Hoare triple {139737#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,194 INFO L290 TraceCheckUtils]: 43: Hoare triple {139737#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,194 INFO L290 TraceCheckUtils]: 44: Hoare triple {139737#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,194 INFO L290 TraceCheckUtils]: 45: Hoare triple {139737#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,194 INFO L290 TraceCheckUtils]: 46: Hoare triple {139737#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,195 INFO L290 TraceCheckUtils]: 47: Hoare triple {139737#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,195 INFO L290 TraceCheckUtils]: 48: Hoare triple {139737#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,195 INFO L290 TraceCheckUtils]: 49: Hoare triple {139737#true} assume 4384 == #t~mem56;havoc #t~mem56; {139737#true} is VALID [2022-04-28 08:47:53,195 INFO L290 TraceCheckUtils]: 50: Hoare triple {139737#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {139737#true} is VALID [2022-04-28 08:47:53,195 INFO L290 TraceCheckUtils]: 51: Hoare triple {139737#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {139737#true} is VALID [2022-04-28 08:47:53,195 INFO L290 TraceCheckUtils]: 52: Hoare triple {139737#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,195 INFO L290 TraceCheckUtils]: 53: Hoare triple {139737#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,195 INFO L290 TraceCheckUtils]: 54: Hoare triple {139737#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,195 INFO L290 TraceCheckUtils]: 55: Hoare triple {139737#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,195 INFO L290 TraceCheckUtils]: 56: Hoare triple {139737#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {139737#true} is VALID [2022-04-28 08:47:53,195 INFO L290 TraceCheckUtils]: 57: Hoare triple {139737#true} ~skip~0 := 0; {139737#true} is VALID [2022-04-28 08:47:53,195 INFO L290 TraceCheckUtils]: 58: Hoare triple {139737#true} assume !false; {139737#true} is VALID [2022-04-28 08:47:53,195 INFO L290 TraceCheckUtils]: 59: Hoare triple {139737#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,196 INFO L290 TraceCheckUtils]: 60: Hoare triple {139737#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,196 INFO L290 TraceCheckUtils]: 61: Hoare triple {139737#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,196 INFO L290 TraceCheckUtils]: 62: Hoare triple {139737#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,196 INFO L290 TraceCheckUtils]: 63: Hoare triple {139737#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,196 INFO L290 TraceCheckUtils]: 64: Hoare triple {139737#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,196 INFO L290 TraceCheckUtils]: 65: Hoare triple {139737#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,196 INFO L290 TraceCheckUtils]: 66: Hoare triple {139737#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,196 INFO L290 TraceCheckUtils]: 67: Hoare triple {139737#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,196 INFO L290 TraceCheckUtils]: 68: Hoare triple {139737#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,196 INFO L290 TraceCheckUtils]: 69: Hoare triple {139737#true} assume 4400 == #t~mem58;havoc #t~mem58; {139737#true} is VALID [2022-04-28 08:47:53,196 INFO L290 TraceCheckUtils]: 70: Hoare triple {139737#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,196 INFO L290 TraceCheckUtils]: 71: Hoare triple {139737#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {139737#true} is VALID [2022-04-28 08:47:53,196 INFO L290 TraceCheckUtils]: 72: Hoare triple {139737#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {139737#true} is VALID [2022-04-28 08:47:53,197 INFO L290 TraceCheckUtils]: 73: Hoare triple {139737#true} assume !(~ret~0 <= 0); {139737#true} is VALID [2022-04-28 08:47:53,197 INFO L290 TraceCheckUtils]: 74: Hoare triple {139737#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,197 INFO L290 TraceCheckUtils]: 75: Hoare triple {139737#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,197 INFO L290 TraceCheckUtils]: 76: Hoare triple {139737#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {139737#true} is VALID [2022-04-28 08:47:53,197 INFO L290 TraceCheckUtils]: 77: Hoare triple {139737#true} ~skip~0 := 0; {139737#true} is VALID [2022-04-28 08:47:53,197 INFO L290 TraceCheckUtils]: 78: Hoare triple {139737#true} assume !false; {139737#true} is VALID [2022-04-28 08:47:53,197 INFO L290 TraceCheckUtils]: 79: Hoare triple {139737#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,197 INFO L290 TraceCheckUtils]: 80: Hoare triple {139737#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,197 INFO L290 TraceCheckUtils]: 81: Hoare triple {139737#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,197 INFO L290 TraceCheckUtils]: 82: Hoare triple {139737#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,197 INFO L290 TraceCheckUtils]: 83: Hoare triple {139737#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,197 INFO L290 TraceCheckUtils]: 84: Hoare triple {139737#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,197 INFO L290 TraceCheckUtils]: 85: Hoare triple {139737#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,198 INFO L290 TraceCheckUtils]: 86: Hoare triple {139737#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,198 INFO L290 TraceCheckUtils]: 87: Hoare triple {139737#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,198 INFO L290 TraceCheckUtils]: 88: Hoare triple {139737#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,198 INFO L290 TraceCheckUtils]: 89: Hoare triple {139737#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,198 INFO L290 TraceCheckUtils]: 90: Hoare triple {139737#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,198 INFO L290 TraceCheckUtils]: 91: Hoare triple {139737#true} assume 4416 == #t~mem60;havoc #t~mem60; {139737#true} is VALID [2022-04-28 08:47:53,198 INFO L290 TraceCheckUtils]: 92: Hoare triple {139737#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {139737#true} is VALID [2022-04-28 08:47:53,198 INFO L290 TraceCheckUtils]: 93: Hoare triple {139737#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {139737#true} is VALID [2022-04-28 08:47:53,198 INFO L290 TraceCheckUtils]: 94: Hoare triple {139737#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,198 INFO L290 TraceCheckUtils]: 95: Hoare triple {139737#true} assume !(0 == ~tmp___6~0); {139737#true} is VALID [2022-04-28 08:47:53,198 INFO L290 TraceCheckUtils]: 96: Hoare triple {139737#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,198 INFO L290 TraceCheckUtils]: 97: Hoare triple {139737#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {139737#true} is VALID [2022-04-28 08:47:53,198 INFO L290 TraceCheckUtils]: 98: Hoare triple {139737#true} ~skip~0 := 0; {139737#true} is VALID [2022-04-28 08:47:53,199 INFO L290 TraceCheckUtils]: 99: Hoare triple {139737#true} assume !false; {139737#true} is VALID [2022-04-28 08:47:53,199 INFO L290 TraceCheckUtils]: 100: Hoare triple {139737#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,199 INFO L290 TraceCheckUtils]: 101: Hoare triple {139737#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,199 INFO L290 TraceCheckUtils]: 102: Hoare triple {139737#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,199 INFO L290 TraceCheckUtils]: 103: Hoare triple {139737#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,199 INFO L290 TraceCheckUtils]: 104: Hoare triple {139737#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,199 INFO L290 TraceCheckUtils]: 105: Hoare triple {139737#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,199 INFO L290 TraceCheckUtils]: 106: Hoare triple {139737#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,199 INFO L290 TraceCheckUtils]: 107: Hoare triple {139737#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,199 INFO L290 TraceCheckUtils]: 108: Hoare triple {139737#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,199 INFO L290 TraceCheckUtils]: 109: Hoare triple {139737#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,199 INFO L290 TraceCheckUtils]: 110: Hoare triple {139737#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,200 INFO L290 TraceCheckUtils]: 111: Hoare triple {139737#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,200 INFO L290 TraceCheckUtils]: 112: Hoare triple {139737#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,200 INFO L290 TraceCheckUtils]: 113: Hoare triple {139737#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-28 08:47:53,200 INFO L290 TraceCheckUtils]: 114: Hoare triple {139737#true} assume 4432 == #t~mem62;havoc #t~mem62; {139737#true} is VALID [2022-04-28 08:47:53,200 INFO L290 TraceCheckUtils]: 115: Hoare triple {139737#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {139737#true} is VALID [2022-04-28 08:47:53,200 INFO L290 TraceCheckUtils]: 116: Hoare triple {139737#true} assume !(5 == ~blastFlag~0); {139737#true} is VALID [2022-04-28 08:47:53,201 INFO L290 TraceCheckUtils]: 117: Hoare triple {139737#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:53,201 INFO L290 TraceCheckUtils]: 118: Hoare triple {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:53,202 INFO L290 TraceCheckUtils]: 119: Hoare triple {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:53,202 INFO L290 TraceCheckUtils]: 120: Hoare triple {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:53,203 INFO L290 TraceCheckUtils]: 121: Hoare triple {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:53,203 INFO L290 TraceCheckUtils]: 122: Hoare triple {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:53,203 INFO L290 TraceCheckUtils]: 123: Hoare triple {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:53,204 INFO L290 TraceCheckUtils]: 124: Hoare triple {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:53,204 INFO L290 TraceCheckUtils]: 125: Hoare triple {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:53,205 INFO L290 TraceCheckUtils]: 126: Hoare triple {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:53,205 INFO L290 TraceCheckUtils]: 127: Hoare triple {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:53,205 INFO L290 TraceCheckUtils]: 128: Hoare triple {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:53,206 INFO L290 TraceCheckUtils]: 129: Hoare triple {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:53,206 INFO L290 TraceCheckUtils]: 130: Hoare triple {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:53,207 INFO L290 TraceCheckUtils]: 131: Hoare triple {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:47:53,207 INFO L290 TraceCheckUtils]: 132: Hoare triple {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {139743#(= |ssl3_connect_#t~mem59| 4448)} is VALID [2022-04-28 08:47:53,207 INFO L290 TraceCheckUtils]: 133: Hoare triple {139743#(= |ssl3_connect_#t~mem59| 4448)} assume 4401 == #t~mem59;havoc #t~mem59; {139738#false} is VALID [2022-04-28 08:47:53,207 INFO L290 TraceCheckUtils]: 134: Hoare triple {139738#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,208 INFO L290 TraceCheckUtils]: 135: Hoare triple {139738#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {139738#false} is VALID [2022-04-28 08:47:53,208 INFO L290 TraceCheckUtils]: 136: Hoare triple {139738#false} assume !(2 == ~blastFlag~0); {139738#false} is VALID [2022-04-28 08:47:53,208 INFO L290 TraceCheckUtils]: 137: Hoare triple {139738#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {139738#false} is VALID [2022-04-28 08:47:53,208 INFO L290 TraceCheckUtils]: 138: Hoare triple {139738#false} assume !(~ret~0 <= 0); {139738#false} is VALID [2022-04-28 08:47:53,208 INFO L290 TraceCheckUtils]: 139: Hoare triple {139738#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,208 INFO L290 TraceCheckUtils]: 140: Hoare triple {139738#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,208 INFO L290 TraceCheckUtils]: 141: Hoare triple {139738#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {139738#false} is VALID [2022-04-28 08:47:53,208 INFO L290 TraceCheckUtils]: 142: Hoare triple {139738#false} ~skip~0 := 0; {139738#false} is VALID [2022-04-28 08:47:53,208 INFO L290 TraceCheckUtils]: 143: Hoare triple {139738#false} assume !false; {139738#false} is VALID [2022-04-28 08:47:53,208 INFO L290 TraceCheckUtils]: 144: Hoare triple {139738#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,208 INFO L290 TraceCheckUtils]: 145: Hoare triple {139738#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,208 INFO L290 TraceCheckUtils]: 146: Hoare triple {139738#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,208 INFO L290 TraceCheckUtils]: 147: Hoare triple {139738#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,209 INFO L290 TraceCheckUtils]: 148: Hoare triple {139738#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,209 INFO L290 TraceCheckUtils]: 149: Hoare triple {139738#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,209 INFO L290 TraceCheckUtils]: 150: Hoare triple {139738#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,209 INFO L290 TraceCheckUtils]: 151: Hoare triple {139738#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,209 INFO L290 TraceCheckUtils]: 152: Hoare triple {139738#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,209 INFO L290 TraceCheckUtils]: 153: Hoare triple {139738#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,209 INFO L290 TraceCheckUtils]: 154: Hoare triple {139738#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,209 INFO L290 TraceCheckUtils]: 155: Hoare triple {139738#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,209 INFO L290 TraceCheckUtils]: 156: Hoare triple {139738#false} assume 4416 == #t~mem60;havoc #t~mem60; {139738#false} is VALID [2022-04-28 08:47:53,209 INFO L290 TraceCheckUtils]: 157: Hoare triple {139738#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {139738#false} is VALID [2022-04-28 08:47:53,209 INFO L290 TraceCheckUtils]: 158: Hoare triple {139738#false} assume !(3 == ~blastFlag~0); {139738#false} is VALID [2022-04-28 08:47:53,210 INFO L290 TraceCheckUtils]: 159: Hoare triple {139738#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,210 INFO L290 TraceCheckUtils]: 160: Hoare triple {139738#false} assume !(0 == ~tmp___6~0); {139738#false} is VALID [2022-04-28 08:47:53,210 INFO L290 TraceCheckUtils]: 161: Hoare triple {139738#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,210 INFO L290 TraceCheckUtils]: 162: Hoare triple {139738#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {139738#false} is VALID [2022-04-28 08:47:53,210 INFO L290 TraceCheckUtils]: 163: Hoare triple {139738#false} ~skip~0 := 0; {139738#false} is VALID [2022-04-28 08:47:53,210 INFO L290 TraceCheckUtils]: 164: Hoare triple {139738#false} assume !false; {139738#false} is VALID [2022-04-28 08:47:53,210 INFO L290 TraceCheckUtils]: 165: Hoare triple {139738#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,210 INFO L290 TraceCheckUtils]: 166: Hoare triple {139738#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,210 INFO L290 TraceCheckUtils]: 167: Hoare triple {139738#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,210 INFO L290 TraceCheckUtils]: 168: Hoare triple {139738#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,210 INFO L290 TraceCheckUtils]: 169: Hoare triple {139738#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,210 INFO L290 TraceCheckUtils]: 170: Hoare triple {139738#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,210 INFO L290 TraceCheckUtils]: 171: Hoare triple {139738#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,211 INFO L290 TraceCheckUtils]: 172: Hoare triple {139738#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,211 INFO L290 TraceCheckUtils]: 173: Hoare triple {139738#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,211 INFO L290 TraceCheckUtils]: 174: Hoare triple {139738#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,211 INFO L290 TraceCheckUtils]: 175: Hoare triple {139738#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,211 INFO L290 TraceCheckUtils]: 176: Hoare triple {139738#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,211 INFO L290 TraceCheckUtils]: 177: Hoare triple {139738#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,211 INFO L290 TraceCheckUtils]: 178: Hoare triple {139738#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-28 08:47:53,211 INFO L290 TraceCheckUtils]: 179: Hoare triple {139738#false} assume 4432 == #t~mem62;havoc #t~mem62; {139738#false} is VALID [2022-04-28 08:47:53,211 INFO L290 TraceCheckUtils]: 180: Hoare triple {139738#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {139738#false} is VALID [2022-04-28 08:47:53,211 INFO L290 TraceCheckUtils]: 181: Hoare triple {139738#false} assume 5 == ~blastFlag~0; {139738#false} is VALID [2022-04-28 08:47:53,211 INFO L290 TraceCheckUtils]: 182: Hoare triple {139738#false} assume !false; {139738#false} is VALID [2022-04-28 08:47:53,212 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-04-28 08:47:53,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:47:53,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528718089] [2022-04-28 08:47:53,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528718089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:47:53,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:47:53,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:47:53,213 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:47:53,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1509793820] [2022-04-28 08:47:53,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1509793820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:47:53,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:47:53,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:47:53,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641604378] [2022-04-28 08:47:53,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:47:53,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 183 [2022-04-28 08:47:53,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:47:53,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:53,294 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-28 08:47:53,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:47:53,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:47:53,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:47:53,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:47:53,295 INFO L87 Difference]: Start difference. First operand 1146 states and 1623 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-28 08:47:55,315 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:47:57,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:57,311 INFO L93 Difference]: Finished difference Result 2632 states and 3744 transitions. [2022-04-28 08:47:57,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:47:57,311 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 183 [2022-04-28 08:47:57,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:47:57,311 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-28 08:47:57,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-28 08:47:57,313 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-28 08:47:57,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-28 08:47:57,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 440 transitions. [2022-04-28 08:47:57,626 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-28 08:47:57,708 INFO L225 Difference]: With dead ends: 2632 [2022-04-28 08:47:57,708 INFO L226 Difference]: Without dead ends: 1502 [2022-04-28 08:47:57,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:47:57,710 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 73 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:47:57,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 534 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 488 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:47:57,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2022-04-28 08:47:58,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1167. [2022-04-28 08:47:58,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:47:58,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1502 states. Second operand has 1167 states, 1162 states have (on average 1.4173838209982788) internal successors, (1647), 1162 states have internal predecessors, (1647), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:58,170 INFO L74 IsIncluded]: Start isIncluded. First operand 1502 states. Second operand has 1167 states, 1162 states have (on average 1.4173838209982788) internal successors, (1647), 1162 states have internal predecessors, (1647), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:58,171 INFO L87 Difference]: Start difference. First operand 1502 states. Second operand has 1167 states, 1162 states have (on average 1.4173838209982788) internal successors, (1647), 1162 states have internal predecessors, (1647), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:58,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:58,228 INFO L93 Difference]: Finished difference Result 1502 states and 2136 transitions. [2022-04-28 08:47:58,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 2136 transitions. [2022-04-28 08:47:58,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:47:58,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:47:58,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 1167 states, 1162 states have (on average 1.4173838209982788) internal successors, (1647), 1162 states have internal predecessors, (1647), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1502 states. [2022-04-28 08:47:58,231 INFO L87 Difference]: Start difference. First operand has 1167 states, 1162 states have (on average 1.4173838209982788) internal successors, (1647), 1162 states have internal predecessors, (1647), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1502 states. [2022-04-28 08:47:58,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:58,284 INFO L93 Difference]: Finished difference Result 1502 states and 2136 transitions. [2022-04-28 08:47:58,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 2136 transitions. [2022-04-28 08:47:58,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:47:58,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:47:58,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:47:58,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:47:58,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 1162 states have (on average 1.4173838209982788) internal successors, (1647), 1162 states have internal predecessors, (1647), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:58,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1651 transitions. [2022-04-28 08:47:58,336 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1651 transitions. Word has length 183 [2022-04-28 08:47:58,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:47:58,336 INFO L495 AbstractCegarLoop]: Abstraction has 1167 states and 1651 transitions. [2022-04-28 08:47:58,336 INFO L496 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-28 08:47:58,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1167 states and 1651 transitions. [2022-04-28 08:48:00,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1651 edges. 1651 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:48:00,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1651 transitions. [2022-04-28 08:48:00,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-04-28 08:48:00,141 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:48:00,141 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:48:00,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 08:48:00,141 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:48:00,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:48:00,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1259168305, now seen corresponding path program 1 times [2022-04-28 08:48:00,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:48:00,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1760511986] [2022-04-28 08:48:16,053 WARN L232 SmtUtils]: Spent 11.08s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:48:23,676 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:48:23,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1259168305, now seen corresponding path program 2 times [2022-04-28 08:48:23,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:48:23,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194923987] [2022-04-28 08:48:23,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:48:23,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:48:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:48:23,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:48:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:48:23,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {150358#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {150351#true} is VALID [2022-04-28 08:48:23,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {150351#true} assume true; {150351#true} is VALID [2022-04-28 08:48:23,932 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {150351#true} {150351#true} #593#return; {150351#true} is VALID [2022-04-28 08:48:23,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {150351#true} call ULTIMATE.init(); {150358#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:48:23,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {150358#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {150351#true} is VALID [2022-04-28 08:48:23,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {150351#true} assume true; {150351#true} is VALID [2022-04-28 08:48:23,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150351#true} {150351#true} #593#return; {150351#true} is VALID [2022-04-28 08:48:23,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {150351#true} call #t~ret158 := main(); {150351#true} is VALID [2022-04-28 08:48:23,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {150351#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {150351#true} is VALID [2022-04-28 08:48:23,933 INFO L272 TraceCheckUtils]: 6: Hoare triple {150351#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {150351#true} is VALID [2022-04-28 08:48:23,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {150351#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {150351#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {150351#true} is VALID [2022-04-28 08:48:23,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {150351#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {150351#true} is VALID [2022-04-28 08:48:23,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {150351#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {150351#true} is VALID [2022-04-28 08:48:23,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {150351#true} assume !false; {150351#true} is VALID [2022-04-28 08:48:23,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {150351#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {150351#true} assume 12292 == #t~mem49;havoc #t~mem49; {150351#true} is VALID [2022-04-28 08:48:23,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {150351#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {150351#true} is VALID [2022-04-28 08:48:23,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {150351#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {150351#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {150351#true} is VALID [2022-04-28 08:48:23,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {150351#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,934 INFO L290 TraceCheckUtils]: 18: Hoare triple {150351#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {150351#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {150351#true} is VALID [2022-04-28 08:48:23,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {150351#true} assume !(0 == ~tmp___4~0); {150351#true} is VALID [2022-04-28 08:48:23,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {150351#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,934 INFO L290 TraceCheckUtils]: 22: Hoare triple {150351#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {150351#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150351#true} is VALID [2022-04-28 08:48:23,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {150351#true} ~skip~0 := 0; {150351#true} is VALID [2022-04-28 08:48:23,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {150351#true} assume !false; {150351#true} is VALID [2022-04-28 08:48:23,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {150351#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,935 INFO L290 TraceCheckUtils]: 27: Hoare triple {150351#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,935 INFO L290 TraceCheckUtils]: 28: Hoare triple {150351#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {150351#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,935 INFO L290 TraceCheckUtils]: 30: Hoare triple {150351#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,935 INFO L290 TraceCheckUtils]: 31: Hoare triple {150351#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,935 INFO L290 TraceCheckUtils]: 32: Hoare triple {150351#true} assume 4368 == #t~mem54;havoc #t~mem54; {150351#true} is VALID [2022-04-28 08:48:23,935 INFO L290 TraceCheckUtils]: 33: Hoare triple {150351#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {150351#true} is VALID [2022-04-28 08:48:23,935 INFO L290 TraceCheckUtils]: 34: Hoare triple {150351#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {150351#true} is VALID [2022-04-28 08:48:23,935 INFO L290 TraceCheckUtils]: 35: Hoare triple {150351#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,935 INFO L290 TraceCheckUtils]: 36: Hoare triple {150351#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {150351#true} is VALID [2022-04-28 08:48:23,936 INFO L290 TraceCheckUtils]: 37: Hoare triple {150351#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,936 INFO L290 TraceCheckUtils]: 38: Hoare triple {150351#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150351#true} is VALID [2022-04-28 08:48:23,936 INFO L290 TraceCheckUtils]: 39: Hoare triple {150351#true} ~skip~0 := 0; {150351#true} is VALID [2022-04-28 08:48:23,936 INFO L290 TraceCheckUtils]: 40: Hoare triple {150351#true} assume !false; {150351#true} is VALID [2022-04-28 08:48:23,936 INFO L290 TraceCheckUtils]: 41: Hoare triple {150351#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,936 INFO L290 TraceCheckUtils]: 42: Hoare triple {150351#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,936 INFO L290 TraceCheckUtils]: 43: Hoare triple {150351#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,936 INFO L290 TraceCheckUtils]: 44: Hoare triple {150351#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,936 INFO L290 TraceCheckUtils]: 45: Hoare triple {150351#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,936 INFO L290 TraceCheckUtils]: 46: Hoare triple {150351#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,936 INFO L290 TraceCheckUtils]: 47: Hoare triple {150351#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,936 INFO L290 TraceCheckUtils]: 48: Hoare triple {150351#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,937 INFO L290 TraceCheckUtils]: 49: Hoare triple {150351#true} assume 4384 == #t~mem56;havoc #t~mem56; {150351#true} is VALID [2022-04-28 08:48:23,937 INFO L290 TraceCheckUtils]: 50: Hoare triple {150351#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {150351#true} is VALID [2022-04-28 08:48:23,937 INFO L290 TraceCheckUtils]: 51: Hoare triple {150351#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {150351#true} is VALID [2022-04-28 08:48:23,937 INFO L290 TraceCheckUtils]: 52: Hoare triple {150351#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,937 INFO L290 TraceCheckUtils]: 53: Hoare triple {150351#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,937 INFO L290 TraceCheckUtils]: 54: Hoare triple {150351#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,937 INFO L290 TraceCheckUtils]: 55: Hoare triple {150351#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,937 INFO L290 TraceCheckUtils]: 56: Hoare triple {150351#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150351#true} is VALID [2022-04-28 08:48:23,937 INFO L290 TraceCheckUtils]: 57: Hoare triple {150351#true} ~skip~0 := 0; {150351#true} is VALID [2022-04-28 08:48:23,937 INFO L290 TraceCheckUtils]: 58: Hoare triple {150351#true} assume !false; {150351#true} is VALID [2022-04-28 08:48:23,937 INFO L290 TraceCheckUtils]: 59: Hoare triple {150351#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,937 INFO L290 TraceCheckUtils]: 60: Hoare triple {150351#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,937 INFO L290 TraceCheckUtils]: 61: Hoare triple {150351#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,938 INFO L290 TraceCheckUtils]: 62: Hoare triple {150351#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,938 INFO L290 TraceCheckUtils]: 63: Hoare triple {150351#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,938 INFO L290 TraceCheckUtils]: 64: Hoare triple {150351#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,938 INFO L290 TraceCheckUtils]: 65: Hoare triple {150351#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,938 INFO L290 TraceCheckUtils]: 66: Hoare triple {150351#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,938 INFO L290 TraceCheckUtils]: 67: Hoare triple {150351#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,938 INFO L290 TraceCheckUtils]: 68: Hoare triple {150351#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,938 INFO L290 TraceCheckUtils]: 69: Hoare triple {150351#true} assume 4400 == #t~mem58;havoc #t~mem58; {150351#true} is VALID [2022-04-28 08:48:23,938 INFO L290 TraceCheckUtils]: 70: Hoare triple {150351#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,938 INFO L290 TraceCheckUtils]: 71: Hoare triple {150351#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {150351#true} is VALID [2022-04-28 08:48:23,938 INFO L290 TraceCheckUtils]: 72: Hoare triple {150351#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {150351#true} is VALID [2022-04-28 08:48:23,938 INFO L290 TraceCheckUtils]: 73: Hoare triple {150351#true} assume !(~ret~0 <= 0); {150351#true} is VALID [2022-04-28 08:48:23,938 INFO L290 TraceCheckUtils]: 74: Hoare triple {150351#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,939 INFO L290 TraceCheckUtils]: 75: Hoare triple {150351#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,939 INFO L290 TraceCheckUtils]: 76: Hoare triple {150351#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150351#true} is VALID [2022-04-28 08:48:23,939 INFO L290 TraceCheckUtils]: 77: Hoare triple {150351#true} ~skip~0 := 0; {150351#true} is VALID [2022-04-28 08:48:23,939 INFO L290 TraceCheckUtils]: 78: Hoare triple {150351#true} assume !false; {150351#true} is VALID [2022-04-28 08:48:23,939 INFO L290 TraceCheckUtils]: 79: Hoare triple {150351#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,939 INFO L290 TraceCheckUtils]: 80: Hoare triple {150351#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,939 INFO L290 TraceCheckUtils]: 81: Hoare triple {150351#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,939 INFO L290 TraceCheckUtils]: 82: Hoare triple {150351#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,939 INFO L290 TraceCheckUtils]: 83: Hoare triple {150351#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,939 INFO L290 TraceCheckUtils]: 84: Hoare triple {150351#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,939 INFO L290 TraceCheckUtils]: 85: Hoare triple {150351#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,939 INFO L290 TraceCheckUtils]: 86: Hoare triple {150351#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,939 INFO L290 TraceCheckUtils]: 87: Hoare triple {150351#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,940 INFO L290 TraceCheckUtils]: 88: Hoare triple {150351#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,940 INFO L290 TraceCheckUtils]: 89: Hoare triple {150351#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,940 INFO L290 TraceCheckUtils]: 90: Hoare triple {150351#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-28 08:48:23,940 INFO L290 TraceCheckUtils]: 91: Hoare triple {150351#true} assume 4416 == #t~mem60;havoc #t~mem60; {150351#true} is VALID [2022-04-28 08:48:23,940 INFO L290 TraceCheckUtils]: 92: Hoare triple {150351#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {150351#true} is VALID [2022-04-28 08:48:23,940 INFO L290 TraceCheckUtils]: 93: Hoare triple {150351#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {150351#true} is VALID [2022-04-28 08:48:23,941 INFO L290 TraceCheckUtils]: 94: Hoare triple {150351#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:48:23,941 INFO L290 TraceCheckUtils]: 95: Hoare triple {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:48:23,942 INFO L290 TraceCheckUtils]: 96: Hoare triple {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:48:23,942 INFO L290 TraceCheckUtils]: 97: Hoare triple {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:48:23,942 INFO L290 TraceCheckUtils]: 98: Hoare triple {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:48:23,943 INFO L290 TraceCheckUtils]: 99: Hoare triple {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:48:23,943 INFO L290 TraceCheckUtils]: 100: Hoare triple {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:48:23,943 INFO L290 TraceCheckUtils]: 101: Hoare triple {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:48:23,943 INFO L290 TraceCheckUtils]: 102: Hoare triple {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:48:23,944 INFO L290 TraceCheckUtils]: 103: Hoare triple {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:48:23,944 INFO L290 TraceCheckUtils]: 104: Hoare triple {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:48:23,944 INFO L290 TraceCheckUtils]: 105: Hoare triple {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:48:23,945 INFO L290 TraceCheckUtils]: 106: Hoare triple {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:48:23,945 INFO L290 TraceCheckUtils]: 107: Hoare triple {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:48:23,945 INFO L290 TraceCheckUtils]: 108: Hoare triple {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:48:23,945 INFO L290 TraceCheckUtils]: 109: Hoare triple {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:48:23,946 INFO L290 TraceCheckUtils]: 110: Hoare triple {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:48:23,946 INFO L290 TraceCheckUtils]: 111: Hoare triple {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:48:23,946 INFO L290 TraceCheckUtils]: 112: Hoare triple {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:48:23,947 INFO L290 TraceCheckUtils]: 113: Hoare triple {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {150357#(= |ssl3_connect_#t~mem62| 4432)} is VALID [2022-04-28 08:48:23,947 INFO L290 TraceCheckUtils]: 114: Hoare triple {150357#(= |ssl3_connect_#t~mem62| 4432)} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,947 INFO L290 TraceCheckUtils]: 115: Hoare triple {150352#false} assume !(4433 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,947 INFO L290 TraceCheckUtils]: 116: Hoare triple {150352#false} assume 4448 == #t~mem64;havoc #t~mem64; {150352#false} is VALID [2022-04-28 08:48:23,947 INFO L290 TraceCheckUtils]: 117: Hoare triple {150352#false} assume -2147483648 <= #t~nondet100 && #t~nondet100 <= 2147483647;~ret~0 := #t~nondet100;havoc #t~nondet100; {150352#false} is VALID [2022-04-28 08:48:23,947 INFO L290 TraceCheckUtils]: 118: Hoare triple {150352#false} assume !(~ret~0 <= 0);call #t~mem101.base, #t~mem101.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem102 := read~int(#t~mem101.base, 852 + #t~mem101.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,947 INFO L290 TraceCheckUtils]: 119: Hoare triple {150352#false} assume !(0 != #t~mem102);havoc #t~mem101.base, #t~mem101.offset;havoc #t~mem102;call write~int(4480, ~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,947 INFO L290 TraceCheckUtils]: 120: Hoare triple {150352#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,948 INFO L290 TraceCheckUtils]: 121: Hoare triple {150352#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,948 INFO L290 TraceCheckUtils]: 122: Hoare triple {150352#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150352#false} is VALID [2022-04-28 08:48:23,948 INFO L290 TraceCheckUtils]: 123: Hoare triple {150352#false} ~skip~0 := 0; {150352#false} is VALID [2022-04-28 08:48:23,948 INFO L290 TraceCheckUtils]: 124: Hoare triple {150352#false} assume !false; {150352#false} is VALID [2022-04-28 08:48:23,948 INFO L290 TraceCheckUtils]: 125: Hoare triple {150352#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,948 INFO L290 TraceCheckUtils]: 126: Hoare triple {150352#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,948 INFO L290 TraceCheckUtils]: 127: Hoare triple {150352#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,948 INFO L290 TraceCheckUtils]: 128: Hoare triple {150352#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,948 INFO L290 TraceCheckUtils]: 129: Hoare triple {150352#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,948 INFO L290 TraceCheckUtils]: 130: Hoare triple {150352#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,948 INFO L290 TraceCheckUtils]: 131: Hoare triple {150352#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,948 INFO L290 TraceCheckUtils]: 132: Hoare triple {150352#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,948 INFO L290 TraceCheckUtils]: 133: Hoare triple {150352#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,948 INFO L290 TraceCheckUtils]: 134: Hoare triple {150352#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,948 INFO L290 TraceCheckUtils]: 135: Hoare triple {150352#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,949 INFO L290 TraceCheckUtils]: 136: Hoare triple {150352#false} assume 4401 == #t~mem59;havoc #t~mem59; {150352#false} is VALID [2022-04-28 08:48:23,949 INFO L290 TraceCheckUtils]: 137: Hoare triple {150352#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,949 INFO L290 TraceCheckUtils]: 138: Hoare triple {150352#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {150352#false} is VALID [2022-04-28 08:48:23,949 INFO L290 TraceCheckUtils]: 139: Hoare triple {150352#false} assume !(2 == ~blastFlag~0); {150352#false} is VALID [2022-04-28 08:48:23,949 INFO L290 TraceCheckUtils]: 140: Hoare triple {150352#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {150352#false} is VALID [2022-04-28 08:48:23,949 INFO L290 TraceCheckUtils]: 141: Hoare triple {150352#false} assume !(~ret~0 <= 0); {150352#false} is VALID [2022-04-28 08:48:23,949 INFO L290 TraceCheckUtils]: 142: Hoare triple {150352#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,949 INFO L290 TraceCheckUtils]: 143: Hoare triple {150352#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,949 INFO L290 TraceCheckUtils]: 144: Hoare triple {150352#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150352#false} is VALID [2022-04-28 08:48:23,949 INFO L290 TraceCheckUtils]: 145: Hoare triple {150352#false} ~skip~0 := 0; {150352#false} is VALID [2022-04-28 08:48:23,949 INFO L290 TraceCheckUtils]: 146: Hoare triple {150352#false} assume !false; {150352#false} is VALID [2022-04-28 08:48:23,950 INFO L290 TraceCheckUtils]: 147: Hoare triple {150352#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,950 INFO L290 TraceCheckUtils]: 148: Hoare triple {150352#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,950 INFO L290 TraceCheckUtils]: 149: Hoare triple {150352#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,950 INFO L290 TraceCheckUtils]: 150: Hoare triple {150352#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,950 INFO L290 TraceCheckUtils]: 151: Hoare triple {150352#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,950 INFO L290 TraceCheckUtils]: 152: Hoare triple {150352#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,950 INFO L290 TraceCheckUtils]: 153: Hoare triple {150352#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,950 INFO L290 TraceCheckUtils]: 154: Hoare triple {150352#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,950 INFO L290 TraceCheckUtils]: 155: Hoare triple {150352#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,950 INFO L290 TraceCheckUtils]: 156: Hoare triple {150352#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,950 INFO L290 TraceCheckUtils]: 157: Hoare triple {150352#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,950 INFO L290 TraceCheckUtils]: 158: Hoare triple {150352#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,951 INFO L290 TraceCheckUtils]: 159: Hoare triple {150352#false} assume 4416 == #t~mem60;havoc #t~mem60; {150352#false} is VALID [2022-04-28 08:48:23,951 INFO L290 TraceCheckUtils]: 160: Hoare triple {150352#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {150352#false} is VALID [2022-04-28 08:48:23,951 INFO L290 TraceCheckUtils]: 161: Hoare triple {150352#false} assume !(3 == ~blastFlag~0); {150352#false} is VALID [2022-04-28 08:48:23,951 INFO L290 TraceCheckUtils]: 162: Hoare triple {150352#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,951 INFO L290 TraceCheckUtils]: 163: Hoare triple {150352#false} assume !(0 == ~tmp___6~0); {150352#false} is VALID [2022-04-28 08:48:23,951 INFO L290 TraceCheckUtils]: 164: Hoare triple {150352#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,951 INFO L290 TraceCheckUtils]: 165: Hoare triple {150352#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150352#false} is VALID [2022-04-28 08:48:23,951 INFO L290 TraceCheckUtils]: 166: Hoare triple {150352#false} ~skip~0 := 0; {150352#false} is VALID [2022-04-28 08:48:23,951 INFO L290 TraceCheckUtils]: 167: Hoare triple {150352#false} assume !false; {150352#false} is VALID [2022-04-28 08:48:23,951 INFO L290 TraceCheckUtils]: 168: Hoare triple {150352#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,951 INFO L290 TraceCheckUtils]: 169: Hoare triple {150352#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,951 INFO L290 TraceCheckUtils]: 170: Hoare triple {150352#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,952 INFO L290 TraceCheckUtils]: 171: Hoare triple {150352#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,952 INFO L290 TraceCheckUtils]: 172: Hoare triple {150352#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,952 INFO L290 TraceCheckUtils]: 173: Hoare triple {150352#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,952 INFO L290 TraceCheckUtils]: 174: Hoare triple {150352#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,952 INFO L290 TraceCheckUtils]: 175: Hoare triple {150352#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,952 INFO L290 TraceCheckUtils]: 176: Hoare triple {150352#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,952 INFO L290 TraceCheckUtils]: 177: Hoare triple {150352#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,952 INFO L290 TraceCheckUtils]: 178: Hoare triple {150352#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,952 INFO L290 TraceCheckUtils]: 179: Hoare triple {150352#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,952 INFO L290 TraceCheckUtils]: 180: Hoare triple {150352#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,952 INFO L290 TraceCheckUtils]: 181: Hoare triple {150352#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-28 08:48:23,952 INFO L290 TraceCheckUtils]: 182: Hoare triple {150352#false} assume 4432 == #t~mem62;havoc #t~mem62; {150352#false} is VALID [2022-04-28 08:48:23,953 INFO L290 TraceCheckUtils]: 183: Hoare triple {150352#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {150352#false} is VALID [2022-04-28 08:48:23,953 INFO L290 TraceCheckUtils]: 184: Hoare triple {150352#false} assume 5 == ~blastFlag~0; {150352#false} is VALID [2022-04-28 08:48:23,953 INFO L290 TraceCheckUtils]: 185: Hoare triple {150352#false} assume !false; {150352#false} is VALID [2022-04-28 08:48:23,953 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-04-28 08:48:23,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:48:23,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194923987] [2022-04-28 08:48:23,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194923987] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:48:23,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:48:23,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:48:23,954 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:48:23,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1760511986] [2022-04-28 08:48:23,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1760511986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:48:23,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:48:23,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:48:23,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496583220] [2022-04-28 08:48:23,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:48:23,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 186 [2022-04-28 08:48:23,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:48:23,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:24,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:48:24,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:48:24,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:48:24,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:48:24,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:48:24,036 INFO L87 Difference]: Start difference. First operand 1167 states and 1651 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:26,056 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:48:27,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:48:27,526 INFO L93 Difference]: Finished difference Result 2452 states and 3458 transitions. [2022-04-28 08:48:27,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:48:27,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 186 [2022-04-28 08:48:27,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:48:27,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:27,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 380 transitions. [2022-04-28 08:48:27,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:27,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 380 transitions. [2022-04-28 08:48:27,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 380 transitions. [2022-04-28 08:48:27,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 380 edges. 380 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:48:27,830 INFO L225 Difference]: With dead ends: 2452 [2022-04-28 08:48:27,830 INFO L226 Difference]: Without dead ends: 1301 [2022-04-28 08:48:27,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:48:27,832 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 23 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:48:27,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 474 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 347 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:48:27,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2022-04-28 08:48:28,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1263. [2022-04-28 08:48:28,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:48:28,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1301 states. Second operand has 1263 states, 1258 states have (on average 1.4141494435612083) internal successors, (1779), 1258 states have internal predecessors, (1779), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:28,255 INFO L74 IsIncluded]: Start isIncluded. First operand 1301 states. Second operand has 1263 states, 1258 states have (on average 1.4141494435612083) internal successors, (1779), 1258 states have internal predecessors, (1779), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:28,256 INFO L87 Difference]: Start difference. First operand 1301 states. Second operand has 1263 states, 1258 states have (on average 1.4141494435612083) internal successors, (1779), 1258 states have internal predecessors, (1779), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:28,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:48:28,297 INFO L93 Difference]: Finished difference Result 1301 states and 1823 transitions. [2022-04-28 08:48:28,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1823 transitions. [2022-04-28 08:48:28,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:48:28,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:48:28,300 INFO L74 IsIncluded]: Start isIncluded. First operand has 1263 states, 1258 states have (on average 1.4141494435612083) internal successors, (1779), 1258 states have internal predecessors, (1779), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1301 states. [2022-04-28 08:48:28,300 INFO L87 Difference]: Start difference. First operand has 1263 states, 1258 states have (on average 1.4141494435612083) internal successors, (1779), 1258 states have internal predecessors, (1779), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1301 states. [2022-04-28 08:48:28,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:48:28,341 INFO L93 Difference]: Finished difference Result 1301 states and 1823 transitions. [2022-04-28 08:48:28,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1823 transitions. [2022-04-28 08:48:28,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:48:28,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:48:28,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:48:28,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:48:28,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 1258 states have (on average 1.4141494435612083) internal successors, (1779), 1258 states have internal predecessors, (1779), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:28,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1783 transitions. [2022-04-28 08:48:28,402 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1783 transitions. Word has length 186 [2022-04-28 08:48:28,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:48:28,402 INFO L495 AbstractCegarLoop]: Abstraction has 1263 states and 1783 transitions. [2022-04-28 08:48:28,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:28,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1263 states and 1783 transitions. [2022-04-28 08:48:30,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1783 edges. 1783 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:48:30,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1783 transitions. [2022-04-28 08:48:30,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-04-28 08:48:30,241 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:48:30,241 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:48:30,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 08:48:30,241 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:48:30,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:48:30,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1408894034, now seen corresponding path program 1 times [2022-04-28 08:48:30,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:48:30,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [297100415] [2022-04-28 08:48:46,209 WARN L232 SmtUtils]: Spent 10.00s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:48:54,972 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:48:54,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1408894034, now seen corresponding path program 2 times [2022-04-28 08:48:54,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:48:54,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653580453] [2022-04-28 08:48:54,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:48:54,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:48:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:48:55,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:48:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:48:55,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {160402#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {160395#true} is VALID [2022-04-28 08:48:55,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {160395#true} assume true; {160395#true} is VALID [2022-04-28 08:48:55,231 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {160395#true} {160395#true} #593#return; {160395#true} is VALID [2022-04-28 08:48:55,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {160395#true} call ULTIMATE.init(); {160402#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:48:55,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {160402#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_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_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {160395#true} is VALID [2022-04-28 08:48:55,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {160395#true} assume true; {160395#true} is VALID [2022-04-28 08:48:55,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160395#true} {160395#true} #593#return; {160395#true} is VALID [2022-04-28 08:48:55,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {160395#true} call #t~ret158 := main(); {160395#true} is VALID [2022-04-28 08:48:55,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {160395#true} 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~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {160395#true} is VALID [2022-04-28 08:48:55,233 INFO L272 TraceCheckUtils]: 6: Hoare triple {160395#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {160395#true} is VALID [2022-04-28 08:48:55,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {160395#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;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;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {160395#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {160395#true} is VALID [2022-04-28 08:48:55,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {160395#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {160395#true} is VALID [2022-04-28 08:48:55,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {160395#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {160395#true} is VALID [2022-04-28 08:48:55,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {160395#true} assume !false; {160395#true} is VALID [2022-04-28 08:48:55,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {160395#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {160395#true} assume 12292 == #t~mem49;havoc #t~mem49; {160395#true} is VALID [2022-04-28 08:48:55,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {160395#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {160395#true} is VALID [2022-04-28 08:48:55,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {160395#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {160395#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {160395#true} is VALID [2022-04-28 08:48:55,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {160395#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {160395#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {160395#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {160395#true} is VALID [2022-04-28 08:48:55,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {160395#true} assume !(0 == ~tmp___4~0); {160395#true} is VALID [2022-04-28 08:48:55,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {160395#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {160395#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {160395#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {160395#true} is VALID [2022-04-28 08:48:55,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {160395#true} ~skip~0 := 0; {160395#true} is VALID [2022-04-28 08:48:55,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {160395#true} assume !false; {160395#true} is VALID [2022-04-28 08:48:55,234 INFO L290 TraceCheckUtils]: 26: Hoare triple {160395#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,234 INFO L290 TraceCheckUtils]: 27: Hoare triple {160395#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,234 INFO L290 TraceCheckUtils]: 28: Hoare triple {160395#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {160395#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,234 INFO L290 TraceCheckUtils]: 30: Hoare triple {160395#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {160395#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,235 INFO L290 TraceCheckUtils]: 32: Hoare triple {160395#true} assume 4368 == #t~mem54;havoc #t~mem54; {160395#true} is VALID [2022-04-28 08:48:55,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {160395#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {160395#true} is VALID [2022-04-28 08:48:55,235 INFO L290 TraceCheckUtils]: 34: Hoare triple {160395#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {160395#true} is VALID [2022-04-28 08:48:55,235 INFO L290 TraceCheckUtils]: 35: Hoare triple {160395#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,235 INFO L290 TraceCheckUtils]: 36: Hoare triple {160395#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {160395#true} is VALID [2022-04-28 08:48:55,235 INFO L290 TraceCheckUtils]: 37: Hoare triple {160395#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,235 INFO L290 TraceCheckUtils]: 38: Hoare triple {160395#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {160395#true} is VALID [2022-04-28 08:48:55,235 INFO L290 TraceCheckUtils]: 39: Hoare triple {160395#true} ~skip~0 := 0; {160395#true} is VALID [2022-04-28 08:48:55,235 INFO L290 TraceCheckUtils]: 40: Hoare triple {160395#true} assume !false; {160395#true} is VALID [2022-04-28 08:48:55,235 INFO L290 TraceCheckUtils]: 41: Hoare triple {160395#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,235 INFO L290 TraceCheckUtils]: 42: Hoare triple {160395#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,235 INFO L290 TraceCheckUtils]: 43: Hoare triple {160395#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,236 INFO L290 TraceCheckUtils]: 44: Hoare triple {160395#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,236 INFO L290 TraceCheckUtils]: 45: Hoare triple {160395#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,236 INFO L290 TraceCheckUtils]: 46: Hoare triple {160395#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,236 INFO L290 TraceCheckUtils]: 47: Hoare triple {160395#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,236 INFO L290 TraceCheckUtils]: 48: Hoare triple {160395#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,236 INFO L290 TraceCheckUtils]: 49: Hoare triple {160395#true} assume 4384 == #t~mem56;havoc #t~mem56; {160395#true} is VALID [2022-04-28 08:48:55,236 INFO L290 TraceCheckUtils]: 50: Hoare triple {160395#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {160395#true} is VALID [2022-04-28 08:48:55,236 INFO L290 TraceCheckUtils]: 51: Hoare triple {160395#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {160395#true} is VALID [2022-04-28 08:48:55,236 INFO L290 TraceCheckUtils]: 52: Hoare triple {160395#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,236 INFO L290 TraceCheckUtils]: 53: Hoare triple {160395#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,236 INFO L290 TraceCheckUtils]: 54: Hoare triple {160395#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,236 INFO L290 TraceCheckUtils]: 55: Hoare triple {160395#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,236 INFO L290 TraceCheckUtils]: 56: Hoare triple {160395#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {160395#true} is VALID [2022-04-28 08:48:55,237 INFO L290 TraceCheckUtils]: 57: Hoare triple {160395#true} ~skip~0 := 0; {160395#true} is VALID [2022-04-28 08:48:55,237 INFO L290 TraceCheckUtils]: 58: Hoare triple {160395#true} assume !false; {160395#true} is VALID [2022-04-28 08:48:55,237 INFO L290 TraceCheckUtils]: 59: Hoare triple {160395#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,237 INFO L290 TraceCheckUtils]: 60: Hoare triple {160395#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,237 INFO L290 TraceCheckUtils]: 61: Hoare triple {160395#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,237 INFO L290 TraceCheckUtils]: 62: Hoare triple {160395#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,237 INFO L290 TraceCheckUtils]: 63: Hoare triple {160395#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,237 INFO L290 TraceCheckUtils]: 64: Hoare triple {160395#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,237 INFO L290 TraceCheckUtils]: 65: Hoare triple {160395#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,237 INFO L290 TraceCheckUtils]: 66: Hoare triple {160395#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,237 INFO L290 TraceCheckUtils]: 67: Hoare triple {160395#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,237 INFO L290 TraceCheckUtils]: 68: Hoare triple {160395#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,237 INFO L290 TraceCheckUtils]: 69: Hoare triple {160395#true} assume 4400 == #t~mem58;havoc #t~mem58; {160395#true} is VALID [2022-04-28 08:48:55,238 INFO L290 TraceCheckUtils]: 70: Hoare triple {160395#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,238 INFO L290 TraceCheckUtils]: 71: Hoare triple {160395#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {160395#true} is VALID [2022-04-28 08:48:55,238 INFO L290 TraceCheckUtils]: 72: Hoare triple {160395#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {160395#true} is VALID [2022-04-28 08:48:55,238 INFO L290 TraceCheckUtils]: 73: Hoare triple {160395#true} assume !(~ret~0 <= 0); {160395#true} is VALID [2022-04-28 08:48:55,238 INFO L290 TraceCheckUtils]: 74: Hoare triple {160395#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,238 INFO L290 TraceCheckUtils]: 75: Hoare triple {160395#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,238 INFO L290 TraceCheckUtils]: 76: Hoare triple {160395#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {160395#true} is VALID [2022-04-28 08:48:55,238 INFO L290 TraceCheckUtils]: 77: Hoare triple {160395#true} ~skip~0 := 0; {160395#true} is VALID [2022-04-28 08:48:55,238 INFO L290 TraceCheckUtils]: 78: Hoare triple {160395#true} assume !false; {160395#true} is VALID [2022-04-28 08:48:55,238 INFO L290 TraceCheckUtils]: 79: Hoare triple {160395#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,238 INFO L290 TraceCheckUtils]: 80: Hoare triple {160395#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,238 INFO L290 TraceCheckUtils]: 81: Hoare triple {160395#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,239 INFO L290 TraceCheckUtils]: 82: Hoare triple {160395#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,239 INFO L290 TraceCheckUtils]: 83: Hoare triple {160395#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,239 INFO L290 TraceCheckUtils]: 84: Hoare triple {160395#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,239 INFO L290 TraceCheckUtils]: 85: Hoare triple {160395#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,239 INFO L290 TraceCheckUtils]: 86: Hoare triple {160395#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,239 INFO L290 TraceCheckUtils]: 87: Hoare triple {160395#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,239 INFO L290 TraceCheckUtils]: 88: Hoare triple {160395#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,239 INFO L290 TraceCheckUtils]: 89: Hoare triple {160395#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,239 INFO L290 TraceCheckUtils]: 90: Hoare triple {160395#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-28 08:48:55,239 INFO L290 TraceCheckUtils]: 91: Hoare triple {160395#true} assume 4416 == #t~mem60;havoc #t~mem60; {160395#true} is VALID [2022-04-28 08:48:55,239 INFO L290 TraceCheckUtils]: 92: Hoare triple {160395#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {160395#true} is VALID [2022-04-28 08:48:55,239 INFO L290 TraceCheckUtils]: 93: Hoare triple {160395#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {160395#true} is VALID [2022-04-28 08:48:55,240 INFO L290 TraceCheckUtils]: 94: Hoare triple {160395#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:48:55,241 INFO L290 TraceCheckUtils]: 95: Hoare triple {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:48:55,241 INFO L290 TraceCheckUtils]: 96: Hoare triple {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:48:55,242 INFO L290 TraceCheckUtils]: 97: Hoare triple {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:48:55,242 INFO L290 TraceCheckUtils]: 98: Hoare triple {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:48:55,242 INFO L290 TraceCheckUtils]: 99: Hoare triple {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:48:55,243 INFO L290 TraceCheckUtils]: 100: Hoare triple {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:48:55,243 INFO L290 TraceCheckUtils]: 101: Hoare triple {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:48:55,243 INFO L290 TraceCheckUtils]: 102: Hoare triple {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:48:55,244 INFO L290 TraceCheckUtils]: 103: Hoare triple {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:48:55,244 INFO L290 TraceCheckUtils]: 104: Hoare triple {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:48:55,245 INFO L290 TraceCheckUtils]: 105: Hoare triple {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {160401#(not (= |ssl3_connect_#t~mem54| 4368))} is VALID [2022-04-28 08:48:55,245 INFO L290 TraceCheckUtils]: 106: Hoare triple {160401#(not (= |ssl3_connect_#t~mem54| 4368))} assume 4368 == #t~mem54;havoc #t~mem54; {160396#false} is VALID [2022-04-28 08:48:55,245 INFO L290 TraceCheckUtils]: 107: Hoare triple {160396#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {160396#false} is VALID [2022-04-28 08:48:55,245 INFO L290 TraceCheckUtils]: 108: Hoare triple {160396#false} assume !(0 == ~blastFlag~0); {160396#false} is VALID [2022-04-28 08:48:55,245 INFO L290 TraceCheckUtils]: 109: Hoare triple {160396#false} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,245 INFO L290 TraceCheckUtils]: 110: Hoare triple {160396#false} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {160396#false} is VALID [2022-04-28 08:48:55,245 INFO L290 TraceCheckUtils]: 111: Hoare triple {160396#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,245 INFO L290 TraceCheckUtils]: 112: Hoare triple {160396#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {160396#false} is VALID [2022-04-28 08:48:55,245 INFO L290 TraceCheckUtils]: 113: Hoare triple {160396#false} ~skip~0 := 0; {160396#false} is VALID [2022-04-28 08:48:55,246 INFO L290 TraceCheckUtils]: 114: Hoare triple {160396#false} assume !false; {160396#false} is VALID [2022-04-28 08:48:55,246 INFO L290 TraceCheckUtils]: 115: Hoare triple {160396#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,246 INFO L290 TraceCheckUtils]: 116: Hoare triple {160396#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,246 INFO L290 TraceCheckUtils]: 117: Hoare triple {160396#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,246 INFO L290 TraceCheckUtils]: 118: Hoare triple {160396#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,246 INFO L290 TraceCheckUtils]: 119: Hoare triple {160396#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,246 INFO L290 TraceCheckUtils]: 120: Hoare triple {160396#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,246 INFO L290 TraceCheckUtils]: 121: Hoare triple {160396#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,246 INFO L290 TraceCheckUtils]: 122: Hoare triple {160396#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,246 INFO L290 TraceCheckUtils]: 123: Hoare triple {160396#false} assume 4384 == #t~mem56;havoc #t~mem56; {160396#false} is VALID [2022-04-28 08:48:55,246 INFO L290 TraceCheckUtils]: 124: Hoare triple {160396#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {160396#false} is VALID [2022-04-28 08:48:55,246 INFO L290 TraceCheckUtils]: 125: Hoare triple {160396#false} assume !(1 == ~blastFlag~0); {160396#false} is VALID [2022-04-28 08:48:55,246 INFO L290 TraceCheckUtils]: 126: Hoare triple {160396#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,247 INFO L290 TraceCheckUtils]: 127: Hoare triple {160396#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,247 INFO L290 TraceCheckUtils]: 128: Hoare triple {160396#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,247 INFO L290 TraceCheckUtils]: 129: Hoare triple {160396#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,247 INFO L290 TraceCheckUtils]: 130: Hoare triple {160396#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {160396#false} is VALID [2022-04-28 08:48:55,247 INFO L290 TraceCheckUtils]: 131: Hoare triple {160396#false} ~skip~0 := 0; {160396#false} is VALID [2022-04-28 08:48:55,247 INFO L290 TraceCheckUtils]: 132: Hoare triple {160396#false} assume !false; {160396#false} is VALID [2022-04-28 08:48:55,247 INFO L290 TraceCheckUtils]: 133: Hoare triple {160396#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,247 INFO L290 TraceCheckUtils]: 134: Hoare triple {160396#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,247 INFO L290 TraceCheckUtils]: 135: Hoare triple {160396#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,247 INFO L290 TraceCheckUtils]: 136: Hoare triple {160396#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,247 INFO L290 TraceCheckUtils]: 137: Hoare triple {160396#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,247 INFO L290 TraceCheckUtils]: 138: Hoare triple {160396#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,247 INFO L290 TraceCheckUtils]: 139: Hoare triple {160396#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,248 INFO L290 TraceCheckUtils]: 140: Hoare triple {160396#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,248 INFO L290 TraceCheckUtils]: 141: Hoare triple {160396#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,248 INFO L290 TraceCheckUtils]: 142: Hoare triple {160396#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,248 INFO L290 TraceCheckUtils]: 143: Hoare triple {160396#false} assume 4400 == #t~mem58;havoc #t~mem58; {160396#false} is VALID [2022-04-28 08:48:55,248 INFO L290 TraceCheckUtils]: 144: Hoare triple {160396#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,248 INFO L290 TraceCheckUtils]: 145: Hoare triple {160396#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {160396#false} is VALID [2022-04-28 08:48:55,248 INFO L290 TraceCheckUtils]: 146: Hoare triple {160396#false} assume !(2 == ~blastFlag~0); {160396#false} is VALID [2022-04-28 08:48:55,248 INFO L290 TraceCheckUtils]: 147: Hoare triple {160396#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {160396#false} is VALID [2022-04-28 08:48:55,248 INFO L290 TraceCheckUtils]: 148: Hoare triple {160396#false} assume !(~ret~0 <= 0); {160396#false} is VALID [2022-04-28 08:48:55,248 INFO L290 TraceCheckUtils]: 149: Hoare triple {160396#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,248 INFO L290 TraceCheckUtils]: 150: Hoare triple {160396#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,248 INFO L290 TraceCheckUtils]: 151: Hoare triple {160396#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {160396#false} is VALID [2022-04-28 08:48:55,248 INFO L290 TraceCheckUtils]: 152: Hoare triple {160396#false} ~skip~0 := 0; {160396#false} is VALID [2022-04-28 08:48:55,248 INFO L290 TraceCheckUtils]: 153: Hoare triple {160396#false} assume !false; {160396#false} is VALID [2022-04-28 08:48:55,249 INFO L290 TraceCheckUtils]: 154: Hoare triple {160396#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,249 INFO L290 TraceCheckUtils]: 155: Hoare triple {160396#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,249 INFO L290 TraceCheckUtils]: 156: Hoare triple {160396#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,249 INFO L290 TraceCheckUtils]: 157: Hoare triple {160396#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,249 INFO L290 TraceCheckUtils]: 158: Hoare triple {160396#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,249 INFO L290 TraceCheckUtils]: 159: Hoare triple {160396#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,249 INFO L290 TraceCheckUtils]: 160: Hoare triple {160396#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,249 INFO L290 TraceCheckUtils]: 161: Hoare triple {160396#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,249 INFO L290 TraceCheckUtils]: 162: Hoare triple {160396#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,249 INFO L290 TraceCheckUtils]: 163: Hoare triple {160396#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,249 INFO L290 TraceCheckUtils]: 164: Hoare triple {160396#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,249 INFO L290 TraceCheckUtils]: 165: Hoare triple {160396#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,249 INFO L290 TraceCheckUtils]: 166: Hoare triple {160396#false} assume 4416 == #t~mem60;havoc #t~mem60; {160396#false} is VALID [2022-04-28 08:48:55,250 INFO L290 TraceCheckUtils]: 167: Hoare triple {160396#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {160396#false} is VALID [2022-04-28 08:48:55,250 INFO L290 TraceCheckUtils]: 168: Hoare triple {160396#false} assume !(3 == ~blastFlag~0); {160396#false} is VALID [2022-04-28 08:48:55,250 INFO L290 TraceCheckUtils]: 169: Hoare triple {160396#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,250 INFO L290 TraceCheckUtils]: 170: Hoare triple {160396#false} assume !(0 == ~tmp___6~0); {160396#false} is VALID [2022-04-28 08:48:55,250 INFO L290 TraceCheckUtils]: 171: Hoare triple {160396#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,250 INFO L290 TraceCheckUtils]: 172: Hoare triple {160396#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {160396#false} is VALID [2022-04-28 08:48:55,250 INFO L290 TraceCheckUtils]: 173: Hoare triple {160396#false} ~skip~0 := 0; {160396#false} is VALID [2022-04-28 08:48:55,250 INFO L290 TraceCheckUtils]: 174: Hoare triple {160396#false} assume !false; {160396#false} is VALID [2022-04-28 08:48:55,250 INFO L290 TraceCheckUtils]: 175: Hoare triple {160396#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,250 INFO L290 TraceCheckUtils]: 176: Hoare triple {160396#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,250 INFO L290 TraceCheckUtils]: 177: Hoare triple {160396#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,250 INFO L290 TraceCheckUtils]: 178: Hoare triple {160396#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,250 INFO L290 TraceCheckUtils]: 179: Hoare triple {160396#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,251 INFO L290 TraceCheckUtils]: 180: Hoare triple {160396#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,251 INFO L290 TraceCheckUtils]: 181: Hoare triple {160396#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,251 INFO L290 TraceCheckUtils]: 182: Hoare triple {160396#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,251 INFO L290 TraceCheckUtils]: 183: Hoare triple {160396#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,251 INFO L290 TraceCheckUtils]: 184: Hoare triple {160396#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,251 INFO L290 TraceCheckUtils]: 185: Hoare triple {160396#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,251 INFO L290 TraceCheckUtils]: 186: Hoare triple {160396#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,251 INFO L290 TraceCheckUtils]: 187: Hoare triple {160396#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,251 INFO L290 TraceCheckUtils]: 188: Hoare triple {160396#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-28 08:48:55,251 INFO L290 TraceCheckUtils]: 189: Hoare triple {160396#false} assume 4432 == #t~mem62;havoc #t~mem62; {160396#false} is VALID [2022-04-28 08:48:55,251 INFO L290 TraceCheckUtils]: 190: Hoare triple {160396#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {160396#false} is VALID [2022-04-28 08:48:55,251 INFO L290 TraceCheckUtils]: 191: Hoare triple {160396#false} assume 5 == ~blastFlag~0; {160396#false} is VALID [2022-04-28 08:48:55,251 INFO L290 TraceCheckUtils]: 192: Hoare triple {160396#false} assume !false; {160396#false} is VALID [2022-04-28 08:48:55,252 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-04-28 08:48:55,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:48:55,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653580453] [2022-04-28 08:48:55,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653580453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:48:55,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:48:55,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:48:55,253 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:48:55,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [297100415] [2022-04-28 08:48:55,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [297100415] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:48:55,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:48:55,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:48:55,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725681755] [2022-04-28 08:48:55,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:48:55,253 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 193 [2022-04-28 08:48:55,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:48:55,254 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-28 08:48:55,335 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-28 08:48:55,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:48:55,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:48:55,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:48:55,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:48:55,336 INFO L87 Difference]: Start difference. First operand 1263 states and 1783 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-28 08:48:57,354 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:48:59,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:48:59,447 INFO L93 Difference]: Finished difference Result 2743 states and 3882 transitions. [2022-04-28 08:48:59,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:48:59,447 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 193 [2022-04-28 08:48:59,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:48:59,448 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-28 08:48:59,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 470 transitions. [2022-04-28 08:48:59,450 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-28 08:48:59,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 470 transitions. [2022-04-28 08:48:59,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 470 transitions. [2022-04-28 08:48:59,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 470 edges. 470 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:48:59,881 INFO L225 Difference]: With dead ends: 2743 [2022-04-28 08:48:59,881 INFO L226 Difference]: Without dead ends: 1728 [2022-04-28 08:48:59,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:48:59,883 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 110 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:48:59,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 490 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 494 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:48:59,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2022-04-28 08:49:00,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1343. [2022-04-28 08:49:00,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:49:00,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1728 states. Second operand has 1343 states, 1338 states have (on average 1.3863976083707026) internal successors, (1855), 1338 states have internal predecessors, (1855), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:00,340 INFO L74 IsIncluded]: Start isIncluded. First operand 1728 states. Second operand has 1343 states, 1338 states have (on average 1.3863976083707026) internal successors, (1855), 1338 states have internal predecessors, (1855), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:00,340 INFO L87 Difference]: Start difference. First operand 1728 states. Second operand has 1343 states, 1338 states have (on average 1.3863976083707026) internal successors, (1855), 1338 states have internal predecessors, (1855), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:00,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:49:00,423 INFO L93 Difference]: Finished difference Result 1728 states and 2413 transitions. [2022-04-28 08:49:00,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2413 transitions. [2022-04-28 08:49:00,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:49:00,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:49:00,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 1343 states, 1338 states have (on average 1.3863976083707026) internal successors, (1855), 1338 states have internal predecessors, (1855), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1728 states. [2022-04-28 08:49:00,427 INFO L87 Difference]: Start difference. First operand has 1343 states, 1338 states have (on average 1.3863976083707026) internal successors, (1855), 1338 states have internal predecessors, (1855), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1728 states. [2022-04-28 08:49:00,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:49:00,502 INFO L93 Difference]: Finished difference Result 1728 states and 2413 transitions. [2022-04-28 08:49:00,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2413 transitions. [2022-04-28 08:49:00,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:49:00,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:49:00,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:49:00,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:49:00,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1338 states have (on average 1.3863976083707026) internal successors, (1855), 1338 states have internal predecessors, (1855), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:00,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1859 transitions. [2022-04-28 08:49:00,569 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1859 transitions. Word has length 193 [2022-04-28 08:49:00,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:49:00,569 INFO L495 AbstractCegarLoop]: Abstraction has 1343 states and 1859 transitions. [2022-04-28 08:49:00,569 INFO L496 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-28 08:49:00,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1343 states and 1859 transitions. [2022-04-28 08:49:02,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1859 edges. 1859 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:49:02,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1859 transitions. [2022-04-28 08:49:02,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-04-28 08:49:02,534 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:49:02,534 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 5, 5, 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] [2022-04-28 08:49:02,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-28 08:49:02,534 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:49:02,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:49:02,535 INFO L85 PathProgramCache]: Analyzing trace with hash 164938377, now seen corresponding path program 1 times [2022-04-28 08:49:02,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:49:02,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [679727828]