/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.03.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 11:33:52,026 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:33:52,028 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:33:52,063 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:33:52,063 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:33:52,064 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:33:52,066 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:33:52,068 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:33:52,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:33:52,071 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:33:52,071 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:33:52,072 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:33:52,072 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:33:52,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:33:52,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:33:52,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:33:52,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:33:52,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:33:52,078 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:33:52,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:33:52,080 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:33:52,083 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:33:52,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:33:52,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:33:52,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:33:52,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:33:52,091 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:33:52,092 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:33:52,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:33:52,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:33:52,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:33:52,093 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:33:52,094 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:33:52,095 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:33:52,095 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:33:52,096 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:33:52,096 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:33:52,096 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:33:52,096 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:33:52,096 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:33:52,097 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:33:52,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:33:52,099 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 11:33:52,107 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:33:52,107 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:33:52,108 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:33:52,108 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:33:52,108 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:33:52,108 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:33:52,109 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:33:52,109 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:33:52,109 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:33:52,109 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:33:52,109 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:33:52,110 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:33:52,110 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:33:52,110 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:33:52,110 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:33:52,110 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:33:52,110 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:33:52,110 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:33:52,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:33:52,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:33:52,110 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:33:52,110 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:33:52,110 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:33:52,111 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:33:52,111 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:33:52,111 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 11:33:52,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:33:52,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:33:52,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:33:52,289 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:33:52,289 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:33:52,290 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.03.i.cil-2.c [2022-04-15 11:33:52,328 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bfd3dd3d/8c8683f6b6a84cea83efe73971f25036/FLAG4bdcc3c2f [2022-04-15 11:33:52,770 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:33:52,770 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.03.i.cil-2.c [2022-04-15 11:33:52,785 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bfd3dd3d/8c8683f6b6a84cea83efe73971f25036/FLAG4bdcc3c2f [2022-04-15 11:33:52,793 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bfd3dd3d/8c8683f6b6a84cea83efe73971f25036 [2022-04-15 11:33:52,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:33:52,795 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:33:52,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:33:52,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:33:52,798 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:33:52,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:33:52" (1/1) ... [2022-04-15 11:33:52,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@338df940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:33:52, skipping insertion in model container [2022-04-15 11:33:52,800 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:33:52" (1/1) ... [2022-04-15 11:33:52,804 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:33:52,846 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:33:53,144 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.03.i.cil-2.c[65397,65410] [2022-04-15 11:33:53,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:33:53,158 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:33:53,221 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.03.i.cil-2.c[65397,65410] [2022-04-15 11:33:53,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:33:53,234 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:33:53,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:33:53 WrapperNode [2022-04-15 11:33:53,235 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:33:53,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:33:53,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:33:53,236 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:33:53,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:33:53" (1/1) ... [2022-04-15 11:33:53,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:33:53" (1/1) ... [2022-04-15 11:33:53,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:33:53" (1/1) ... [2022-04-15 11:33:53,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:33:53" (1/1) ... [2022-04-15 11:33:53,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:33:53" (1/1) ... [2022-04-15 11:33:53,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:33:53" (1/1) ... [2022-04-15 11:33:53,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:33:53" (1/1) ... [2022-04-15 11:33:53,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:33:53,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:33:53,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:33:53,358 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:33:53,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:33:53" (1/1) ... [2022-04-15 11:33:53,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:33:53,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:33:53,382 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 11:33:53,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 11:33:53,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:33:53,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:33:53,417 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:33:53,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-15 11:33:53,417 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-15 11:33:53,417 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:33:53,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-15 11:33:53,417 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-15 11:33:53,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 11:33:53,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-15 11:33:53,418 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:33:53,418 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:33:53,419 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:33:53,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:33:53,419 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 11:33:53,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 11:33:53,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:33:53,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 11:33:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 11:33:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 11:33:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-15 11:33:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-15 11:33:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-15 11:33:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-15 11:33:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-15 11:33:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 11:33:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:33:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 11:33:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:33:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 11:33:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:33:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 11:33:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 11:33:53,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:33:53,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:33:53,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:33:53,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 11:33:53,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 11:33:53,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 11:33:53,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 11:33:53,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:33:53,545 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:33:53,546 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:33:54,847 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:33:55,223 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-15 11:33:55,224 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-15 11:33:55,239 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:33:55,244 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:33:55,245 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:33:55,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:33:55 BoogieIcfgContainer [2022-04-15 11:33:55,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:33:55,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:33:55,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:33:55,255 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:33:55,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:33:52" (1/3) ... [2022-04-15 11:33:55,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@656b6a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:33:55, skipping insertion in model container [2022-04-15 11:33:55,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:33:53" (2/3) ... [2022-04-15 11:33:55,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@656b6a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:33:55, skipping insertion in model container [2022-04-15 11:33:55,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:33:55" (3/3) ... [2022-04-15 11:33:55,257 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03.i.cil-2.c [2022-04-15 11:33:55,261 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:33:55,261 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:33:55,288 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:33:55,292 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 11:33:55,292 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:33:55,306 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-15 11:33:55,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 11:33:55,312 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:33:55,312 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:33:55,312 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:33:55,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:33:55,316 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 1 times [2022-04-15 11:33:55,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:55,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [323964527] [2022-04-15 11:33:55,328 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:33:55,328 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 2 times [2022-04-15 11:33:55,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:33:55,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427600387] [2022-04-15 11:33:55,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:33:55,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:33:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:55,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:33:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:55,776 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-15 11:33:55,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-15 11:33:55,777 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-15 11:33:55,779 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-15 11:33:55,779 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-15 11:33:55,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-15 11:33:55,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-15 11:33:55,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {141#true} call #t~ret158 := main(); {141#true} is VALID [2022-04-15 11:33:55,783 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-15 11:33:55,783 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-15 11:33:55,785 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-15 11:33:55,785 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-15 11:33:55,786 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-15 11:33:55,786 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-15 11:33:55,787 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-15 11:33:55,787 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-15 11:33:55,788 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-15 11:33:55,788 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-15 11:33:55,789 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-15 11:33:55,789 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-15 11:33:55,789 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-15 11:33:55,790 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-15 11:33:55,790 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-15 11:33:55,790 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-15 11:33:55,790 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-15 11:33:55,791 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-15 11:33:55,791 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-15 11:33:55,791 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-15 11:33:55,791 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-15 11:33:55,791 INFO L290 TraceCheckUtils]: 26: Hoare triple {142#false} assume 4432 == #t~mem62;havoc #t~mem62; {142#false} is VALID [2022-04-15 11:33:55,792 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-15 11:33:55,792 INFO L290 TraceCheckUtils]: 28: Hoare triple {142#false} assume 5 == ~blastFlag~0; {142#false} is VALID [2022-04-15 11:33:55,792 INFO L290 TraceCheckUtils]: 29: Hoare triple {142#false} assume !false; {142#false} is VALID [2022-04-15 11:33:55,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:33:55,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:33:55,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427600387] [2022-04-15 11:33:55,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427600387] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:55,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:55,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:33:55,798 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:33:55,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [323964527] [2022-04-15 11:33:55,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [323964527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:55,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:55,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:33:55,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222339840] [2022-04-15 11:33:55,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:33:55,803 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-15 11:33:55,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:33:55,807 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-15 11:33:55,842 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-15 11:33:55,843 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:33:55,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:55,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:33:55,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:33:55,860 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-15 11:33:57,901 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:58,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:58,902 INFO L93 Difference]: Finished difference Result 267 states and 442 transitions. [2022-04-15 11:33:58,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:33:58,902 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-15 11:33:58,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:33:58,903 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-15 11:33:58,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-15 11:33:58,914 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-15 11:33:58,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-15 11:33:58,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-15 11:33:59,216 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-15 11:33:59,224 INFO L225 Difference]: With dead ends: 267 [2022-04-15 11:33:59,225 INFO L226 Difference]: Without dead ends: 122 [2022-04-15 11:33:59,226 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:33:59,228 INFO L913 BasicCegarLoop]: 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-15 11:33:59,229 INFO L914 BasicCegarLoop]: 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-15 11:33:59,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-15 11:33:59,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-04-15 11:33:59,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:33:59,253 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-15 11:33:59,254 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-15 11:33:59,254 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-15 11:33:59,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:59,258 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-15 11:33:59,258 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-15 11:33:59,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:59,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:59,260 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-15 11:33:59,260 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-15 11:33:59,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:59,264 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-15 11:33:59,264 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-15 11:33:59,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:59,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:59,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:33:59,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:33:59,265 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-15 11:33:59,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2022-04-15 11:33:59,269 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 30 [2022-04-15 11:33:59,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:33:59,269 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2022-04-15 11:33:59,269 INFO L479 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-15 11:33:59,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 178 transitions. [2022-04-15 11:33:59,383 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-15 11:33:59,384 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2022-04-15 11:33:59,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 11:33:59,385 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:33:59,385 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:33:59,385 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:33:59,385 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:33:59,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:33:59,386 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 1 times [2022-04-15 11:33:59,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:59,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [168422720] [2022-04-15 11:33:59,386 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:33:59,386 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 2 times [2022-04-15 11:33:59,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:33:59,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108261829] [2022-04-15 11:33:59,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:33:59,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:33:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:59,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:33:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:59,626 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-15 11:33:59,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-15 11:33:59,627 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-15 11:33:59,627 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-15 11:33:59,627 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-15 11:33:59,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-15 11:33:59,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-15 11:33:59,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} call #t~ret158 := main(); {1173#true} is VALID [2022-04-15 11:33:59,628 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-15 11:33:59,628 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-15 11:33:59,629 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-15 11:33:59,629 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-15 11:33:59,630 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-15 11:33:59,630 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-15 11:33:59,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:33:59,631 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-15 11:33:59,631 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-15 11:33:59,633 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-15 11:33:59,634 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-15 11:33:59,634 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-15 11:33:59,634 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-15 11:33:59,635 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-15 11:33:59,635 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-15 11:33:59,636 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-15 11:33:59,636 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-15 11:33:59,637 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-15 11:33:59,637 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-15 11:33:59,637 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-15 11:33:59,638 INFO L290 TraceCheckUtils]: 25: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:33:59,638 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-15 11:33:59,638 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-15 11:33:59,639 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-15 11:33:59,639 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-15 11:33:59,639 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-15 11:33:59,640 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-15 11:33:59,640 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-15 11:33:59,640 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-15 11:33:59,640 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-15 11:33:59,641 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-15 11:33:59,641 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-15 11:33:59,641 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-15 11:33:59,642 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-15 11:33:59,642 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-15 11:33:59,642 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-15 11:33:59,643 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-15 11:33:59,643 INFO L290 TraceCheckUtils]: 42: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 5 == ~blastFlag~0; {1174#false} is VALID [2022-04-15 11:33:59,643 INFO L290 TraceCheckUtils]: 43: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-15 11:33:59,643 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-15 11:33:59,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:33:59,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108261829] [2022-04-15 11:33:59,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108261829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:59,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:59,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:33:59,644 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:33:59,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [168422720] [2022-04-15 11:33:59,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [168422720] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:59,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:59,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:33:59,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955284796] [2022-04-15 11:33:59,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:33:59,645 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-15 11:33:59,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:33:59,646 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-15 11:33:59,677 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-15 11:33:59,677 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:33:59,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:59,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:33:59,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:33:59,678 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-15 11:34:01,696 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:02,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:02,236 INFO L93 Difference]: Finished difference Result 327 states and 490 transitions. [2022-04-15 11:34:02,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:34:02,236 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-15 11:34:02,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:02,237 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-15 11:34:02,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-15 11:34:02,240 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-15 11:34:02,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-15 11:34:02,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-15 11:34:02,564 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-15 11:34:02,569 INFO L225 Difference]: With dead ends: 327 [2022-04-15 11:34:02,569 INFO L226 Difference]: Without dead ends: 222 [2022-04-15 11:34:02,570 INFO L912 BasicCegarLoop]: 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-15 11:34:02,570 INFO L913 BasicCegarLoop]: 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-15 11:34:02,571 INFO L914 BasicCegarLoop]: 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-15 11:34:02,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-15 11:34:02,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-04-15 11:34:02,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:02,582 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-15 11:34:02,583 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-15 11:34:02,583 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-15 11:34:02,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:02,589 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-15 11:34:02,589 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-15 11:34:02,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:02,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:02,590 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-15 11:34:02,591 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-15 11:34:02,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:02,597 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-15 11:34:02,597 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-15 11:34:02,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:02,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:02,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:02,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:02,598 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-15 11:34:02,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 326 transitions. [2022-04-15 11:34:02,605 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 326 transitions. Word has length 44 [2022-04-15 11:34:02,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:02,605 INFO L478 AbstractCegarLoop]: Abstraction has 222 states and 326 transitions. [2022-04-15 11:34:02,605 INFO L479 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-15 11:34:02,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 222 states and 326 transitions. [2022-04-15 11:34:02,847 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-15 11:34:02,847 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-15 11:34:02,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 11:34:02,849 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:02,849 INFO L499 BasicCegarLoop]: 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-15 11:34:02,849 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:34:02,849 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:02,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:02,849 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 1 times [2022-04-15 11:34:02,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:02,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1318243767] [2022-04-15 11:34:02,850 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:02,850 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 2 times [2022-04-15 11:34:02,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:02,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146606357] [2022-04-15 11:34:02,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:02,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:03,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:03,016 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-15 11:34:03,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-15 11:34:03,017 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2724#true} {2724#true} #593#return; {2724#true} is VALID [2022-04-15 11:34:03,017 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-15 11:34:03,018 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-15 11:34:03,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-15 11:34:03,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2724#true} {2724#true} #593#return; {2724#true} is VALID [2022-04-15 11:34:03,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {2724#true} call #t~ret158 := main(); {2724#true} is VALID [2022-04-15 11:34:03,018 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-15 11:34:03,018 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-15 11:34:03,018 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-15 11:34:03,019 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-15 11:34:03,019 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-15 11:34:03,019 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-15 11:34:03,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {2724#true} assume !false; {2724#true} is VALID [2022-04-15 11:34:03,019 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-15 11:34:03,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {2724#true} assume 12292 == #t~mem49;havoc #t~mem49; {2724#true} is VALID [2022-04-15 11:34:03,019 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-15 11:34:03,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {2724#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 11:34:03,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {2724#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {2724#true} is VALID [2022-04-15 11:34:03,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {2724#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {2724#true} is VALID [2022-04-15 11:34:03,020 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-15 11:34:03,020 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-15 11:34:03,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {2724#true} assume !(0 == ~tmp___4~0); {2724#true} is VALID [2022-04-15 11:34:03,020 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-15 11:34:03,020 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-15 11:34:03,020 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-15 11:34:03,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {2724#true} ~skip~0 := 0; {2724#true} is VALID [2022-04-15 11:34:03,021 INFO L290 TraceCheckUtils]: 25: Hoare triple {2724#true} assume !false; {2724#true} is VALID [2022-04-15 11:34:03,021 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-15 11:34:03,021 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-15 11:34:03,021 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-15 11:34:03,021 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-15 11:34:03,021 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-15 11:34:03,021 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-15 11:34:03,021 INFO L290 TraceCheckUtils]: 32: Hoare triple {2724#true} assume 4368 == #t~mem54;havoc #t~mem54; {2724#true} is VALID [2022-04-15 11:34:03,022 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-15 11:34:03,022 INFO L290 TraceCheckUtils]: 34: Hoare triple {2724#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2724#true} is VALID [2022-04-15 11:34:03,024 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-15 11:34:03,024 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-15 11:34:03,031 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-15 11:34:03,032 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-15 11:34:03,032 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-15 11:34:03,032 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-15 11:34:03,033 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-15 11:34:03,033 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-15 11:34:03,033 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-15 11:34:03,034 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-15 11:34:03,034 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-15 11:34:03,035 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-15 11:34:03,035 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-15 11:34:03,035 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-15 11:34:03,036 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-15 11:34:03,036 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-15 11:34:03,036 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-15 11:34:03,036 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-15 11:34:03,036 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-15 11:34:03,036 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-15 11:34:03,036 INFO L290 TraceCheckUtils]: 55: Hoare triple {2725#false} assume 4432 == #t~mem62;havoc #t~mem62; {2725#false} is VALID [2022-04-15 11:34:03,037 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-15 11:34:03,037 INFO L290 TraceCheckUtils]: 57: Hoare triple {2725#false} assume 5 == ~blastFlag~0; {2725#false} is VALID [2022-04-15 11:34:03,037 INFO L290 TraceCheckUtils]: 58: Hoare triple {2725#false} assume !false; {2725#false} is VALID [2022-04-15 11:34:03,037 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-15 11:34:03,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:03,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146606357] [2022-04-15 11:34:03,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146606357] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:03,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:03,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:03,038 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:03,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1318243767] [2022-04-15 11:34:03,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1318243767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:03,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:03,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:03,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530947103] [2022-04-15 11:34:03,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:03,039 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-15 11:34:03,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:03,039 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-15 11:34:03,080 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-15 11:34:03,081 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:34:03,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:03,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:34:03,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:34:03,082 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-15 11:34:05,111 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:06,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:06,074 INFO L93 Difference]: Finished difference Result 363 states and 539 transitions. [2022-04-15 11:34:06,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:34:06,074 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-15 11:34:06,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:06,075 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-15 11:34:06,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-15 11:34:06,078 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-15 11:34:06,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-15 11:34:06,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 388 transitions. [2022-04-15 11:34:06,335 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-15 11:34:06,345 INFO L225 Difference]: With dead ends: 363 [2022-04-15 11:34:06,345 INFO L226 Difference]: Without dead ends: 258 [2022-04-15 11:34:06,346 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:34:06,347 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 33 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:34:06,347 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 486 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 360 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:34:06,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-04-15 11:34:06,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 240. [2022-04-15 11:34:06,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:06,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 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-15 11:34:06,357 INFO L74 IsIncluded]: Start isIncluded. First operand 258 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-15 11:34:06,358 INFO L87 Difference]: Start difference. First operand 258 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-15 11:34:06,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:06,368 INFO L93 Difference]: Finished difference Result 258 states and 380 transitions. [2022-04-15 11:34:06,368 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 380 transitions. [2022-04-15 11:34:06,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:06,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:06,369 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 258 states. [2022-04-15 11:34:06,370 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 258 states. [2022-04-15 11:34:06,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:06,380 INFO L93 Difference]: Finished difference Result 258 states and 380 transitions. [2022-04-15 11:34:06,381 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 380 transitions. [2022-04-15 11:34:06,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:06,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:06,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:06,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:06,382 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-15 11:34:06,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 356 transitions. [2022-04-15 11:34:06,391 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 356 transitions. Word has length 59 [2022-04-15 11:34:06,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:06,392 INFO L478 AbstractCegarLoop]: Abstraction has 240 states and 356 transitions. [2022-04-15 11:34:06,392 INFO L479 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-15 11:34:06,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 240 states and 356 transitions. [2022-04-15 11:34:06,621 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-15 11:34:06,622 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 356 transitions. [2022-04-15 11:34:06,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 11:34:06,623 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:06,623 INFO L499 BasicCegarLoop]: 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-15 11:34:06,623 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:34:06,623 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:06,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:06,623 INFO L85 PathProgramCache]: Analyzing trace with hash -2084364124, now seen corresponding path program 3 times [2022-04-15 11:34:06,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:06,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [715321112] [2022-04-15 11:34:15,407 WARN L232 SmtUtils]: Spent 8.78s 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-15 11:34:22,201 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:22,201 INFO L85 PathProgramCache]: Analyzing trace with hash -2084364124, now seen corresponding path program 4 times [2022-04-15 11:34:22,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:22,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096804637] [2022-04-15 11:34:22,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:22,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:22,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:22,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {4465#(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); {4458#true} is VALID [2022-04-15 11:34:22,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-15 11:34:22,403 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4458#true} {4458#true} #593#return; {4458#true} is VALID [2022-04-15 11:34:22,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {4458#true} call ULTIMATE.init(); {4465#(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-15 11:34:22,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {4465#(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); {4458#true} is VALID [2022-04-15 11:34:22,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-15 11:34:22,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4458#true} {4458#true} #593#return; {4458#true} is VALID [2022-04-15 11:34:22,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {4458#true} call #t~ret158 := main(); {4458#true} is VALID [2022-04-15 11:34:22,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {4458#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; {4458#true} is VALID [2022-04-15 11:34:22,405 INFO L272 TraceCheckUtils]: 6: Hoare triple {4458#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {4458#true} is VALID [2022-04-15 11:34:22,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {4458#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); {4458#true} is VALID [2022-04-15 11:34:22,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {4458#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; {4458#true} is VALID [2022-04-15 11:34:22,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {4458#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; {4458#true} is VALID [2022-04-15 11:34:22,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {4458#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4458#true} is VALID [2022-04-15 11:34:22,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {4458#true} assume !false; {4458#true} is VALID [2022-04-15 11:34:22,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {4458#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); {4458#true} is VALID [2022-04-15 11:34:22,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {4458#true} assume 12292 == #t~mem49;havoc #t~mem49; {4458#true} is VALID [2022-04-15 11:34:22,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {4458#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; {4458#true} is VALID [2022-04-15 11:34:22,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {4458#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4458#true} is VALID [2022-04-15 11:34:22,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {4458#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4458#true} is VALID [2022-04-15 11:34:22,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {4458#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4458#true} is VALID [2022-04-15 11:34:22,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {4458#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); {4458#true} is VALID [2022-04-15 11:34:22,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {4458#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4458#true} is VALID [2022-04-15 11:34:22,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {4458#true} assume !(0 == ~tmp___4~0); {4458#true} is VALID [2022-04-15 11:34:22,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {4458#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); {4458#true} is VALID [2022-04-15 11:34:22,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {4458#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); {4458#true} is VALID [2022-04-15 11:34:22,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {4458#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4458#true} is VALID [2022-04-15 11:34:22,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {4458#true} ~skip~0 := 0; {4458#true} is VALID [2022-04-15 11:34:22,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {4458#true} assume !false; {4458#true} is VALID [2022-04-15 11:34:22,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {4458#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); {4458#true} is VALID [2022-04-15 11:34:22,407 INFO L290 TraceCheckUtils]: 27: Hoare triple {4458#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4458#true} is VALID [2022-04-15 11:34:22,407 INFO L290 TraceCheckUtils]: 28: Hoare triple {4458#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4458#true} is VALID [2022-04-15 11:34:22,407 INFO L290 TraceCheckUtils]: 29: Hoare triple {4458#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4458#true} is VALID [2022-04-15 11:34:22,407 INFO L290 TraceCheckUtils]: 30: Hoare triple {4458#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4458#true} is VALID [2022-04-15 11:34:22,407 INFO L290 TraceCheckUtils]: 31: Hoare triple {4458#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4458#true} is VALID [2022-04-15 11:34:22,408 INFO L290 TraceCheckUtils]: 32: Hoare triple {4458#true} assume 4368 == #t~mem54;havoc #t~mem54; {4458#true} is VALID [2022-04-15 11:34:22,408 INFO L290 TraceCheckUtils]: 33: Hoare triple {4458#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; {4458#true} is VALID [2022-04-15 11:34:22,408 INFO L290 TraceCheckUtils]: 34: Hoare triple {4458#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4458#true} is VALID [2022-04-15 11:34:22,410 INFO L290 TraceCheckUtils]: 35: Hoare triple {4458#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); {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:34:22,410 INFO L290 TraceCheckUtils]: 36: Hoare triple {4463#(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; {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:34:22,415 INFO L290 TraceCheckUtils]: 37: Hoare triple {4463#(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); {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:34:22,415 INFO L290 TraceCheckUtils]: 38: Hoare triple {4463#(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; {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:34:22,416 INFO L290 TraceCheckUtils]: 39: Hoare triple {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:34:22,416 INFO L290 TraceCheckUtils]: 40: Hoare triple {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:34:22,416 INFO L290 TraceCheckUtils]: 41: Hoare triple {4463#(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); {4464#(not (= 12292 |ssl3_connect_#t~mem49|))} is VALID [2022-04-15 11:34:22,417 INFO L290 TraceCheckUtils]: 42: Hoare triple {4464#(not (= 12292 |ssl3_connect_#t~mem49|))} assume 12292 == #t~mem49;havoc #t~mem49; {4459#false} is VALID [2022-04-15 11:34:22,417 INFO L290 TraceCheckUtils]: 43: Hoare triple {4459#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; {4459#false} is VALID [2022-04-15 11:34:22,417 INFO L290 TraceCheckUtils]: 44: Hoare triple {4459#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:34:22,417 INFO L290 TraceCheckUtils]: 45: Hoare triple {4459#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4459#false} is VALID [2022-04-15 11:34:22,417 INFO L290 TraceCheckUtils]: 46: Hoare triple {4459#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:34:22,417 INFO L290 TraceCheckUtils]: 47: Hoare triple {4459#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); {4459#false} is VALID [2022-04-15 11:34:22,417 INFO L290 TraceCheckUtils]: 48: Hoare triple {4459#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4459#false} is VALID [2022-04-15 11:34:22,417 INFO L290 TraceCheckUtils]: 49: Hoare triple {4459#false} assume !(0 == ~tmp___4~0); {4459#false} is VALID [2022-04-15 11:34:22,417 INFO L290 TraceCheckUtils]: 50: Hoare triple {4459#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); {4459#false} is VALID [2022-04-15 11:34:22,418 INFO L290 TraceCheckUtils]: 51: Hoare triple {4459#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); {4459#false} is VALID [2022-04-15 11:34:22,418 INFO L290 TraceCheckUtils]: 52: Hoare triple {4459#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4459#false} is VALID [2022-04-15 11:34:22,418 INFO L290 TraceCheckUtils]: 53: Hoare triple {4459#false} ~skip~0 := 0; {4459#false} is VALID [2022-04-15 11:34:22,418 INFO L290 TraceCheckUtils]: 54: Hoare triple {4459#false} assume !false; {4459#false} is VALID [2022-04-15 11:34:22,418 INFO L290 TraceCheckUtils]: 55: Hoare triple {4459#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); {4459#false} is VALID [2022-04-15 11:34:22,418 INFO L290 TraceCheckUtils]: 56: Hoare triple {4459#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:34:22,418 INFO L290 TraceCheckUtils]: 57: Hoare triple {4459#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:34:22,418 INFO L290 TraceCheckUtils]: 58: Hoare triple {4459#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:34:22,418 INFO L290 TraceCheckUtils]: 59: Hoare triple {4459#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:34:22,418 INFO L290 TraceCheckUtils]: 60: Hoare triple {4459#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:34:22,418 INFO L290 TraceCheckUtils]: 61: Hoare triple {4459#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:34:22,419 INFO L290 TraceCheckUtils]: 62: Hoare triple {4459#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:34:22,419 INFO L290 TraceCheckUtils]: 63: Hoare triple {4459#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:34:22,419 INFO L290 TraceCheckUtils]: 64: Hoare triple {4459#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:34:22,419 INFO L290 TraceCheckUtils]: 65: Hoare triple {4459#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:34:22,419 INFO L290 TraceCheckUtils]: 66: Hoare triple {4459#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:34:22,419 INFO L290 TraceCheckUtils]: 67: Hoare triple {4459#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:34:22,419 INFO L290 TraceCheckUtils]: 68: Hoare triple {4459#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:34:22,419 INFO L290 TraceCheckUtils]: 69: Hoare triple {4459#false} assume 4432 == #t~mem62;havoc #t~mem62; {4459#false} is VALID [2022-04-15 11:34:22,419 INFO L290 TraceCheckUtils]: 70: Hoare triple {4459#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {4459#false} is VALID [2022-04-15 11:34:22,419 INFO L290 TraceCheckUtils]: 71: Hoare triple {4459#false} assume 5 == ~blastFlag~0; {4459#false} is VALID [2022-04-15 11:34:22,419 INFO L290 TraceCheckUtils]: 72: Hoare triple {4459#false} assume !false; {4459#false} is VALID [2022-04-15 11:34:22,420 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-15 11:34:22,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:22,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096804637] [2022-04-15 11:34:22,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096804637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:22,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:22,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:22,420 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:22,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [715321112] [2022-04-15 11:34:22,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [715321112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:22,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:22,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:22,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527548912] [2022-04-15 11:34:22,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:22,421 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-15 11:34:22,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:22,422 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-15 11:34:22,469 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-15 11:34:22,469 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:34:22,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:22,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:34:22,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:34:22,470 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-15 11:34:24,504 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:25,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:25,416 INFO L93 Difference]: Finished difference Result 645 states and 966 transitions. [2022-04-15 11:34:25,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:34:25,416 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-15 11:34:25,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:25,416 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-15 11:34:25,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 11:34:25,420 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-15 11:34:25,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 11:34:25,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-15 11:34:25,744 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-15 11:34:25,752 INFO L225 Difference]: With dead ends: 645 [2022-04-15 11:34:25,752 INFO L226 Difference]: Without dead ends: 421 [2022-04-15 11:34:25,753 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:34:25,753 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 112 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:34:25,754 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 296 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 379 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:34:25,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-04-15 11:34:25,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 262. [2022-04-15 11:34:25,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:25,768 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-15 11:34:25,768 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-15 11:34:25,768 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-15 11:34:25,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:25,778 INFO L93 Difference]: Finished difference Result 421 states and 627 transitions. [2022-04-15 11:34:25,778 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 627 transitions. [2022-04-15 11:34:25,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:25,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:25,779 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-15 11:34:25,780 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-15 11:34:25,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:25,789 INFO L93 Difference]: Finished difference Result 421 states and 627 transitions. [2022-04-15 11:34:25,789 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 627 transitions. [2022-04-15 11:34:25,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:25,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:25,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:25,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:25,791 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-15 11:34:25,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 387 transitions. [2022-04-15 11:34:25,797 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 387 transitions. Word has length 73 [2022-04-15 11:34:25,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:25,797 INFO L478 AbstractCegarLoop]: Abstraction has 262 states and 387 transitions. [2022-04-15 11:34:25,797 INFO L479 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-15 11:34:25,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 262 states and 387 transitions. [2022-04-15 11:34:26,074 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-15 11:34:26,075 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 387 transitions. [2022-04-15 11:34:26,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 11:34:26,075 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:26,076 INFO L499 BasicCegarLoop]: 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-15 11:34:26,076 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:34:26,076 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:26,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:26,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1101622726, now seen corresponding path program 1 times [2022-04-15 11:34:26,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:26,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1851017510] [2022-04-15 11:34:39,631 WARN L232 SmtUtils]: Spent 9.86s 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-15 11:34:47,547 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:47,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1101622726, now seen corresponding path program 2 times [2022-04-15 11:34:47,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:47,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590417044] [2022-04-15 11:34:47,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:47,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:47,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:47,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {7133#(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); {7126#true} is VALID [2022-04-15 11:34:47,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {7126#true} assume true; {7126#true} is VALID [2022-04-15 11:34:47,730 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7126#true} {7126#true} #593#return; {7126#true} is VALID [2022-04-15 11:34:47,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {7126#true} call ULTIMATE.init(); {7133#(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-15 11:34:47,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {7133#(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); {7126#true} is VALID [2022-04-15 11:34:47,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {7126#true} assume true; {7126#true} is VALID [2022-04-15 11:34:47,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7126#true} {7126#true} #593#return; {7126#true} is VALID [2022-04-15 11:34:47,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {7126#true} call #t~ret158 := main(); {7126#true} is VALID [2022-04-15 11:34:47,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {7126#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; {7126#true} is VALID [2022-04-15 11:34:47,731 INFO L272 TraceCheckUtils]: 6: Hoare triple {7126#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {7126#true} is VALID [2022-04-15 11:34:47,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {7126#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); {7126#true} is VALID [2022-04-15 11:34:47,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {7126#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; {7126#true} is VALID [2022-04-15 11:34:47,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {7126#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; {7126#true} is VALID [2022-04-15 11:34:47,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {7126#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7126#true} is VALID [2022-04-15 11:34:47,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {7126#true} assume !false; {7126#true} is VALID [2022-04-15 11:34:47,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {7126#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); {7126#true} is VALID [2022-04-15 11:34:47,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {7126#true} assume 12292 == #t~mem49;havoc #t~mem49; {7126#true} is VALID [2022-04-15 11:34:47,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {7126#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; {7126#true} is VALID [2022-04-15 11:34:47,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {7126#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7126#true} is VALID [2022-04-15 11:34:47,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {7126#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7126#true} is VALID [2022-04-15 11:34:47,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {7126#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7126#true} is VALID [2022-04-15 11:34:47,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {7126#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); {7126#true} is VALID [2022-04-15 11:34:47,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {7126#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7126#true} is VALID [2022-04-15 11:34:47,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {7126#true} assume !(0 == ~tmp___4~0); {7126#true} is VALID [2022-04-15 11:34:47,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {7126#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); {7126#true} is VALID [2022-04-15 11:34:47,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {7126#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); {7126#true} is VALID [2022-04-15 11:34:47,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {7126#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7126#true} is VALID [2022-04-15 11:34:47,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {7126#true} ~skip~0 := 0; {7126#true} is VALID [2022-04-15 11:34:47,739 INFO L290 TraceCheckUtils]: 25: Hoare triple {7126#true} assume !false; {7126#true} is VALID [2022-04-15 11:34:47,742 INFO L290 TraceCheckUtils]: 26: Hoare triple {7126#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); {7126#true} is VALID [2022-04-15 11:34:47,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {7126#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7126#true} is VALID [2022-04-15 11:34:47,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {7126#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7126#true} is VALID [2022-04-15 11:34:47,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {7126#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7126#true} is VALID [2022-04-15 11:34:47,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {7126#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7126#true} is VALID [2022-04-15 11:34:47,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {7126#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7126#true} is VALID [2022-04-15 11:34:47,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {7126#true} assume 4368 == #t~mem54;havoc #t~mem54; {7126#true} is VALID [2022-04-15 11:34:47,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {7126#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; {7126#true} is VALID [2022-04-15 11:34:47,745 INFO L290 TraceCheckUtils]: 34: Hoare triple {7126#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7126#true} is VALID [2022-04-15 11:34:47,747 INFO L290 TraceCheckUtils]: 35: Hoare triple {7126#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); {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:34:47,747 INFO L290 TraceCheckUtils]: 36: Hoare triple {7131#(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; {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:34:47,748 INFO L290 TraceCheckUtils]: 37: Hoare triple {7131#(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); {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:34:47,748 INFO L290 TraceCheckUtils]: 38: Hoare triple {7131#(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; {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:34:47,748 INFO L290 TraceCheckUtils]: 39: Hoare triple {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:34:47,749 INFO L290 TraceCheckUtils]: 40: Hoare triple {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:34:47,749 INFO L290 TraceCheckUtils]: 41: Hoare triple {7131#(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); {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:34:47,749 INFO L290 TraceCheckUtils]: 42: Hoare triple {7131#(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); {7132#(not (= |ssl3_connect_#t~mem50| 16384))} is VALID [2022-04-15 11:34:47,750 INFO L290 TraceCheckUtils]: 43: Hoare triple {7132#(not (= |ssl3_connect_#t~mem50| 16384))} assume 16384 == #t~mem50;havoc #t~mem50; {7127#false} is VALID [2022-04-15 11:34:47,750 INFO L290 TraceCheckUtils]: 44: Hoare triple {7127#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:34:47,751 INFO L290 TraceCheckUtils]: 45: Hoare triple {7127#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7127#false} is VALID [2022-04-15 11:34:47,751 INFO L290 TraceCheckUtils]: 46: Hoare triple {7127#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:34:47,751 INFO L290 TraceCheckUtils]: 47: Hoare triple {7127#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); {7127#false} is VALID [2022-04-15 11:34:47,752 INFO L290 TraceCheckUtils]: 48: Hoare triple {7127#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7127#false} is VALID [2022-04-15 11:34:47,752 INFO L290 TraceCheckUtils]: 49: Hoare triple {7127#false} assume !(0 == ~tmp___4~0); {7127#false} is VALID [2022-04-15 11:34:47,752 INFO L290 TraceCheckUtils]: 50: Hoare triple {7127#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); {7127#false} is VALID [2022-04-15 11:34:47,752 INFO L290 TraceCheckUtils]: 51: Hoare triple {7127#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); {7127#false} is VALID [2022-04-15 11:34:47,752 INFO L290 TraceCheckUtils]: 52: Hoare triple {7127#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7127#false} is VALID [2022-04-15 11:34:47,752 INFO L290 TraceCheckUtils]: 53: Hoare triple {7127#false} ~skip~0 := 0; {7127#false} is VALID [2022-04-15 11:34:47,752 INFO L290 TraceCheckUtils]: 54: Hoare triple {7127#false} assume !false; {7127#false} is VALID [2022-04-15 11:34:47,752 INFO L290 TraceCheckUtils]: 55: Hoare triple {7127#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); {7127#false} is VALID [2022-04-15 11:34:47,752 INFO L290 TraceCheckUtils]: 56: Hoare triple {7127#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:34:47,752 INFO L290 TraceCheckUtils]: 57: Hoare triple {7127#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:34:47,753 INFO L290 TraceCheckUtils]: 58: Hoare triple {7127#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:34:47,753 INFO L290 TraceCheckUtils]: 59: Hoare triple {7127#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:34:47,753 INFO L290 TraceCheckUtils]: 60: Hoare triple {7127#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:34:47,753 INFO L290 TraceCheckUtils]: 61: Hoare triple {7127#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:34:47,753 INFO L290 TraceCheckUtils]: 62: Hoare triple {7127#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:34:47,753 INFO L290 TraceCheckUtils]: 63: Hoare triple {7127#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:34:47,753 INFO L290 TraceCheckUtils]: 64: Hoare triple {7127#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:34:47,753 INFO L290 TraceCheckUtils]: 65: Hoare triple {7127#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:34:47,753 INFO L290 TraceCheckUtils]: 66: Hoare triple {7127#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:34:47,753 INFO L290 TraceCheckUtils]: 67: Hoare triple {7127#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:34:47,753 INFO L290 TraceCheckUtils]: 68: Hoare triple {7127#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:34:47,753 INFO L290 TraceCheckUtils]: 69: Hoare triple {7127#false} assume 4432 == #t~mem62;havoc #t~mem62; {7127#false} is VALID [2022-04-15 11:34:47,753 INFO L290 TraceCheckUtils]: 70: Hoare triple {7127#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {7127#false} is VALID [2022-04-15 11:34:47,754 INFO L290 TraceCheckUtils]: 71: Hoare triple {7127#false} assume 5 == ~blastFlag~0; {7127#false} is VALID [2022-04-15 11:34:47,754 INFO L290 TraceCheckUtils]: 72: Hoare triple {7127#false} assume !false; {7127#false} is VALID [2022-04-15 11:34:47,755 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-15 11:34:47,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:47,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590417044] [2022-04-15 11:34:47,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590417044] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:47,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:47,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:47,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:47,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1851017510] [2022-04-15 11:34:47,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1851017510] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:47,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:47,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:47,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840827594] [2022-04-15 11:34:47,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:47,757 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-15 11:34:47,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:47,759 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-15 11:34:47,816 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-15 11:34:47,816 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:34:47,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:47,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:34:47,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:34:47,817 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-15 11:34:49,836 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:50,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:50,791 INFO L93 Difference]: Finished difference Result 668 states and 995 transitions. [2022-04-15 11:34:50,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:34:50,791 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-15 11:34:50,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:50,792 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-15 11:34:50,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 11:34:50,795 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-15 11:34:50,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 11:34:50,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-15 11:34:51,129 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-15 11:34:51,137 INFO L225 Difference]: With dead ends: 668 [2022-04-15 11:34:51,138 INFO L226 Difference]: Without dead ends: 422 [2022-04-15 11:34:51,138 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:34:51,139 INFO L913 BasicCegarLoop]: 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-15 11:34:51,139 INFO L914 BasicCegarLoop]: 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-15 11:34:51,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-04-15 11:34:51,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 264. [2022-04-15 11:34:51,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:51,149 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-15 11:34:51,150 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-15 11:34:51,150 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-15 11:34:51,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:51,158 INFO L93 Difference]: Finished difference Result 422 states and 625 transitions. [2022-04-15 11:34:51,158 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 625 transitions. [2022-04-15 11:34:51,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:51,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:51,159 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-15 11:34:51,160 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-15 11:34:51,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:51,167 INFO L93 Difference]: Finished difference Result 422 states and 625 transitions. [2022-04-15 11:34:51,167 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 625 transitions. [2022-04-15 11:34:51,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:51,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:51,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:51,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:51,169 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-15 11:34:51,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 388 transitions. [2022-04-15 11:34:51,173 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 388 transitions. Word has length 73 [2022-04-15 11:34:51,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:51,173 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 388 transitions. [2022-04-15 11:34:51,173 INFO L479 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-15 11:34:51,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 388 transitions. [2022-04-15 11:34:51,485 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-15 11:34:51,486 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 388 transitions. [2022-04-15 11:34:51,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 11:34:51,486 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:51,487 INFO L499 BasicCegarLoop]: 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-15 11:34:51,487 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:34:51,487 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:51,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:51,487 INFO L85 PathProgramCache]: Analyzing trace with hash -155040791, now seen corresponding path program 1 times [2022-04-15 11:34:51,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:51,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [573310851] [2022-04-15 11:35:03,245 WARN L232 SmtUtils]: Spent 11.76s 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-15 11:35:15,958 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:35:15,958 INFO L85 PathProgramCache]: Analyzing trace with hash -155040791, now seen corresponding path program 2 times [2022-04-15 11:35:15,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:35:15,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746800155] [2022-04-15 11:35:15,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:35:15,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:35:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:16,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:35:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:16,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {9853#(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); {9846#true} is VALID [2022-04-15 11:35:16,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {9846#true} assume true; {9846#true} is VALID [2022-04-15 11:35:16,113 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9846#true} {9846#true} #593#return; {9846#true} is VALID [2022-04-15 11:35:16,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {9846#true} call ULTIMATE.init(); {9853#(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-15 11:35:16,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {9853#(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); {9846#true} is VALID [2022-04-15 11:35:16,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {9846#true} assume true; {9846#true} is VALID [2022-04-15 11:35:16,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9846#true} {9846#true} #593#return; {9846#true} is VALID [2022-04-15 11:35:16,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {9846#true} call #t~ret158 := main(); {9846#true} is VALID [2022-04-15 11:35:16,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {9846#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; {9846#true} is VALID [2022-04-15 11:35:16,115 INFO L272 TraceCheckUtils]: 6: Hoare triple {9846#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {9846#true} is VALID [2022-04-15 11:35:16,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {9846#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); {9846#true} is VALID [2022-04-15 11:35:16,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {9846#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; {9846#true} is VALID [2022-04-15 11:35:16,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {9846#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; {9846#true} is VALID [2022-04-15 11:35:16,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {9846#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9846#true} is VALID [2022-04-15 11:35:16,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {9846#true} assume !false; {9846#true} is VALID [2022-04-15 11:35:16,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {9846#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); {9846#true} is VALID [2022-04-15 11:35:16,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {9846#true} assume 12292 == #t~mem49;havoc #t~mem49; {9846#true} is VALID [2022-04-15 11:35:16,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {9846#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; {9846#true} is VALID [2022-04-15 11:35:16,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {9846#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9846#true} is VALID [2022-04-15 11:35:16,116 INFO L290 TraceCheckUtils]: 16: Hoare triple {9846#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9846#true} is VALID [2022-04-15 11:35:16,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {9846#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9846#true} is VALID [2022-04-15 11:35:16,117 INFO L290 TraceCheckUtils]: 18: Hoare triple {9846#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); {9846#true} is VALID [2022-04-15 11:35:16,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {9846#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9846#true} is VALID [2022-04-15 11:35:16,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {9846#true} assume !(0 == ~tmp___4~0); {9846#true} is VALID [2022-04-15 11:35:16,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {9846#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); {9846#true} is VALID [2022-04-15 11:35:16,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {9846#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); {9846#true} is VALID [2022-04-15 11:35:16,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {9846#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9846#true} is VALID [2022-04-15 11:35:16,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {9846#true} ~skip~0 := 0; {9846#true} is VALID [2022-04-15 11:35:16,117 INFO L290 TraceCheckUtils]: 25: Hoare triple {9846#true} assume !false; {9846#true} is VALID [2022-04-15 11:35:16,117 INFO L290 TraceCheckUtils]: 26: Hoare triple {9846#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); {9846#true} is VALID [2022-04-15 11:35:16,117 INFO L290 TraceCheckUtils]: 27: Hoare triple {9846#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9846#true} is VALID [2022-04-15 11:35:16,117 INFO L290 TraceCheckUtils]: 28: Hoare triple {9846#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9846#true} is VALID [2022-04-15 11:35:16,117 INFO L290 TraceCheckUtils]: 29: Hoare triple {9846#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9846#true} is VALID [2022-04-15 11:35:16,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {9846#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9846#true} is VALID [2022-04-15 11:35:16,118 INFO L290 TraceCheckUtils]: 31: Hoare triple {9846#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9846#true} is VALID [2022-04-15 11:35:16,118 INFO L290 TraceCheckUtils]: 32: Hoare triple {9846#true} assume 4368 == #t~mem54;havoc #t~mem54; {9846#true} is VALID [2022-04-15 11:35:16,118 INFO L290 TraceCheckUtils]: 33: Hoare triple {9846#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; {9846#true} is VALID [2022-04-15 11:35:16,118 INFO L290 TraceCheckUtils]: 34: Hoare triple {9846#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9846#true} is VALID [2022-04-15 11:35:16,119 INFO L290 TraceCheckUtils]: 35: Hoare triple {9846#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); {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:35:16,119 INFO L290 TraceCheckUtils]: 36: Hoare triple {9851#(= 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; {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:35:16,119 INFO L290 TraceCheckUtils]: 37: Hoare triple {9851#(= 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); {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:35:16,120 INFO L290 TraceCheckUtils]: 38: Hoare triple {9851#(= 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; {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:35:16,120 INFO L290 TraceCheckUtils]: 39: Hoare triple {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:35:16,120 INFO L290 TraceCheckUtils]: 40: Hoare triple {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:35:16,121 INFO L290 TraceCheckUtils]: 41: Hoare triple {9851#(= 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); {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:35:16,121 INFO L290 TraceCheckUtils]: 42: Hoare triple {9851#(= 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); {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:35:16,121 INFO L290 TraceCheckUtils]: 43: Hoare triple {9851#(= 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); {9852#(= |ssl3_connect_#t~mem51| 4384)} is VALID [2022-04-15 11:35:16,122 INFO L290 TraceCheckUtils]: 44: Hoare triple {9852#(= |ssl3_connect_#t~mem51| 4384)} assume 4096 == #t~mem51;havoc #t~mem51; {9847#false} is VALID [2022-04-15 11:35:16,122 INFO L290 TraceCheckUtils]: 45: Hoare triple {9847#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:35:16,122 INFO L290 TraceCheckUtils]: 46: Hoare triple {9847#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9847#false} is VALID [2022-04-15 11:35:16,122 INFO L290 TraceCheckUtils]: 47: Hoare triple {9847#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:35:16,122 INFO L290 TraceCheckUtils]: 48: Hoare triple {9847#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); {9847#false} is VALID [2022-04-15 11:35:16,122 INFO L290 TraceCheckUtils]: 49: Hoare triple {9847#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9847#false} is VALID [2022-04-15 11:35:16,122 INFO L290 TraceCheckUtils]: 50: Hoare triple {9847#false} assume !(0 == ~tmp___4~0); {9847#false} is VALID [2022-04-15 11:35:16,122 INFO L290 TraceCheckUtils]: 51: Hoare triple {9847#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); {9847#false} is VALID [2022-04-15 11:35:16,126 INFO L290 TraceCheckUtils]: 52: Hoare triple {9847#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); {9847#false} is VALID [2022-04-15 11:35:16,127 INFO L290 TraceCheckUtils]: 53: Hoare triple {9847#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9847#false} is VALID [2022-04-15 11:35:16,127 INFO L290 TraceCheckUtils]: 54: Hoare triple {9847#false} ~skip~0 := 0; {9847#false} is VALID [2022-04-15 11:35:16,127 INFO L290 TraceCheckUtils]: 55: Hoare triple {9847#false} assume !false; {9847#false} is VALID [2022-04-15 11:35:16,127 INFO L290 TraceCheckUtils]: 56: Hoare triple {9847#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); {9847#false} is VALID [2022-04-15 11:35:16,127 INFO L290 TraceCheckUtils]: 57: Hoare triple {9847#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:35:16,127 INFO L290 TraceCheckUtils]: 58: Hoare triple {9847#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:35:16,127 INFO L290 TraceCheckUtils]: 59: Hoare triple {9847#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:35:16,127 INFO L290 TraceCheckUtils]: 60: Hoare triple {9847#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:35:16,127 INFO L290 TraceCheckUtils]: 61: Hoare triple {9847#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:35:16,127 INFO L290 TraceCheckUtils]: 62: Hoare triple {9847#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:35:16,127 INFO L290 TraceCheckUtils]: 63: Hoare triple {9847#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:35:16,127 INFO L290 TraceCheckUtils]: 64: Hoare triple {9847#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:35:16,127 INFO L290 TraceCheckUtils]: 65: Hoare triple {9847#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:35:16,128 INFO L290 TraceCheckUtils]: 66: Hoare triple {9847#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:35:16,128 INFO L290 TraceCheckUtils]: 67: Hoare triple {9847#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:35:16,128 INFO L290 TraceCheckUtils]: 68: Hoare triple {9847#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:35:16,128 INFO L290 TraceCheckUtils]: 69: Hoare triple {9847#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:35:16,128 INFO L290 TraceCheckUtils]: 70: Hoare triple {9847#false} assume 4432 == #t~mem62;havoc #t~mem62; {9847#false} is VALID [2022-04-15 11:35:16,128 INFO L290 TraceCheckUtils]: 71: Hoare triple {9847#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {9847#false} is VALID [2022-04-15 11:35:16,128 INFO L290 TraceCheckUtils]: 72: Hoare triple {9847#false} assume 5 == ~blastFlag~0; {9847#false} is VALID [2022-04-15 11:35:16,129 INFO L290 TraceCheckUtils]: 73: Hoare triple {9847#false} assume !false; {9847#false} is VALID [2022-04-15 11:35:16,129 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-15 11:35:16,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:35:16,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746800155] [2022-04-15 11:35:16,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746800155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:16,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:16,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:35:16,130 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:35:16,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [573310851] [2022-04-15 11:35:16,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [573310851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:16,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:16,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:35:16,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245614790] [2022-04-15 11:35:16,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:35:16,130 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-15 11:35:16,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:35:16,131 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-15 11:35:16,187 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-15 11:35:16,187 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:35:16,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:16,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:35:16,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:35:16,188 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-15 11:35:18,207 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:35:19,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:19,098 INFO L93 Difference]: Finished difference Result 416 states and 614 transitions. [2022-04-15 11:35:19,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:35:19,099 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-15 11:35:19,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:35:19,099 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-15 11:35:19,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-15 11:35:19,101 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-15 11:35:19,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-15 11:35:19,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 384 transitions. [2022-04-15 11:35:19,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 384 edges. 384 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:35:19,337 INFO L225 Difference]: With dead ends: 416 [2022-04-15 11:35:19,337 INFO L226 Difference]: Without dead ends: 281 [2022-04-15 11:35:19,337 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:35:19,338 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 35 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:35:19,338 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 482 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 351 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:35:19,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-15 11:35:19,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 264. [2022-04-15 11:35:19,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:35:19,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 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-15 11:35:19,347 INFO L74 IsIncluded]: Start isIncluded. First operand 281 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-15 11:35:19,347 INFO L87 Difference]: Start difference. First operand 281 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-15 11:35:19,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:19,351 INFO L93 Difference]: Finished difference Result 281 states and 410 transitions. [2022-04-15 11:35:19,351 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 410 transitions. [2022-04-15 11:35:19,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:19,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:19,352 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 281 states. [2022-04-15 11:35:19,353 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 281 states. [2022-04-15 11:35:19,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:19,357 INFO L93 Difference]: Finished difference Result 281 states and 410 transitions. [2022-04-15 11:35:19,357 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 410 transitions. [2022-04-15 11:35:19,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:19,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:19,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:35:19,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:35:19,358 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-15 11:35:19,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 387 transitions. [2022-04-15 11:35:19,362 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 387 transitions. Word has length 74 [2022-04-15 11:35:19,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:35:19,362 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 387 transitions. [2022-04-15 11:35:19,362 INFO L479 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-15 11:35:19,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 387 transitions. [2022-04-15 11:35:19,689 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-15 11:35:19,689 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 387 transitions. [2022-04-15 11:35:19,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 11:35:19,690 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:35:19,690 INFO L499 BasicCegarLoop]: 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-15 11:35:19,690 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:35:19,690 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:35:19,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:35:19,690 INFO L85 PathProgramCache]: Analyzing trace with hash -400323519, now seen corresponding path program 1 times [2022-04-15 11:35:19,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:19,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1117858589] [2022-04-15 11:35:35,377 WARN L232 SmtUtils]: Spent 11.50s 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-15 11:35:43,113 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:35:43,113 INFO L85 PathProgramCache]: Analyzing trace with hash -400323519, now seen corresponding path program 2 times [2022-04-15 11:35:43,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:35:43,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119105939] [2022-04-15 11:35:43,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:35:43,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:35:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:43,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:35:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:43,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {11787#(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); {11780#true} is VALID [2022-04-15 11:35:43,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {11780#true} assume true; {11780#true} is VALID [2022-04-15 11:35:43,297 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11780#true} {11780#true} #593#return; {11780#true} is VALID [2022-04-15 11:35:43,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {11780#true} call ULTIMATE.init(); {11787#(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-15 11:35:43,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {11787#(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); {11780#true} is VALID [2022-04-15 11:35:43,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {11780#true} assume true; {11780#true} is VALID [2022-04-15 11:35:43,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11780#true} {11780#true} #593#return; {11780#true} is VALID [2022-04-15 11:35:43,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {11780#true} call #t~ret158 := main(); {11780#true} is VALID [2022-04-15 11:35:43,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {11780#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; {11780#true} is VALID [2022-04-15 11:35:43,300 INFO L272 TraceCheckUtils]: 6: Hoare triple {11780#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {11780#true} is VALID [2022-04-15 11:35:43,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {11780#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); {11780#true} is VALID [2022-04-15 11:35:43,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {11780#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; {11780#true} is VALID [2022-04-15 11:35:43,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {11780#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; {11780#true} is VALID [2022-04-15 11:35:43,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {11780#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11780#true} is VALID [2022-04-15 11:35:43,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {11780#true} assume !false; {11780#true} is VALID [2022-04-15 11:35:43,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {11780#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); {11780#true} is VALID [2022-04-15 11:35:43,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {11780#true} assume 12292 == #t~mem49;havoc #t~mem49; {11780#true} is VALID [2022-04-15 11:35:43,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {11780#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; {11780#true} is VALID [2022-04-15 11:35:43,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {11780#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11780#true} is VALID [2022-04-15 11:35:43,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {11780#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11780#true} is VALID [2022-04-15 11:35:43,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {11780#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11780#true} is VALID [2022-04-15 11:35:43,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {11780#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); {11780#true} is VALID [2022-04-15 11:35:43,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {11780#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {11780#true} is VALID [2022-04-15 11:35:43,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {11780#true} assume !(0 == ~tmp___4~0); {11780#true} is VALID [2022-04-15 11:35:43,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {11780#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); {11780#true} is VALID [2022-04-15 11:35:43,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {11780#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); {11780#true} is VALID [2022-04-15 11:35:43,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {11780#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11780#true} is VALID [2022-04-15 11:35:43,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {11780#true} ~skip~0 := 0; {11780#true} is VALID [2022-04-15 11:35:43,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {11780#true} assume !false; {11780#true} is VALID [2022-04-15 11:35:43,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {11780#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); {11780#true} is VALID [2022-04-15 11:35:43,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {11780#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11780#true} is VALID [2022-04-15 11:35:43,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {11780#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11780#true} is VALID [2022-04-15 11:35:43,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {11780#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11780#true} is VALID [2022-04-15 11:35:43,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {11780#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11780#true} is VALID [2022-04-15 11:35:43,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {11780#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11780#true} is VALID [2022-04-15 11:35:43,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {11780#true} assume 4368 == #t~mem54;havoc #t~mem54; {11780#true} is VALID [2022-04-15 11:35:43,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {11780#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; {11780#true} is VALID [2022-04-15 11:35:43,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {11780#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11780#true} is VALID [2022-04-15 11:35:43,303 INFO L290 TraceCheckUtils]: 35: Hoare triple {11780#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); {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:35:43,303 INFO L290 TraceCheckUtils]: 36: Hoare triple {11785#(= 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; {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:35:43,304 INFO L290 TraceCheckUtils]: 37: Hoare triple {11785#(= 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); {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:35:43,304 INFO L290 TraceCheckUtils]: 38: Hoare triple {11785#(= 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; {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:35:43,304 INFO L290 TraceCheckUtils]: 39: Hoare triple {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:35:43,305 INFO L290 TraceCheckUtils]: 40: Hoare triple {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:35:43,306 INFO L290 TraceCheckUtils]: 41: Hoare triple {11785#(= 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); {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:35:43,306 INFO L290 TraceCheckUtils]: 42: Hoare triple {11785#(= 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); {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:35:43,306 INFO L290 TraceCheckUtils]: 43: Hoare triple {11785#(= 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); {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:35:43,307 INFO L290 TraceCheckUtils]: 44: Hoare triple {11785#(= 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); {11786#(= |ssl3_connect_#t~mem52| 4384)} is VALID [2022-04-15 11:35:43,307 INFO L290 TraceCheckUtils]: 45: Hoare triple {11786#(= |ssl3_connect_#t~mem52| 4384)} assume 20480 == #t~mem52;havoc #t~mem52; {11781#false} is VALID [2022-04-15 11:35:43,307 INFO L290 TraceCheckUtils]: 46: Hoare triple {11781#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:35:43,307 INFO L290 TraceCheckUtils]: 47: Hoare triple {11781#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11781#false} is VALID [2022-04-15 11:35:43,307 INFO L290 TraceCheckUtils]: 48: Hoare triple {11781#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:35:43,307 INFO L290 TraceCheckUtils]: 49: Hoare triple {11781#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); {11781#false} is VALID [2022-04-15 11:35:43,307 INFO L290 TraceCheckUtils]: 50: Hoare triple {11781#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {11781#false} is VALID [2022-04-15 11:35:43,308 INFO L290 TraceCheckUtils]: 51: Hoare triple {11781#false} assume !(0 == ~tmp___4~0); {11781#false} is VALID [2022-04-15 11:35:43,308 INFO L290 TraceCheckUtils]: 52: Hoare triple {11781#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); {11781#false} is VALID [2022-04-15 11:35:43,308 INFO L290 TraceCheckUtils]: 53: Hoare triple {11781#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); {11781#false} is VALID [2022-04-15 11:35:43,308 INFO L290 TraceCheckUtils]: 54: Hoare triple {11781#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11781#false} is VALID [2022-04-15 11:35:43,308 INFO L290 TraceCheckUtils]: 55: Hoare triple {11781#false} ~skip~0 := 0; {11781#false} is VALID [2022-04-15 11:35:43,308 INFO L290 TraceCheckUtils]: 56: Hoare triple {11781#false} assume !false; {11781#false} is VALID [2022-04-15 11:35:43,308 INFO L290 TraceCheckUtils]: 57: Hoare triple {11781#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); {11781#false} is VALID [2022-04-15 11:35:43,308 INFO L290 TraceCheckUtils]: 58: Hoare triple {11781#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:35:43,308 INFO L290 TraceCheckUtils]: 59: Hoare triple {11781#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:35:43,308 INFO L290 TraceCheckUtils]: 60: Hoare triple {11781#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:35:43,308 INFO L290 TraceCheckUtils]: 61: Hoare triple {11781#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:35:43,308 INFO L290 TraceCheckUtils]: 62: Hoare triple {11781#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:35:43,308 INFO L290 TraceCheckUtils]: 63: Hoare triple {11781#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:35:43,309 INFO L290 TraceCheckUtils]: 64: Hoare triple {11781#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:35:43,309 INFO L290 TraceCheckUtils]: 65: Hoare triple {11781#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:35:43,309 INFO L290 TraceCheckUtils]: 66: Hoare triple {11781#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:35:43,309 INFO L290 TraceCheckUtils]: 67: Hoare triple {11781#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:35:43,309 INFO L290 TraceCheckUtils]: 68: Hoare triple {11781#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:35:43,309 INFO L290 TraceCheckUtils]: 69: Hoare triple {11781#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:35:43,309 INFO L290 TraceCheckUtils]: 70: Hoare triple {11781#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:35:43,309 INFO L290 TraceCheckUtils]: 71: Hoare triple {11781#false} assume 4432 == #t~mem62;havoc #t~mem62; {11781#false} is VALID [2022-04-15 11:35:43,309 INFO L290 TraceCheckUtils]: 72: Hoare triple {11781#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {11781#false} is VALID [2022-04-15 11:35:43,309 INFO L290 TraceCheckUtils]: 73: Hoare triple {11781#false} assume 5 == ~blastFlag~0; {11781#false} is VALID [2022-04-15 11:35:43,309 INFO L290 TraceCheckUtils]: 74: Hoare triple {11781#false} assume !false; {11781#false} is VALID [2022-04-15 11:35:43,310 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-15 11:35:43,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:35:43,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119105939] [2022-04-15 11:35:43,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119105939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:43,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:43,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:35:43,311 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:35:43,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1117858589] [2022-04-15 11:35:43,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1117858589] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:43,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:43,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:35:43,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737780226] [2022-04-15 11:35:43,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:35:43,312 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-15 11:35:43,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:35:43,312 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-15 11:35:43,369 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-15 11:35:43,369 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:35:43,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:43,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:35:43,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:35:43,370 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-15 11:35:45,392 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:35:46,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:46,236 INFO L93 Difference]: Finished difference Result 416 states and 612 transitions. [2022-04-15 11:35:46,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:35:46,236 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-15 11:35:46,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:35:46,236 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-15 11:35:46,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2022-04-15 11:35:46,238 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-15 11:35:46,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2022-04-15 11:35:46,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 383 transitions. [2022-04-15 11:35:46,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 383 edges. 383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:35:46,511 INFO L225 Difference]: With dead ends: 416 [2022-04-15 11:35:46,511 INFO L226 Difference]: Without dead ends: 281 [2022-04-15 11:35:46,511 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:35:46,512 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 33 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:35:46,512 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 480 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 350 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:35:46,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-15 11:35:46,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 264. [2022-04-15 11:35:46,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:35:46,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 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-15 11:35:46,522 INFO L74 IsIncluded]: Start isIncluded. First operand 281 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-15 11:35:46,523 INFO L87 Difference]: Start difference. First operand 281 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-15 11:35:46,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:46,527 INFO L93 Difference]: Finished difference Result 281 states and 409 transitions. [2022-04-15 11:35:46,527 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 409 transitions. [2022-04-15 11:35:46,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:46,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:46,528 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 281 states. [2022-04-15 11:35:46,529 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 281 states. [2022-04-15 11:35:46,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:46,533 INFO L93 Difference]: Finished difference Result 281 states and 409 transitions. [2022-04-15 11:35:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 409 transitions. [2022-04-15 11:35:46,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:46,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:46,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:35:46,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:35:46,534 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-15 11:35:46,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 386 transitions. [2022-04-15 11:35:46,538 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 386 transitions. Word has length 75 [2022-04-15 11:35:46,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:35:46,539 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 386 transitions. [2022-04-15 11:35:46,539 INFO L479 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-15 11:35:46,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 386 transitions. [2022-04-15 11:35:46,836 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-15 11:35:46,837 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 386 transitions. [2022-04-15 11:35:46,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-15 11:35:46,838 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:35:46,838 INFO L499 BasicCegarLoop]: 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-15 11:35:46,838 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:35:46,838 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:35:46,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:35:46,839 INFO L85 PathProgramCache]: Analyzing trace with hash 642427140, now seen corresponding path program 1 times [2022-04-15 11:35:46,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:46,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [57668804] [2022-04-15 11:36:00,967 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-15 11:36:07,419 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:36:07,420 INFO L85 PathProgramCache]: Analyzing trace with hash 642427140, now seen corresponding path program 2 times [2022-04-15 11:36:07,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:36:07,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390151916] [2022-04-15 11:36:07,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:36:07,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:36:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:07,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:36:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:07,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {13721#(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); {13714#true} is VALID [2022-04-15 11:36:07,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {13714#true} assume true; {13714#true} is VALID [2022-04-15 11:36:07,608 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13714#true} {13714#true} #593#return; {13714#true} is VALID [2022-04-15 11:36:07,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {13714#true} call ULTIMATE.init(); {13721#(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-15 11:36:07,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {13721#(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); {13714#true} is VALID [2022-04-15 11:36:07,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {13714#true} assume true; {13714#true} is VALID [2022-04-15 11:36:07,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13714#true} {13714#true} #593#return; {13714#true} is VALID [2022-04-15 11:36:07,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {13714#true} call #t~ret158 := main(); {13714#true} is VALID [2022-04-15 11:36:07,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {13714#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; {13714#true} is VALID [2022-04-15 11:36:07,609 INFO L272 TraceCheckUtils]: 6: Hoare triple {13714#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {13714#true} is VALID [2022-04-15 11:36:07,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {13714#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); {13714#true} is VALID [2022-04-15 11:36:07,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {13714#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; {13714#true} is VALID [2022-04-15 11:36:07,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {13714#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; {13714#true} is VALID [2022-04-15 11:36:07,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {13714#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {13714#true} is VALID [2022-04-15 11:36:07,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {13714#true} assume !false; {13714#true} is VALID [2022-04-15 11:36:07,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {13714#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); {13714#true} is VALID [2022-04-15 11:36:07,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {13714#true} assume 12292 == #t~mem49;havoc #t~mem49; {13714#true} is VALID [2022-04-15 11:36:07,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {13714#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; {13714#true} is VALID [2022-04-15 11:36:07,610 INFO L290 TraceCheckUtils]: 15: Hoare triple {13714#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13714#true} is VALID [2022-04-15 11:36:07,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {13714#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13714#true} is VALID [2022-04-15 11:36:07,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {13714#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {13714#true} is VALID [2022-04-15 11:36:07,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {13714#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); {13714#true} is VALID [2022-04-15 11:36:07,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {13714#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {13714#true} is VALID [2022-04-15 11:36:07,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {13714#true} assume !(0 == ~tmp___4~0); {13714#true} is VALID [2022-04-15 11:36:07,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {13714#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); {13714#true} is VALID [2022-04-15 11:36:07,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {13714#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); {13714#true} is VALID [2022-04-15 11:36:07,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {13714#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {13714#true} is VALID [2022-04-15 11:36:07,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {13714#true} ~skip~0 := 0; {13714#true} is VALID [2022-04-15 11:36:07,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {13714#true} assume !false; {13714#true} is VALID [2022-04-15 11:36:07,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {13714#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); {13714#true} is VALID [2022-04-15 11:36:07,611 INFO L290 TraceCheckUtils]: 27: Hoare triple {13714#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13714#true} is VALID [2022-04-15 11:36:07,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {13714#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13714#true} is VALID [2022-04-15 11:36:07,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {13714#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13714#true} is VALID [2022-04-15 11:36:07,611 INFO L290 TraceCheckUtils]: 30: Hoare triple {13714#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13714#true} is VALID [2022-04-15 11:36:07,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {13714#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13714#true} is VALID [2022-04-15 11:36:07,611 INFO L290 TraceCheckUtils]: 32: Hoare triple {13714#true} assume 4368 == #t~mem54;havoc #t~mem54; {13714#true} is VALID [2022-04-15 11:36:07,611 INFO L290 TraceCheckUtils]: 33: Hoare triple {13714#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; {13714#true} is VALID [2022-04-15 11:36:07,612 INFO L290 TraceCheckUtils]: 34: Hoare triple {13714#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {13714#true} is VALID [2022-04-15 11:36:07,613 INFO L290 TraceCheckUtils]: 35: Hoare triple {13714#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); {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:07,613 INFO L290 TraceCheckUtils]: 36: Hoare triple {13719#(= 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; {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:07,613 INFO L290 TraceCheckUtils]: 37: Hoare triple {13719#(= 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); {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:07,614 INFO L290 TraceCheckUtils]: 38: Hoare triple {13719#(= 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; {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:07,614 INFO L290 TraceCheckUtils]: 39: Hoare triple {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:07,614 INFO L290 TraceCheckUtils]: 40: Hoare triple {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:07,615 INFO L290 TraceCheckUtils]: 41: Hoare triple {13719#(= 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); {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:07,615 INFO L290 TraceCheckUtils]: 42: Hoare triple {13719#(= 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); {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:07,615 INFO L290 TraceCheckUtils]: 43: Hoare triple {13719#(= 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); {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:07,615 INFO L290 TraceCheckUtils]: 44: Hoare triple {13719#(= 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); {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:07,616 INFO L290 TraceCheckUtils]: 45: Hoare triple {13719#(= 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); {13720#(= |ssl3_connect_#t~mem53| 4384)} is VALID [2022-04-15 11:36:07,616 INFO L290 TraceCheckUtils]: 46: Hoare triple {13720#(= |ssl3_connect_#t~mem53| 4384)} assume 4099 == #t~mem53;havoc #t~mem53; {13715#false} is VALID [2022-04-15 11:36:07,616 INFO L290 TraceCheckUtils]: 47: Hoare triple {13715#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:36:07,616 INFO L290 TraceCheckUtils]: 48: Hoare triple {13715#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13715#false} is VALID [2022-04-15 11:36:07,616 INFO L290 TraceCheckUtils]: 49: Hoare triple {13715#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:36:07,616 INFO L290 TraceCheckUtils]: 50: Hoare triple {13715#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); {13715#false} is VALID [2022-04-15 11:36:07,617 INFO L290 TraceCheckUtils]: 51: Hoare triple {13715#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {13715#false} is VALID [2022-04-15 11:36:07,617 INFO L290 TraceCheckUtils]: 52: Hoare triple {13715#false} assume !(0 == ~tmp___4~0); {13715#false} is VALID [2022-04-15 11:36:07,617 INFO L290 TraceCheckUtils]: 53: Hoare triple {13715#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); {13715#false} is VALID [2022-04-15 11:36:07,617 INFO L290 TraceCheckUtils]: 54: Hoare triple {13715#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); {13715#false} is VALID [2022-04-15 11:36:07,617 INFO L290 TraceCheckUtils]: 55: Hoare triple {13715#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {13715#false} is VALID [2022-04-15 11:36:07,617 INFO L290 TraceCheckUtils]: 56: Hoare triple {13715#false} ~skip~0 := 0; {13715#false} is VALID [2022-04-15 11:36:07,617 INFO L290 TraceCheckUtils]: 57: Hoare triple {13715#false} assume !false; {13715#false} is VALID [2022-04-15 11:36:07,617 INFO L290 TraceCheckUtils]: 58: Hoare triple {13715#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); {13715#false} is VALID [2022-04-15 11:36:07,617 INFO L290 TraceCheckUtils]: 59: Hoare triple {13715#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:36:07,617 INFO L290 TraceCheckUtils]: 60: Hoare triple {13715#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:36:07,617 INFO L290 TraceCheckUtils]: 61: Hoare triple {13715#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:36:07,617 INFO L290 TraceCheckUtils]: 62: Hoare triple {13715#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:36:07,617 INFO L290 TraceCheckUtils]: 63: Hoare triple {13715#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:36:07,617 INFO L290 TraceCheckUtils]: 64: Hoare triple {13715#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:36:07,618 INFO L290 TraceCheckUtils]: 65: Hoare triple {13715#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:36:07,618 INFO L290 TraceCheckUtils]: 66: Hoare triple {13715#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:36:07,618 INFO L290 TraceCheckUtils]: 67: Hoare triple {13715#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:36:07,618 INFO L290 TraceCheckUtils]: 68: Hoare triple {13715#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:36:07,618 INFO L290 TraceCheckUtils]: 69: Hoare triple {13715#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:36:07,618 INFO L290 TraceCheckUtils]: 70: Hoare triple {13715#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:36:07,618 INFO L290 TraceCheckUtils]: 71: Hoare triple {13715#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:36:07,618 INFO L290 TraceCheckUtils]: 72: Hoare triple {13715#false} assume 4432 == #t~mem62;havoc #t~mem62; {13715#false} is VALID [2022-04-15 11:36:07,618 INFO L290 TraceCheckUtils]: 73: Hoare triple {13715#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {13715#false} is VALID [2022-04-15 11:36:07,618 INFO L290 TraceCheckUtils]: 74: Hoare triple {13715#false} assume 5 == ~blastFlag~0; {13715#false} is VALID [2022-04-15 11:36:07,618 INFO L290 TraceCheckUtils]: 75: Hoare triple {13715#false} assume !false; {13715#false} is VALID [2022-04-15 11:36:07,619 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-15 11:36:07,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:36:07,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390151916] [2022-04-15 11:36:07,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390151916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:07,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:07,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:36:07,619 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:36:07,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [57668804] [2022-04-15 11:36:07,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [57668804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:07,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:07,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:36:07,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57266266] [2022-04-15 11:36:07,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:36:07,620 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-15 11:36:07,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:36:07,620 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-15 11:36:07,674 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-15 11:36:07,674 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:36:07,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:07,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:36:07,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:36:07,675 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-15 11:36:09,696 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:36:10,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:10,422 INFO L93 Difference]: Finished difference Result 407 states and 599 transitions. [2022-04-15 11:36:10,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:36:10,422 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-15 11:36:10,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:36:10,423 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-15 11:36:10,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 371 transitions. [2022-04-15 11:36:10,424 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-15 11:36:10,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 371 transitions. [2022-04-15 11:36:10,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 371 transitions. [2022-04-15 11:36:10,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 371 edges. 371 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:10,692 INFO L225 Difference]: With dead ends: 407 [2022-04-15 11:36:10,692 INFO L226 Difference]: Without dead ends: 272 [2022-04-15 11:36:10,692 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:36:10,693 INFO L913 BasicCegarLoop]: 189 mSDtfsCounter, 24 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:36:10,693 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 466 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 327 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 11:36:10,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-04-15 11:36:10,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 264. [2022-04-15 11:36:10,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:36:10,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 272 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-15 11:36:10,701 INFO L74 IsIncluded]: Start isIncluded. First operand 272 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-15 11:36:10,702 INFO L87 Difference]: Start difference. First operand 272 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-15 11:36:10,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:10,705 INFO L93 Difference]: Finished difference Result 272 states and 397 transitions. [2022-04-15 11:36:10,705 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 397 transitions. [2022-04-15 11:36:10,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:10,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:10,706 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 272 states. [2022-04-15 11:36:10,707 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 272 states. [2022-04-15 11:36:10,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:10,710 INFO L93 Difference]: Finished difference Result 272 states and 397 transitions. [2022-04-15 11:36:10,710 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 397 transitions. [2022-04-15 11:36:10,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:10,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:10,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:36:10,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:36:10,711 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-15 11:36:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 385 transitions. [2022-04-15 11:36:10,715 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 385 transitions. Word has length 76 [2022-04-15 11:36:10,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:36:10,716 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 385 transitions. [2022-04-15 11:36:10,716 INFO L479 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-15 11:36:10,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 385 transitions. [2022-04-15 11:36:11,008 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-15 11:36:11,008 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 385 transitions. [2022-04-15 11:36:11,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 11:36:11,009 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:36:11,009 INFO L499 BasicCegarLoop]: 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-15 11:36:11,009 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:36:11,009 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:36:11,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:36:11,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1188358039, now seen corresponding path program 1 times [2022-04-15 11:36:11,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:11,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1915575854] [2022-04-15 11:36:11,010 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:36:11,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1188358039, now seen corresponding path program 2 times [2022-04-15 11:36:11,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:36:11,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229133945] [2022-04-15 11:36:11,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:36:11,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:36:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:11,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:36:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:11,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {15618#(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); {15612#true} is VALID [2022-04-15 11:36:11,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {15612#true} assume true; {15612#true} is VALID [2022-04-15 11:36:11,142 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15612#true} {15612#true} #593#return; {15612#true} is VALID [2022-04-15 11:36:11,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {15612#true} call ULTIMATE.init(); {15618#(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-15 11:36:11,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {15618#(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); {15612#true} is VALID [2022-04-15 11:36:11,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {15612#true} assume true; {15612#true} is VALID [2022-04-15 11:36:11,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15612#true} {15612#true} #593#return; {15612#true} is VALID [2022-04-15 11:36:11,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {15612#true} call #t~ret158 := main(); {15612#true} is VALID [2022-04-15 11:36:11,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {15612#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; {15612#true} is VALID [2022-04-15 11:36:11,144 INFO L272 TraceCheckUtils]: 6: Hoare triple {15612#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {15612#true} is VALID [2022-04-15 11:36:11,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {15612#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); {15612#true} is VALID [2022-04-15 11:36:11,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {15612#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; {15612#true} is VALID [2022-04-15 11:36:11,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {15612#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; {15612#true} is VALID [2022-04-15 11:36:11,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {15612#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15612#true} is VALID [2022-04-15 11:36:11,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {15612#true} assume !false; {15612#true} is VALID [2022-04-15 11:36:11,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {15612#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); {15612#true} is VALID [2022-04-15 11:36:11,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {15612#true} assume 12292 == #t~mem49;havoc #t~mem49; {15612#true} is VALID [2022-04-15 11:36:11,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {15612#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; {15612#true} is VALID [2022-04-15 11:36:11,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {15612#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:36:11,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {15612#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15612#true} is VALID [2022-04-15 11:36:11,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {15612#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:36:11,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {15612#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); {15612#true} is VALID [2022-04-15 11:36:11,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {15612#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {15612#true} is VALID [2022-04-15 11:36:11,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {15612#true} assume !(0 == ~tmp___4~0); {15612#true} is VALID [2022-04-15 11:36:11,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {15612#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); {15612#true} is VALID [2022-04-15 11:36:11,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {15612#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); {15612#true} is VALID [2022-04-15 11:36:11,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {15612#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15612#true} is VALID [2022-04-15 11:36:11,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {15612#true} ~skip~0 := 0; {15612#true} is VALID [2022-04-15 11:36:11,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {15612#true} assume !false; {15612#true} is VALID [2022-04-15 11:36:11,145 INFO L290 TraceCheckUtils]: 26: Hoare triple {15612#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); {15612#true} is VALID [2022-04-15 11:36:11,145 INFO L290 TraceCheckUtils]: 27: Hoare triple {15612#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:36:11,145 INFO L290 TraceCheckUtils]: 28: Hoare triple {15612#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:36:11,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {15612#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:36:11,145 INFO L290 TraceCheckUtils]: 30: Hoare triple {15612#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:36:11,146 INFO L290 TraceCheckUtils]: 31: Hoare triple {15612#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:36:11,146 INFO L290 TraceCheckUtils]: 32: Hoare triple {15612#true} assume 4368 == #t~mem54;havoc #t~mem54; {15612#true} is VALID [2022-04-15 11:36:11,146 INFO L290 TraceCheckUtils]: 33: Hoare triple {15612#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; {15612#true} is VALID [2022-04-15 11:36:11,146 INFO L290 TraceCheckUtils]: 34: Hoare triple {15612#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15612#true} is VALID [2022-04-15 11:36:11,146 INFO L290 TraceCheckUtils]: 35: Hoare triple {15612#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); {15612#true} is VALID [2022-04-15 11:36:11,146 INFO L290 TraceCheckUtils]: 36: Hoare triple {15612#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; {15612#true} is VALID [2022-04-15 11:36:11,146 INFO L290 TraceCheckUtils]: 37: Hoare triple {15612#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); {15612#true} is VALID [2022-04-15 11:36:11,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {15612#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15612#true} is VALID [2022-04-15 11:36:11,146 INFO L290 TraceCheckUtils]: 39: Hoare triple {15612#true} ~skip~0 := 0; {15612#true} is VALID [2022-04-15 11:36:11,146 INFO L290 TraceCheckUtils]: 40: Hoare triple {15612#true} assume !false; {15612#true} is VALID [2022-04-15 11:36:11,146 INFO L290 TraceCheckUtils]: 41: Hoare triple {15612#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); {15612#true} is VALID [2022-04-15 11:36:11,146 INFO L290 TraceCheckUtils]: 42: Hoare triple {15612#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:36:11,146 INFO L290 TraceCheckUtils]: 43: Hoare triple {15612#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:36:11,146 INFO L290 TraceCheckUtils]: 44: Hoare triple {15612#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:36:11,147 INFO L290 TraceCheckUtils]: 45: Hoare triple {15612#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:36:11,147 INFO L290 TraceCheckUtils]: 46: Hoare triple {15612#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:36:11,147 INFO L290 TraceCheckUtils]: 47: Hoare triple {15612#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:36:11,147 INFO L290 TraceCheckUtils]: 48: Hoare triple {15612#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:36:11,147 INFO L290 TraceCheckUtils]: 49: Hoare triple {15612#true} assume 4384 == #t~mem56;havoc #t~mem56; {15612#true} is VALID [2022-04-15 11:36:11,147 INFO L290 TraceCheckUtils]: 50: Hoare triple {15612#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {15612#true} is VALID [2022-04-15 11:36:11,147 INFO L290 TraceCheckUtils]: 51: Hoare triple {15612#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:11,148 INFO L290 TraceCheckUtils]: 52: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:11,148 INFO L290 TraceCheckUtils]: 53: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:11,148 INFO L290 TraceCheckUtils]: 54: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:11,148 INFO L290 TraceCheckUtils]: 55: Hoare triple {15617#(= 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); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:11,149 INFO L290 TraceCheckUtils]: 56: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:11,149 INFO L290 TraceCheckUtils]: 57: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:11,149 INFO L290 TraceCheckUtils]: 58: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:11,149 INFO L290 TraceCheckUtils]: 59: Hoare triple {15617#(= 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); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:11,150 INFO L290 TraceCheckUtils]: 60: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:11,150 INFO L290 TraceCheckUtils]: 61: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:11,151 INFO L290 TraceCheckUtils]: 62: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:11,151 INFO L290 TraceCheckUtils]: 63: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:11,151 INFO L290 TraceCheckUtils]: 64: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:11,151 INFO L290 TraceCheckUtils]: 65: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:11,152 INFO L290 TraceCheckUtils]: 66: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:11,152 INFO L290 TraceCheckUtils]: 67: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:11,152 INFO L290 TraceCheckUtils]: 68: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:11,153 INFO L290 TraceCheckUtils]: 69: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:11,153 INFO L290 TraceCheckUtils]: 70: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:11,153 INFO L290 TraceCheckUtils]: 71: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:11,153 INFO L290 TraceCheckUtils]: 72: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:11,154 INFO L290 TraceCheckUtils]: 73: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:11,154 INFO L290 TraceCheckUtils]: 74: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:11,154 INFO L290 TraceCheckUtils]: 75: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {15613#false} is VALID [2022-04-15 11:36:11,154 INFO L290 TraceCheckUtils]: 76: Hoare triple {15613#false} assume !false; {15613#false} is VALID [2022-04-15 11:36:11,154 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-15 11:36:11,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:36:11,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229133945] [2022-04-15 11:36:11,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229133945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:11,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:11,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:36:11,155 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:36:11,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1915575854] [2022-04-15 11:36:11,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1915575854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:11,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:11,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:36:11,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092294908] [2022-04-15 11:36:11,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:36:11,156 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-15 11:36:11,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:36:11,156 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-15 11:36:11,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:11,211 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:36:11,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:11,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:36:11,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:36:11,212 INFO L87 Difference]: Start difference. First operand 264 states and 385 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-15 11:36:13,228 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:36:14,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:14,046 INFO L93 Difference]: Finished difference Result 531 states and 783 transitions. [2022-04-15 11:36:14,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:36:14,046 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-15 11:36:14,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:36:14,046 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-15 11:36:14,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-15 11:36:14,048 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-15 11:36:14,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-15 11:36:14,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 489 transitions. [2022-04-15 11:36:14,355 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-15 11:36:14,369 INFO L225 Difference]: With dead ends: 531 [2022-04-15 11:36:14,370 INFO L226 Difference]: Without dead ends: 396 [2022-04-15 11:36:14,370 INFO L912 BasicCegarLoop]: 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-15 11:36:14,372 INFO L913 BasicCegarLoop]: 315 mSDtfsCounter, 126 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 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-15 11:36:14,372 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 477 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 339 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:36:14,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-04-15 11:36:14,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2022-04-15 11:36:14,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:36:14,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 396 states. Second operand has 396 states, 391 states have (on average 1.4654731457800512) internal successors, (573), 391 states have internal predecessors, (573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:14,384 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states. Second operand has 396 states, 391 states have (on average 1.4654731457800512) internal successors, (573), 391 states have internal predecessors, (573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:14,385 INFO L87 Difference]: Start difference. First operand 396 states. Second operand has 396 states, 391 states have (on average 1.4654731457800512) internal successors, (573), 391 states have internal predecessors, (573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:14,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:14,399 INFO L93 Difference]: Finished difference Result 396 states and 577 transitions. [2022-04-15 11:36:14,399 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 577 transitions. [2022-04-15 11:36:14,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:14,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:14,400 INFO L74 IsIncluded]: Start isIncluded. First operand has 396 states, 391 states have (on average 1.4654731457800512) internal successors, (573), 391 states have internal predecessors, (573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 396 states. [2022-04-15 11:36:14,401 INFO L87 Difference]: Start difference. First operand has 396 states, 391 states have (on average 1.4654731457800512) internal successors, (573), 391 states have internal predecessors, (573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 396 states. [2022-04-15 11:36:14,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:14,408 INFO L93 Difference]: Finished difference Result 396 states and 577 transitions. [2022-04-15 11:36:14,408 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 577 transitions. [2022-04-15 11:36:14,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:14,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:14,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:36:14,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:36:14,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 391 states have (on average 1.4654731457800512) internal successors, (573), 391 states have internal predecessors, (573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:14,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 577 transitions. [2022-04-15 11:36:14,417 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 577 transitions. Word has length 77 [2022-04-15 11:36:14,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:36:14,417 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 577 transitions. [2022-04-15 11:36:14,418 INFO L479 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-15 11:36:14,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 396 states and 577 transitions. [2022-04-15 11:36:14,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 577 edges. 577 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:14,858 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 577 transitions. [2022-04-15 11:36:14,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-15 11:36:14,859 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:36:14,859 INFO L499 BasicCegarLoop]: 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, 1] [2022-04-15 11:36:14,859 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:36:14,860 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:36:14,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:36:14,860 INFO L85 PathProgramCache]: Analyzing trace with hash -979274608, now seen corresponding path program 1 times [2022-04-15 11:36:14,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:14,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [145287309] [2022-04-15 11:36:14,860 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:36:14,860 INFO L85 PathProgramCache]: Analyzing trace with hash -979274608, now seen corresponding path program 2 times [2022-04-15 11:36:14,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:36:14,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975522579] [2022-04-15 11:36:14,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:36:14,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:36:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:14,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:36:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:14,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {18273#(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); {18267#true} is VALID [2022-04-15 11:36:14,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {18267#true} assume true; {18267#true} is VALID [2022-04-15 11:36:14,980 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18267#true} {18267#true} #593#return; {18267#true} is VALID [2022-04-15 11:36:14,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {18267#true} call ULTIMATE.init(); {18273#(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-15 11:36:14,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {18273#(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); {18267#true} is VALID [2022-04-15 11:36:14,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {18267#true} assume true; {18267#true} is VALID [2022-04-15 11:36:14,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18267#true} {18267#true} #593#return; {18267#true} is VALID [2022-04-15 11:36:14,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {18267#true} call #t~ret158 := main(); {18267#true} is VALID [2022-04-15 11:36:14,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {18267#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; {18267#true} is VALID [2022-04-15 11:36:14,981 INFO L272 TraceCheckUtils]: 6: Hoare triple {18267#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {18267#true} is VALID [2022-04-15 11:36:14,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {18267#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); {18267#true} is VALID [2022-04-15 11:36:14,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {18267#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; {18267#true} is VALID [2022-04-15 11:36:14,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {18267#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; {18267#true} is VALID [2022-04-15 11:36:14,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {18267#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18267#true} is VALID [2022-04-15 11:36:14,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {18267#true} assume !false; {18267#true} is VALID [2022-04-15 11:36:14,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {18267#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); {18267#true} is VALID [2022-04-15 11:36:14,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {18267#true} assume 12292 == #t~mem49;havoc #t~mem49; {18267#true} is VALID [2022-04-15 11:36:14,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {18267#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; {18267#true} is VALID [2022-04-15 11:36:14,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {18267#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {18267#true} is VALID [2022-04-15 11:36:14,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {18267#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {18267#true} is VALID [2022-04-15 11:36:14,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {18267#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {18267#true} is VALID [2022-04-15 11:36:14,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {18267#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); {18267#true} is VALID [2022-04-15 11:36:14,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {18267#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {18267#true} is VALID [2022-04-15 11:36:14,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {18267#true} assume !(0 == ~tmp___4~0); {18267#true} is VALID [2022-04-15 11:36:14,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {18267#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); {18267#true} is VALID [2022-04-15 11:36:14,982 INFO L290 TraceCheckUtils]: 22: Hoare triple {18267#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); {18267#true} is VALID [2022-04-15 11:36:14,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {18267#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {18267#true} is VALID [2022-04-15 11:36:14,982 INFO L290 TraceCheckUtils]: 24: Hoare triple {18267#true} ~skip~0 := 0; {18267#true} is VALID [2022-04-15 11:36:14,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {18267#true} assume !false; {18267#true} is VALID [2022-04-15 11:36:14,983 INFO L290 TraceCheckUtils]: 26: Hoare triple {18267#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); {18267#true} is VALID [2022-04-15 11:36:14,983 INFO L290 TraceCheckUtils]: 27: Hoare triple {18267#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18267#true} is VALID [2022-04-15 11:36:14,983 INFO L290 TraceCheckUtils]: 28: Hoare triple {18267#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18267#true} is VALID [2022-04-15 11:36:14,983 INFO L290 TraceCheckUtils]: 29: Hoare triple {18267#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18267#true} is VALID [2022-04-15 11:36:14,983 INFO L290 TraceCheckUtils]: 30: Hoare triple {18267#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18267#true} is VALID [2022-04-15 11:36:14,983 INFO L290 TraceCheckUtils]: 31: Hoare triple {18267#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18267#true} is VALID [2022-04-15 11:36:14,983 INFO L290 TraceCheckUtils]: 32: Hoare triple {18267#true} assume 4368 == #t~mem54;havoc #t~mem54; {18267#true} is VALID [2022-04-15 11:36:14,983 INFO L290 TraceCheckUtils]: 33: Hoare triple {18267#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; {18267#true} is VALID [2022-04-15 11:36:14,983 INFO L290 TraceCheckUtils]: 34: Hoare triple {18267#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:36:14,984 INFO L290 TraceCheckUtils]: 35: Hoare triple {18272#(= 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); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:36:14,984 INFO L290 TraceCheckUtils]: 36: Hoare triple {18272#(= 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; {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:36:14,984 INFO L290 TraceCheckUtils]: 37: Hoare triple {18272#(= 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); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:36:14,984 INFO L290 TraceCheckUtils]: 38: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:36:14,985 INFO L290 TraceCheckUtils]: 39: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:36:14,985 INFO L290 TraceCheckUtils]: 40: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !false; {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:36:14,985 INFO L290 TraceCheckUtils]: 41: Hoare triple {18272#(= 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); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:36:14,985 INFO L290 TraceCheckUtils]: 42: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:36:14,985 INFO L290 TraceCheckUtils]: 43: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:36:14,986 INFO L290 TraceCheckUtils]: 44: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:36:14,986 INFO L290 TraceCheckUtils]: 45: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:36:14,986 INFO L290 TraceCheckUtils]: 46: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:36:14,986 INFO L290 TraceCheckUtils]: 47: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:36:14,987 INFO L290 TraceCheckUtils]: 48: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:36:14,987 INFO L290 TraceCheckUtils]: 49: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume 4384 == #t~mem56;havoc #t~mem56; {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:36:14,987 INFO L290 TraceCheckUtils]: 50: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:36:14,987 INFO L290 TraceCheckUtils]: 51: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {18268#false} is VALID [2022-04-15 11:36:14,988 INFO L290 TraceCheckUtils]: 52: Hoare triple {18268#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {18268#false} is VALID [2022-04-15 11:36:14,988 INFO L290 TraceCheckUtils]: 53: Hoare triple {18268#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:36:14,988 INFO L290 TraceCheckUtils]: 54: Hoare triple {18268#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:36:14,988 INFO L290 TraceCheckUtils]: 55: Hoare triple {18268#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:36:14,988 INFO L290 TraceCheckUtils]: 56: Hoare triple {18268#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); {18268#false} is VALID [2022-04-15 11:36:14,988 INFO L290 TraceCheckUtils]: 57: Hoare triple {18268#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {18268#false} is VALID [2022-04-15 11:36:14,988 INFO L290 TraceCheckUtils]: 58: Hoare triple {18268#false} ~skip~0 := 0; {18268#false} is VALID [2022-04-15 11:36:14,988 INFO L290 TraceCheckUtils]: 59: Hoare triple {18268#false} assume !false; {18268#false} is VALID [2022-04-15 11:36:14,988 INFO L290 TraceCheckUtils]: 60: Hoare triple {18268#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); {18268#false} is VALID [2022-04-15 11:36:14,989 INFO L290 TraceCheckUtils]: 61: Hoare triple {18268#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:36:14,989 INFO L290 TraceCheckUtils]: 62: Hoare triple {18268#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:36:14,989 INFO L290 TraceCheckUtils]: 63: Hoare triple {18268#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:36:14,989 INFO L290 TraceCheckUtils]: 64: Hoare triple {18268#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:36:14,989 INFO L290 TraceCheckUtils]: 65: Hoare triple {18268#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:36:14,989 INFO L290 TraceCheckUtils]: 66: Hoare triple {18268#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:36:14,989 INFO L290 TraceCheckUtils]: 67: Hoare triple {18268#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:36:14,989 INFO L290 TraceCheckUtils]: 68: Hoare triple {18268#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:36:14,989 INFO L290 TraceCheckUtils]: 69: Hoare triple {18268#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:36:14,989 INFO L290 TraceCheckUtils]: 70: Hoare triple {18268#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:36:14,989 INFO L290 TraceCheckUtils]: 71: Hoare triple {18268#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:36:14,989 INFO L290 TraceCheckUtils]: 72: Hoare triple {18268#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:36:14,989 INFO L290 TraceCheckUtils]: 73: Hoare triple {18268#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:36:14,989 INFO L290 TraceCheckUtils]: 74: Hoare triple {18268#false} assume 4432 == #t~mem62;havoc #t~mem62; {18268#false} is VALID [2022-04-15 11:36:14,990 INFO L290 TraceCheckUtils]: 75: Hoare triple {18268#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {18268#false} is VALID [2022-04-15 11:36:14,990 INFO L290 TraceCheckUtils]: 76: Hoare triple {18268#false} assume 5 == ~blastFlag~0; {18268#false} is VALID [2022-04-15 11:36:14,990 INFO L290 TraceCheckUtils]: 77: Hoare triple {18268#false} assume !false; {18268#false} is VALID [2022-04-15 11:36:14,990 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-15 11:36:14,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:36:14,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975522579] [2022-04-15 11:36:14,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975522579] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:14,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:14,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:36:14,991 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:36:14,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [145287309] [2022-04-15 11:36:14,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [145287309] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:14,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:14,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:36:14,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453476094] [2022-04-15 11:36:14,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:36:14,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-15 11:36:14,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:36:14,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:15,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:15,044 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:36:15,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:15,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:36:15,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:36:15,045 INFO L87 Difference]: Start difference. First operand 396 states and 577 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:17,061 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:36:17,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:17,626 INFO L93 Difference]: Finished difference Result 687 states and 1003 transitions. [2022-04-15 11:36:17,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:36:17,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-15 11:36:17,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:36:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:17,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2022-04-15 11:36:17,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:17,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2022-04-15 11:36:17,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 367 transitions. [2022-04-15 11:36:17,881 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-15 11:36:17,888 INFO L225 Difference]: With dead ends: 687 [2022-04-15 11:36:17,888 INFO L226 Difference]: Without dead ends: 420 [2022-04-15 11:36:17,889 INFO L912 BasicCegarLoop]: 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-15 11:36:17,891 INFO L913 BasicCegarLoop]: 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-15 11:36:17,891 INFO L914 BasicCegarLoop]: 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-15 11:36:17,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-04-15 11:36:17,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2022-04-15 11:36:17,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:36:17,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 420 states. Second operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:17,902 INFO L74 IsIncluded]: Start isIncluded. First operand 420 states. Second operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:17,907 INFO L87 Difference]: Start difference. First operand 420 states. Second operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:17,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:17,914 INFO L93 Difference]: Finished difference Result 420 states and 609 transitions. [2022-04-15 11:36:17,914 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 609 transitions. [2022-04-15 11:36:17,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:17,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:17,915 INFO L74 IsIncluded]: Start isIncluded. First operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 420 states. [2022-04-15 11:36:17,915 INFO L87 Difference]: Start difference. First operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 420 states. [2022-04-15 11:36:17,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:17,922 INFO L93 Difference]: Finished difference Result 420 states and 609 transitions. [2022-04-15 11:36:17,922 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 609 transitions. [2022-04-15 11:36:17,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:17,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:17,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:36:17,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:36:17,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:17,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 609 transitions. [2022-04-15 11:36:17,932 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 609 transitions. Word has length 78 [2022-04-15 11:36:17,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:36:17,932 INFO L478 AbstractCegarLoop]: Abstraction has 420 states and 609 transitions. [2022-04-15 11:36:17,932 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:17,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 420 states and 609 transitions. [2022-04-15 11:36:18,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 609 edges. 609 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:18,457 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 609 transitions. [2022-04-15 11:36:18,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-15 11:36:18,458 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:36:18,458 INFO L499 BasicCegarLoop]: 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-15 11:36:18,459 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:36:18,459 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:36:18,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:36:18,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1809534672, now seen corresponding path program 1 times [2022-04-15 11:36:18,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:18,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [420386759] [2022-04-15 11:36:18,459 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:36:18,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1809534672, now seen corresponding path program 2 times [2022-04-15 11:36:18,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:36:18,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502557573] [2022-04-15 11:36:18,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:36:18,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:36:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:18,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:36:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:18,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {21336#(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); {21330#true} is VALID [2022-04-15 11:36:18,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {21330#true} assume true; {21330#true} is VALID [2022-04-15 11:36:18,613 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21330#true} {21330#true} #593#return; {21330#true} is VALID [2022-04-15 11:36:18,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {21330#true} call ULTIMATE.init(); {21336#(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-15 11:36:18,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {21336#(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); {21330#true} is VALID [2022-04-15 11:36:18,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {21330#true} assume true; {21330#true} is VALID [2022-04-15 11:36:18,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21330#true} {21330#true} #593#return; {21330#true} is VALID [2022-04-15 11:36:18,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {21330#true} call #t~ret158 := main(); {21330#true} is VALID [2022-04-15 11:36:18,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {21330#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; {21330#true} is VALID [2022-04-15 11:36:18,614 INFO L272 TraceCheckUtils]: 6: Hoare triple {21330#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {21330#true} is VALID [2022-04-15 11:36:18,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {21330#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); {21330#true} is VALID [2022-04-15 11:36:18,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {21330#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; {21330#true} is VALID [2022-04-15 11:36:18,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {21330#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; {21330#true} is VALID [2022-04-15 11:36:18,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {21330#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21330#true} is VALID [2022-04-15 11:36:18,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {21330#true} assume !false; {21330#true} is VALID [2022-04-15 11:36:18,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {21330#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); {21330#true} is VALID [2022-04-15 11:36:18,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {21330#true} assume 12292 == #t~mem49;havoc #t~mem49; {21330#true} is VALID [2022-04-15 11:36:18,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {21330#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; {21330#true} is VALID [2022-04-15 11:36:18,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {21330#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:36:18,627 INFO L290 TraceCheckUtils]: 16: Hoare triple {21330#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {21330#true} is VALID [2022-04-15 11:36:18,627 INFO L290 TraceCheckUtils]: 17: Hoare triple {21330#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:36:18,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {21330#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); {21330#true} is VALID [2022-04-15 11:36:18,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {21330#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {21330#true} is VALID [2022-04-15 11:36:18,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {21330#true} assume !(0 == ~tmp___4~0); {21330#true} is VALID [2022-04-15 11:36:18,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {21330#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); {21330#true} is VALID [2022-04-15 11:36:18,627 INFO L290 TraceCheckUtils]: 22: Hoare triple {21330#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); {21330#true} is VALID [2022-04-15 11:36:18,627 INFO L290 TraceCheckUtils]: 23: Hoare triple {21330#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21330#true} is VALID [2022-04-15 11:36:18,627 INFO L290 TraceCheckUtils]: 24: Hoare triple {21330#true} ~skip~0 := 0; {21330#true} is VALID [2022-04-15 11:36:18,627 INFO L290 TraceCheckUtils]: 25: Hoare triple {21330#true} assume !false; {21330#true} is VALID [2022-04-15 11:36:18,627 INFO L290 TraceCheckUtils]: 26: Hoare triple {21330#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); {21330#true} is VALID [2022-04-15 11:36:18,628 INFO L290 TraceCheckUtils]: 27: Hoare triple {21330#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:36:18,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {21330#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:36:18,628 INFO L290 TraceCheckUtils]: 29: Hoare triple {21330#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:36:18,628 INFO L290 TraceCheckUtils]: 30: Hoare triple {21330#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:36:18,628 INFO L290 TraceCheckUtils]: 31: Hoare triple {21330#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:36:18,628 INFO L290 TraceCheckUtils]: 32: Hoare triple {21330#true} assume 4368 == #t~mem54;havoc #t~mem54; {21330#true} is VALID [2022-04-15 11:36:18,628 INFO L290 TraceCheckUtils]: 33: Hoare triple {21330#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; {21330#true} is VALID [2022-04-15 11:36:18,628 INFO L290 TraceCheckUtils]: 34: Hoare triple {21330#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21330#true} is VALID [2022-04-15 11:36:18,628 INFO L290 TraceCheckUtils]: 35: Hoare triple {21330#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); {21330#true} is VALID [2022-04-15 11:36:18,628 INFO L290 TraceCheckUtils]: 36: Hoare triple {21330#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; {21330#true} is VALID [2022-04-15 11:36:18,628 INFO L290 TraceCheckUtils]: 37: Hoare triple {21330#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); {21330#true} is VALID [2022-04-15 11:36:18,628 INFO L290 TraceCheckUtils]: 38: Hoare triple {21330#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21330#true} is VALID [2022-04-15 11:36:18,628 INFO L290 TraceCheckUtils]: 39: Hoare triple {21330#true} ~skip~0 := 0; {21330#true} is VALID [2022-04-15 11:36:18,628 INFO L290 TraceCheckUtils]: 40: Hoare triple {21330#true} assume !false; {21330#true} is VALID [2022-04-15 11:36:18,629 INFO L290 TraceCheckUtils]: 41: Hoare triple {21330#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); {21330#true} is VALID [2022-04-15 11:36:18,629 INFO L290 TraceCheckUtils]: 42: Hoare triple {21330#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:36:18,629 INFO L290 TraceCheckUtils]: 43: Hoare triple {21330#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:36:18,629 INFO L290 TraceCheckUtils]: 44: Hoare triple {21330#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:36:18,629 INFO L290 TraceCheckUtils]: 45: Hoare triple {21330#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:36:18,629 INFO L290 TraceCheckUtils]: 46: Hoare triple {21330#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:36:18,629 INFO L290 TraceCheckUtils]: 47: Hoare triple {21330#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:36:18,629 INFO L290 TraceCheckUtils]: 48: Hoare triple {21330#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:36:18,629 INFO L290 TraceCheckUtils]: 49: Hoare triple {21330#true} assume 4384 == #t~mem56;havoc #t~mem56; {21330#true} is VALID [2022-04-15 11:36:18,629 INFO L290 TraceCheckUtils]: 50: Hoare triple {21330#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {21330#true} is VALID [2022-04-15 11:36:18,629 INFO L290 TraceCheckUtils]: 51: Hoare triple {21330#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {21330#true} is VALID [2022-04-15 11:36:18,650 INFO L290 TraceCheckUtils]: 52: Hoare triple {21330#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:36:18,651 INFO L290 TraceCheckUtils]: 53: Hoare triple {21330#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:36:18,651 INFO L290 TraceCheckUtils]: 54: Hoare triple {21330#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:36:18,651 INFO L290 TraceCheckUtils]: 55: Hoare triple {21330#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); {21330#true} is VALID [2022-04-15 11:36:18,651 INFO L290 TraceCheckUtils]: 56: Hoare triple {21330#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21330#true} is VALID [2022-04-15 11:36:18,651 INFO L290 TraceCheckUtils]: 57: Hoare triple {21330#true} ~skip~0 := 0; {21330#true} is VALID [2022-04-15 11:36:18,651 INFO L290 TraceCheckUtils]: 58: Hoare triple {21330#true} assume !false; {21330#true} is VALID [2022-04-15 11:36:18,651 INFO L290 TraceCheckUtils]: 59: Hoare triple {21330#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); {21330#true} is VALID [2022-04-15 11:36:18,652 INFO L290 TraceCheckUtils]: 60: Hoare triple {21330#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:36:18,652 INFO L290 TraceCheckUtils]: 61: Hoare triple {21330#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:36:18,652 INFO L290 TraceCheckUtils]: 62: Hoare triple {21330#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:36:18,652 INFO L290 TraceCheckUtils]: 63: Hoare triple {21330#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:36:18,652 INFO L290 TraceCheckUtils]: 64: Hoare triple {21330#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:36:18,652 INFO L290 TraceCheckUtils]: 65: Hoare triple {21330#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:36:18,652 INFO L290 TraceCheckUtils]: 66: Hoare triple {21330#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:36:18,652 INFO L290 TraceCheckUtils]: 67: Hoare triple {21330#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:36:18,652 INFO L290 TraceCheckUtils]: 68: Hoare triple {21330#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:36:18,652 INFO L290 TraceCheckUtils]: 69: Hoare triple {21330#true} assume 4400 == #t~mem58;havoc #t~mem58; {21330#true} is VALID [2022-04-15 11:36:18,652 INFO L290 TraceCheckUtils]: 70: Hoare triple {21330#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); {21330#true} is VALID [2022-04-15 11:36:18,652 INFO L290 TraceCheckUtils]: 71: Hoare triple {21330#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; {21330#true} is VALID [2022-04-15 11:36:18,653 INFO L290 TraceCheckUtils]: 72: Hoare triple {21330#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:18,653 INFO L290 TraceCheckUtils]: 73: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:18,654 INFO L290 TraceCheckUtils]: 74: Hoare triple {21335#(= 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); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:18,654 INFO L290 TraceCheckUtils]: 75: Hoare triple {21335#(= 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); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:18,654 INFO L290 TraceCheckUtils]: 76: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:18,654 INFO L290 TraceCheckUtils]: 77: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:18,654 INFO L290 TraceCheckUtils]: 78: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:18,655 INFO L290 TraceCheckUtils]: 79: Hoare triple {21335#(= 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); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:18,655 INFO L290 TraceCheckUtils]: 80: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:18,655 INFO L290 TraceCheckUtils]: 81: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:18,655 INFO L290 TraceCheckUtils]: 82: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:18,656 INFO L290 TraceCheckUtils]: 83: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:18,656 INFO L290 TraceCheckUtils]: 84: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:18,656 INFO L290 TraceCheckUtils]: 85: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:18,656 INFO L290 TraceCheckUtils]: 86: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:18,657 INFO L290 TraceCheckUtils]: 87: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:18,657 INFO L290 TraceCheckUtils]: 88: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:18,657 INFO L290 TraceCheckUtils]: 89: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:18,657 INFO L290 TraceCheckUtils]: 90: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:18,658 INFO L290 TraceCheckUtils]: 91: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:18,658 INFO L290 TraceCheckUtils]: 92: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:18,658 INFO L290 TraceCheckUtils]: 93: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:18,658 INFO L290 TraceCheckUtils]: 94: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:36:18,659 INFO L290 TraceCheckUtils]: 95: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {21331#false} is VALID [2022-04-15 11:36:18,659 INFO L290 TraceCheckUtils]: 96: Hoare triple {21331#false} assume !false; {21331#false} is VALID [2022-04-15 11:36:18,659 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-15 11:36:18,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:36:18,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502557573] [2022-04-15 11:36:18,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502557573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:18,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:18,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:36:18,660 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:36:18,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [420386759] [2022-04-15 11:36:18,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [420386759] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:18,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:18,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:36:18,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066639552] [2022-04-15 11:36:18,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:36:18,660 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-15 11:36:18,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:36:18,660 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-15 11:36:18,704 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-15 11:36:18,704 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:36:18,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:18,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:36:18,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:36:18,705 INFO L87 Difference]: Start difference. First operand 420 states and 609 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-15 11:36:20,720 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:36:21,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:21,576 INFO L93 Difference]: Finished difference Result 842 states and 1230 transitions. [2022-04-15 11:36:21,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:36:21,576 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-15 11:36:21,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:36:21,577 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-15 11:36:21,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-15 11:36:21,580 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-15 11:36:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-15 11:36:21,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 488 transitions. [2022-04-15 11:36:21,943 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-15 11:36:21,955 INFO L225 Difference]: With dead ends: 842 [2022-04-15 11:36:21,955 INFO L226 Difference]: Without dead ends: 551 [2022-04-15 11:36:21,956 INFO L912 BasicCegarLoop]: 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-15 11:36:21,957 INFO L913 BasicCegarLoop]: 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-15 11:36:21,957 INFO L914 BasicCegarLoop]: 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-15 11:36:21,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-04-15 11:36:21,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2022-04-15 11:36:21,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:36:21,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 551 states. Second operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:21,972 INFO L74 IsIncluded]: Start isIncluded. First operand 551 states. Second operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:21,973 INFO L87 Difference]: Start difference. First operand 551 states. Second operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:21,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:21,989 INFO L93 Difference]: Finished difference Result 551 states and 800 transitions. [2022-04-15 11:36:21,989 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 800 transitions. [2022-04-15 11:36:21,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:21,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:21,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 551 states. [2022-04-15 11:36:21,990 INFO L87 Difference]: Start difference. First operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 551 states. [2022-04-15 11:36:22,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:22,000 INFO L93 Difference]: Finished difference Result 551 states and 800 transitions. [2022-04-15 11:36:22,000 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 800 transitions. [2022-04-15 11:36:22,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:22,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:22,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:36:22,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:36:22,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:22,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 800 transitions. [2022-04-15 11:36:22,014 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 800 transitions. Word has length 97 [2022-04-15 11:36:22,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:36:22,014 INFO L478 AbstractCegarLoop]: Abstraction has 551 states and 800 transitions. [2022-04-15 11:36:22,014 INFO L479 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-15 11:36:22,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 551 states and 800 transitions. [2022-04-15 11:36:22,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 800 edges. 800 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:22,602 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 800 transitions. [2022-04-15 11:36:22,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-15 11:36:22,611 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:36:22,611 INFO L499 BasicCegarLoop]: 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-15 11:36:22,612 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:36:22,612 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:36:22,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:36:22,612 INFO L85 PathProgramCache]: Analyzing trace with hash -120492913, now seen corresponding path program 1 times [2022-04-15 11:36:22,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:22,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [205596889] [2022-04-15 11:36:22,613 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:36:22,613 INFO L85 PathProgramCache]: Analyzing trace with hash -120492913, now seen corresponding path program 2 times [2022-04-15 11:36:22,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:36:22,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525820862] [2022-04-15 11:36:22,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:36:22,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:36:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:22,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:36:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:22,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {25233#(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); {25227#true} is VALID [2022-04-15 11:36:22,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {25227#true} assume true; {25227#true} is VALID [2022-04-15 11:36:22,794 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25227#true} {25227#true} #593#return; {25227#true} is VALID [2022-04-15 11:36:22,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {25227#true} call ULTIMATE.init(); {25233#(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-15 11:36:22,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {25233#(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); {25227#true} is VALID [2022-04-15 11:36:22,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {25227#true} assume true; {25227#true} is VALID [2022-04-15 11:36:22,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25227#true} {25227#true} #593#return; {25227#true} is VALID [2022-04-15 11:36:22,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {25227#true} call #t~ret158 := main(); {25227#true} is VALID [2022-04-15 11:36:22,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {25227#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; {25227#true} is VALID [2022-04-15 11:36:22,795 INFO L272 TraceCheckUtils]: 6: Hoare triple {25227#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {25227#true} is VALID [2022-04-15 11:36:22,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {25227#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); {25227#true} is VALID [2022-04-15 11:36:22,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {25227#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; {25227#true} is VALID [2022-04-15 11:36:22,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {25227#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; {25227#true} is VALID [2022-04-15 11:36:22,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {25227#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25227#true} is VALID [2022-04-15 11:36:22,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {25227#true} assume !false; {25227#true} is VALID [2022-04-15 11:36:22,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {25227#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); {25227#true} is VALID [2022-04-15 11:36:22,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {25227#true} assume 12292 == #t~mem49;havoc #t~mem49; {25227#true} is VALID [2022-04-15 11:36:22,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {25227#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; {25227#true} is VALID [2022-04-15 11:36:22,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {25227#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {25227#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {25227#true} is VALID [2022-04-15 11:36:22,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {25227#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {25227#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); {25227#true} is VALID [2022-04-15 11:36:22,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {25227#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {25227#true} is VALID [2022-04-15 11:36:22,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {25227#true} assume !(0 == ~tmp___4~0); {25227#true} is VALID [2022-04-15 11:36:22,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {25227#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); {25227#true} is VALID [2022-04-15 11:36:22,802 INFO L290 TraceCheckUtils]: 22: Hoare triple {25227#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); {25227#true} is VALID [2022-04-15 11:36:22,802 INFO L290 TraceCheckUtils]: 23: Hoare triple {25227#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {25227#true} is VALID [2022-04-15 11:36:22,802 INFO L290 TraceCheckUtils]: 24: Hoare triple {25227#true} ~skip~0 := 0; {25227#true} is VALID [2022-04-15 11:36:22,802 INFO L290 TraceCheckUtils]: 25: Hoare triple {25227#true} assume !false; {25227#true} is VALID [2022-04-15 11:36:22,802 INFO L290 TraceCheckUtils]: 26: Hoare triple {25227#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); {25227#true} is VALID [2022-04-15 11:36:22,802 INFO L290 TraceCheckUtils]: 27: Hoare triple {25227#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,802 INFO L290 TraceCheckUtils]: 28: Hoare triple {25227#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,802 INFO L290 TraceCheckUtils]: 29: Hoare triple {25227#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,802 INFO L290 TraceCheckUtils]: 30: Hoare triple {25227#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,802 INFO L290 TraceCheckUtils]: 31: Hoare triple {25227#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,802 INFO L290 TraceCheckUtils]: 32: Hoare triple {25227#true} assume 4368 == #t~mem54;havoc #t~mem54; {25227#true} is VALID [2022-04-15 11:36:22,803 INFO L290 TraceCheckUtils]: 33: Hoare triple {25227#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; {25227#true} is VALID [2022-04-15 11:36:22,803 INFO L290 TraceCheckUtils]: 34: Hoare triple {25227#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25227#true} is VALID [2022-04-15 11:36:22,803 INFO L290 TraceCheckUtils]: 35: Hoare triple {25227#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); {25227#true} is VALID [2022-04-15 11:36:22,803 INFO L290 TraceCheckUtils]: 36: Hoare triple {25227#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; {25227#true} is VALID [2022-04-15 11:36:22,803 INFO L290 TraceCheckUtils]: 37: Hoare triple {25227#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); {25227#true} is VALID [2022-04-15 11:36:22,803 INFO L290 TraceCheckUtils]: 38: Hoare triple {25227#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {25227#true} is VALID [2022-04-15 11:36:22,803 INFO L290 TraceCheckUtils]: 39: Hoare triple {25227#true} ~skip~0 := 0; {25227#true} is VALID [2022-04-15 11:36:22,803 INFO L290 TraceCheckUtils]: 40: Hoare triple {25227#true} assume !false; {25227#true} is VALID [2022-04-15 11:36:22,803 INFO L290 TraceCheckUtils]: 41: Hoare triple {25227#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); {25227#true} is VALID [2022-04-15 11:36:22,803 INFO L290 TraceCheckUtils]: 42: Hoare triple {25227#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,803 INFO L290 TraceCheckUtils]: 43: Hoare triple {25227#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,803 INFO L290 TraceCheckUtils]: 44: Hoare triple {25227#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,803 INFO L290 TraceCheckUtils]: 45: Hoare triple {25227#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,803 INFO L290 TraceCheckUtils]: 46: Hoare triple {25227#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,804 INFO L290 TraceCheckUtils]: 47: Hoare triple {25227#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,804 INFO L290 TraceCheckUtils]: 48: Hoare triple {25227#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,804 INFO L290 TraceCheckUtils]: 49: Hoare triple {25227#true} assume 4384 == #t~mem56;havoc #t~mem56; {25227#true} is VALID [2022-04-15 11:36:22,804 INFO L290 TraceCheckUtils]: 50: Hoare triple {25227#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {25227#true} is VALID [2022-04-15 11:36:22,804 INFO L290 TraceCheckUtils]: 51: Hoare triple {25227#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {25227#true} is VALID [2022-04-15 11:36:22,804 INFO L290 TraceCheckUtils]: 52: Hoare triple {25227#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,804 INFO L290 TraceCheckUtils]: 53: Hoare triple {25227#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,804 INFO L290 TraceCheckUtils]: 54: Hoare triple {25227#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,804 INFO L290 TraceCheckUtils]: 55: Hoare triple {25227#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); {25227#true} is VALID [2022-04-15 11:36:22,804 INFO L290 TraceCheckUtils]: 56: Hoare triple {25227#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {25227#true} is VALID [2022-04-15 11:36:22,804 INFO L290 TraceCheckUtils]: 57: Hoare triple {25227#true} ~skip~0 := 0; {25227#true} is VALID [2022-04-15 11:36:22,804 INFO L290 TraceCheckUtils]: 58: Hoare triple {25227#true} assume !false; {25227#true} is VALID [2022-04-15 11:36:22,804 INFO L290 TraceCheckUtils]: 59: Hoare triple {25227#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); {25227#true} is VALID [2022-04-15 11:36:22,805 INFO L290 TraceCheckUtils]: 60: Hoare triple {25227#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,805 INFO L290 TraceCheckUtils]: 61: Hoare triple {25227#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,805 INFO L290 TraceCheckUtils]: 62: Hoare triple {25227#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,805 INFO L290 TraceCheckUtils]: 63: Hoare triple {25227#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,805 INFO L290 TraceCheckUtils]: 64: Hoare triple {25227#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,805 INFO L290 TraceCheckUtils]: 65: Hoare triple {25227#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,805 INFO L290 TraceCheckUtils]: 66: Hoare triple {25227#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,805 INFO L290 TraceCheckUtils]: 67: Hoare triple {25227#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,805 INFO L290 TraceCheckUtils]: 68: Hoare triple {25227#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,805 INFO L290 TraceCheckUtils]: 69: Hoare triple {25227#true} assume 4400 == #t~mem58;havoc #t~mem58; {25227#true} is VALID [2022-04-15 11:36:22,805 INFO L290 TraceCheckUtils]: 70: Hoare triple {25227#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); {25227#true} is VALID [2022-04-15 11:36:22,805 INFO L290 TraceCheckUtils]: 71: Hoare triple {25227#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; {25227#true} is VALID [2022-04-15 11:36:22,805 INFO L290 TraceCheckUtils]: 72: Hoare triple {25227#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {25227#true} is VALID [2022-04-15 11:36:22,805 INFO L290 TraceCheckUtils]: 73: Hoare triple {25227#true} assume !(~ret~0 <= 0); {25227#true} is VALID [2022-04-15 11:36:22,806 INFO L290 TraceCheckUtils]: 74: Hoare triple {25227#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,806 INFO L290 TraceCheckUtils]: 75: Hoare triple {25227#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); {25227#true} is VALID [2022-04-15 11:36:22,806 INFO L290 TraceCheckUtils]: 76: Hoare triple {25227#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {25227#true} is VALID [2022-04-15 11:36:22,806 INFO L290 TraceCheckUtils]: 77: Hoare triple {25227#true} ~skip~0 := 0; {25227#true} is VALID [2022-04-15 11:36:22,806 INFO L290 TraceCheckUtils]: 78: Hoare triple {25227#true} assume !false; {25227#true} is VALID [2022-04-15 11:36:22,806 INFO L290 TraceCheckUtils]: 79: Hoare triple {25227#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); {25227#true} is VALID [2022-04-15 11:36:22,806 INFO L290 TraceCheckUtils]: 80: Hoare triple {25227#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,806 INFO L290 TraceCheckUtils]: 81: Hoare triple {25227#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,806 INFO L290 TraceCheckUtils]: 82: Hoare triple {25227#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,806 INFO L290 TraceCheckUtils]: 83: Hoare triple {25227#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,806 INFO L290 TraceCheckUtils]: 84: Hoare triple {25227#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,806 INFO L290 TraceCheckUtils]: 85: Hoare triple {25227#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,806 INFO L290 TraceCheckUtils]: 86: Hoare triple {25227#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,806 INFO L290 TraceCheckUtils]: 87: Hoare triple {25227#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,807 INFO L290 TraceCheckUtils]: 88: Hoare triple {25227#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,807 INFO L290 TraceCheckUtils]: 89: Hoare triple {25227#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,807 INFO L290 TraceCheckUtils]: 90: Hoare triple {25227#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-15 11:36:22,807 INFO L290 TraceCheckUtils]: 91: Hoare triple {25227#true} assume 4416 == #t~mem60;havoc #t~mem60; {25227#true} is VALID [2022-04-15 11:36:22,807 INFO L290 TraceCheckUtils]: 92: Hoare triple {25227#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {25227#true} is VALID [2022-04-15 11:36:22,807 INFO L290 TraceCheckUtils]: 93: Hoare triple {25227#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:36:22,807 INFO L290 TraceCheckUtils]: 94: Hoare triple {25232#(= 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); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:36:22,808 INFO L290 TraceCheckUtils]: 95: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == ~tmp___6~0); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:36:22,808 INFO L290 TraceCheckUtils]: 96: Hoare triple {25232#(= 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); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:36:22,808 INFO L290 TraceCheckUtils]: 97: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:36:22,808 INFO L290 TraceCheckUtils]: 98: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} ~skip~0 := 0; {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:36:22,809 INFO L290 TraceCheckUtils]: 99: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !false; {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:36:22,809 INFO L290 TraceCheckUtils]: 100: Hoare triple {25232#(= 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); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:36:22,809 INFO L290 TraceCheckUtils]: 101: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:36:22,809 INFO L290 TraceCheckUtils]: 102: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:36:22,810 INFO L290 TraceCheckUtils]: 103: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:36:22,810 INFO L290 TraceCheckUtils]: 104: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:36:22,810 INFO L290 TraceCheckUtils]: 105: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:36:22,810 INFO L290 TraceCheckUtils]: 106: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:36:22,811 INFO L290 TraceCheckUtils]: 107: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:36:22,811 INFO L290 TraceCheckUtils]: 108: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:36:22,811 INFO L290 TraceCheckUtils]: 109: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:36:22,811 INFO L290 TraceCheckUtils]: 110: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:36:22,812 INFO L290 TraceCheckUtils]: 111: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:36:22,812 INFO L290 TraceCheckUtils]: 112: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:36:22,812 INFO L290 TraceCheckUtils]: 113: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:36:22,812 INFO L290 TraceCheckUtils]: 114: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume 4432 == #t~mem62;havoc #t~mem62; {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:36:22,813 INFO L290 TraceCheckUtils]: 115: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:36:22,813 INFO L290 TraceCheckUtils]: 116: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume 5 == ~blastFlag~0; {25228#false} is VALID [2022-04-15 11:36:22,813 INFO L290 TraceCheckUtils]: 117: Hoare triple {25228#false} assume !false; {25228#false} is VALID [2022-04-15 11:36:22,813 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-15 11:36:22,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:36:22,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525820862] [2022-04-15 11:36:22,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525820862] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:22,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:22,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:36:22,814 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:36:22,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [205596889] [2022-04-15 11:36:22,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [205596889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:22,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:22,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:36:22,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337107730] [2022-04-15 11:36:22,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:36:22,814 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-15 11:36:22,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:36:22,815 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-15 11:36:22,864 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-15 11:36:22,864 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:36:22,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:22,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:36:22,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:36:22,865 INFO L87 Difference]: Start difference. First operand 551 states and 800 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-15 11:36:24,879 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:36:25,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:25,728 INFO L93 Difference]: Finished difference Result 1103 states and 1610 transitions. [2022-04-15 11:36:25,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:36:25,728 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-15 11:36:25,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:36:25,728 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-15 11:36:25,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2022-04-15 11:36:25,731 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-15 11:36:25,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2022-04-15 11:36:25,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 486 transitions. [2022-04-15 11:36:26,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 486 edges. 486 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:26,038 INFO L225 Difference]: With dead ends: 1103 [2022-04-15 11:36:26,038 INFO L226 Difference]: Without dead ends: 681 [2022-04-15 11:36:26,039 INFO L912 BasicCegarLoop]: 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-15 11:36:26,039 INFO L913 BasicCegarLoop]: 312 mSDtfsCounter, 124 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:36:26,039 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 474 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 336 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 11:36:26,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2022-04-15 11:36:26,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2022-04-15 11:36:26,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:36:26,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 681 states. Second operand has 681 states, 676 states have (on average 1.4571005917159763) internal successors, (985), 676 states have internal predecessors, (985), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:26,055 INFO L74 IsIncluded]: Start isIncluded. First operand 681 states. Second operand has 681 states, 676 states have (on average 1.4571005917159763) internal successors, (985), 676 states have internal predecessors, (985), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:26,056 INFO L87 Difference]: Start difference. First operand 681 states. Second operand has 681 states, 676 states have (on average 1.4571005917159763) internal successors, (985), 676 states have internal predecessors, (985), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:26,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:26,069 INFO L93 Difference]: Finished difference Result 681 states and 989 transitions. [2022-04-15 11:36:26,069 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 989 transitions. [2022-04-15 11:36:26,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:26,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:26,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 681 states, 676 states have (on average 1.4571005917159763) internal successors, (985), 676 states have internal predecessors, (985), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 681 states. [2022-04-15 11:36:26,072 INFO L87 Difference]: Start difference. First operand has 681 states, 676 states have (on average 1.4571005917159763) internal successors, (985), 676 states have internal predecessors, (985), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 681 states. [2022-04-15 11:36:26,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:26,085 INFO L93 Difference]: Finished difference Result 681 states and 989 transitions. [2022-04-15 11:36:26,085 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 989 transitions. [2022-04-15 11:36:26,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:26,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:26,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:36:26,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:36:26,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 676 states have (on average 1.4571005917159763) internal successors, (985), 676 states have internal predecessors, (985), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:26,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 989 transitions. [2022-04-15 11:36:26,105 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 989 transitions. Word has length 118 [2022-04-15 11:36:26,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:36:26,105 INFO L478 AbstractCegarLoop]: Abstraction has 681 states and 989 transitions. [2022-04-15 11:36:26,105 INFO L479 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-15 11:36:26,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 681 states and 989 transitions. [2022-04-15 11:36:26,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 989 edges. 989 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:26,768 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 989 transitions. [2022-04-15 11:36:26,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-15 11:36:26,784 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:36:26,784 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:36:26,784 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:36:26,784 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:36:26,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:36:26,785 INFO L85 PathProgramCache]: Analyzing trace with hash 707325485, now seen corresponding path program 1 times [2022-04-15 11:36:26,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:26,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [538217362] [2022-04-15 11:36:37,607 WARN L232 SmtUtils]: Spent 7.27s 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-15 11:36:44,317 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:36:44,318 INFO L85 PathProgramCache]: Analyzing trace with hash 707325485, now seen corresponding path program 2 times [2022-04-15 11:36:44,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:36:44,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419537219] [2022-04-15 11:36:44,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:36:44,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:36:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:44,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:36:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:44,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {30173#(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); {30166#true} is VALID [2022-04-15 11:36:44,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {30166#true} assume true; {30166#true} is VALID [2022-04-15 11:36:44,470 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30166#true} {30166#true} #593#return; {30166#true} is VALID [2022-04-15 11:36:44,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {30166#true} call ULTIMATE.init(); {30173#(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-15 11:36:44,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {30173#(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); {30166#true} is VALID [2022-04-15 11:36:44,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {30166#true} assume true; {30166#true} is VALID [2022-04-15 11:36:44,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30166#true} {30166#true} #593#return; {30166#true} is VALID [2022-04-15 11:36:44,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {30166#true} call #t~ret158 := main(); {30166#true} is VALID [2022-04-15 11:36:44,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {30166#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; {30166#true} is VALID [2022-04-15 11:36:44,471 INFO L272 TraceCheckUtils]: 6: Hoare triple {30166#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {30166#true} is VALID [2022-04-15 11:36:44,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {30166#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); {30166#true} is VALID [2022-04-15 11:36:44,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {30166#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; {30166#true} is VALID [2022-04-15 11:36:44,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {30166#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; {30166#true} is VALID [2022-04-15 11:36:44,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {30166#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {30166#true} is VALID [2022-04-15 11:36:44,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {30166#true} assume !false; {30166#true} is VALID [2022-04-15 11:36:44,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {30166#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); {30166#true} is VALID [2022-04-15 11:36:44,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {30166#true} assume 12292 == #t~mem49;havoc #t~mem49; {30166#true} is VALID [2022-04-15 11:36:44,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {30166#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; {30166#true} is VALID [2022-04-15 11:36:44,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {30166#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {30166#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {30166#true} is VALID [2022-04-15 11:36:44,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {30166#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {30166#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); {30166#true} is VALID [2022-04-15 11:36:44,472 INFO L290 TraceCheckUtils]: 19: Hoare triple {30166#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {30166#true} is VALID [2022-04-15 11:36:44,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {30166#true} assume !(0 == ~tmp___4~0); {30166#true} is VALID [2022-04-15 11:36:44,472 INFO L290 TraceCheckUtils]: 21: Hoare triple {30166#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); {30166#true} is VALID [2022-04-15 11:36:44,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {30166#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); {30166#true} is VALID [2022-04-15 11:36:44,473 INFO L290 TraceCheckUtils]: 23: Hoare triple {30166#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {30166#true} is VALID [2022-04-15 11:36:44,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {30166#true} ~skip~0 := 0; {30166#true} is VALID [2022-04-15 11:36:44,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {30166#true} assume !false; {30166#true} is VALID [2022-04-15 11:36:44,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {30166#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); {30166#true} is VALID [2022-04-15 11:36:44,473 INFO L290 TraceCheckUtils]: 27: Hoare triple {30166#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,473 INFO L290 TraceCheckUtils]: 28: Hoare triple {30166#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,473 INFO L290 TraceCheckUtils]: 29: Hoare triple {30166#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,473 INFO L290 TraceCheckUtils]: 30: Hoare triple {30166#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,473 INFO L290 TraceCheckUtils]: 31: Hoare triple {30166#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,473 INFO L290 TraceCheckUtils]: 32: Hoare triple {30166#true} assume 4368 == #t~mem54;havoc #t~mem54; {30166#true} is VALID [2022-04-15 11:36:44,473 INFO L290 TraceCheckUtils]: 33: Hoare triple {30166#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; {30166#true} is VALID [2022-04-15 11:36:44,473 INFO L290 TraceCheckUtils]: 34: Hoare triple {30166#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30166#true} is VALID [2022-04-15 11:36:44,473 INFO L290 TraceCheckUtils]: 35: Hoare triple {30166#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); {30166#true} is VALID [2022-04-15 11:36:44,474 INFO L290 TraceCheckUtils]: 36: Hoare triple {30166#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; {30166#true} is VALID [2022-04-15 11:36:44,474 INFO L290 TraceCheckUtils]: 37: Hoare triple {30166#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); {30166#true} is VALID [2022-04-15 11:36:44,474 INFO L290 TraceCheckUtils]: 38: Hoare triple {30166#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {30166#true} is VALID [2022-04-15 11:36:44,474 INFO L290 TraceCheckUtils]: 39: Hoare triple {30166#true} ~skip~0 := 0; {30166#true} is VALID [2022-04-15 11:36:44,474 INFO L290 TraceCheckUtils]: 40: Hoare triple {30166#true} assume !false; {30166#true} is VALID [2022-04-15 11:36:44,474 INFO L290 TraceCheckUtils]: 41: Hoare triple {30166#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); {30166#true} is VALID [2022-04-15 11:36:44,474 INFO L290 TraceCheckUtils]: 42: Hoare triple {30166#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,474 INFO L290 TraceCheckUtils]: 43: Hoare triple {30166#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,474 INFO L290 TraceCheckUtils]: 44: Hoare triple {30166#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,474 INFO L290 TraceCheckUtils]: 45: Hoare triple {30166#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,474 INFO L290 TraceCheckUtils]: 46: Hoare triple {30166#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,474 INFO L290 TraceCheckUtils]: 47: Hoare triple {30166#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,474 INFO L290 TraceCheckUtils]: 48: Hoare triple {30166#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,474 INFO L290 TraceCheckUtils]: 49: Hoare triple {30166#true} assume 4384 == #t~mem56;havoc #t~mem56; {30166#true} is VALID [2022-04-15 11:36:44,475 INFO L290 TraceCheckUtils]: 50: Hoare triple {30166#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {30166#true} is VALID [2022-04-15 11:36:44,475 INFO L290 TraceCheckUtils]: 51: Hoare triple {30166#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {30166#true} is VALID [2022-04-15 11:36:44,475 INFO L290 TraceCheckUtils]: 52: Hoare triple {30166#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,475 INFO L290 TraceCheckUtils]: 53: Hoare triple {30166#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,475 INFO L290 TraceCheckUtils]: 54: Hoare triple {30166#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,475 INFO L290 TraceCheckUtils]: 55: Hoare triple {30166#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); {30166#true} is VALID [2022-04-15 11:36:44,475 INFO L290 TraceCheckUtils]: 56: Hoare triple {30166#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {30166#true} is VALID [2022-04-15 11:36:44,475 INFO L290 TraceCheckUtils]: 57: Hoare triple {30166#true} ~skip~0 := 0; {30166#true} is VALID [2022-04-15 11:36:44,475 INFO L290 TraceCheckUtils]: 58: Hoare triple {30166#true} assume !false; {30166#true} is VALID [2022-04-15 11:36:44,475 INFO L290 TraceCheckUtils]: 59: Hoare triple {30166#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); {30166#true} is VALID [2022-04-15 11:36:44,475 INFO L290 TraceCheckUtils]: 60: Hoare triple {30166#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,475 INFO L290 TraceCheckUtils]: 61: Hoare triple {30166#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,475 INFO L290 TraceCheckUtils]: 62: Hoare triple {30166#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,475 INFO L290 TraceCheckUtils]: 63: Hoare triple {30166#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,476 INFO L290 TraceCheckUtils]: 64: Hoare triple {30166#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,476 INFO L290 TraceCheckUtils]: 65: Hoare triple {30166#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,476 INFO L290 TraceCheckUtils]: 66: Hoare triple {30166#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,476 INFO L290 TraceCheckUtils]: 67: Hoare triple {30166#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,476 INFO L290 TraceCheckUtils]: 68: Hoare triple {30166#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,476 INFO L290 TraceCheckUtils]: 69: Hoare triple {30166#true} assume 4400 == #t~mem58;havoc #t~mem58; {30166#true} is VALID [2022-04-15 11:36:44,476 INFO L290 TraceCheckUtils]: 70: Hoare triple {30166#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); {30166#true} is VALID [2022-04-15 11:36:44,476 INFO L290 TraceCheckUtils]: 71: Hoare triple {30166#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; {30166#true} is VALID [2022-04-15 11:36:44,476 INFO L290 TraceCheckUtils]: 72: Hoare triple {30166#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {30166#true} is VALID [2022-04-15 11:36:44,476 INFO L290 TraceCheckUtils]: 73: Hoare triple {30166#true} assume !(~ret~0 <= 0); {30166#true} is VALID [2022-04-15 11:36:44,476 INFO L290 TraceCheckUtils]: 74: Hoare triple {30166#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,476 INFO L290 TraceCheckUtils]: 75: Hoare triple {30166#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); {30166#true} is VALID [2022-04-15 11:36:44,476 INFO L290 TraceCheckUtils]: 76: Hoare triple {30166#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {30166#true} is VALID [2022-04-15 11:36:44,477 INFO L290 TraceCheckUtils]: 77: Hoare triple {30166#true} ~skip~0 := 0; {30166#true} is VALID [2022-04-15 11:36:44,477 INFO L290 TraceCheckUtils]: 78: Hoare triple {30166#true} assume !false; {30166#true} is VALID [2022-04-15 11:36:44,477 INFO L290 TraceCheckUtils]: 79: Hoare triple {30166#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); {30166#true} is VALID [2022-04-15 11:36:44,477 INFO L290 TraceCheckUtils]: 80: Hoare triple {30166#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,477 INFO L290 TraceCheckUtils]: 81: Hoare triple {30166#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,477 INFO L290 TraceCheckUtils]: 82: Hoare triple {30166#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,477 INFO L290 TraceCheckUtils]: 83: Hoare triple {30166#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,477 INFO L290 TraceCheckUtils]: 84: Hoare triple {30166#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,477 INFO L290 TraceCheckUtils]: 85: Hoare triple {30166#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,477 INFO L290 TraceCheckUtils]: 86: Hoare triple {30166#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,477 INFO L290 TraceCheckUtils]: 87: Hoare triple {30166#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,477 INFO L290 TraceCheckUtils]: 88: Hoare triple {30166#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,477 INFO L290 TraceCheckUtils]: 89: Hoare triple {30166#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,478 INFO L290 TraceCheckUtils]: 90: Hoare triple {30166#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-15 11:36:44,478 INFO L290 TraceCheckUtils]: 91: Hoare triple {30166#true} assume 4416 == #t~mem60;havoc #t~mem60; {30166#true} is VALID [2022-04-15 11:36:44,478 INFO L290 TraceCheckUtils]: 92: Hoare triple {30166#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {30166#true} is VALID [2022-04-15 11:36:44,478 INFO L290 TraceCheckUtils]: 93: Hoare triple {30166#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {30166#true} is VALID [2022-04-15 11:36:44,479 INFO L290 TraceCheckUtils]: 94: Hoare triple {30166#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); {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:36:44,479 INFO L290 TraceCheckUtils]: 95: Hoare triple {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:36:44,479 INFO L290 TraceCheckUtils]: 96: Hoare triple {30171#(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); {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:36:44,480 INFO L290 TraceCheckUtils]: 97: Hoare triple {30171#(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; {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:36:44,480 INFO L290 TraceCheckUtils]: 98: Hoare triple {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:36:44,480 INFO L290 TraceCheckUtils]: 99: Hoare triple {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:36:44,481 INFO L290 TraceCheckUtils]: 100: Hoare triple {30171#(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); {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:36:44,481 INFO L290 TraceCheckUtils]: 101: Hoare triple {30171#(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); {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:36:44,481 INFO L290 TraceCheckUtils]: 102: Hoare triple {30171#(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); {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:36:44,482 INFO L290 TraceCheckUtils]: 103: Hoare triple {30171#(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); {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:36:44,482 INFO L290 TraceCheckUtils]: 104: Hoare triple {30171#(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); {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:36:44,482 INFO L290 TraceCheckUtils]: 105: Hoare triple {30171#(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); {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:36:44,483 INFO L290 TraceCheckUtils]: 106: Hoare triple {30171#(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); {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:36:44,483 INFO L290 TraceCheckUtils]: 107: Hoare triple {30171#(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); {30172#(not (= |ssl3_connect_#t~mem56| 4384))} is VALID [2022-04-15 11:36:44,483 INFO L290 TraceCheckUtils]: 108: Hoare triple {30172#(not (= |ssl3_connect_#t~mem56| 4384))} assume 4384 == #t~mem56;havoc #t~mem56; {30167#false} is VALID [2022-04-15 11:36:44,483 INFO L290 TraceCheckUtils]: 109: Hoare triple {30167#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {30167#false} is VALID [2022-04-15 11:36:44,483 INFO L290 TraceCheckUtils]: 110: Hoare triple {30167#false} assume !(1 == ~blastFlag~0); {30167#false} is VALID [2022-04-15 11:36:44,484 INFO L290 TraceCheckUtils]: 111: Hoare triple {30167#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {30167#false} is VALID [2022-04-15 11:36:44,484 INFO L290 TraceCheckUtils]: 112: Hoare triple {30167#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {30167#false} is VALID [2022-04-15 11:36:44,484 INFO L290 TraceCheckUtils]: 113: Hoare triple {30167#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {30167#false} is VALID [2022-04-15 11:36:44,484 INFO L290 TraceCheckUtils]: 114: Hoare triple {30167#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {30167#false} is VALID [2022-04-15 11:36:44,484 INFO L290 TraceCheckUtils]: 115: Hoare triple {30167#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); {30167#false} is VALID [2022-04-15 11:36:44,484 INFO L290 TraceCheckUtils]: 116: Hoare triple {30167#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {30167#false} is VALID [2022-04-15 11:36:44,484 INFO L290 TraceCheckUtils]: 117: Hoare triple {30167#false} ~skip~0 := 0; {30167#false} is VALID [2022-04-15 11:36:44,484 INFO L290 TraceCheckUtils]: 118: Hoare triple {30167#false} assume !false; {30167#false} is VALID [2022-04-15 11:36:44,484 INFO L290 TraceCheckUtils]: 119: Hoare triple {30167#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); {30167#false} is VALID [2022-04-15 11:36:44,484 INFO L290 TraceCheckUtils]: 120: Hoare triple {30167#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30167#false} is VALID [2022-04-15 11:36:44,484 INFO L290 TraceCheckUtils]: 121: Hoare triple {30167#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30167#false} is VALID [2022-04-15 11:36:44,484 INFO L290 TraceCheckUtils]: 122: Hoare triple {30167#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30167#false} is VALID [2022-04-15 11:36:44,484 INFO L290 TraceCheckUtils]: 123: Hoare triple {30167#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30167#false} is VALID [2022-04-15 11:36:44,484 INFO L290 TraceCheckUtils]: 124: Hoare triple {30167#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30167#false} is VALID [2022-04-15 11:36:44,485 INFO L290 TraceCheckUtils]: 125: Hoare triple {30167#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30167#false} is VALID [2022-04-15 11:36:44,485 INFO L290 TraceCheckUtils]: 126: Hoare triple {30167#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30167#false} is VALID [2022-04-15 11:36:44,485 INFO L290 TraceCheckUtils]: 127: Hoare triple {30167#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30167#false} is VALID [2022-04-15 11:36:44,485 INFO L290 TraceCheckUtils]: 128: Hoare triple {30167#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30167#false} is VALID [2022-04-15 11:36:44,485 INFO L290 TraceCheckUtils]: 129: Hoare triple {30167#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {30167#false} is VALID [2022-04-15 11:36:44,485 INFO L290 TraceCheckUtils]: 130: Hoare triple {30167#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {30167#false} is VALID [2022-04-15 11:36:44,485 INFO L290 TraceCheckUtils]: 131: Hoare triple {30167#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {30167#false} is VALID [2022-04-15 11:36:44,485 INFO L290 TraceCheckUtils]: 132: Hoare triple {30167#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {30167#false} is VALID [2022-04-15 11:36:44,485 INFO L290 TraceCheckUtils]: 133: Hoare triple {30167#false} assume 4432 == #t~mem62;havoc #t~mem62; {30167#false} is VALID [2022-04-15 11:36:44,485 INFO L290 TraceCheckUtils]: 134: Hoare triple {30167#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {30167#false} is VALID [2022-04-15 11:36:44,485 INFO L290 TraceCheckUtils]: 135: Hoare triple {30167#false} assume 5 == ~blastFlag~0; {30167#false} is VALID [2022-04-15 11:36:44,485 INFO L290 TraceCheckUtils]: 136: Hoare triple {30167#false} assume !false; {30167#false} is VALID [2022-04-15 11:36:44,486 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-15 11:36:44,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:36:44,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419537219] [2022-04-15 11:36:44,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419537219] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:44,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:44,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:36:44,486 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:36:44,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [538217362] [2022-04-15 11:36:44,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [538217362] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:44,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:44,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:36:44,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735855572] [2022-04-15 11:36:44,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:36:44,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 137 [2022-04-15 11:36:44,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:36:44,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:44,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:44,557 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:36:44,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:44,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:36:44,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:36:44,557 INFO L87 Difference]: Start difference. First operand 681 states and 989 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:46,577 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:36:47,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:47,606 INFO L93 Difference]: Finished difference Result 1735 states and 2536 transitions. [2022-04-15 11:36:47,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:36:47,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 137 [2022-04-15 11:36:47,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:36:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:47,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 11:36:47,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 11:36:47,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-15 11:36:47,900 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-15 11:36:47,943 INFO L225 Difference]: With dead ends: 1735 [2022-04-15 11:36:47,943 INFO L226 Difference]: Without dead ends: 1070 [2022-04-15 11:36:47,944 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:36:47,945 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 110 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:36:47,945 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 284 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:36:47,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2022-04-15 11:36:47,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 711. [2022-04-15 11:36:47,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:36:47,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1070 states. Second operand has 711 states, 706 states have (on average 1.4730878186968839) internal successors, (1040), 706 states have internal predecessors, (1040), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:47,968 INFO L74 IsIncluded]: Start isIncluded. First operand 1070 states. Second operand has 711 states, 706 states have (on average 1.4730878186968839) internal successors, (1040), 706 states have internal predecessors, (1040), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:47,968 INFO L87 Difference]: Start difference. First operand 1070 states. Second operand has 711 states, 706 states have (on average 1.4730878186968839) internal successors, (1040), 706 states have internal predecessors, (1040), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:47,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:47,998 INFO L93 Difference]: Finished difference Result 1070 states and 1562 transitions. [2022-04-15 11:36:47,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1562 transitions. [2022-04-15 11:36:47,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:47,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:48,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 711 states, 706 states have (on average 1.4730878186968839) internal successors, (1040), 706 states have internal predecessors, (1040), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1070 states. [2022-04-15 11:36:48,001 INFO L87 Difference]: Start difference. First operand has 711 states, 706 states have (on average 1.4730878186968839) internal successors, (1040), 706 states have internal predecessors, (1040), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1070 states. [2022-04-15 11:36:48,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:48,032 INFO L93 Difference]: Finished difference Result 1070 states and 1562 transitions. [2022-04-15 11:36:48,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1562 transitions. [2022-04-15 11:36:48,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:48,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:48,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:36:48,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:36:48,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 706 states have (on average 1.4730878186968839) internal successors, (1040), 706 states have internal predecessors, (1040), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:48,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1044 transitions. [2022-04-15 11:36:48,054 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1044 transitions. Word has length 137 [2022-04-15 11:36:48,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:36:48,054 INFO L478 AbstractCegarLoop]: Abstraction has 711 states and 1044 transitions. [2022-04-15 11:36:48,054 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:48,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 711 states and 1044 transitions. [2022-04-15 11:36:48,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1044 edges. 1044 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:48,802 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1044 transitions. [2022-04-15 11:36:48,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-15 11:36:48,803 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:36:48,803 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:36:48,803 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 11:36:48,803 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:36:48,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:36:48,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1627312080, now seen corresponding path program 1 times [2022-04-15 11:36:48,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:48,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1474339991] [2022-04-15 11:37:04,465 WARN L232 SmtUtils]: Spent 11.88s 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-15 11:37:12,042 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:37:12,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1627312080, now seen corresponding path program 2 times [2022-04-15 11:37:12,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:37:12,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537608808] [2022-04-15 11:37:12,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:37:12,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:37:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:12,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:37:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:12,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {37217#(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); {37210#true} is VALID [2022-04-15 11:37:12,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {37210#true} assume true; {37210#true} is VALID [2022-04-15 11:37:12,234 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37210#true} {37210#true} #593#return; {37210#true} is VALID [2022-04-15 11:37:12,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {37210#true} call ULTIMATE.init(); {37217#(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-15 11:37:12,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {37217#(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); {37210#true} is VALID [2022-04-15 11:37:12,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {37210#true} assume true; {37210#true} is VALID [2022-04-15 11:37:12,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37210#true} {37210#true} #593#return; {37210#true} is VALID [2022-04-15 11:37:12,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {37210#true} call #t~ret158 := main(); {37210#true} is VALID [2022-04-15 11:37:12,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {37210#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; {37210#true} is VALID [2022-04-15 11:37:12,236 INFO L272 TraceCheckUtils]: 6: Hoare triple {37210#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {37210#true} is VALID [2022-04-15 11:37:12,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {37210#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); {37210#true} is VALID [2022-04-15 11:37:12,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {37210#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; {37210#true} is VALID [2022-04-15 11:37:12,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {37210#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; {37210#true} is VALID [2022-04-15 11:37:12,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {37210#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {37210#true} is VALID [2022-04-15 11:37:12,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {37210#true} assume !false; {37210#true} is VALID [2022-04-15 11:37:12,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {37210#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); {37210#true} is VALID [2022-04-15 11:37:12,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {37210#true} assume 12292 == #t~mem49;havoc #t~mem49; {37210#true} is VALID [2022-04-15 11:37:12,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {37210#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; {37210#true} is VALID [2022-04-15 11:37:12,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {37210#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {37210#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {37210#true} is VALID [2022-04-15 11:37:12,236 INFO L290 TraceCheckUtils]: 17: Hoare triple {37210#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {37210#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); {37210#true} is VALID [2022-04-15 11:37:12,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {37210#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {37210#true} is VALID [2022-04-15 11:37:12,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {37210#true} assume !(0 == ~tmp___4~0); {37210#true} is VALID [2022-04-15 11:37:12,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {37210#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); {37210#true} is VALID [2022-04-15 11:37:12,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {37210#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); {37210#true} is VALID [2022-04-15 11:37:12,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {37210#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37210#true} is VALID [2022-04-15 11:37:12,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {37210#true} ~skip~0 := 0; {37210#true} is VALID [2022-04-15 11:37:12,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {37210#true} assume !false; {37210#true} is VALID [2022-04-15 11:37:12,237 INFO L290 TraceCheckUtils]: 26: Hoare triple {37210#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); {37210#true} is VALID [2022-04-15 11:37:12,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {37210#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,237 INFO L290 TraceCheckUtils]: 28: Hoare triple {37210#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,237 INFO L290 TraceCheckUtils]: 29: Hoare triple {37210#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,237 INFO L290 TraceCheckUtils]: 30: Hoare triple {37210#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,237 INFO L290 TraceCheckUtils]: 31: Hoare triple {37210#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,238 INFO L290 TraceCheckUtils]: 32: Hoare triple {37210#true} assume 4368 == #t~mem54;havoc #t~mem54; {37210#true} is VALID [2022-04-15 11:37:12,238 INFO L290 TraceCheckUtils]: 33: Hoare triple {37210#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; {37210#true} is VALID [2022-04-15 11:37:12,238 INFO L290 TraceCheckUtils]: 34: Hoare triple {37210#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37210#true} is VALID [2022-04-15 11:37:12,238 INFO L290 TraceCheckUtils]: 35: Hoare triple {37210#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); {37210#true} is VALID [2022-04-15 11:37:12,238 INFO L290 TraceCheckUtils]: 36: Hoare triple {37210#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; {37210#true} is VALID [2022-04-15 11:37:12,238 INFO L290 TraceCheckUtils]: 37: Hoare triple {37210#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); {37210#true} is VALID [2022-04-15 11:37:12,238 INFO L290 TraceCheckUtils]: 38: Hoare triple {37210#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37210#true} is VALID [2022-04-15 11:37:12,238 INFO L290 TraceCheckUtils]: 39: Hoare triple {37210#true} ~skip~0 := 0; {37210#true} is VALID [2022-04-15 11:37:12,238 INFO L290 TraceCheckUtils]: 40: Hoare triple {37210#true} assume !false; {37210#true} is VALID [2022-04-15 11:37:12,238 INFO L290 TraceCheckUtils]: 41: Hoare triple {37210#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); {37210#true} is VALID [2022-04-15 11:37:12,238 INFO L290 TraceCheckUtils]: 42: Hoare triple {37210#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,238 INFO L290 TraceCheckUtils]: 43: Hoare triple {37210#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,238 INFO L290 TraceCheckUtils]: 44: Hoare triple {37210#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,238 INFO L290 TraceCheckUtils]: 45: Hoare triple {37210#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,239 INFO L290 TraceCheckUtils]: 46: Hoare triple {37210#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,239 INFO L290 TraceCheckUtils]: 47: Hoare triple {37210#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,239 INFO L290 TraceCheckUtils]: 48: Hoare triple {37210#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,239 INFO L290 TraceCheckUtils]: 49: Hoare triple {37210#true} assume 4384 == #t~mem56;havoc #t~mem56; {37210#true} is VALID [2022-04-15 11:37:12,239 INFO L290 TraceCheckUtils]: 50: Hoare triple {37210#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {37210#true} is VALID [2022-04-15 11:37:12,239 INFO L290 TraceCheckUtils]: 51: Hoare triple {37210#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {37210#true} is VALID [2022-04-15 11:37:12,239 INFO L290 TraceCheckUtils]: 52: Hoare triple {37210#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,239 INFO L290 TraceCheckUtils]: 53: Hoare triple {37210#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,239 INFO L290 TraceCheckUtils]: 54: Hoare triple {37210#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,239 INFO L290 TraceCheckUtils]: 55: Hoare triple {37210#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); {37210#true} is VALID [2022-04-15 11:37:12,239 INFO L290 TraceCheckUtils]: 56: Hoare triple {37210#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37210#true} is VALID [2022-04-15 11:37:12,239 INFO L290 TraceCheckUtils]: 57: Hoare triple {37210#true} ~skip~0 := 0; {37210#true} is VALID [2022-04-15 11:37:12,239 INFO L290 TraceCheckUtils]: 58: Hoare triple {37210#true} assume !false; {37210#true} is VALID [2022-04-15 11:37:12,240 INFO L290 TraceCheckUtils]: 59: Hoare triple {37210#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); {37210#true} is VALID [2022-04-15 11:37:12,240 INFO L290 TraceCheckUtils]: 60: Hoare triple {37210#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,240 INFO L290 TraceCheckUtils]: 61: Hoare triple {37210#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,240 INFO L290 TraceCheckUtils]: 62: Hoare triple {37210#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,240 INFO L290 TraceCheckUtils]: 63: Hoare triple {37210#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,240 INFO L290 TraceCheckUtils]: 64: Hoare triple {37210#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,240 INFO L290 TraceCheckUtils]: 65: Hoare triple {37210#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,240 INFO L290 TraceCheckUtils]: 66: Hoare triple {37210#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,240 INFO L290 TraceCheckUtils]: 67: Hoare triple {37210#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,240 INFO L290 TraceCheckUtils]: 68: Hoare triple {37210#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,240 INFO L290 TraceCheckUtils]: 69: Hoare triple {37210#true} assume 4400 == #t~mem58;havoc #t~mem58; {37210#true} is VALID [2022-04-15 11:37:12,240 INFO L290 TraceCheckUtils]: 70: Hoare triple {37210#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); {37210#true} is VALID [2022-04-15 11:37:12,240 INFO L290 TraceCheckUtils]: 71: Hoare triple {37210#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; {37210#true} is VALID [2022-04-15 11:37:12,240 INFO L290 TraceCheckUtils]: 72: Hoare triple {37210#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {37210#true} is VALID [2022-04-15 11:37:12,241 INFO L290 TraceCheckUtils]: 73: Hoare triple {37210#true} assume !(~ret~0 <= 0); {37210#true} is VALID [2022-04-15 11:37:12,241 INFO L290 TraceCheckUtils]: 74: Hoare triple {37210#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,241 INFO L290 TraceCheckUtils]: 75: Hoare triple {37210#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); {37210#true} is VALID [2022-04-15 11:37:12,241 INFO L290 TraceCheckUtils]: 76: Hoare triple {37210#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37210#true} is VALID [2022-04-15 11:37:12,241 INFO L290 TraceCheckUtils]: 77: Hoare triple {37210#true} ~skip~0 := 0; {37210#true} is VALID [2022-04-15 11:37:12,241 INFO L290 TraceCheckUtils]: 78: Hoare triple {37210#true} assume !false; {37210#true} is VALID [2022-04-15 11:37:12,241 INFO L290 TraceCheckUtils]: 79: Hoare triple {37210#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); {37210#true} is VALID [2022-04-15 11:37:12,241 INFO L290 TraceCheckUtils]: 80: Hoare triple {37210#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,241 INFO L290 TraceCheckUtils]: 81: Hoare triple {37210#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,241 INFO L290 TraceCheckUtils]: 82: Hoare triple {37210#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,241 INFO L290 TraceCheckUtils]: 83: Hoare triple {37210#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,241 INFO L290 TraceCheckUtils]: 84: Hoare triple {37210#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,241 INFO L290 TraceCheckUtils]: 85: Hoare triple {37210#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,241 INFO L290 TraceCheckUtils]: 86: Hoare triple {37210#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,242 INFO L290 TraceCheckUtils]: 87: Hoare triple {37210#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,242 INFO L290 TraceCheckUtils]: 88: Hoare triple {37210#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,242 INFO L290 TraceCheckUtils]: 89: Hoare triple {37210#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,242 INFO L290 TraceCheckUtils]: 90: Hoare triple {37210#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-15 11:37:12,242 INFO L290 TraceCheckUtils]: 91: Hoare triple {37210#true} assume 4416 == #t~mem60;havoc #t~mem60; {37210#true} is VALID [2022-04-15 11:37:12,242 INFO L290 TraceCheckUtils]: 92: Hoare triple {37210#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {37210#true} is VALID [2022-04-15 11:37:12,242 INFO L290 TraceCheckUtils]: 93: Hoare triple {37210#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {37210#true} is VALID [2022-04-15 11:37:12,243 INFO L290 TraceCheckUtils]: 94: Hoare triple {37210#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); {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:12,243 INFO L290 TraceCheckUtils]: 95: Hoare triple {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:12,243 INFO L290 TraceCheckUtils]: 96: Hoare triple {37215#(= 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); {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:12,244 INFO L290 TraceCheckUtils]: 97: Hoare triple {37215#(= 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; {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:12,244 INFO L290 TraceCheckUtils]: 98: Hoare triple {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:12,244 INFO L290 TraceCheckUtils]: 99: Hoare triple {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:12,244 INFO L290 TraceCheckUtils]: 100: Hoare triple {37215#(= 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); {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:12,245 INFO L290 TraceCheckUtils]: 101: Hoare triple {37215#(= 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); {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:12,245 INFO L290 TraceCheckUtils]: 102: Hoare triple {37215#(= 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); {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:12,245 INFO L290 TraceCheckUtils]: 103: Hoare triple {37215#(= 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); {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:12,246 INFO L290 TraceCheckUtils]: 104: Hoare triple {37215#(= 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); {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:12,246 INFO L290 TraceCheckUtils]: 105: Hoare triple {37215#(= 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); {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:12,246 INFO L290 TraceCheckUtils]: 106: Hoare triple {37215#(= 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); {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:12,246 INFO L290 TraceCheckUtils]: 107: Hoare triple {37215#(= 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); {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:12,247 INFO L290 TraceCheckUtils]: 108: Hoare triple {37215#(= 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); {37216#(= |ssl3_connect_#t~mem57| 4432)} is VALID [2022-04-15 11:37:12,247 INFO L290 TraceCheckUtils]: 109: Hoare triple {37216#(= |ssl3_connect_#t~mem57| 4432)} assume 4385 == #t~mem57;havoc #t~mem57; {37211#false} is VALID [2022-04-15 11:37:12,247 INFO L290 TraceCheckUtils]: 110: Hoare triple {37211#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {37211#false} is VALID [2022-04-15 11:37:12,247 INFO L290 TraceCheckUtils]: 111: Hoare triple {37211#false} assume !(1 == ~blastFlag~0); {37211#false} is VALID [2022-04-15 11:37:12,247 INFO L290 TraceCheckUtils]: 112: Hoare triple {37211#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {37211#false} is VALID [2022-04-15 11:37:12,247 INFO L290 TraceCheckUtils]: 113: Hoare triple {37211#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {37211#false} is VALID [2022-04-15 11:37:12,247 INFO L290 TraceCheckUtils]: 114: Hoare triple {37211#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {37211#false} is VALID [2022-04-15 11:37:12,247 INFO L290 TraceCheckUtils]: 115: Hoare triple {37211#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {37211#false} is VALID [2022-04-15 11:37:12,248 INFO L290 TraceCheckUtils]: 116: Hoare triple {37211#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); {37211#false} is VALID [2022-04-15 11:37:12,248 INFO L290 TraceCheckUtils]: 117: Hoare triple {37211#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37211#false} is VALID [2022-04-15 11:37:12,248 INFO L290 TraceCheckUtils]: 118: Hoare triple {37211#false} ~skip~0 := 0; {37211#false} is VALID [2022-04-15 11:37:12,248 INFO L290 TraceCheckUtils]: 119: Hoare triple {37211#false} assume !false; {37211#false} is VALID [2022-04-15 11:37:12,248 INFO L290 TraceCheckUtils]: 120: Hoare triple {37211#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); {37211#false} is VALID [2022-04-15 11:37:12,248 INFO L290 TraceCheckUtils]: 121: Hoare triple {37211#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37211#false} is VALID [2022-04-15 11:37:12,248 INFO L290 TraceCheckUtils]: 122: Hoare triple {37211#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37211#false} is VALID [2022-04-15 11:37:12,248 INFO L290 TraceCheckUtils]: 123: Hoare triple {37211#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37211#false} is VALID [2022-04-15 11:37:12,248 INFO L290 TraceCheckUtils]: 124: Hoare triple {37211#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37211#false} is VALID [2022-04-15 11:37:12,248 INFO L290 TraceCheckUtils]: 125: Hoare triple {37211#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37211#false} is VALID [2022-04-15 11:37:12,248 INFO L290 TraceCheckUtils]: 126: Hoare triple {37211#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37211#false} is VALID [2022-04-15 11:37:12,248 INFO L290 TraceCheckUtils]: 127: Hoare triple {37211#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37211#false} is VALID [2022-04-15 11:37:12,248 INFO L290 TraceCheckUtils]: 128: Hoare triple {37211#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37211#false} is VALID [2022-04-15 11:37:12,248 INFO L290 TraceCheckUtils]: 129: Hoare triple {37211#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37211#false} is VALID [2022-04-15 11:37:12,249 INFO L290 TraceCheckUtils]: 130: Hoare triple {37211#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {37211#false} is VALID [2022-04-15 11:37:12,249 INFO L290 TraceCheckUtils]: 131: Hoare triple {37211#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {37211#false} is VALID [2022-04-15 11:37:12,249 INFO L290 TraceCheckUtils]: 132: Hoare triple {37211#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {37211#false} is VALID [2022-04-15 11:37:12,249 INFO L290 TraceCheckUtils]: 133: Hoare triple {37211#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {37211#false} is VALID [2022-04-15 11:37:12,249 INFO L290 TraceCheckUtils]: 134: Hoare triple {37211#false} assume 4432 == #t~mem62;havoc #t~mem62; {37211#false} is VALID [2022-04-15 11:37:12,249 INFO L290 TraceCheckUtils]: 135: Hoare triple {37211#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {37211#false} is VALID [2022-04-15 11:37:12,249 INFO L290 TraceCheckUtils]: 136: Hoare triple {37211#false} assume 5 == ~blastFlag~0; {37211#false} is VALID [2022-04-15 11:37:12,249 INFO L290 TraceCheckUtils]: 137: Hoare triple {37211#false} assume !false; {37211#false} is VALID [2022-04-15 11:37:12,249 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-15 11:37:12,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:37:12,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537608808] [2022-04-15 11:37:12,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537608808] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:12,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:12,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:37:12,250 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:37:12,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1474339991] [2022-04-15 11:37:12,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1474339991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:12,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:12,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:37:12,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710971188] [2022-04-15 11:37:12,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:37:12,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 138 [2022-04-15 11:37:12,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:37:12,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:12,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:12,324 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:37:12,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:12,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:37:12,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:37:12,325 INFO L87 Difference]: Start difference. First operand 711 states and 1044 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:14,348 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:37:15,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:15,654 INFO L93 Difference]: Finished difference Result 1749 states and 2574 transitions. [2022-04-15 11:37:15,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:37:15,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 138 [2022-04-15 11:37:15,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:37:15,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:15,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-15 11:37:15,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:15,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-15 11:37:15,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 463 transitions. [2022-04-15 11:37:15,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 463 edges. 463 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:15,978 INFO L225 Difference]: With dead ends: 1749 [2022-04-15 11:37:15,978 INFO L226 Difference]: Without dead ends: 1054 [2022-04-15 11:37:15,979 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:37:15,979 INFO L913 BasicCegarLoop]: 238 mSDtfsCounter, 93 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:37:15,979 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 565 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 527 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:37:15,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2022-04-15 11:37:16,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 787. [2022-04-15 11:37:16,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:37:16,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1054 states. Second operand has 787 states, 782 states have (on average 1.4782608695652173) internal successors, (1156), 782 states have internal predecessors, (1156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:16,006 INFO L74 IsIncluded]: Start isIncluded. First operand 1054 states. Second operand has 787 states, 782 states have (on average 1.4782608695652173) internal successors, (1156), 782 states have internal predecessors, (1156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:16,006 INFO L87 Difference]: Start difference. First operand 1054 states. Second operand has 787 states, 782 states have (on average 1.4782608695652173) internal successors, (1156), 782 states have internal predecessors, (1156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:16,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:16,035 INFO L93 Difference]: Finished difference Result 1054 states and 1546 transitions. [2022-04-15 11:37:16,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1546 transitions. [2022-04-15 11:37:16,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:16,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:16,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 787 states, 782 states have (on average 1.4782608695652173) internal successors, (1156), 782 states have internal predecessors, (1156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1054 states. [2022-04-15 11:37:16,038 INFO L87 Difference]: Start difference. First operand has 787 states, 782 states have (on average 1.4782608695652173) internal successors, (1156), 782 states have internal predecessors, (1156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1054 states. [2022-04-15 11:37:16,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:16,068 INFO L93 Difference]: Finished difference Result 1054 states and 1546 transitions. [2022-04-15 11:37:16,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1546 transitions. [2022-04-15 11:37:16,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:16,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:16,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:37:16,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:37:16,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 782 states have (on average 1.4782608695652173) internal successors, (1156), 782 states have internal predecessors, (1156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:16,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1160 transitions. [2022-04-15 11:37:16,096 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1160 transitions. Word has length 138 [2022-04-15 11:37:16,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:37:16,096 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 1160 transitions. [2022-04-15 11:37:16,096 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:16,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 787 states and 1160 transitions. [2022-04-15 11:37:16,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1160 edges. 1160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:16,965 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1160 transitions. [2022-04-15 11:37:16,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-04-15 11:37:16,966 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:37:16,966 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:37:16,966 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 11:37:16,966 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:37:16,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:37:16,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1029384155, now seen corresponding path program 1 times [2022-04-15 11:37:16,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:16,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [401594322] [2022-04-15 11:37:31,540 WARN L232 SmtUtils]: Spent 9.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-15 11:37:39,287 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:37:39,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1029384155, now seen corresponding path program 2 times [2022-04-15 11:37:39,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:37:39,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173971254] [2022-04-15 11:37:39,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:37:39,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:37:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:39,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:37:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:39,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {44409#(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); {44402#true} is VALID [2022-04-15 11:37:39,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {44402#true} assume true; {44402#true} is VALID [2022-04-15 11:37:39,479 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44402#true} {44402#true} #593#return; {44402#true} is VALID [2022-04-15 11:37:39,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {44402#true} call ULTIMATE.init(); {44409#(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-15 11:37:39,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {44409#(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); {44402#true} is VALID [2022-04-15 11:37:39,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {44402#true} assume true; {44402#true} is VALID [2022-04-15 11:37:39,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44402#true} {44402#true} #593#return; {44402#true} is VALID [2022-04-15 11:37:39,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {44402#true} call #t~ret158 := main(); {44402#true} is VALID [2022-04-15 11:37:39,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {44402#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; {44402#true} is VALID [2022-04-15 11:37:39,480 INFO L272 TraceCheckUtils]: 6: Hoare triple {44402#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {44402#true} is VALID [2022-04-15 11:37:39,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {44402#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); {44402#true} is VALID [2022-04-15 11:37:39,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {44402#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; {44402#true} is VALID [2022-04-15 11:37:39,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {44402#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; {44402#true} is VALID [2022-04-15 11:37:39,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {44402#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {44402#true} is VALID [2022-04-15 11:37:39,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {44402#true} assume !false; {44402#true} is VALID [2022-04-15 11:37:39,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {44402#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); {44402#true} is VALID [2022-04-15 11:37:39,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {44402#true} assume 12292 == #t~mem49;havoc #t~mem49; {44402#true} is VALID [2022-04-15 11:37:39,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {44402#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; {44402#true} is VALID [2022-04-15 11:37:39,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {44402#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {44402#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {44402#true} is VALID [2022-04-15 11:37:39,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {44402#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {44402#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); {44402#true} is VALID [2022-04-15 11:37:39,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {44402#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {44402#true} is VALID [2022-04-15 11:37:39,481 INFO L290 TraceCheckUtils]: 20: Hoare triple {44402#true} assume !(0 == ~tmp___4~0); {44402#true} is VALID [2022-04-15 11:37:39,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {44402#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); {44402#true} is VALID [2022-04-15 11:37:39,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {44402#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); {44402#true} is VALID [2022-04-15 11:37:39,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {44402#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44402#true} is VALID [2022-04-15 11:37:39,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {44402#true} ~skip~0 := 0; {44402#true} is VALID [2022-04-15 11:37:39,482 INFO L290 TraceCheckUtils]: 25: Hoare triple {44402#true} assume !false; {44402#true} is VALID [2022-04-15 11:37:39,482 INFO L290 TraceCheckUtils]: 26: Hoare triple {44402#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); {44402#true} is VALID [2022-04-15 11:37:39,482 INFO L290 TraceCheckUtils]: 27: Hoare triple {44402#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,482 INFO L290 TraceCheckUtils]: 28: Hoare triple {44402#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,482 INFO L290 TraceCheckUtils]: 29: Hoare triple {44402#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,482 INFO L290 TraceCheckUtils]: 30: Hoare triple {44402#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,482 INFO L290 TraceCheckUtils]: 31: Hoare triple {44402#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,482 INFO L290 TraceCheckUtils]: 32: Hoare triple {44402#true} assume 4368 == #t~mem54;havoc #t~mem54; {44402#true} is VALID [2022-04-15 11:37:39,482 INFO L290 TraceCheckUtils]: 33: Hoare triple {44402#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; {44402#true} is VALID [2022-04-15 11:37:39,482 INFO L290 TraceCheckUtils]: 34: Hoare triple {44402#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {44402#true} is VALID [2022-04-15 11:37:39,482 INFO L290 TraceCheckUtils]: 35: Hoare triple {44402#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); {44402#true} is VALID [2022-04-15 11:37:39,482 INFO L290 TraceCheckUtils]: 36: Hoare triple {44402#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; {44402#true} is VALID [2022-04-15 11:37:39,482 INFO L290 TraceCheckUtils]: 37: Hoare triple {44402#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); {44402#true} is VALID [2022-04-15 11:37:39,482 INFO L290 TraceCheckUtils]: 38: Hoare triple {44402#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44402#true} is VALID [2022-04-15 11:37:39,482 INFO L290 TraceCheckUtils]: 39: Hoare triple {44402#true} ~skip~0 := 0; {44402#true} is VALID [2022-04-15 11:37:39,483 INFO L290 TraceCheckUtils]: 40: Hoare triple {44402#true} assume !false; {44402#true} is VALID [2022-04-15 11:37:39,483 INFO L290 TraceCheckUtils]: 41: Hoare triple {44402#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); {44402#true} is VALID [2022-04-15 11:37:39,483 INFO L290 TraceCheckUtils]: 42: Hoare triple {44402#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,483 INFO L290 TraceCheckUtils]: 43: Hoare triple {44402#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,483 INFO L290 TraceCheckUtils]: 44: Hoare triple {44402#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,483 INFO L290 TraceCheckUtils]: 45: Hoare triple {44402#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,483 INFO L290 TraceCheckUtils]: 46: Hoare triple {44402#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,483 INFO L290 TraceCheckUtils]: 47: Hoare triple {44402#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,483 INFO L290 TraceCheckUtils]: 48: Hoare triple {44402#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,483 INFO L290 TraceCheckUtils]: 49: Hoare triple {44402#true} assume 4384 == #t~mem56;havoc #t~mem56; {44402#true} is VALID [2022-04-15 11:37:39,483 INFO L290 TraceCheckUtils]: 50: Hoare triple {44402#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {44402#true} is VALID [2022-04-15 11:37:39,483 INFO L290 TraceCheckUtils]: 51: Hoare triple {44402#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {44402#true} is VALID [2022-04-15 11:37:39,483 INFO L290 TraceCheckUtils]: 52: Hoare triple {44402#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,483 INFO L290 TraceCheckUtils]: 53: Hoare triple {44402#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,484 INFO L290 TraceCheckUtils]: 54: Hoare triple {44402#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,484 INFO L290 TraceCheckUtils]: 55: Hoare triple {44402#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); {44402#true} is VALID [2022-04-15 11:37:39,484 INFO L290 TraceCheckUtils]: 56: Hoare triple {44402#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44402#true} is VALID [2022-04-15 11:37:39,484 INFO L290 TraceCheckUtils]: 57: Hoare triple {44402#true} ~skip~0 := 0; {44402#true} is VALID [2022-04-15 11:37:39,484 INFO L290 TraceCheckUtils]: 58: Hoare triple {44402#true} assume !false; {44402#true} is VALID [2022-04-15 11:37:39,484 INFO L290 TraceCheckUtils]: 59: Hoare triple {44402#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); {44402#true} is VALID [2022-04-15 11:37:39,484 INFO L290 TraceCheckUtils]: 60: Hoare triple {44402#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,484 INFO L290 TraceCheckUtils]: 61: Hoare triple {44402#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,484 INFO L290 TraceCheckUtils]: 62: Hoare triple {44402#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,484 INFO L290 TraceCheckUtils]: 63: Hoare triple {44402#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,484 INFO L290 TraceCheckUtils]: 64: Hoare triple {44402#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,484 INFO L290 TraceCheckUtils]: 65: Hoare triple {44402#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,484 INFO L290 TraceCheckUtils]: 66: Hoare triple {44402#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,484 INFO L290 TraceCheckUtils]: 67: Hoare triple {44402#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,485 INFO L290 TraceCheckUtils]: 68: Hoare triple {44402#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,485 INFO L290 TraceCheckUtils]: 69: Hoare triple {44402#true} assume 4400 == #t~mem58;havoc #t~mem58; {44402#true} is VALID [2022-04-15 11:37:39,485 INFO L290 TraceCheckUtils]: 70: Hoare triple {44402#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); {44402#true} is VALID [2022-04-15 11:37:39,485 INFO L290 TraceCheckUtils]: 71: Hoare triple {44402#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; {44402#true} is VALID [2022-04-15 11:37:39,485 INFO L290 TraceCheckUtils]: 72: Hoare triple {44402#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {44402#true} is VALID [2022-04-15 11:37:39,485 INFO L290 TraceCheckUtils]: 73: Hoare triple {44402#true} assume !(~ret~0 <= 0); {44402#true} is VALID [2022-04-15 11:37:39,485 INFO L290 TraceCheckUtils]: 74: Hoare triple {44402#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,485 INFO L290 TraceCheckUtils]: 75: Hoare triple {44402#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); {44402#true} is VALID [2022-04-15 11:37:39,485 INFO L290 TraceCheckUtils]: 76: Hoare triple {44402#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44402#true} is VALID [2022-04-15 11:37:39,485 INFO L290 TraceCheckUtils]: 77: Hoare triple {44402#true} ~skip~0 := 0; {44402#true} is VALID [2022-04-15 11:37:39,485 INFO L290 TraceCheckUtils]: 78: Hoare triple {44402#true} assume !false; {44402#true} is VALID [2022-04-15 11:37:39,485 INFO L290 TraceCheckUtils]: 79: Hoare triple {44402#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); {44402#true} is VALID [2022-04-15 11:37:39,485 INFO L290 TraceCheckUtils]: 80: Hoare triple {44402#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,485 INFO L290 TraceCheckUtils]: 81: Hoare triple {44402#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,485 INFO L290 TraceCheckUtils]: 82: Hoare triple {44402#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,486 INFO L290 TraceCheckUtils]: 83: Hoare triple {44402#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,486 INFO L290 TraceCheckUtils]: 84: Hoare triple {44402#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,486 INFO L290 TraceCheckUtils]: 85: Hoare triple {44402#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,486 INFO L290 TraceCheckUtils]: 86: Hoare triple {44402#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,486 INFO L290 TraceCheckUtils]: 87: Hoare triple {44402#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,486 INFO L290 TraceCheckUtils]: 88: Hoare triple {44402#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,486 INFO L290 TraceCheckUtils]: 89: Hoare triple {44402#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,486 INFO L290 TraceCheckUtils]: 90: Hoare triple {44402#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-15 11:37:39,486 INFO L290 TraceCheckUtils]: 91: Hoare triple {44402#true} assume 4416 == #t~mem60;havoc #t~mem60; {44402#true} is VALID [2022-04-15 11:37:39,486 INFO L290 TraceCheckUtils]: 92: Hoare triple {44402#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {44402#true} is VALID [2022-04-15 11:37:39,486 INFO L290 TraceCheckUtils]: 93: Hoare triple {44402#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {44402#true} is VALID [2022-04-15 11:37:39,487 INFO L290 TraceCheckUtils]: 94: Hoare triple {44402#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); {44407#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:37:39,487 INFO L290 TraceCheckUtils]: 95: Hoare triple {44407#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {44407#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:37:39,488 INFO L290 TraceCheckUtils]: 96: Hoare triple {44407#(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); {44407#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:37:39,488 INFO L290 TraceCheckUtils]: 97: Hoare triple {44407#(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; {44407#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:37:39,488 INFO L290 TraceCheckUtils]: 98: Hoare triple {44407#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {44407#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:37:39,489 INFO L290 TraceCheckUtils]: 99: Hoare triple {44407#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {44407#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:37:39,489 INFO L290 TraceCheckUtils]: 100: Hoare triple {44407#(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); {44407#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:37:39,489 INFO L290 TraceCheckUtils]: 101: Hoare triple {44407#(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); {44407#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:37:39,490 INFO L290 TraceCheckUtils]: 102: Hoare triple {44407#(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); {44407#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:37:39,490 INFO L290 TraceCheckUtils]: 103: Hoare triple {44407#(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); {44407#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:37:39,490 INFO L290 TraceCheckUtils]: 104: Hoare triple {44407#(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); {44407#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:37:39,491 INFO L290 TraceCheckUtils]: 105: Hoare triple {44407#(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); {44408#(not (= |ssl3_connect_#t~mem54| 4368))} is VALID [2022-04-15 11:37:39,491 INFO L290 TraceCheckUtils]: 106: Hoare triple {44408#(not (= |ssl3_connect_#t~mem54| 4368))} assume 4368 == #t~mem54;havoc #t~mem54; {44403#false} is VALID [2022-04-15 11:37:39,491 INFO L290 TraceCheckUtils]: 107: Hoare triple {44403#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; {44403#false} is VALID [2022-04-15 11:37:39,491 INFO L290 TraceCheckUtils]: 108: Hoare triple {44403#false} assume !(0 == ~blastFlag~0); {44403#false} is VALID [2022-04-15 11:37:39,491 INFO L290 TraceCheckUtils]: 109: Hoare triple {44403#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); {44403#false} is VALID [2022-04-15 11:37:39,491 INFO L290 TraceCheckUtils]: 110: Hoare triple {44403#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; {44403#false} is VALID [2022-04-15 11:37:39,491 INFO L290 TraceCheckUtils]: 111: Hoare triple {44403#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); {44403#false} is VALID [2022-04-15 11:37:39,491 INFO L290 TraceCheckUtils]: 112: Hoare triple {44403#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44403#false} is VALID [2022-04-15 11:37:39,492 INFO L290 TraceCheckUtils]: 113: Hoare triple {44403#false} ~skip~0 := 0; {44403#false} is VALID [2022-04-15 11:37:39,492 INFO L290 TraceCheckUtils]: 114: Hoare triple {44403#false} assume !false; {44403#false} is VALID [2022-04-15 11:37:39,492 INFO L290 TraceCheckUtils]: 115: Hoare triple {44403#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); {44403#false} is VALID [2022-04-15 11:37:39,492 INFO L290 TraceCheckUtils]: 116: Hoare triple {44403#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-15 11:37:39,492 INFO L290 TraceCheckUtils]: 117: Hoare triple {44403#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-15 11:37:39,492 INFO L290 TraceCheckUtils]: 118: Hoare triple {44403#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-15 11:37:39,492 INFO L290 TraceCheckUtils]: 119: Hoare triple {44403#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-15 11:37:39,492 INFO L290 TraceCheckUtils]: 120: Hoare triple {44403#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-15 11:37:39,492 INFO L290 TraceCheckUtils]: 121: Hoare triple {44403#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-15 11:37:39,492 INFO L290 TraceCheckUtils]: 122: Hoare triple {44403#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-15 11:37:39,492 INFO L290 TraceCheckUtils]: 123: Hoare triple {44403#false} assume 4384 == #t~mem56;havoc #t~mem56; {44403#false} is VALID [2022-04-15 11:37:39,492 INFO L290 TraceCheckUtils]: 124: Hoare triple {44403#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {44403#false} is VALID [2022-04-15 11:37:39,492 INFO L290 TraceCheckUtils]: 125: Hoare triple {44403#false} assume !(1 == ~blastFlag~0); {44403#false} is VALID [2022-04-15 11:37:39,492 INFO L290 TraceCheckUtils]: 126: Hoare triple {44403#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {44403#false} is VALID [2022-04-15 11:37:39,493 INFO L290 TraceCheckUtils]: 127: Hoare triple {44403#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {44403#false} is VALID [2022-04-15 11:37:39,493 INFO L290 TraceCheckUtils]: 128: Hoare triple {44403#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-15 11:37:39,493 INFO L290 TraceCheckUtils]: 129: Hoare triple {44403#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {44403#false} is VALID [2022-04-15 11:37:39,493 INFO L290 TraceCheckUtils]: 130: Hoare triple {44403#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); {44403#false} is VALID [2022-04-15 11:37:39,493 INFO L290 TraceCheckUtils]: 131: Hoare triple {44403#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44403#false} is VALID [2022-04-15 11:37:39,493 INFO L290 TraceCheckUtils]: 132: Hoare triple {44403#false} ~skip~0 := 0; {44403#false} is VALID [2022-04-15 11:37:39,493 INFO L290 TraceCheckUtils]: 133: Hoare triple {44403#false} assume !false; {44403#false} is VALID [2022-04-15 11:37:39,493 INFO L290 TraceCheckUtils]: 134: Hoare triple {44403#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); {44403#false} is VALID [2022-04-15 11:37:39,493 INFO L290 TraceCheckUtils]: 135: Hoare triple {44403#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-15 11:37:39,493 INFO L290 TraceCheckUtils]: 136: Hoare triple {44403#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-15 11:37:39,493 INFO L290 TraceCheckUtils]: 137: Hoare triple {44403#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-15 11:37:39,493 INFO L290 TraceCheckUtils]: 138: Hoare triple {44403#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-15 11:37:39,493 INFO L290 TraceCheckUtils]: 139: Hoare triple {44403#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-15 11:37:39,493 INFO L290 TraceCheckUtils]: 140: Hoare triple {44403#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-15 11:37:39,493 INFO L290 TraceCheckUtils]: 141: Hoare triple {44403#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-15 11:37:39,494 INFO L290 TraceCheckUtils]: 142: Hoare triple {44403#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-15 11:37:39,494 INFO L290 TraceCheckUtils]: 143: Hoare triple {44403#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-15 11:37:39,494 INFO L290 TraceCheckUtils]: 144: Hoare triple {44403#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-15 11:37:39,494 INFO L290 TraceCheckUtils]: 145: Hoare triple {44403#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-15 11:37:39,494 INFO L290 TraceCheckUtils]: 146: Hoare triple {44403#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-15 11:37:39,494 INFO L290 TraceCheckUtils]: 147: Hoare triple {44403#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-15 11:37:39,494 INFO L290 TraceCheckUtils]: 148: Hoare triple {44403#false} assume 4432 == #t~mem62;havoc #t~mem62; {44403#false} is VALID [2022-04-15 11:37:39,494 INFO L290 TraceCheckUtils]: 149: Hoare triple {44403#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {44403#false} is VALID [2022-04-15 11:37:39,494 INFO L290 TraceCheckUtils]: 150: Hoare triple {44403#false} assume 5 == ~blastFlag~0; {44403#false} is VALID [2022-04-15 11:37:39,494 INFO L290 TraceCheckUtils]: 151: Hoare triple {44403#false} assume !false; {44403#false} is VALID [2022-04-15 11:37:39,495 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-04-15 11:37:39,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:37:39,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173971254] [2022-04-15 11:37:39,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173971254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:39,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:39,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:37:39,495 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:37:39,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [401594322] [2022-04-15 11:37:39,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [401594322] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:39,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:39,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:37:39,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914914774] [2022-04-15 11:37:39,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:37:39,496 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 152 [2022-04-15 11:37:39,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:37:39,496 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-15 11:37:39,558 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-15 11:37:39,558 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:37:39,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:39,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:37:39,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:37:39,558 INFO L87 Difference]: Start difference. First operand 787 states and 1160 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-15 11:37:41,577 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:37:42,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:42,844 INFO L93 Difference]: Finished difference Result 1871 states and 2755 transitions. [2022-04-15 11:37:42,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:37:42,844 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 152 [2022-04-15 11:37:42,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:37:42,844 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-15 11:37:42,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 11:37:42,846 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-15 11:37:42,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 11:37:42,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-15 11:37:43,134 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-15 11:37:43,192 INFO L225 Difference]: With dead ends: 1871 [2022-04-15 11:37:43,192 INFO L226 Difference]: Without dead ends: 1236 [2022-04-15 11:37:43,193 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:37:43,193 INFO L913 BasicCegarLoop]: 215 mSDtfsCounter, 114 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 31 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:37:43,193 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 512 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 505 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:37:43,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2022-04-15 11:37:43,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 867. [2022-04-15 11:37:43,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:37:43,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1236 states. Second operand has 867 states, 862 states have (on average 1.4698375870069607) internal successors, (1267), 862 states have internal predecessors, (1267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:43,226 INFO L74 IsIncluded]: Start isIncluded. First operand 1236 states. Second operand has 867 states, 862 states have (on average 1.4698375870069607) internal successors, (1267), 862 states have internal predecessors, (1267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:43,227 INFO L87 Difference]: Start difference. First operand 1236 states. Second operand has 867 states, 862 states have (on average 1.4698375870069607) internal successors, (1267), 862 states have internal predecessors, (1267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:43,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:43,264 INFO L93 Difference]: Finished difference Result 1236 states and 1804 transitions. [2022-04-15 11:37:43,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1804 transitions. [2022-04-15 11:37:43,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:43,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:43,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 867 states, 862 states have (on average 1.4698375870069607) internal successors, (1267), 862 states have internal predecessors, (1267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1236 states. [2022-04-15 11:37:43,268 INFO L87 Difference]: Start difference. First operand has 867 states, 862 states have (on average 1.4698375870069607) internal successors, (1267), 862 states have internal predecessors, (1267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1236 states. [2022-04-15 11:37:43,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:43,306 INFO L93 Difference]: Finished difference Result 1236 states and 1804 transitions. [2022-04-15 11:37:43,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1804 transitions. [2022-04-15 11:37:43,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:43,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:43,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:37:43,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:37:43,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 862 states have (on average 1.4698375870069607) internal successors, (1267), 862 states have internal predecessors, (1267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:43,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1271 transitions. [2022-04-15 11:37:43,347 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1271 transitions. Word has length 152 [2022-04-15 11:37:43,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:37:43,348 INFO L478 AbstractCegarLoop]: Abstraction has 867 states and 1271 transitions. [2022-04-15 11:37:43,348 INFO L479 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-15 11:37:43,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 867 states and 1271 transitions. [2022-04-15 11:37:44,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1271 edges. 1271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:44,302 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1271 transitions. [2022-04-15 11:37:44,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-15 11:37:44,303 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:37:44,303 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:37:44,303 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 11:37:44,303 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:37:44,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:37:44,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1636398631, now seen corresponding path program 1 times [2022-04-15 11:37:44,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:44,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1783475610] [2022-04-15 11:37:58,084 WARN L232 SmtUtils]: Spent 12.58s 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-15 11:38:10,678 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:38:10,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1636398631, now seen corresponding path program 2 times [2022-04-15 11:38:10,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:38:10,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650487528] [2022-04-15 11:38:10,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:38:10,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:38:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:10,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:38:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:10,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {52369#(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); {52362#true} is VALID [2022-04-15 11:38:10,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {52362#true} assume true; {52362#true} is VALID [2022-04-15 11:38:10,845 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52362#true} {52362#true} #593#return; {52362#true} is VALID [2022-04-15 11:38:10,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {52362#true} call ULTIMATE.init(); {52369#(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-15 11:38:10,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {52369#(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); {52362#true} is VALID [2022-04-15 11:38:10,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {52362#true} assume true; {52362#true} is VALID [2022-04-15 11:38:10,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52362#true} {52362#true} #593#return; {52362#true} is VALID [2022-04-15 11:38:10,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {52362#true} call #t~ret158 := main(); {52362#true} is VALID [2022-04-15 11:38:10,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {52362#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; {52362#true} is VALID [2022-04-15 11:38:10,846 INFO L272 TraceCheckUtils]: 6: Hoare triple {52362#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {52362#true} is VALID [2022-04-15 11:38:10,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {52362#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); {52362#true} is VALID [2022-04-15 11:38:10,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {52362#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; {52362#true} is VALID [2022-04-15 11:38:10,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {52362#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; {52362#true} is VALID [2022-04-15 11:38:10,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {52362#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {52362#true} is VALID [2022-04-15 11:38:10,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {52362#true} assume !false; {52362#true} is VALID [2022-04-15 11:38:10,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {52362#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); {52362#true} is VALID [2022-04-15 11:38:10,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {52362#true} assume 12292 == #t~mem49;havoc #t~mem49; {52362#true} is VALID [2022-04-15 11:38:10,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {52362#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; {52362#true} is VALID [2022-04-15 11:38:10,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {52362#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {52362#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {52362#true} is VALID [2022-04-15 11:38:10,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {52362#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {52362#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); {52362#true} is VALID [2022-04-15 11:38:10,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {52362#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {52362#true} is VALID [2022-04-15 11:38:10,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {52362#true} assume !(0 == ~tmp___4~0); {52362#true} is VALID [2022-04-15 11:38:10,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {52362#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); {52362#true} is VALID [2022-04-15 11:38:10,848 INFO L290 TraceCheckUtils]: 22: Hoare triple {52362#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); {52362#true} is VALID [2022-04-15 11:38:10,848 INFO L290 TraceCheckUtils]: 23: Hoare triple {52362#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52362#true} is VALID [2022-04-15 11:38:10,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {52362#true} ~skip~0 := 0; {52362#true} is VALID [2022-04-15 11:38:10,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {52362#true} assume !false; {52362#true} is VALID [2022-04-15 11:38:10,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {52362#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); {52362#true} is VALID [2022-04-15 11:38:10,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {52362#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,848 INFO L290 TraceCheckUtils]: 28: Hoare triple {52362#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {52362#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {52362#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,848 INFO L290 TraceCheckUtils]: 31: Hoare triple {52362#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,848 INFO L290 TraceCheckUtils]: 32: Hoare triple {52362#true} assume 4368 == #t~mem54;havoc #t~mem54; {52362#true} is VALID [2022-04-15 11:38:10,848 INFO L290 TraceCheckUtils]: 33: Hoare triple {52362#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; {52362#true} is VALID [2022-04-15 11:38:10,848 INFO L290 TraceCheckUtils]: 34: Hoare triple {52362#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {52362#true} is VALID [2022-04-15 11:38:10,849 INFO L290 TraceCheckUtils]: 35: Hoare triple {52362#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); {52362#true} is VALID [2022-04-15 11:38:10,849 INFO L290 TraceCheckUtils]: 36: Hoare triple {52362#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; {52362#true} is VALID [2022-04-15 11:38:10,849 INFO L290 TraceCheckUtils]: 37: Hoare triple {52362#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); {52362#true} is VALID [2022-04-15 11:38:10,849 INFO L290 TraceCheckUtils]: 38: Hoare triple {52362#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52362#true} is VALID [2022-04-15 11:38:10,849 INFO L290 TraceCheckUtils]: 39: Hoare triple {52362#true} ~skip~0 := 0; {52362#true} is VALID [2022-04-15 11:38:10,849 INFO L290 TraceCheckUtils]: 40: Hoare triple {52362#true} assume !false; {52362#true} is VALID [2022-04-15 11:38:10,849 INFO L290 TraceCheckUtils]: 41: Hoare triple {52362#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); {52362#true} is VALID [2022-04-15 11:38:10,849 INFO L290 TraceCheckUtils]: 42: Hoare triple {52362#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,849 INFO L290 TraceCheckUtils]: 43: Hoare triple {52362#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,849 INFO L290 TraceCheckUtils]: 44: Hoare triple {52362#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,849 INFO L290 TraceCheckUtils]: 45: Hoare triple {52362#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,849 INFO L290 TraceCheckUtils]: 46: Hoare triple {52362#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,849 INFO L290 TraceCheckUtils]: 47: Hoare triple {52362#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,849 INFO L290 TraceCheckUtils]: 48: Hoare triple {52362#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,849 INFO L290 TraceCheckUtils]: 49: Hoare triple {52362#true} assume 4384 == #t~mem56;havoc #t~mem56; {52362#true} is VALID [2022-04-15 11:38:10,850 INFO L290 TraceCheckUtils]: 50: Hoare triple {52362#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {52362#true} is VALID [2022-04-15 11:38:10,850 INFO L290 TraceCheckUtils]: 51: Hoare triple {52362#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {52362#true} is VALID [2022-04-15 11:38:10,850 INFO L290 TraceCheckUtils]: 52: Hoare triple {52362#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,850 INFO L290 TraceCheckUtils]: 53: Hoare triple {52362#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,850 INFO L290 TraceCheckUtils]: 54: Hoare triple {52362#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,850 INFO L290 TraceCheckUtils]: 55: Hoare triple {52362#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); {52362#true} is VALID [2022-04-15 11:38:10,850 INFO L290 TraceCheckUtils]: 56: Hoare triple {52362#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52362#true} is VALID [2022-04-15 11:38:10,850 INFO L290 TraceCheckUtils]: 57: Hoare triple {52362#true} ~skip~0 := 0; {52362#true} is VALID [2022-04-15 11:38:10,850 INFO L290 TraceCheckUtils]: 58: Hoare triple {52362#true} assume !false; {52362#true} is VALID [2022-04-15 11:38:10,850 INFO L290 TraceCheckUtils]: 59: Hoare triple {52362#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); {52362#true} is VALID [2022-04-15 11:38:10,850 INFO L290 TraceCheckUtils]: 60: Hoare triple {52362#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,850 INFO L290 TraceCheckUtils]: 61: Hoare triple {52362#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,850 INFO L290 TraceCheckUtils]: 62: Hoare triple {52362#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,850 INFO L290 TraceCheckUtils]: 63: Hoare triple {52362#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,851 INFO L290 TraceCheckUtils]: 64: Hoare triple {52362#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,851 INFO L290 TraceCheckUtils]: 65: Hoare triple {52362#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,851 INFO L290 TraceCheckUtils]: 66: Hoare triple {52362#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,851 INFO L290 TraceCheckUtils]: 67: Hoare triple {52362#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,851 INFO L290 TraceCheckUtils]: 68: Hoare triple {52362#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,851 INFO L290 TraceCheckUtils]: 69: Hoare triple {52362#true} assume 4400 == #t~mem58;havoc #t~mem58; {52362#true} is VALID [2022-04-15 11:38:10,851 INFO L290 TraceCheckUtils]: 70: Hoare triple {52362#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); {52362#true} is VALID [2022-04-15 11:38:10,851 INFO L290 TraceCheckUtils]: 71: Hoare triple {52362#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; {52362#true} is VALID [2022-04-15 11:38:10,851 INFO L290 TraceCheckUtils]: 72: Hoare triple {52362#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {52362#true} is VALID [2022-04-15 11:38:10,851 INFO L290 TraceCheckUtils]: 73: Hoare triple {52362#true} assume !(~ret~0 <= 0); {52362#true} is VALID [2022-04-15 11:38:10,851 INFO L290 TraceCheckUtils]: 74: Hoare triple {52362#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,851 INFO L290 TraceCheckUtils]: 75: Hoare triple {52362#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); {52362#true} is VALID [2022-04-15 11:38:10,851 INFO L290 TraceCheckUtils]: 76: Hoare triple {52362#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52362#true} is VALID [2022-04-15 11:38:10,851 INFO L290 TraceCheckUtils]: 77: Hoare triple {52362#true} ~skip~0 := 0; {52362#true} is VALID [2022-04-15 11:38:10,852 INFO L290 TraceCheckUtils]: 78: Hoare triple {52362#true} assume !false; {52362#true} is VALID [2022-04-15 11:38:10,852 INFO L290 TraceCheckUtils]: 79: Hoare triple {52362#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); {52362#true} is VALID [2022-04-15 11:38:10,856 INFO L290 TraceCheckUtils]: 80: Hoare triple {52362#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,856 INFO L290 TraceCheckUtils]: 81: Hoare triple {52362#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,856 INFO L290 TraceCheckUtils]: 82: Hoare triple {52362#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,856 INFO L290 TraceCheckUtils]: 83: Hoare triple {52362#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,856 INFO L290 TraceCheckUtils]: 84: Hoare triple {52362#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,856 INFO L290 TraceCheckUtils]: 85: Hoare triple {52362#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,856 INFO L290 TraceCheckUtils]: 86: Hoare triple {52362#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,856 INFO L290 TraceCheckUtils]: 87: Hoare triple {52362#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,856 INFO L290 TraceCheckUtils]: 88: Hoare triple {52362#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,856 INFO L290 TraceCheckUtils]: 89: Hoare triple {52362#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,857 INFO L290 TraceCheckUtils]: 90: Hoare triple {52362#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-15 11:38:10,857 INFO L290 TraceCheckUtils]: 91: Hoare triple {52362#true} assume 4416 == #t~mem60;havoc #t~mem60; {52362#true} is VALID [2022-04-15 11:38:10,857 INFO L290 TraceCheckUtils]: 92: Hoare triple {52362#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {52362#true} is VALID [2022-04-15 11:38:10,857 INFO L290 TraceCheckUtils]: 93: Hoare triple {52362#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {52362#true} is VALID [2022-04-15 11:38:10,858 INFO L290 TraceCheckUtils]: 94: Hoare triple {52362#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); {52367#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:38:10,858 INFO L290 TraceCheckUtils]: 95: Hoare triple {52367#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {52367#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:38:10,858 INFO L290 TraceCheckUtils]: 96: Hoare triple {52367#(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); {52367#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:38:10,859 INFO L290 TraceCheckUtils]: 97: Hoare triple {52367#(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; {52367#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:38:10,859 INFO L290 TraceCheckUtils]: 98: Hoare triple {52367#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {52367#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:38:10,859 INFO L290 TraceCheckUtils]: 99: Hoare triple {52367#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {52367#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:38:10,860 INFO L290 TraceCheckUtils]: 100: Hoare triple {52367#(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); {52367#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:38:10,860 INFO L290 TraceCheckUtils]: 101: Hoare triple {52367#(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); {52367#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:38:10,860 INFO L290 TraceCheckUtils]: 102: Hoare triple {52367#(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); {52368#(not (= |ssl3_connect_#t~mem51| 4096))} is VALID [2022-04-15 11:38:10,861 INFO L290 TraceCheckUtils]: 103: Hoare triple {52368#(not (= |ssl3_connect_#t~mem51| 4096))} assume 4096 == #t~mem51;havoc #t~mem51; {52363#false} is VALID [2022-04-15 11:38:10,861 INFO L290 TraceCheckUtils]: 104: Hoare triple {52363#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {52363#false} is VALID [2022-04-15 11:38:10,861 INFO L290 TraceCheckUtils]: 105: Hoare triple {52363#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {52363#false} is VALID [2022-04-15 11:38:10,861 INFO L290 TraceCheckUtils]: 106: Hoare triple {52363#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {52363#false} is VALID [2022-04-15 11:38:10,861 INFO L290 TraceCheckUtils]: 107: Hoare triple {52363#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); {52363#false} is VALID [2022-04-15 11:38:10,861 INFO L290 TraceCheckUtils]: 108: Hoare triple {52363#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {52363#false} is VALID [2022-04-15 11:38:10,861 INFO L290 TraceCheckUtils]: 109: Hoare triple {52363#false} assume !(0 == ~tmp___4~0); {52363#false} is VALID [2022-04-15 11:38:10,861 INFO L290 TraceCheckUtils]: 110: Hoare triple {52363#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); {52363#false} is VALID [2022-04-15 11:38:10,861 INFO L290 TraceCheckUtils]: 111: Hoare triple {52363#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); {52363#false} is VALID [2022-04-15 11:38:10,861 INFO L290 TraceCheckUtils]: 112: Hoare triple {52363#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52363#false} is VALID [2022-04-15 11:38:10,861 INFO L290 TraceCheckUtils]: 113: Hoare triple {52363#false} ~skip~0 := 0; {52363#false} is VALID [2022-04-15 11:38:10,861 INFO L290 TraceCheckUtils]: 114: Hoare triple {52363#false} assume !false; {52363#false} is VALID [2022-04-15 11:38:10,862 INFO L290 TraceCheckUtils]: 115: Hoare triple {52363#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); {52363#false} is VALID [2022-04-15 11:38:10,862 INFO L290 TraceCheckUtils]: 116: Hoare triple {52363#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-15 11:38:10,862 INFO L290 TraceCheckUtils]: 117: Hoare triple {52363#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-15 11:38:10,862 INFO L290 TraceCheckUtils]: 118: Hoare triple {52363#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-15 11:38:10,862 INFO L290 TraceCheckUtils]: 119: Hoare triple {52363#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-15 11:38:10,862 INFO L290 TraceCheckUtils]: 120: Hoare triple {52363#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-15 11:38:10,862 INFO L290 TraceCheckUtils]: 121: Hoare triple {52363#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-15 11:38:10,862 INFO L290 TraceCheckUtils]: 122: Hoare triple {52363#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-15 11:38:10,862 INFO L290 TraceCheckUtils]: 123: Hoare triple {52363#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-15 11:38:10,862 INFO L290 TraceCheckUtils]: 124: Hoare triple {52363#false} assume 4385 == #t~mem57;havoc #t~mem57; {52363#false} is VALID [2022-04-15 11:38:10,862 INFO L290 TraceCheckUtils]: 125: Hoare triple {52363#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {52363#false} is VALID [2022-04-15 11:38:10,862 INFO L290 TraceCheckUtils]: 126: Hoare triple {52363#false} assume !(1 == ~blastFlag~0); {52363#false} is VALID [2022-04-15 11:38:10,862 INFO L290 TraceCheckUtils]: 127: Hoare triple {52363#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {52363#false} is VALID [2022-04-15 11:38:10,862 INFO L290 TraceCheckUtils]: 128: Hoare triple {52363#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {52363#false} is VALID [2022-04-15 11:38:10,862 INFO L290 TraceCheckUtils]: 129: Hoare triple {52363#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-15 11:38:10,863 INFO L290 TraceCheckUtils]: 130: Hoare triple {52363#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {52363#false} is VALID [2022-04-15 11:38:10,863 INFO L290 TraceCheckUtils]: 131: Hoare triple {52363#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); {52363#false} is VALID [2022-04-15 11:38:10,863 INFO L290 TraceCheckUtils]: 132: Hoare triple {52363#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52363#false} is VALID [2022-04-15 11:38:10,863 INFO L290 TraceCheckUtils]: 133: Hoare triple {52363#false} ~skip~0 := 0; {52363#false} is VALID [2022-04-15 11:38:10,863 INFO L290 TraceCheckUtils]: 134: Hoare triple {52363#false} assume !false; {52363#false} is VALID [2022-04-15 11:38:10,863 INFO L290 TraceCheckUtils]: 135: Hoare triple {52363#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); {52363#false} is VALID [2022-04-15 11:38:10,863 INFO L290 TraceCheckUtils]: 136: Hoare triple {52363#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-15 11:38:10,863 INFO L290 TraceCheckUtils]: 137: Hoare triple {52363#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-15 11:38:10,863 INFO L290 TraceCheckUtils]: 138: Hoare triple {52363#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-15 11:38:10,863 INFO L290 TraceCheckUtils]: 139: Hoare triple {52363#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-15 11:38:10,863 INFO L290 TraceCheckUtils]: 140: Hoare triple {52363#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-15 11:38:10,863 INFO L290 TraceCheckUtils]: 141: Hoare triple {52363#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-15 11:38:10,863 INFO L290 TraceCheckUtils]: 142: Hoare triple {52363#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-15 11:38:10,863 INFO L290 TraceCheckUtils]: 143: Hoare triple {52363#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-15 11:38:10,864 INFO L290 TraceCheckUtils]: 144: Hoare triple {52363#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-15 11:38:10,864 INFO L290 TraceCheckUtils]: 145: Hoare triple {52363#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-15 11:38:10,864 INFO L290 TraceCheckUtils]: 146: Hoare triple {52363#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-15 11:38:10,864 INFO L290 TraceCheckUtils]: 147: Hoare triple {52363#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-15 11:38:10,864 INFO L290 TraceCheckUtils]: 148: Hoare triple {52363#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-15 11:38:10,864 INFO L290 TraceCheckUtils]: 149: Hoare triple {52363#false} assume 4432 == #t~mem62;havoc #t~mem62; {52363#false} is VALID [2022-04-15 11:38:10,864 INFO L290 TraceCheckUtils]: 150: Hoare triple {52363#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {52363#false} is VALID [2022-04-15 11:38:10,864 INFO L290 TraceCheckUtils]: 151: Hoare triple {52363#false} assume 5 == ~blastFlag~0; {52363#false} is VALID [2022-04-15 11:38:10,864 INFO L290 TraceCheckUtils]: 152: Hoare triple {52363#false} assume !false; {52363#false} is VALID [2022-04-15 11:38:10,864 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-15 11:38:10,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:38:10,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650487528] [2022-04-15 11:38:10,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650487528] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:10,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:10,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:38:10,867 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:38:10,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1783475610] [2022-04-15 11:38:10,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1783475610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:10,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:10,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:38:10,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504188166] [2022-04-15 11:38:10,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:38:10,868 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 153 [2022-04-15 11:38:10,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:38:10,868 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-15 11:38:10,935 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-15 11:38:10,935 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:38:10,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:10,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:38:10,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:38:10,936 INFO L87 Difference]: Start difference. First operand 867 states and 1271 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-15 11:38:12,955 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:38:14,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:14,085 INFO L93 Difference]: Finished difference Result 2077 states and 3040 transitions. [2022-04-15 11:38:14,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:38:14,085 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 153 [2022-04-15 11:38:14,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:38:14,085 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-15 11:38:14,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 11:38:14,087 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-15 11:38:14,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 11:38:14,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-15 11:38:14,378 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-15 11:38:14,454 INFO L225 Difference]: With dead ends: 2077 [2022-04-15 11:38:14,455 INFO L226 Difference]: Without dead ends: 1226 [2022-04-15 11:38:14,456 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:38:14,456 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 117 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:38:14,456 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 300 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 394 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:38:14,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2022-04-15 11:38:14,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 867. [2022-04-15 11:38:14,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:38:14,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1226 states. Second operand has 867 states, 862 states have (on average 1.4535962877030162) internal successors, (1253), 862 states have internal predecessors, (1253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:14,493 INFO L74 IsIncluded]: Start isIncluded. First operand 1226 states. Second operand has 867 states, 862 states have (on average 1.4535962877030162) internal successors, (1253), 862 states have internal predecessors, (1253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:14,494 INFO L87 Difference]: Start difference. First operand 1226 states. Second operand has 867 states, 862 states have (on average 1.4535962877030162) internal successors, (1253), 862 states have internal predecessors, (1253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:14,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:14,531 INFO L93 Difference]: Finished difference Result 1226 states and 1775 transitions. [2022-04-15 11:38:14,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1775 transitions. [2022-04-15 11:38:14,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:14,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:14,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 867 states, 862 states have (on average 1.4535962877030162) internal successors, (1253), 862 states have internal predecessors, (1253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1226 states. [2022-04-15 11:38:14,533 INFO L87 Difference]: Start difference. First operand has 867 states, 862 states have (on average 1.4535962877030162) internal successors, (1253), 862 states have internal predecessors, (1253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1226 states. [2022-04-15 11:38:14,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:14,571 INFO L93 Difference]: Finished difference Result 1226 states and 1775 transitions. [2022-04-15 11:38:14,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1775 transitions. [2022-04-15 11:38:14,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:14,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:14,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:38:14,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:38:14,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 862 states have (on average 1.4535962877030162) internal successors, (1253), 862 states have internal predecessors, (1253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:14,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1257 transitions. [2022-04-15 11:38:14,603 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1257 transitions. Word has length 153 [2022-04-15 11:38:14,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:38:14,603 INFO L478 AbstractCegarLoop]: Abstraction has 867 states and 1257 transitions. [2022-04-15 11:38:14,603 INFO L479 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-15 11:38:14,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 867 states and 1257 transitions. [2022-04-15 11:38:15,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1257 edges. 1257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:15,619 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1257 transitions. [2022-04-15 11:38:15,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-15 11:38:15,621 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:38:15,621 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:38:15,621 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 11:38:15,621 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:38:15,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:38:15,621 INFO L85 PathProgramCache]: Analyzing trace with hash -374709224, now seen corresponding path program 1 times [2022-04-15 11:38:15,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:15,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1521688819] [2022-04-15 11:38:28,522 WARN L232 SmtUtils]: Spent 8.46s 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-15 11:38:37,469 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:38:37,469 INFO L85 PathProgramCache]: Analyzing trace with hash -374709224, now seen corresponding path program 2 times [2022-04-15 11:38:37,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:38:37,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137605280] [2022-04-15 11:38:37,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:38:37,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:38:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:37,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:38:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:37,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {60721#(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); {60714#true} is VALID [2022-04-15 11:38:37,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {60714#true} assume true; {60714#true} is VALID [2022-04-15 11:38:37,633 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60714#true} {60714#true} #593#return; {60714#true} is VALID [2022-04-15 11:38:37,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {60714#true} call ULTIMATE.init(); {60721#(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-15 11:38:37,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {60721#(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); {60714#true} is VALID [2022-04-15 11:38:37,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {60714#true} assume true; {60714#true} is VALID [2022-04-15 11:38:37,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60714#true} {60714#true} #593#return; {60714#true} is VALID [2022-04-15 11:38:37,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {60714#true} call #t~ret158 := main(); {60714#true} is VALID [2022-04-15 11:38:37,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {60714#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; {60714#true} is VALID [2022-04-15 11:38:37,634 INFO L272 TraceCheckUtils]: 6: Hoare triple {60714#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {60714#true} is VALID [2022-04-15 11:38:37,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {60714#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); {60714#true} is VALID [2022-04-15 11:38:37,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {60714#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; {60714#true} is VALID [2022-04-15 11:38:37,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {60714#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; {60714#true} is VALID [2022-04-15 11:38:37,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {60714#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {60714#true} is VALID [2022-04-15 11:38:37,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {60714#true} assume !false; {60714#true} is VALID [2022-04-15 11:38:37,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {60714#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); {60714#true} is VALID [2022-04-15 11:38:37,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {60714#true} assume 12292 == #t~mem49;havoc #t~mem49; {60714#true} is VALID [2022-04-15 11:38:37,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {60714#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; {60714#true} is VALID [2022-04-15 11:38:37,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {60714#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {60714#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {60714#true} is VALID [2022-04-15 11:38:37,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {60714#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {60714#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); {60714#true} is VALID [2022-04-15 11:38:37,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {60714#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {60714#true} is VALID [2022-04-15 11:38:37,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {60714#true} assume !(0 == ~tmp___4~0); {60714#true} is VALID [2022-04-15 11:38:37,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {60714#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); {60714#true} is VALID [2022-04-15 11:38:37,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {60714#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); {60714#true} is VALID [2022-04-15 11:38:37,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {60714#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {60714#true} is VALID [2022-04-15 11:38:37,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {60714#true} ~skip~0 := 0; {60714#true} is VALID [2022-04-15 11:38:37,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {60714#true} assume !false; {60714#true} is VALID [2022-04-15 11:38:37,635 INFO L290 TraceCheckUtils]: 26: Hoare triple {60714#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); {60714#true} is VALID [2022-04-15 11:38:37,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {60714#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,635 INFO L290 TraceCheckUtils]: 28: Hoare triple {60714#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {60714#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {60714#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,636 INFO L290 TraceCheckUtils]: 31: Hoare triple {60714#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,636 INFO L290 TraceCheckUtils]: 32: Hoare triple {60714#true} assume 4368 == #t~mem54;havoc #t~mem54; {60714#true} is VALID [2022-04-15 11:38:37,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {60714#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; {60714#true} is VALID [2022-04-15 11:38:37,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {60714#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {60714#true} is VALID [2022-04-15 11:38:37,636 INFO L290 TraceCheckUtils]: 35: Hoare triple {60714#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); {60714#true} is VALID [2022-04-15 11:38:37,636 INFO L290 TraceCheckUtils]: 36: Hoare triple {60714#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; {60714#true} is VALID [2022-04-15 11:38:37,636 INFO L290 TraceCheckUtils]: 37: Hoare triple {60714#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); {60714#true} is VALID [2022-04-15 11:38:37,636 INFO L290 TraceCheckUtils]: 38: Hoare triple {60714#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {60714#true} is VALID [2022-04-15 11:38:37,636 INFO L290 TraceCheckUtils]: 39: Hoare triple {60714#true} ~skip~0 := 0; {60714#true} is VALID [2022-04-15 11:38:37,636 INFO L290 TraceCheckUtils]: 40: Hoare triple {60714#true} assume !false; {60714#true} is VALID [2022-04-15 11:38:37,636 INFO L290 TraceCheckUtils]: 41: Hoare triple {60714#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); {60714#true} is VALID [2022-04-15 11:38:37,636 INFO L290 TraceCheckUtils]: 42: Hoare triple {60714#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,636 INFO L290 TraceCheckUtils]: 43: Hoare triple {60714#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,637 INFO L290 TraceCheckUtils]: 44: Hoare triple {60714#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,637 INFO L290 TraceCheckUtils]: 45: Hoare triple {60714#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,637 INFO L290 TraceCheckUtils]: 46: Hoare triple {60714#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,637 INFO L290 TraceCheckUtils]: 47: Hoare triple {60714#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,637 INFO L290 TraceCheckUtils]: 48: Hoare triple {60714#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,637 INFO L290 TraceCheckUtils]: 49: Hoare triple {60714#true} assume 4384 == #t~mem56;havoc #t~mem56; {60714#true} is VALID [2022-04-15 11:38:37,637 INFO L290 TraceCheckUtils]: 50: Hoare triple {60714#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {60714#true} is VALID [2022-04-15 11:38:37,637 INFO L290 TraceCheckUtils]: 51: Hoare triple {60714#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {60714#true} is VALID [2022-04-15 11:38:37,637 INFO L290 TraceCheckUtils]: 52: Hoare triple {60714#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,637 INFO L290 TraceCheckUtils]: 53: Hoare triple {60714#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,637 INFO L290 TraceCheckUtils]: 54: Hoare triple {60714#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,637 INFO L290 TraceCheckUtils]: 55: Hoare triple {60714#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); {60714#true} is VALID [2022-04-15 11:38:37,637 INFO L290 TraceCheckUtils]: 56: Hoare triple {60714#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {60714#true} is VALID [2022-04-15 11:38:37,637 INFO L290 TraceCheckUtils]: 57: Hoare triple {60714#true} ~skip~0 := 0; {60714#true} is VALID [2022-04-15 11:38:37,638 INFO L290 TraceCheckUtils]: 58: Hoare triple {60714#true} assume !false; {60714#true} is VALID [2022-04-15 11:38:37,638 INFO L290 TraceCheckUtils]: 59: Hoare triple {60714#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); {60714#true} is VALID [2022-04-15 11:38:37,638 INFO L290 TraceCheckUtils]: 60: Hoare triple {60714#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,638 INFO L290 TraceCheckUtils]: 61: Hoare triple {60714#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,638 INFO L290 TraceCheckUtils]: 62: Hoare triple {60714#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,638 INFO L290 TraceCheckUtils]: 63: Hoare triple {60714#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,638 INFO L290 TraceCheckUtils]: 64: Hoare triple {60714#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,638 INFO L290 TraceCheckUtils]: 65: Hoare triple {60714#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,638 INFO L290 TraceCheckUtils]: 66: Hoare triple {60714#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,638 INFO L290 TraceCheckUtils]: 67: Hoare triple {60714#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,638 INFO L290 TraceCheckUtils]: 68: Hoare triple {60714#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,638 INFO L290 TraceCheckUtils]: 69: Hoare triple {60714#true} assume 4400 == #t~mem58;havoc #t~mem58; {60714#true} is VALID [2022-04-15 11:38:37,638 INFO L290 TraceCheckUtils]: 70: Hoare triple {60714#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); {60714#true} is VALID [2022-04-15 11:38:37,638 INFO L290 TraceCheckUtils]: 71: Hoare triple {60714#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; {60714#true} is VALID [2022-04-15 11:38:37,639 INFO L290 TraceCheckUtils]: 72: Hoare triple {60714#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {60714#true} is VALID [2022-04-15 11:38:37,639 INFO L290 TraceCheckUtils]: 73: Hoare triple {60714#true} assume !(~ret~0 <= 0); {60714#true} is VALID [2022-04-15 11:38:37,639 INFO L290 TraceCheckUtils]: 74: Hoare triple {60714#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,639 INFO L290 TraceCheckUtils]: 75: Hoare triple {60714#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); {60714#true} is VALID [2022-04-15 11:38:37,639 INFO L290 TraceCheckUtils]: 76: Hoare triple {60714#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {60714#true} is VALID [2022-04-15 11:38:37,639 INFO L290 TraceCheckUtils]: 77: Hoare triple {60714#true} ~skip~0 := 0; {60714#true} is VALID [2022-04-15 11:38:37,639 INFO L290 TraceCheckUtils]: 78: Hoare triple {60714#true} assume !false; {60714#true} is VALID [2022-04-15 11:38:37,639 INFO L290 TraceCheckUtils]: 79: Hoare triple {60714#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); {60714#true} is VALID [2022-04-15 11:38:37,639 INFO L290 TraceCheckUtils]: 80: Hoare triple {60714#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,639 INFO L290 TraceCheckUtils]: 81: Hoare triple {60714#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,639 INFO L290 TraceCheckUtils]: 82: Hoare triple {60714#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,639 INFO L290 TraceCheckUtils]: 83: Hoare triple {60714#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,639 INFO L290 TraceCheckUtils]: 84: Hoare triple {60714#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,639 INFO L290 TraceCheckUtils]: 85: Hoare triple {60714#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,640 INFO L290 TraceCheckUtils]: 86: Hoare triple {60714#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,640 INFO L290 TraceCheckUtils]: 87: Hoare triple {60714#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,640 INFO L290 TraceCheckUtils]: 88: Hoare triple {60714#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,640 INFO L290 TraceCheckUtils]: 89: Hoare triple {60714#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,640 INFO L290 TraceCheckUtils]: 90: Hoare triple {60714#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-15 11:38:37,640 INFO L290 TraceCheckUtils]: 91: Hoare triple {60714#true} assume 4416 == #t~mem60;havoc #t~mem60; {60714#true} is VALID [2022-04-15 11:38:37,640 INFO L290 TraceCheckUtils]: 92: Hoare triple {60714#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {60714#true} is VALID [2022-04-15 11:38:37,640 INFO L290 TraceCheckUtils]: 93: Hoare triple {60714#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {60714#true} is VALID [2022-04-15 11:38:37,641 INFO L290 TraceCheckUtils]: 94: Hoare triple {60714#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); {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:37,641 INFO L290 TraceCheckUtils]: 95: Hoare triple {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:37,642 INFO L290 TraceCheckUtils]: 96: Hoare triple {60719#(= 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); {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:37,642 INFO L290 TraceCheckUtils]: 97: Hoare triple {60719#(= 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; {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:37,642 INFO L290 TraceCheckUtils]: 98: Hoare triple {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:37,642 INFO L290 TraceCheckUtils]: 99: Hoare triple {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:37,643 INFO L290 TraceCheckUtils]: 100: Hoare triple {60719#(= 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); {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:37,643 INFO L290 TraceCheckUtils]: 101: Hoare triple {60719#(= 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); {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:37,643 INFO L290 TraceCheckUtils]: 102: Hoare triple {60719#(= 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); {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:37,643 INFO L290 TraceCheckUtils]: 103: Hoare triple {60719#(= 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); {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:37,644 INFO L290 TraceCheckUtils]: 104: Hoare triple {60719#(= 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); {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:37,644 INFO L290 TraceCheckUtils]: 105: Hoare triple {60719#(= 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); {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:37,644 INFO L290 TraceCheckUtils]: 106: Hoare triple {60719#(= 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); {60720#(= |ssl3_connect_#t~mem55| 4432)} is VALID [2022-04-15 11:38:37,644 INFO L290 TraceCheckUtils]: 107: Hoare triple {60720#(= |ssl3_connect_#t~mem55| 4432)} assume 4369 == #t~mem55;havoc #t~mem55; {60715#false} is VALID [2022-04-15 11:38:37,645 INFO L290 TraceCheckUtils]: 108: Hoare triple {60715#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; {60715#false} is VALID [2022-04-15 11:38:37,645 INFO L290 TraceCheckUtils]: 109: Hoare triple {60715#false} assume !(0 == ~blastFlag~0); {60715#false} is VALID [2022-04-15 11:38:37,645 INFO L290 TraceCheckUtils]: 110: Hoare triple {60715#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); {60715#false} is VALID [2022-04-15 11:38:37,645 INFO L290 TraceCheckUtils]: 111: Hoare triple {60715#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; {60715#false} is VALID [2022-04-15 11:38:37,645 INFO L290 TraceCheckUtils]: 112: Hoare triple {60715#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); {60715#false} is VALID [2022-04-15 11:38:37,645 INFO L290 TraceCheckUtils]: 113: Hoare triple {60715#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {60715#false} is VALID [2022-04-15 11:38:37,645 INFO L290 TraceCheckUtils]: 114: Hoare triple {60715#false} ~skip~0 := 0; {60715#false} is VALID [2022-04-15 11:38:37,645 INFO L290 TraceCheckUtils]: 115: Hoare triple {60715#false} assume !false; {60715#false} is VALID [2022-04-15 11:38:37,645 INFO L290 TraceCheckUtils]: 116: Hoare triple {60715#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); {60715#false} is VALID [2022-04-15 11:38:37,645 INFO L290 TraceCheckUtils]: 117: Hoare triple {60715#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-15 11:38:37,645 INFO L290 TraceCheckUtils]: 118: Hoare triple {60715#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-15 11:38:37,645 INFO L290 TraceCheckUtils]: 119: Hoare triple {60715#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-15 11:38:37,645 INFO L290 TraceCheckUtils]: 120: Hoare triple {60715#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-15 11:38:37,645 INFO L290 TraceCheckUtils]: 121: Hoare triple {60715#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-15 11:38:37,646 INFO L290 TraceCheckUtils]: 122: Hoare triple {60715#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-15 11:38:37,646 INFO L290 TraceCheckUtils]: 123: Hoare triple {60715#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-15 11:38:37,646 INFO L290 TraceCheckUtils]: 124: Hoare triple {60715#false} assume 4384 == #t~mem56;havoc #t~mem56; {60715#false} is VALID [2022-04-15 11:38:37,646 INFO L290 TraceCheckUtils]: 125: Hoare triple {60715#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {60715#false} is VALID [2022-04-15 11:38:37,646 INFO L290 TraceCheckUtils]: 126: Hoare triple {60715#false} assume !(1 == ~blastFlag~0); {60715#false} is VALID [2022-04-15 11:38:37,646 INFO L290 TraceCheckUtils]: 127: Hoare triple {60715#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {60715#false} is VALID [2022-04-15 11:38:37,646 INFO L290 TraceCheckUtils]: 128: Hoare triple {60715#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {60715#false} is VALID [2022-04-15 11:38:37,646 INFO L290 TraceCheckUtils]: 129: Hoare triple {60715#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-15 11:38:37,646 INFO L290 TraceCheckUtils]: 130: Hoare triple {60715#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {60715#false} is VALID [2022-04-15 11:38:37,646 INFO L290 TraceCheckUtils]: 131: Hoare triple {60715#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); {60715#false} is VALID [2022-04-15 11:38:37,646 INFO L290 TraceCheckUtils]: 132: Hoare triple {60715#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {60715#false} is VALID [2022-04-15 11:38:37,646 INFO L290 TraceCheckUtils]: 133: Hoare triple {60715#false} ~skip~0 := 0; {60715#false} is VALID [2022-04-15 11:38:37,646 INFO L290 TraceCheckUtils]: 134: Hoare triple {60715#false} assume !false; {60715#false} is VALID [2022-04-15 11:38:37,646 INFO L290 TraceCheckUtils]: 135: Hoare triple {60715#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); {60715#false} is VALID [2022-04-15 11:38:37,647 INFO L290 TraceCheckUtils]: 136: Hoare triple {60715#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-15 11:38:37,647 INFO L290 TraceCheckUtils]: 137: Hoare triple {60715#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-15 11:38:37,647 INFO L290 TraceCheckUtils]: 138: Hoare triple {60715#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-15 11:38:37,647 INFO L290 TraceCheckUtils]: 139: Hoare triple {60715#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-15 11:38:37,647 INFO L290 TraceCheckUtils]: 140: Hoare triple {60715#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-15 11:38:37,647 INFO L290 TraceCheckUtils]: 141: Hoare triple {60715#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-15 11:38:37,647 INFO L290 TraceCheckUtils]: 142: Hoare triple {60715#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-15 11:38:37,647 INFO L290 TraceCheckUtils]: 143: Hoare triple {60715#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-15 11:38:37,647 INFO L290 TraceCheckUtils]: 144: Hoare triple {60715#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-15 11:38:37,647 INFO L290 TraceCheckUtils]: 145: Hoare triple {60715#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-15 11:38:37,647 INFO L290 TraceCheckUtils]: 146: Hoare triple {60715#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-15 11:38:37,647 INFO L290 TraceCheckUtils]: 147: Hoare triple {60715#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-15 11:38:37,647 INFO L290 TraceCheckUtils]: 148: Hoare triple {60715#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-15 11:38:37,648 INFO L290 TraceCheckUtils]: 149: Hoare triple {60715#false} assume 4432 == #t~mem62;havoc #t~mem62; {60715#false} is VALID [2022-04-15 11:38:37,648 INFO L290 TraceCheckUtils]: 150: Hoare triple {60715#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {60715#false} is VALID [2022-04-15 11:38:37,648 INFO L290 TraceCheckUtils]: 151: Hoare triple {60715#false} assume 5 == ~blastFlag~0; {60715#false} is VALID [2022-04-15 11:38:37,648 INFO L290 TraceCheckUtils]: 152: Hoare triple {60715#false} assume !false; {60715#false} is VALID [2022-04-15 11:38:37,648 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-04-15 11:38:37,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:38:37,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137605280] [2022-04-15 11:38:37,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137605280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:37,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:37,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:38:37,649 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:38:37,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1521688819] [2022-04-15 11:38:37,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1521688819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:37,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:37,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:38:37,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992156476] [2022-04-15 11:38:37,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:38:37,649 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 153 [2022-04-15 11:38:37,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:38:37,650 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-15 11:38:37,713 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-15 11:38:37,713 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:38:37,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:37,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:38:37,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:38:37,713 INFO L87 Difference]: Start difference. First operand 867 states and 1257 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-15 11:38:39,752 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:38:41,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:41,034 INFO L93 Difference]: Finished difference Result 1821 states and 2644 transitions. [2022-04-15 11:38:41,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:38:41,034 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 153 [2022-04-15 11:38:41,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:38:41,035 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-15 11:38:41,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 456 transitions. [2022-04-15 11:38:41,036 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-15 11:38:41,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 456 transitions. [2022-04-15 11:38:41,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 456 transitions. [2022-04-15 11:38:41,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 456 edges. 456 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:41,353 INFO L225 Difference]: With dead ends: 1821 [2022-04-15 11:38:41,353 INFO L226 Difference]: Without dead ends: 1122 [2022-04-15 11:38:41,354 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:38:41,354 INFO L913 BasicCegarLoop]: 233 mSDtfsCounter, 90 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:38:41,354 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 555 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 515 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:38:41,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2022-04-15 11:38:41,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 867. [2022-04-15 11:38:41,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:38:41,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1122 states. Second operand has 867 states, 862 states have (on average 1.448955916473318) internal successors, (1249), 862 states have internal predecessors, (1249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:41,401 INFO L74 IsIncluded]: Start isIncluded. First operand 1122 states. Second operand has 867 states, 862 states have (on average 1.448955916473318) internal successors, (1249), 862 states have internal predecessors, (1249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:41,401 INFO L87 Difference]: Start difference. First operand 1122 states. Second operand has 867 states, 862 states have (on average 1.448955916473318) internal successors, (1249), 862 states have internal predecessors, (1249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:41,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:41,433 INFO L93 Difference]: Finished difference Result 1122 states and 1626 transitions. [2022-04-15 11:38:41,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1626 transitions. [2022-04-15 11:38:41,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:41,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:41,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 867 states, 862 states have (on average 1.448955916473318) internal successors, (1249), 862 states have internal predecessors, (1249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1122 states. [2022-04-15 11:38:41,436 INFO L87 Difference]: Start difference. First operand has 867 states, 862 states have (on average 1.448955916473318) internal successors, (1249), 862 states have internal predecessors, (1249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1122 states. [2022-04-15 11:38:41,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:41,468 INFO L93 Difference]: Finished difference Result 1122 states and 1626 transitions. [2022-04-15 11:38:41,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1626 transitions. [2022-04-15 11:38:41,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:41,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:41,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:38:41,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:38:41,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 862 states have (on average 1.448955916473318) internal successors, (1249), 862 states have internal predecessors, (1249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:41,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1253 transitions. [2022-04-15 11:38:41,500 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1253 transitions. Word has length 153 [2022-04-15 11:38:41,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:38:41,501 INFO L478 AbstractCegarLoop]: Abstraction has 867 states and 1253 transitions. [2022-04-15 11:38:41,501 INFO L479 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-15 11:38:41,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 867 states and 1253 transitions. [2022-04-15 11:38:42,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1253 edges. 1253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:42,521 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1253 transitions. [2022-04-15 11:38:42,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-04-15 11:38:42,522 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:38:42,522 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:38:42,522 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 11:38:42,522 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:38:42,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:38:42,523 INFO L85 PathProgramCache]: Analyzing trace with hash -719726875, now seen corresponding path program 1 times [2022-04-15 11:38:42,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:42,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1994137720] [2022-04-15 11:38:59,074 WARN L232 SmtUtils]: Spent 10.92s 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-15 11:39:07,519 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:39:07,520 INFO L85 PathProgramCache]: Analyzing trace with hash -719726875, now seen corresponding path program 2 times [2022-04-15 11:39:07,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:39:07,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283569812] [2022-04-15 11:39:07,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:39:07,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:39:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:07,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:39:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:07,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {68353#(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); {68346#true} is VALID [2022-04-15 11:39:07,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {68346#true} assume true; {68346#true} is VALID [2022-04-15 11:39:07,688 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68346#true} {68346#true} #593#return; {68346#true} is VALID [2022-04-15 11:39:07,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {68346#true} call ULTIMATE.init(); {68353#(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-15 11:39:07,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {68353#(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); {68346#true} is VALID [2022-04-15 11:39:07,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {68346#true} assume true; {68346#true} is VALID [2022-04-15 11:39:07,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68346#true} {68346#true} #593#return; {68346#true} is VALID [2022-04-15 11:39:07,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {68346#true} call #t~ret158 := main(); {68346#true} is VALID [2022-04-15 11:39:07,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {68346#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; {68346#true} is VALID [2022-04-15 11:39:07,689 INFO L272 TraceCheckUtils]: 6: Hoare triple {68346#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {68346#true} is VALID [2022-04-15 11:39:07,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {68346#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); {68346#true} is VALID [2022-04-15 11:39:07,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {68346#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; {68346#true} is VALID [2022-04-15 11:39:07,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {68346#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; {68346#true} is VALID [2022-04-15 11:39:07,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {68346#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {68346#true} is VALID [2022-04-15 11:39:07,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {68346#true} assume !false; {68346#true} is VALID [2022-04-15 11:39:07,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {68346#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); {68346#true} is VALID [2022-04-15 11:39:07,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {68346#true} assume 12292 == #t~mem49;havoc #t~mem49; {68346#true} is VALID [2022-04-15 11:39:07,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {68346#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; {68346#true} is VALID [2022-04-15 11:39:07,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {68346#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {68346#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {68346#true} is VALID [2022-04-15 11:39:07,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {68346#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {68346#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); {68346#true} is VALID [2022-04-15 11:39:07,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {68346#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {68346#true} is VALID [2022-04-15 11:39:07,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {68346#true} assume !(0 == ~tmp___4~0); {68346#true} is VALID [2022-04-15 11:39:07,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {68346#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); {68346#true} is VALID [2022-04-15 11:39:07,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {68346#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); {68346#true} is VALID [2022-04-15 11:39:07,691 INFO L290 TraceCheckUtils]: 23: Hoare triple {68346#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {68346#true} is VALID [2022-04-15 11:39:07,691 INFO L290 TraceCheckUtils]: 24: Hoare triple {68346#true} ~skip~0 := 0; {68346#true} is VALID [2022-04-15 11:39:07,691 INFO L290 TraceCheckUtils]: 25: Hoare triple {68346#true} assume !false; {68346#true} is VALID [2022-04-15 11:39:07,691 INFO L290 TraceCheckUtils]: 26: Hoare triple {68346#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); {68346#true} is VALID [2022-04-15 11:39:07,691 INFO L290 TraceCheckUtils]: 27: Hoare triple {68346#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,691 INFO L290 TraceCheckUtils]: 28: Hoare triple {68346#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,691 INFO L290 TraceCheckUtils]: 29: Hoare triple {68346#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,691 INFO L290 TraceCheckUtils]: 30: Hoare triple {68346#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,691 INFO L290 TraceCheckUtils]: 31: Hoare triple {68346#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,691 INFO L290 TraceCheckUtils]: 32: Hoare triple {68346#true} assume 4368 == #t~mem54;havoc #t~mem54; {68346#true} is VALID [2022-04-15 11:39:07,691 INFO L290 TraceCheckUtils]: 33: Hoare triple {68346#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; {68346#true} is VALID [2022-04-15 11:39:07,691 INFO L290 TraceCheckUtils]: 34: Hoare triple {68346#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {68346#true} is VALID [2022-04-15 11:39:07,691 INFO L290 TraceCheckUtils]: 35: Hoare triple {68346#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); {68346#true} is VALID [2022-04-15 11:39:07,692 INFO L290 TraceCheckUtils]: 36: Hoare triple {68346#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; {68346#true} is VALID [2022-04-15 11:39:07,692 INFO L290 TraceCheckUtils]: 37: Hoare triple {68346#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); {68346#true} is VALID [2022-04-15 11:39:07,692 INFO L290 TraceCheckUtils]: 38: Hoare triple {68346#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {68346#true} is VALID [2022-04-15 11:39:07,692 INFO L290 TraceCheckUtils]: 39: Hoare triple {68346#true} ~skip~0 := 0; {68346#true} is VALID [2022-04-15 11:39:07,692 INFO L290 TraceCheckUtils]: 40: Hoare triple {68346#true} assume !false; {68346#true} is VALID [2022-04-15 11:39:07,692 INFO L290 TraceCheckUtils]: 41: Hoare triple {68346#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); {68346#true} is VALID [2022-04-15 11:39:07,692 INFO L290 TraceCheckUtils]: 42: Hoare triple {68346#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,692 INFO L290 TraceCheckUtils]: 43: Hoare triple {68346#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,692 INFO L290 TraceCheckUtils]: 44: Hoare triple {68346#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,692 INFO L290 TraceCheckUtils]: 45: Hoare triple {68346#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,692 INFO L290 TraceCheckUtils]: 46: Hoare triple {68346#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,692 INFO L290 TraceCheckUtils]: 47: Hoare triple {68346#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,692 INFO L290 TraceCheckUtils]: 48: Hoare triple {68346#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,692 INFO L290 TraceCheckUtils]: 49: Hoare triple {68346#true} assume 4384 == #t~mem56;havoc #t~mem56; {68346#true} is VALID [2022-04-15 11:39:07,692 INFO L290 TraceCheckUtils]: 50: Hoare triple {68346#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {68346#true} is VALID [2022-04-15 11:39:07,693 INFO L290 TraceCheckUtils]: 51: Hoare triple {68346#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {68346#true} is VALID [2022-04-15 11:39:07,693 INFO L290 TraceCheckUtils]: 52: Hoare triple {68346#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,693 INFO L290 TraceCheckUtils]: 53: Hoare triple {68346#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,693 INFO L290 TraceCheckUtils]: 54: Hoare triple {68346#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,693 INFO L290 TraceCheckUtils]: 55: Hoare triple {68346#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); {68346#true} is VALID [2022-04-15 11:39:07,693 INFO L290 TraceCheckUtils]: 56: Hoare triple {68346#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {68346#true} is VALID [2022-04-15 11:39:07,693 INFO L290 TraceCheckUtils]: 57: Hoare triple {68346#true} ~skip~0 := 0; {68346#true} is VALID [2022-04-15 11:39:07,693 INFO L290 TraceCheckUtils]: 58: Hoare triple {68346#true} assume !false; {68346#true} is VALID [2022-04-15 11:39:07,693 INFO L290 TraceCheckUtils]: 59: Hoare triple {68346#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); {68346#true} is VALID [2022-04-15 11:39:07,693 INFO L290 TraceCheckUtils]: 60: Hoare triple {68346#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,693 INFO L290 TraceCheckUtils]: 61: Hoare triple {68346#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,693 INFO L290 TraceCheckUtils]: 62: Hoare triple {68346#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,693 INFO L290 TraceCheckUtils]: 63: Hoare triple {68346#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,693 INFO L290 TraceCheckUtils]: 64: Hoare triple {68346#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,694 INFO L290 TraceCheckUtils]: 65: Hoare triple {68346#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,694 INFO L290 TraceCheckUtils]: 66: Hoare triple {68346#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,694 INFO L290 TraceCheckUtils]: 67: Hoare triple {68346#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,694 INFO L290 TraceCheckUtils]: 68: Hoare triple {68346#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,694 INFO L290 TraceCheckUtils]: 69: Hoare triple {68346#true} assume 4400 == #t~mem58;havoc #t~mem58; {68346#true} is VALID [2022-04-15 11:39:07,694 INFO L290 TraceCheckUtils]: 70: Hoare triple {68346#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); {68346#true} is VALID [2022-04-15 11:39:07,694 INFO L290 TraceCheckUtils]: 71: Hoare triple {68346#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; {68346#true} is VALID [2022-04-15 11:39:07,694 INFO L290 TraceCheckUtils]: 72: Hoare triple {68346#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {68346#true} is VALID [2022-04-15 11:39:07,694 INFO L290 TraceCheckUtils]: 73: Hoare triple {68346#true} assume !(~ret~0 <= 0); {68346#true} is VALID [2022-04-15 11:39:07,694 INFO L290 TraceCheckUtils]: 74: Hoare triple {68346#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,694 INFO L290 TraceCheckUtils]: 75: Hoare triple {68346#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); {68346#true} is VALID [2022-04-15 11:39:07,694 INFO L290 TraceCheckUtils]: 76: Hoare triple {68346#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {68346#true} is VALID [2022-04-15 11:39:07,694 INFO L290 TraceCheckUtils]: 77: Hoare triple {68346#true} ~skip~0 := 0; {68346#true} is VALID [2022-04-15 11:39:07,694 INFO L290 TraceCheckUtils]: 78: Hoare triple {68346#true} assume !false; {68346#true} is VALID [2022-04-15 11:39:07,695 INFO L290 TraceCheckUtils]: 79: Hoare triple {68346#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); {68346#true} is VALID [2022-04-15 11:39:07,695 INFO L290 TraceCheckUtils]: 80: Hoare triple {68346#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,695 INFO L290 TraceCheckUtils]: 81: Hoare triple {68346#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,695 INFO L290 TraceCheckUtils]: 82: Hoare triple {68346#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,695 INFO L290 TraceCheckUtils]: 83: Hoare triple {68346#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,695 INFO L290 TraceCheckUtils]: 84: Hoare triple {68346#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,695 INFO L290 TraceCheckUtils]: 85: Hoare triple {68346#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,695 INFO L290 TraceCheckUtils]: 86: Hoare triple {68346#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,695 INFO L290 TraceCheckUtils]: 87: Hoare triple {68346#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,695 INFO L290 TraceCheckUtils]: 88: Hoare triple {68346#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,695 INFO L290 TraceCheckUtils]: 89: Hoare triple {68346#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,695 INFO L290 TraceCheckUtils]: 90: Hoare triple {68346#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-15 11:39:07,695 INFO L290 TraceCheckUtils]: 91: Hoare triple {68346#true} assume 4416 == #t~mem60;havoc #t~mem60; {68346#true} is VALID [2022-04-15 11:39:07,695 INFO L290 TraceCheckUtils]: 92: Hoare triple {68346#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {68346#true} is VALID [2022-04-15 11:39:07,696 INFO L290 TraceCheckUtils]: 93: Hoare triple {68346#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {68346#true} is VALID [2022-04-15 11:39:07,696 INFO L290 TraceCheckUtils]: 94: Hoare triple {68346#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); {68351#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:39:07,697 INFO L290 TraceCheckUtils]: 95: Hoare triple {68351#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {68351#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:39:07,697 INFO L290 TraceCheckUtils]: 96: Hoare triple {68351#(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); {68351#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:39:07,697 INFO L290 TraceCheckUtils]: 97: Hoare triple {68351#(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; {68351#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:39:07,698 INFO L290 TraceCheckUtils]: 98: Hoare triple {68351#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {68351#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:39:07,698 INFO L290 TraceCheckUtils]: 99: Hoare triple {68351#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {68351#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:39:07,698 INFO L290 TraceCheckUtils]: 100: Hoare triple {68351#(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); {68351#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:39:07,699 INFO L290 TraceCheckUtils]: 101: Hoare triple {68351#(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); {68351#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:39:07,699 INFO L290 TraceCheckUtils]: 102: Hoare triple {68351#(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); {68351#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:39:07,699 INFO L290 TraceCheckUtils]: 103: Hoare triple {68351#(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); {68352#(not (= |ssl3_connect_#t~mem52| 20480))} is VALID [2022-04-15 11:39:07,700 INFO L290 TraceCheckUtils]: 104: Hoare triple {68352#(not (= |ssl3_connect_#t~mem52| 20480))} assume 20480 == #t~mem52;havoc #t~mem52; {68347#false} is VALID [2022-04-15 11:39:07,700 INFO L290 TraceCheckUtils]: 105: Hoare triple {68347#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {68347#false} is VALID [2022-04-15 11:39:07,700 INFO L290 TraceCheckUtils]: 106: Hoare triple {68347#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {68347#false} is VALID [2022-04-15 11:39:07,700 INFO L290 TraceCheckUtils]: 107: Hoare triple {68347#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {68347#false} is VALID [2022-04-15 11:39:07,700 INFO L290 TraceCheckUtils]: 108: Hoare triple {68347#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); {68347#false} is VALID [2022-04-15 11:39:07,700 INFO L290 TraceCheckUtils]: 109: Hoare triple {68347#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {68347#false} is VALID [2022-04-15 11:39:07,700 INFO L290 TraceCheckUtils]: 110: Hoare triple {68347#false} assume !(0 == ~tmp___4~0); {68347#false} is VALID [2022-04-15 11:39:07,700 INFO L290 TraceCheckUtils]: 111: Hoare triple {68347#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); {68347#false} is VALID [2022-04-15 11:39:07,700 INFO L290 TraceCheckUtils]: 112: Hoare triple {68347#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); {68347#false} is VALID [2022-04-15 11:39:07,700 INFO L290 TraceCheckUtils]: 113: Hoare triple {68347#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {68347#false} is VALID [2022-04-15 11:39:07,700 INFO L290 TraceCheckUtils]: 114: Hoare triple {68347#false} ~skip~0 := 0; {68347#false} is VALID [2022-04-15 11:39:07,700 INFO L290 TraceCheckUtils]: 115: Hoare triple {68347#false} assume !false; {68347#false} is VALID [2022-04-15 11:39:07,701 INFO L290 TraceCheckUtils]: 116: Hoare triple {68347#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); {68347#false} is VALID [2022-04-15 11:39:07,701 INFO L290 TraceCheckUtils]: 117: Hoare triple {68347#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-15 11:39:07,701 INFO L290 TraceCheckUtils]: 118: Hoare triple {68347#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-15 11:39:07,701 INFO L290 TraceCheckUtils]: 119: Hoare triple {68347#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-15 11:39:07,701 INFO L290 TraceCheckUtils]: 120: Hoare triple {68347#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-15 11:39:07,701 INFO L290 TraceCheckUtils]: 121: Hoare triple {68347#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-15 11:39:07,701 INFO L290 TraceCheckUtils]: 122: Hoare triple {68347#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-15 11:39:07,701 INFO L290 TraceCheckUtils]: 123: Hoare triple {68347#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-15 11:39:07,701 INFO L290 TraceCheckUtils]: 124: Hoare triple {68347#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-15 11:39:07,701 INFO L290 TraceCheckUtils]: 125: Hoare triple {68347#false} assume 4385 == #t~mem57;havoc #t~mem57; {68347#false} is VALID [2022-04-15 11:39:07,701 INFO L290 TraceCheckUtils]: 126: Hoare triple {68347#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {68347#false} is VALID [2022-04-15 11:39:07,701 INFO L290 TraceCheckUtils]: 127: Hoare triple {68347#false} assume !(1 == ~blastFlag~0); {68347#false} is VALID [2022-04-15 11:39:07,701 INFO L290 TraceCheckUtils]: 128: Hoare triple {68347#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {68347#false} is VALID [2022-04-15 11:39:07,701 INFO L290 TraceCheckUtils]: 129: Hoare triple {68347#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {68347#false} is VALID [2022-04-15 11:39:07,702 INFO L290 TraceCheckUtils]: 130: Hoare triple {68347#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-15 11:39:07,702 INFO L290 TraceCheckUtils]: 131: Hoare triple {68347#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {68347#false} is VALID [2022-04-15 11:39:07,702 INFO L290 TraceCheckUtils]: 132: Hoare triple {68347#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); {68347#false} is VALID [2022-04-15 11:39:07,702 INFO L290 TraceCheckUtils]: 133: Hoare triple {68347#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {68347#false} is VALID [2022-04-15 11:39:07,702 INFO L290 TraceCheckUtils]: 134: Hoare triple {68347#false} ~skip~0 := 0; {68347#false} is VALID [2022-04-15 11:39:07,702 INFO L290 TraceCheckUtils]: 135: Hoare triple {68347#false} assume !false; {68347#false} is VALID [2022-04-15 11:39:07,702 INFO L290 TraceCheckUtils]: 136: Hoare triple {68347#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); {68347#false} is VALID [2022-04-15 11:39:07,702 INFO L290 TraceCheckUtils]: 137: Hoare triple {68347#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-15 11:39:07,702 INFO L290 TraceCheckUtils]: 138: Hoare triple {68347#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-15 11:39:07,702 INFO L290 TraceCheckUtils]: 139: Hoare triple {68347#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-15 11:39:07,702 INFO L290 TraceCheckUtils]: 140: Hoare triple {68347#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-15 11:39:07,702 INFO L290 TraceCheckUtils]: 141: Hoare triple {68347#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-15 11:39:07,702 INFO L290 TraceCheckUtils]: 142: Hoare triple {68347#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-15 11:39:07,702 INFO L290 TraceCheckUtils]: 143: Hoare triple {68347#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-15 11:39:07,702 INFO L290 TraceCheckUtils]: 144: Hoare triple {68347#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-15 11:39:07,703 INFO L290 TraceCheckUtils]: 145: Hoare triple {68347#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-15 11:39:07,703 INFO L290 TraceCheckUtils]: 146: Hoare triple {68347#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-15 11:39:07,703 INFO L290 TraceCheckUtils]: 147: Hoare triple {68347#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-15 11:39:07,703 INFO L290 TraceCheckUtils]: 148: Hoare triple {68347#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-15 11:39:07,703 INFO L290 TraceCheckUtils]: 149: Hoare triple {68347#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-15 11:39:07,703 INFO L290 TraceCheckUtils]: 150: Hoare triple {68347#false} assume 4432 == #t~mem62;havoc #t~mem62; {68347#false} is VALID [2022-04-15 11:39:07,703 INFO L290 TraceCheckUtils]: 151: Hoare triple {68347#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {68347#false} is VALID [2022-04-15 11:39:07,703 INFO L290 TraceCheckUtils]: 152: Hoare triple {68347#false} assume 5 == ~blastFlag~0; {68347#false} is VALID [2022-04-15 11:39:07,703 INFO L290 TraceCheckUtils]: 153: Hoare triple {68347#false} assume !false; {68347#false} is VALID [2022-04-15 11:39:07,704 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-15 11:39:07,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:39:07,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283569812] [2022-04-15 11:39:07,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283569812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:07,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:07,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:39:07,704 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:39:07,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1994137720] [2022-04-15 11:39:07,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1994137720] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:07,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:07,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:39:07,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947830638] [2022-04-15 11:39:07,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:39:07,705 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 154 [2022-04-15 11:39:07,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:39:07,705 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-15 11:39:07,769 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-15 11:39:07,769 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:39:07,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:07,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:39:07,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:39:07,770 INFO L87 Difference]: Start difference. First operand 867 states and 1253 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-15 11:39:09,789 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:39:10,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:10,895 INFO L93 Difference]: Finished difference Result 2077 states and 3004 transitions. [2022-04-15 11:39:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:39:10,895 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 154 [2022-04-15 11:39:10,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:39:10,895 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-15 11:39:10,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-15 11:39:10,897 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-15 11:39:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-15 11:39:10,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-15 11:39:11,204 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-15 11:39:11,260 INFO L225 Difference]: With dead ends: 2077 [2022-04-15 11:39:11,261 INFO L226 Difference]: Without dead ends: 1226 [2022-04-15 11:39:11,262 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:39:11,262 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 115 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 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-15 11:39:11,262 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:39:11,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2022-04-15 11:39:11,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 867. [2022-04-15 11:39:11,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:39:11,312 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1226 states. Second operand has 867 states, 862 states have (on average 1.4327146171693736) internal successors, (1235), 862 states have internal predecessors, (1235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:11,313 INFO L74 IsIncluded]: Start isIncluded. First operand 1226 states. Second operand has 867 states, 862 states have (on average 1.4327146171693736) internal successors, (1235), 862 states have internal predecessors, (1235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:11,313 INFO L87 Difference]: Start difference. First operand 1226 states. Second operand has 867 states, 862 states have (on average 1.4327146171693736) internal successors, (1235), 862 states have internal predecessors, (1235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:11,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:11,350 INFO L93 Difference]: Finished difference Result 1226 states and 1757 transitions. [2022-04-15 11:39:11,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1757 transitions. [2022-04-15 11:39:11,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:11,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:11,353 INFO L74 IsIncluded]: Start isIncluded. First operand has 867 states, 862 states have (on average 1.4327146171693736) internal successors, (1235), 862 states have internal predecessors, (1235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1226 states. [2022-04-15 11:39:11,353 INFO L87 Difference]: Start difference. First operand has 867 states, 862 states have (on average 1.4327146171693736) internal successors, (1235), 862 states have internal predecessors, (1235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1226 states. [2022-04-15 11:39:11,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:11,391 INFO L93 Difference]: Finished difference Result 1226 states and 1757 transitions. [2022-04-15 11:39:11,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1757 transitions. [2022-04-15 11:39:11,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:11,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:11,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:39:11,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:39:11,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 862 states have (on average 1.4327146171693736) internal successors, (1235), 862 states have internal predecessors, (1235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:11,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1239 transitions. [2022-04-15 11:39:11,424 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1239 transitions. Word has length 154 [2022-04-15 11:39:11,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:39:11,424 INFO L478 AbstractCegarLoop]: Abstraction has 867 states and 1239 transitions. [2022-04-15 11:39:11,424 INFO L479 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-15 11:39:11,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 867 states and 1239 transitions. [2022-04-15 11:39:12,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1239 edges. 1239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:12,457 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1239 transitions. [2022-04-15 11:39:12,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-15 11:39:12,458 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:39:12,458 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:39:12,458 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 11:39:12,458 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:39:12,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:39:12,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1947874174, now seen corresponding path program 1 times [2022-04-15 11:39:12,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:12,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1941687954] [2022-04-15 11:39:26,336 WARN L232 SmtUtils]: Spent 7.85s 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-15 11:39:32,689 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:39:32,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1947874174, now seen corresponding path program 2 times [2022-04-15 11:39:32,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:39:32,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84132450] [2022-04-15 11:39:32,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:39:32,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:39:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:32,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:39:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:32,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {76705#(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); {76698#true} is VALID [2022-04-15 11:39:32,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {76698#true} assume true; {76698#true} is VALID [2022-04-15 11:39:32,841 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76698#true} {76698#true} #593#return; {76698#true} is VALID [2022-04-15 11:39:32,842 INFO L272 TraceCheckUtils]: 0: Hoare triple {76698#true} call ULTIMATE.init(); {76705#(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-15 11:39:32,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {76705#(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); {76698#true} is VALID [2022-04-15 11:39:32,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {76698#true} assume true; {76698#true} is VALID [2022-04-15 11:39:32,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76698#true} {76698#true} #593#return; {76698#true} is VALID [2022-04-15 11:39:32,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {76698#true} call #t~ret158 := main(); {76698#true} is VALID [2022-04-15 11:39:32,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {76698#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; {76698#true} is VALID [2022-04-15 11:39:32,842 INFO L272 TraceCheckUtils]: 6: Hoare triple {76698#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {76698#true} is VALID [2022-04-15 11:39:32,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {76698#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); {76698#true} is VALID [2022-04-15 11:39:32,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {76698#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; {76698#true} is VALID [2022-04-15 11:39:32,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {76698#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; {76698#true} is VALID [2022-04-15 11:39:32,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {76698#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {76698#true} is VALID [2022-04-15 11:39:32,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {76698#true} assume !false; {76698#true} is VALID [2022-04-15 11:39:32,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {76698#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); {76698#true} is VALID [2022-04-15 11:39:32,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {76698#true} assume 12292 == #t~mem49;havoc #t~mem49; {76698#true} is VALID [2022-04-15 11:39:32,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {76698#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; {76698#true} is VALID [2022-04-15 11:39:32,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {76698#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {76698#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {76698#true} is VALID [2022-04-15 11:39:32,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {76698#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {76698#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); {76698#true} is VALID [2022-04-15 11:39:32,843 INFO L290 TraceCheckUtils]: 19: Hoare triple {76698#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {76698#true} is VALID [2022-04-15 11:39:32,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {76698#true} assume !(0 == ~tmp___4~0); {76698#true} is VALID [2022-04-15 11:39:32,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {76698#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); {76698#true} is VALID [2022-04-15 11:39:32,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {76698#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); {76698#true} is VALID [2022-04-15 11:39:32,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {76698#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76698#true} is VALID [2022-04-15 11:39:32,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {76698#true} ~skip~0 := 0; {76698#true} is VALID [2022-04-15 11:39:32,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {76698#true} assume !false; {76698#true} is VALID [2022-04-15 11:39:32,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {76698#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); {76698#true} is VALID [2022-04-15 11:39:32,844 INFO L290 TraceCheckUtils]: 27: Hoare triple {76698#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,844 INFO L290 TraceCheckUtils]: 28: Hoare triple {76698#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,844 INFO L290 TraceCheckUtils]: 29: Hoare triple {76698#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,844 INFO L290 TraceCheckUtils]: 30: Hoare triple {76698#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,844 INFO L290 TraceCheckUtils]: 31: Hoare triple {76698#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,844 INFO L290 TraceCheckUtils]: 32: Hoare triple {76698#true} assume 4368 == #t~mem54;havoc #t~mem54; {76698#true} is VALID [2022-04-15 11:39:32,844 INFO L290 TraceCheckUtils]: 33: Hoare triple {76698#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; {76698#true} is VALID [2022-04-15 11:39:32,844 INFO L290 TraceCheckUtils]: 34: Hoare triple {76698#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {76698#true} is VALID [2022-04-15 11:39:32,844 INFO L290 TraceCheckUtils]: 35: Hoare triple {76698#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); {76698#true} is VALID [2022-04-15 11:39:32,844 INFO L290 TraceCheckUtils]: 36: Hoare triple {76698#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; {76698#true} is VALID [2022-04-15 11:39:32,844 INFO L290 TraceCheckUtils]: 37: Hoare triple {76698#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); {76698#true} is VALID [2022-04-15 11:39:32,844 INFO L290 TraceCheckUtils]: 38: Hoare triple {76698#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76698#true} is VALID [2022-04-15 11:39:32,845 INFO L290 TraceCheckUtils]: 39: Hoare triple {76698#true} ~skip~0 := 0; {76698#true} is VALID [2022-04-15 11:39:32,845 INFO L290 TraceCheckUtils]: 40: Hoare triple {76698#true} assume !false; {76698#true} is VALID [2022-04-15 11:39:32,845 INFO L290 TraceCheckUtils]: 41: Hoare triple {76698#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); {76698#true} is VALID [2022-04-15 11:39:32,845 INFO L290 TraceCheckUtils]: 42: Hoare triple {76698#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,845 INFO L290 TraceCheckUtils]: 43: Hoare triple {76698#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,845 INFO L290 TraceCheckUtils]: 44: Hoare triple {76698#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,845 INFO L290 TraceCheckUtils]: 45: Hoare triple {76698#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,845 INFO L290 TraceCheckUtils]: 46: Hoare triple {76698#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,845 INFO L290 TraceCheckUtils]: 47: Hoare triple {76698#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,845 INFO L290 TraceCheckUtils]: 48: Hoare triple {76698#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,845 INFO L290 TraceCheckUtils]: 49: Hoare triple {76698#true} assume 4384 == #t~mem56;havoc #t~mem56; {76698#true} is VALID [2022-04-15 11:39:32,845 INFO L290 TraceCheckUtils]: 50: Hoare triple {76698#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {76698#true} is VALID [2022-04-15 11:39:32,845 INFO L290 TraceCheckUtils]: 51: Hoare triple {76698#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {76698#true} is VALID [2022-04-15 11:39:32,845 INFO L290 TraceCheckUtils]: 52: Hoare triple {76698#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,846 INFO L290 TraceCheckUtils]: 53: Hoare triple {76698#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,846 INFO L290 TraceCheckUtils]: 54: Hoare triple {76698#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,846 INFO L290 TraceCheckUtils]: 55: Hoare triple {76698#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); {76698#true} is VALID [2022-04-15 11:39:32,846 INFO L290 TraceCheckUtils]: 56: Hoare triple {76698#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76698#true} is VALID [2022-04-15 11:39:32,846 INFO L290 TraceCheckUtils]: 57: Hoare triple {76698#true} ~skip~0 := 0; {76698#true} is VALID [2022-04-15 11:39:32,846 INFO L290 TraceCheckUtils]: 58: Hoare triple {76698#true} assume !false; {76698#true} is VALID [2022-04-15 11:39:32,846 INFO L290 TraceCheckUtils]: 59: Hoare triple {76698#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); {76698#true} is VALID [2022-04-15 11:39:32,846 INFO L290 TraceCheckUtils]: 60: Hoare triple {76698#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,846 INFO L290 TraceCheckUtils]: 61: Hoare triple {76698#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,846 INFO L290 TraceCheckUtils]: 62: Hoare triple {76698#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,846 INFO L290 TraceCheckUtils]: 63: Hoare triple {76698#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,846 INFO L290 TraceCheckUtils]: 64: Hoare triple {76698#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,846 INFO L290 TraceCheckUtils]: 65: Hoare triple {76698#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,846 INFO L290 TraceCheckUtils]: 66: Hoare triple {76698#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,846 INFO L290 TraceCheckUtils]: 67: Hoare triple {76698#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,847 INFO L290 TraceCheckUtils]: 68: Hoare triple {76698#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,847 INFO L290 TraceCheckUtils]: 69: Hoare triple {76698#true} assume 4400 == #t~mem58;havoc #t~mem58; {76698#true} is VALID [2022-04-15 11:39:32,847 INFO L290 TraceCheckUtils]: 70: Hoare triple {76698#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); {76698#true} is VALID [2022-04-15 11:39:32,847 INFO L290 TraceCheckUtils]: 71: Hoare triple {76698#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; {76698#true} is VALID [2022-04-15 11:39:32,847 INFO L290 TraceCheckUtils]: 72: Hoare triple {76698#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {76698#true} is VALID [2022-04-15 11:39:32,847 INFO L290 TraceCheckUtils]: 73: Hoare triple {76698#true} assume !(~ret~0 <= 0); {76698#true} is VALID [2022-04-15 11:39:32,847 INFO L290 TraceCheckUtils]: 74: Hoare triple {76698#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,847 INFO L290 TraceCheckUtils]: 75: Hoare triple {76698#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); {76698#true} is VALID [2022-04-15 11:39:32,847 INFO L290 TraceCheckUtils]: 76: Hoare triple {76698#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76698#true} is VALID [2022-04-15 11:39:32,847 INFO L290 TraceCheckUtils]: 77: Hoare triple {76698#true} ~skip~0 := 0; {76698#true} is VALID [2022-04-15 11:39:32,847 INFO L290 TraceCheckUtils]: 78: Hoare triple {76698#true} assume !false; {76698#true} is VALID [2022-04-15 11:39:32,847 INFO L290 TraceCheckUtils]: 79: Hoare triple {76698#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); {76698#true} is VALID [2022-04-15 11:39:32,847 INFO L290 TraceCheckUtils]: 80: Hoare triple {76698#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,847 INFO L290 TraceCheckUtils]: 81: Hoare triple {76698#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,848 INFO L290 TraceCheckUtils]: 82: Hoare triple {76698#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,848 INFO L290 TraceCheckUtils]: 83: Hoare triple {76698#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,848 INFO L290 TraceCheckUtils]: 84: Hoare triple {76698#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,848 INFO L290 TraceCheckUtils]: 85: Hoare triple {76698#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,848 INFO L290 TraceCheckUtils]: 86: Hoare triple {76698#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,848 INFO L290 TraceCheckUtils]: 87: Hoare triple {76698#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,848 INFO L290 TraceCheckUtils]: 88: Hoare triple {76698#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,848 INFO L290 TraceCheckUtils]: 89: Hoare triple {76698#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,848 INFO L290 TraceCheckUtils]: 90: Hoare triple {76698#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-15 11:39:32,848 INFO L290 TraceCheckUtils]: 91: Hoare triple {76698#true} assume 4416 == #t~mem60;havoc #t~mem60; {76698#true} is VALID [2022-04-15 11:39:32,848 INFO L290 TraceCheckUtils]: 92: Hoare triple {76698#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {76698#true} is VALID [2022-04-15 11:39:32,848 INFO L290 TraceCheckUtils]: 93: Hoare triple {76698#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {76698#true} is VALID [2022-04-15 11:39:32,849 INFO L290 TraceCheckUtils]: 94: Hoare triple {76698#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); {76703#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:39:32,850 INFO L290 TraceCheckUtils]: 95: Hoare triple {76703#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {76703#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:39:32,850 INFO L290 TraceCheckUtils]: 96: Hoare triple {76703#(= 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); {76703#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:39:32,850 INFO L290 TraceCheckUtils]: 97: Hoare triple {76703#(= 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; {76703#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:39:32,850 INFO L290 TraceCheckUtils]: 98: Hoare triple {76703#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {76703#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:39:32,851 INFO L290 TraceCheckUtils]: 99: Hoare triple {76703#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {76703#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:39:32,851 INFO L290 TraceCheckUtils]: 100: Hoare triple {76703#(= 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); {76703#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:39:32,851 INFO L290 TraceCheckUtils]: 101: Hoare triple {76703#(= 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); {76703#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:39:32,851 INFO L290 TraceCheckUtils]: 102: Hoare triple {76703#(= 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); {76703#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:39:32,852 INFO L290 TraceCheckUtils]: 103: Hoare triple {76703#(= 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); {76703#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:39:32,852 INFO L290 TraceCheckUtils]: 104: Hoare triple {76703#(= 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); {76704#(= |ssl3_connect_#t~mem53| 4432)} is VALID [2022-04-15 11:39:32,852 INFO L290 TraceCheckUtils]: 105: Hoare triple {76704#(= |ssl3_connect_#t~mem53| 4432)} assume 4099 == #t~mem53;havoc #t~mem53; {76699#false} is VALID [2022-04-15 11:39:32,852 INFO L290 TraceCheckUtils]: 106: Hoare triple {76699#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {76699#false} is VALID [2022-04-15 11:39:32,852 INFO L290 TraceCheckUtils]: 107: Hoare triple {76699#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {76699#false} is VALID [2022-04-15 11:39:32,852 INFO L290 TraceCheckUtils]: 108: Hoare triple {76699#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {76699#false} is VALID [2022-04-15 11:39:32,853 INFO L290 TraceCheckUtils]: 109: Hoare triple {76699#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); {76699#false} is VALID [2022-04-15 11:39:32,853 INFO L290 TraceCheckUtils]: 110: Hoare triple {76699#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {76699#false} is VALID [2022-04-15 11:39:32,853 INFO L290 TraceCheckUtils]: 111: Hoare triple {76699#false} assume !(0 == ~tmp___4~0); {76699#false} is VALID [2022-04-15 11:39:32,853 INFO L290 TraceCheckUtils]: 112: Hoare triple {76699#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); {76699#false} is VALID [2022-04-15 11:39:32,853 INFO L290 TraceCheckUtils]: 113: Hoare triple {76699#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); {76699#false} is VALID [2022-04-15 11:39:32,853 INFO L290 TraceCheckUtils]: 114: Hoare triple {76699#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76699#false} is VALID [2022-04-15 11:39:32,853 INFO L290 TraceCheckUtils]: 115: Hoare triple {76699#false} ~skip~0 := 0; {76699#false} is VALID [2022-04-15 11:39:32,853 INFO L290 TraceCheckUtils]: 116: Hoare triple {76699#false} assume !false; {76699#false} is VALID [2022-04-15 11:39:32,853 INFO L290 TraceCheckUtils]: 117: Hoare triple {76699#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); {76699#false} is VALID [2022-04-15 11:39:32,853 INFO L290 TraceCheckUtils]: 118: Hoare triple {76699#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-15 11:39:32,853 INFO L290 TraceCheckUtils]: 119: Hoare triple {76699#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-15 11:39:32,853 INFO L290 TraceCheckUtils]: 120: Hoare triple {76699#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-15 11:39:32,853 INFO L290 TraceCheckUtils]: 121: Hoare triple {76699#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-15 11:39:32,853 INFO L290 TraceCheckUtils]: 122: Hoare triple {76699#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-15 11:39:32,854 INFO L290 TraceCheckUtils]: 123: Hoare triple {76699#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-15 11:39:32,854 INFO L290 TraceCheckUtils]: 124: Hoare triple {76699#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-15 11:39:32,854 INFO L290 TraceCheckUtils]: 125: Hoare triple {76699#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-15 11:39:32,854 INFO L290 TraceCheckUtils]: 126: Hoare triple {76699#false} assume 4385 == #t~mem57;havoc #t~mem57; {76699#false} is VALID [2022-04-15 11:39:32,854 INFO L290 TraceCheckUtils]: 127: Hoare triple {76699#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {76699#false} is VALID [2022-04-15 11:39:32,854 INFO L290 TraceCheckUtils]: 128: Hoare triple {76699#false} assume !(1 == ~blastFlag~0); {76699#false} is VALID [2022-04-15 11:39:32,854 INFO L290 TraceCheckUtils]: 129: Hoare triple {76699#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {76699#false} is VALID [2022-04-15 11:39:32,854 INFO L290 TraceCheckUtils]: 130: Hoare triple {76699#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {76699#false} is VALID [2022-04-15 11:39:32,854 INFO L290 TraceCheckUtils]: 131: Hoare triple {76699#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-15 11:39:32,854 INFO L290 TraceCheckUtils]: 132: Hoare triple {76699#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {76699#false} is VALID [2022-04-15 11:39:32,854 INFO L290 TraceCheckUtils]: 133: Hoare triple {76699#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); {76699#false} is VALID [2022-04-15 11:39:32,854 INFO L290 TraceCheckUtils]: 134: Hoare triple {76699#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76699#false} is VALID [2022-04-15 11:39:32,854 INFO L290 TraceCheckUtils]: 135: Hoare triple {76699#false} ~skip~0 := 0; {76699#false} is VALID [2022-04-15 11:39:32,854 INFO L290 TraceCheckUtils]: 136: Hoare triple {76699#false} assume !false; {76699#false} is VALID [2022-04-15 11:39:32,855 INFO L290 TraceCheckUtils]: 137: Hoare triple {76699#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); {76699#false} is VALID [2022-04-15 11:39:32,855 INFO L290 TraceCheckUtils]: 138: Hoare triple {76699#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-15 11:39:32,855 INFO L290 TraceCheckUtils]: 139: Hoare triple {76699#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-15 11:39:32,855 INFO L290 TraceCheckUtils]: 140: Hoare triple {76699#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-15 11:39:32,855 INFO L290 TraceCheckUtils]: 141: Hoare triple {76699#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-15 11:39:32,855 INFO L290 TraceCheckUtils]: 142: Hoare triple {76699#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-15 11:39:32,855 INFO L290 TraceCheckUtils]: 143: Hoare triple {76699#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-15 11:39:32,855 INFO L290 TraceCheckUtils]: 144: Hoare triple {76699#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-15 11:39:32,855 INFO L290 TraceCheckUtils]: 145: Hoare triple {76699#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-15 11:39:32,855 INFO L290 TraceCheckUtils]: 146: Hoare triple {76699#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-15 11:39:32,855 INFO L290 TraceCheckUtils]: 147: Hoare triple {76699#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-15 11:39:32,855 INFO L290 TraceCheckUtils]: 148: Hoare triple {76699#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-15 11:39:32,855 INFO L290 TraceCheckUtils]: 149: Hoare triple {76699#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-15 11:39:32,855 INFO L290 TraceCheckUtils]: 150: Hoare triple {76699#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-15 11:39:32,855 INFO L290 TraceCheckUtils]: 151: Hoare triple {76699#false} assume 4432 == #t~mem62;havoc #t~mem62; {76699#false} is VALID [2022-04-15 11:39:32,856 INFO L290 TraceCheckUtils]: 152: Hoare triple {76699#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {76699#false} is VALID [2022-04-15 11:39:32,856 INFO L290 TraceCheckUtils]: 153: Hoare triple {76699#false} assume 5 == ~blastFlag~0; {76699#false} is VALID [2022-04-15 11:39:32,856 INFO L290 TraceCheckUtils]: 154: Hoare triple {76699#false} assume !false; {76699#false} is VALID [2022-04-15 11:39:32,856 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-15 11:39:32,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:39:32,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84132450] [2022-04-15 11:39:32,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84132450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:32,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:32,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:39:32,857 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:39:32,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1941687954] [2022-04-15 11:39:32,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1941687954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:32,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:32,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:39:32,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257604482] [2022-04-15 11:39:32,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:39:32,857 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 155 [2022-04-15 11:39:32,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:39:32,858 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-15 11:39:32,932 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-15 11:39:32,932 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:39:32,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:32,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:39:32,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:39:32,933 INFO L87 Difference]: Start difference. First operand 867 states and 1239 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-15 11:39:34,953 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:39:36,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:36,239 INFO L93 Difference]: Finished difference Result 1937 states and 2787 transitions. [2022-04-15 11:39:36,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:39:36,239 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 155 [2022-04-15 11:39:36,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:39:36,240 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-15 11:39:36,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 443 transitions. [2022-04-15 11:39:36,241 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-15 11:39:36,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 443 transitions. [2022-04-15 11:39:36,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 443 transitions. [2022-04-15 11:39:36,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 443 edges. 443 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:36,544 INFO L225 Difference]: With dead ends: 1937 [2022-04-15 11:39:36,544 INFO L226 Difference]: Without dead ends: 1086 [2022-04-15 11:39:36,545 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:39:36,545 INFO L913 BasicCegarLoop]: 225 mSDtfsCounter, 83 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:39:36,545 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 539 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 491 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:39:36,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2022-04-15 11:39:36,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 867. [2022-04-15 11:39:36,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:39:36,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1086 states. Second operand has 867 states, 862 states have (on average 1.4280742459396751) internal successors, (1231), 862 states have internal predecessors, (1231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:36,594 INFO L74 IsIncluded]: Start isIncluded. First operand 1086 states. Second operand has 867 states, 862 states have (on average 1.4280742459396751) internal successors, (1231), 862 states have internal predecessors, (1231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:36,595 INFO L87 Difference]: Start difference. First operand 1086 states. Second operand has 867 states, 862 states have (on average 1.4280742459396751) internal successors, (1231), 862 states have internal predecessors, (1231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:36,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:36,625 INFO L93 Difference]: Finished difference Result 1086 states and 1564 transitions. [2022-04-15 11:39:36,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1564 transitions. [2022-04-15 11:39:36,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:36,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:36,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 867 states, 862 states have (on average 1.4280742459396751) internal successors, (1231), 862 states have internal predecessors, (1231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1086 states. [2022-04-15 11:39:36,628 INFO L87 Difference]: Start difference. First operand has 867 states, 862 states have (on average 1.4280742459396751) internal successors, (1231), 862 states have internal predecessors, (1231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1086 states. [2022-04-15 11:39:36,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:36,658 INFO L93 Difference]: Finished difference Result 1086 states and 1564 transitions. [2022-04-15 11:39:36,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1564 transitions. [2022-04-15 11:39:36,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:36,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:36,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:39:36,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:39:36,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 862 states have (on average 1.4280742459396751) internal successors, (1231), 862 states have internal predecessors, (1231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:36,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1235 transitions. [2022-04-15 11:39:36,689 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1235 transitions. Word has length 155 [2022-04-15 11:39:36,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:39:36,690 INFO L478 AbstractCegarLoop]: Abstraction has 867 states and 1235 transitions. [2022-04-15 11:39:36,690 INFO L479 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-15 11:39:36,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 867 states and 1235 transitions. [2022-04-15 11:39:37,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1235 edges. 1235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:37,736 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1235 transitions. [2022-04-15 11:39:37,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-15 11:39:37,737 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:39:37,741 INFO L499 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:39:37,741 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 11:39:37,742 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:39:37,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:39:37,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1227152319, now seen corresponding path program 1 times [2022-04-15 11:39:37,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:37,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [135229426] [2022-04-15 11:39:54,683 WARN L232 SmtUtils]: Spent 12.38s 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-15 11:40:02,427 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:40:02,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1227152319, now seen corresponding path program 2 times [2022-04-15 11:40:02,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:40:02,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705313828] [2022-04-15 11:40:02,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:40:02,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:40:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:02,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:40:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:02,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {84497#(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); {84490#true} is VALID [2022-04-15 11:40:02,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {84490#true} assume true; {84490#true} is VALID [2022-04-15 11:40:02,611 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {84490#true} {84490#true} #593#return; {84490#true} is VALID [2022-04-15 11:40:02,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {84490#true} call ULTIMATE.init(); {84497#(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-15 11:40:02,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {84497#(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); {84490#true} is VALID [2022-04-15 11:40:02,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {84490#true} assume true; {84490#true} is VALID [2022-04-15 11:40:02,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84490#true} {84490#true} #593#return; {84490#true} is VALID [2022-04-15 11:40:02,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {84490#true} call #t~ret158 := main(); {84490#true} is VALID [2022-04-15 11:40:02,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {84490#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; {84490#true} is VALID [2022-04-15 11:40:02,612 INFO L272 TraceCheckUtils]: 6: Hoare triple {84490#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {84490#true} is VALID [2022-04-15 11:40:02,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {84490#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); {84490#true} is VALID [2022-04-15 11:40:02,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {84490#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; {84490#true} is VALID [2022-04-15 11:40:02,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {84490#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; {84490#true} is VALID [2022-04-15 11:40:02,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {84490#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {84490#true} is VALID [2022-04-15 11:40:02,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {84490#true} assume !false; {84490#true} is VALID [2022-04-15 11:40:02,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {84490#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); {84490#true} is VALID [2022-04-15 11:40:02,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {84490#true} assume 12292 == #t~mem49;havoc #t~mem49; {84490#true} is VALID [2022-04-15 11:40:02,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {84490#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; {84490#true} is VALID [2022-04-15 11:40:02,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {84490#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {84490#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {84490#true} is VALID [2022-04-15 11:40:02,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {84490#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {84490#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); {84490#true} is VALID [2022-04-15 11:40:02,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {84490#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {84490#true} is VALID [2022-04-15 11:40:02,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {84490#true} assume !(0 == ~tmp___4~0); {84490#true} is VALID [2022-04-15 11:40:02,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {84490#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); {84490#true} is VALID [2022-04-15 11:40:02,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {84490#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); {84490#true} is VALID [2022-04-15 11:40:02,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {84490#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {84490#true} is VALID [2022-04-15 11:40:02,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {84490#true} ~skip~0 := 0; {84490#true} is VALID [2022-04-15 11:40:02,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {84490#true} assume !false; {84490#true} is VALID [2022-04-15 11:40:02,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {84490#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); {84490#true} is VALID [2022-04-15 11:40:02,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {84490#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {84490#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {84490#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {84490#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {84490#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {84490#true} assume 4368 == #t~mem54;havoc #t~mem54; {84490#true} is VALID [2022-04-15 11:40:02,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {84490#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; {84490#true} is VALID [2022-04-15 11:40:02,614 INFO L290 TraceCheckUtils]: 34: Hoare triple {84490#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {84490#true} is VALID [2022-04-15 11:40:02,614 INFO L290 TraceCheckUtils]: 35: Hoare triple {84490#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); {84490#true} is VALID [2022-04-15 11:40:02,614 INFO L290 TraceCheckUtils]: 36: Hoare triple {84490#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; {84490#true} is VALID [2022-04-15 11:40:02,614 INFO L290 TraceCheckUtils]: 37: Hoare triple {84490#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); {84490#true} is VALID [2022-04-15 11:40:02,614 INFO L290 TraceCheckUtils]: 38: Hoare triple {84490#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {84490#true} is VALID [2022-04-15 11:40:02,614 INFO L290 TraceCheckUtils]: 39: Hoare triple {84490#true} ~skip~0 := 0; {84490#true} is VALID [2022-04-15 11:40:02,615 INFO L290 TraceCheckUtils]: 40: Hoare triple {84490#true} assume !false; {84490#true} is VALID [2022-04-15 11:40:02,615 INFO L290 TraceCheckUtils]: 41: Hoare triple {84490#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); {84490#true} is VALID [2022-04-15 11:40:02,615 INFO L290 TraceCheckUtils]: 42: Hoare triple {84490#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,615 INFO L290 TraceCheckUtils]: 43: Hoare triple {84490#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,615 INFO L290 TraceCheckUtils]: 44: Hoare triple {84490#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,615 INFO L290 TraceCheckUtils]: 45: Hoare triple {84490#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,615 INFO L290 TraceCheckUtils]: 46: Hoare triple {84490#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,615 INFO L290 TraceCheckUtils]: 47: Hoare triple {84490#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,615 INFO L290 TraceCheckUtils]: 48: Hoare triple {84490#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,615 INFO L290 TraceCheckUtils]: 49: Hoare triple {84490#true} assume 4384 == #t~mem56;havoc #t~mem56; {84490#true} is VALID [2022-04-15 11:40:02,615 INFO L290 TraceCheckUtils]: 50: Hoare triple {84490#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {84490#true} is VALID [2022-04-15 11:40:02,615 INFO L290 TraceCheckUtils]: 51: Hoare triple {84490#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {84490#true} is VALID [2022-04-15 11:40:02,615 INFO L290 TraceCheckUtils]: 52: Hoare triple {84490#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,615 INFO L290 TraceCheckUtils]: 53: Hoare triple {84490#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,616 INFO L290 TraceCheckUtils]: 54: Hoare triple {84490#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,616 INFO L290 TraceCheckUtils]: 55: Hoare triple {84490#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); {84490#true} is VALID [2022-04-15 11:40:02,616 INFO L290 TraceCheckUtils]: 56: Hoare triple {84490#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {84490#true} is VALID [2022-04-15 11:40:02,616 INFO L290 TraceCheckUtils]: 57: Hoare triple {84490#true} ~skip~0 := 0; {84490#true} is VALID [2022-04-15 11:40:02,616 INFO L290 TraceCheckUtils]: 58: Hoare triple {84490#true} assume !false; {84490#true} is VALID [2022-04-15 11:40:02,616 INFO L290 TraceCheckUtils]: 59: Hoare triple {84490#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); {84490#true} is VALID [2022-04-15 11:40:02,616 INFO L290 TraceCheckUtils]: 60: Hoare triple {84490#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,616 INFO L290 TraceCheckUtils]: 61: Hoare triple {84490#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,616 INFO L290 TraceCheckUtils]: 62: Hoare triple {84490#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,616 INFO L290 TraceCheckUtils]: 63: Hoare triple {84490#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,616 INFO L290 TraceCheckUtils]: 64: Hoare triple {84490#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,616 INFO L290 TraceCheckUtils]: 65: Hoare triple {84490#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,616 INFO L290 TraceCheckUtils]: 66: Hoare triple {84490#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,616 INFO L290 TraceCheckUtils]: 67: Hoare triple {84490#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,616 INFO L290 TraceCheckUtils]: 68: Hoare triple {84490#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,617 INFO L290 TraceCheckUtils]: 69: Hoare triple {84490#true} assume 4400 == #t~mem58;havoc #t~mem58; {84490#true} is VALID [2022-04-15 11:40:02,617 INFO L290 TraceCheckUtils]: 70: Hoare triple {84490#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); {84490#true} is VALID [2022-04-15 11:40:02,617 INFO L290 TraceCheckUtils]: 71: Hoare triple {84490#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; {84490#true} is VALID [2022-04-15 11:40:02,617 INFO L290 TraceCheckUtils]: 72: Hoare triple {84490#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {84490#true} is VALID [2022-04-15 11:40:02,617 INFO L290 TraceCheckUtils]: 73: Hoare triple {84490#true} assume !(~ret~0 <= 0); {84490#true} is VALID [2022-04-15 11:40:02,617 INFO L290 TraceCheckUtils]: 74: Hoare triple {84490#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,617 INFO L290 TraceCheckUtils]: 75: Hoare triple {84490#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); {84490#true} is VALID [2022-04-15 11:40:02,617 INFO L290 TraceCheckUtils]: 76: Hoare triple {84490#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {84490#true} is VALID [2022-04-15 11:40:02,617 INFO L290 TraceCheckUtils]: 77: Hoare triple {84490#true} ~skip~0 := 0; {84490#true} is VALID [2022-04-15 11:40:02,617 INFO L290 TraceCheckUtils]: 78: Hoare triple {84490#true} assume !false; {84490#true} is VALID [2022-04-15 11:40:02,617 INFO L290 TraceCheckUtils]: 79: Hoare triple {84490#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); {84490#true} is VALID [2022-04-15 11:40:02,617 INFO L290 TraceCheckUtils]: 80: Hoare triple {84490#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,617 INFO L290 TraceCheckUtils]: 81: Hoare triple {84490#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,617 INFO L290 TraceCheckUtils]: 82: Hoare triple {84490#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,618 INFO L290 TraceCheckUtils]: 83: Hoare triple {84490#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,618 INFO L290 TraceCheckUtils]: 84: Hoare triple {84490#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,618 INFO L290 TraceCheckUtils]: 85: Hoare triple {84490#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,618 INFO L290 TraceCheckUtils]: 86: Hoare triple {84490#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,618 INFO L290 TraceCheckUtils]: 87: Hoare triple {84490#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,618 INFO L290 TraceCheckUtils]: 88: Hoare triple {84490#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,618 INFO L290 TraceCheckUtils]: 89: Hoare triple {84490#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,618 INFO L290 TraceCheckUtils]: 90: Hoare triple {84490#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-15 11:40:02,618 INFO L290 TraceCheckUtils]: 91: Hoare triple {84490#true} assume 4416 == #t~mem60;havoc #t~mem60; {84490#true} is VALID [2022-04-15 11:40:02,618 INFO L290 TraceCheckUtils]: 92: Hoare triple {84490#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {84490#true} is VALID [2022-04-15 11:40:02,618 INFO L290 TraceCheckUtils]: 93: Hoare triple {84490#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {84490#true} is VALID [2022-04-15 11:40:02,623 INFO L290 TraceCheckUtils]: 94: Hoare triple {84490#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); {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:02,623 INFO L290 TraceCheckUtils]: 95: Hoare triple {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:02,624 INFO L290 TraceCheckUtils]: 96: Hoare triple {84495#(= 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); {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:02,624 INFO L290 TraceCheckUtils]: 97: Hoare triple {84495#(= 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; {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:02,624 INFO L290 TraceCheckUtils]: 98: Hoare triple {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:02,625 INFO L290 TraceCheckUtils]: 99: Hoare triple {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:02,625 INFO L290 TraceCheckUtils]: 100: Hoare triple {84495#(= 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); {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:02,625 INFO L290 TraceCheckUtils]: 101: Hoare triple {84495#(= 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); {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:02,625 INFO L290 TraceCheckUtils]: 102: Hoare triple {84495#(= 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); {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:02,626 INFO L290 TraceCheckUtils]: 103: Hoare triple {84495#(= 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); {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:02,626 INFO L290 TraceCheckUtils]: 104: Hoare triple {84495#(= 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); {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:02,626 INFO L290 TraceCheckUtils]: 105: Hoare triple {84495#(= 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); {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:02,626 INFO L290 TraceCheckUtils]: 106: Hoare triple {84495#(= 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); {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:02,627 INFO L290 TraceCheckUtils]: 107: Hoare triple {84495#(= 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); {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:02,627 INFO L290 TraceCheckUtils]: 108: Hoare triple {84495#(= 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); {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:02,627 INFO L290 TraceCheckUtils]: 109: Hoare triple {84495#(= 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); {84496#(= |ssl3_connect_#t~mem58| 4432)} is VALID [2022-04-15 11:40:02,628 INFO L290 TraceCheckUtils]: 110: Hoare triple {84496#(= |ssl3_connect_#t~mem58| 4432)} assume 4400 == #t~mem58;havoc #t~mem58; {84491#false} is VALID [2022-04-15 11:40:02,628 INFO L290 TraceCheckUtils]: 111: Hoare triple {84491#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); {84491#false} is VALID [2022-04-15 11:40:02,628 INFO L290 TraceCheckUtils]: 112: Hoare triple {84491#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;~skip~0 := 1; {84491#false} is VALID [2022-04-15 11:40:02,628 INFO L290 TraceCheckUtils]: 113: Hoare triple {84491#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {84491#false} is VALID [2022-04-15 11:40:02,628 INFO L290 TraceCheckUtils]: 114: Hoare triple {84491#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); {84491#false} is VALID [2022-04-15 11:40:02,628 INFO L290 TraceCheckUtils]: 115: Hoare triple {84491#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {84491#false} is VALID [2022-04-15 11:40:02,628 INFO L290 TraceCheckUtils]: 116: Hoare triple {84491#false} ~skip~0 := 0; {84491#false} is VALID [2022-04-15 11:40:02,628 INFO L290 TraceCheckUtils]: 117: Hoare triple {84491#false} assume !false; {84491#false} is VALID [2022-04-15 11:40:02,628 INFO L290 TraceCheckUtils]: 118: Hoare triple {84491#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); {84491#false} is VALID [2022-04-15 11:40:02,628 INFO L290 TraceCheckUtils]: 119: Hoare triple {84491#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-15 11:40:02,628 INFO L290 TraceCheckUtils]: 120: Hoare triple {84491#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-15 11:40:02,628 INFO L290 TraceCheckUtils]: 121: Hoare triple {84491#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-15 11:40:02,628 INFO L290 TraceCheckUtils]: 122: Hoare triple {84491#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-15 11:40:02,629 INFO L290 TraceCheckUtils]: 123: Hoare triple {84491#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-15 11:40:02,629 INFO L290 TraceCheckUtils]: 124: Hoare triple {84491#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-15 11:40:02,629 INFO L290 TraceCheckUtils]: 125: Hoare triple {84491#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-15 11:40:02,629 INFO L290 TraceCheckUtils]: 126: Hoare triple {84491#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-15 11:40:02,629 INFO L290 TraceCheckUtils]: 127: Hoare triple {84491#false} assume 4385 == #t~mem57;havoc #t~mem57; {84491#false} is VALID [2022-04-15 11:40:02,629 INFO L290 TraceCheckUtils]: 128: Hoare triple {84491#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {84491#false} is VALID [2022-04-15 11:40:02,629 INFO L290 TraceCheckUtils]: 129: Hoare triple {84491#false} assume !(1 == ~blastFlag~0); {84491#false} is VALID [2022-04-15 11:40:02,629 INFO L290 TraceCheckUtils]: 130: Hoare triple {84491#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {84491#false} is VALID [2022-04-15 11:40:02,629 INFO L290 TraceCheckUtils]: 131: Hoare triple {84491#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {84491#false} is VALID [2022-04-15 11:40:02,629 INFO L290 TraceCheckUtils]: 132: Hoare triple {84491#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-15 11:40:02,629 INFO L290 TraceCheckUtils]: 133: Hoare triple {84491#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {84491#false} is VALID [2022-04-15 11:40:02,629 INFO L290 TraceCheckUtils]: 134: Hoare triple {84491#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); {84491#false} is VALID [2022-04-15 11:40:02,629 INFO L290 TraceCheckUtils]: 135: Hoare triple {84491#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {84491#false} is VALID [2022-04-15 11:40:02,629 INFO L290 TraceCheckUtils]: 136: Hoare triple {84491#false} ~skip~0 := 0; {84491#false} is VALID [2022-04-15 11:40:02,629 INFO L290 TraceCheckUtils]: 137: Hoare triple {84491#false} assume !false; {84491#false} is VALID [2022-04-15 11:40:02,630 INFO L290 TraceCheckUtils]: 138: Hoare triple {84491#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); {84491#false} is VALID [2022-04-15 11:40:02,630 INFO L290 TraceCheckUtils]: 139: Hoare triple {84491#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-15 11:40:02,630 INFO L290 TraceCheckUtils]: 140: Hoare triple {84491#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-15 11:40:02,630 INFO L290 TraceCheckUtils]: 141: Hoare triple {84491#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-15 11:40:02,630 INFO L290 TraceCheckUtils]: 142: Hoare triple {84491#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-15 11:40:02,630 INFO L290 TraceCheckUtils]: 143: Hoare triple {84491#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-15 11:40:02,630 INFO L290 TraceCheckUtils]: 144: Hoare triple {84491#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-15 11:40:02,630 INFO L290 TraceCheckUtils]: 145: Hoare triple {84491#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-15 11:40:02,630 INFO L290 TraceCheckUtils]: 146: Hoare triple {84491#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-15 11:40:02,630 INFO L290 TraceCheckUtils]: 147: Hoare triple {84491#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-15 11:40:02,630 INFO L290 TraceCheckUtils]: 148: Hoare triple {84491#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-15 11:40:02,630 INFO L290 TraceCheckUtils]: 149: Hoare triple {84491#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-15 11:40:02,630 INFO L290 TraceCheckUtils]: 150: Hoare triple {84491#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-15 11:40:02,630 INFO L290 TraceCheckUtils]: 151: Hoare triple {84491#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-15 11:40:02,630 INFO L290 TraceCheckUtils]: 152: Hoare triple {84491#false} assume 4432 == #t~mem62;havoc #t~mem62; {84491#false} is VALID [2022-04-15 11:40:02,631 INFO L290 TraceCheckUtils]: 153: Hoare triple {84491#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {84491#false} is VALID [2022-04-15 11:40:02,631 INFO L290 TraceCheckUtils]: 154: Hoare triple {84491#false} assume 5 == ~blastFlag~0; {84491#false} is VALID [2022-04-15 11:40:02,631 INFO L290 TraceCheckUtils]: 155: Hoare triple {84491#false} assume !false; {84491#false} is VALID [2022-04-15 11:40:02,631 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-15 11:40:02,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:40:02,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705313828] [2022-04-15 11:40:02,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705313828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:40:02,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:40:02,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:40:02,632 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:40:02,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [135229426] [2022-04-15 11:40:02,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [135229426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:40:02,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:40:02,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:40:02,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904672245] [2022-04-15 11:40:02,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:40:02,632 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 156 [2022-04-15 11:40:02,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:40:02,633 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-15 11:40:02,709 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-15 11:40:02,709 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:40:02,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:02,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:40:02,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:40:02,710 INFO L87 Difference]: Start difference. First operand 867 states and 1235 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-15 11:40:04,731 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:40:06,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:06,091 INFO L93 Difference]: Finished difference Result 1937 states and 2779 transitions. [2022-04-15 11:40:06,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:40:06,092 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 156 [2022-04-15 11:40:06,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:40:06,092 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-15 11:40:06,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-15 11:40:06,094 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-15 11:40:06,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-15 11:40:06,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-15 11:40:06,359 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-15 11:40:06,404 INFO L225 Difference]: With dead ends: 1937 [2022-04-15 11:40:06,404 INFO L226 Difference]: Without dead ends: 1086 [2022-04-15 11:40:06,405 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:40:06,405 INFO L913 BasicCegarLoop]: 224 mSDtfsCounter, 77 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:40:06,405 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 537 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 490 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:40:06,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2022-04-15 11:40:06,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 871. [2022-04-15 11:40:06,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:40:06,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1086 states. Second operand has 871 states, 866 states have (on average 1.426096997690531) internal successors, (1235), 866 states have internal predecessors, (1235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:06,464 INFO L74 IsIncluded]: Start isIncluded. First operand 1086 states. Second operand has 871 states, 866 states have (on average 1.426096997690531) internal successors, (1235), 866 states have internal predecessors, (1235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:06,465 INFO L87 Difference]: Start difference. First operand 1086 states. Second operand has 871 states, 866 states have (on average 1.426096997690531) internal successors, (1235), 866 states have internal predecessors, (1235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:06,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:06,494 INFO L93 Difference]: Finished difference Result 1086 states and 1560 transitions. [2022-04-15 11:40:06,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1560 transitions. [2022-04-15 11:40:06,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:06,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:06,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 871 states, 866 states have (on average 1.426096997690531) internal successors, (1235), 866 states have internal predecessors, (1235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1086 states. [2022-04-15 11:40:06,497 INFO L87 Difference]: Start difference. First operand has 871 states, 866 states have (on average 1.426096997690531) internal successors, (1235), 866 states have internal predecessors, (1235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1086 states. [2022-04-15 11:40:06,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:06,527 INFO L93 Difference]: Finished difference Result 1086 states and 1560 transitions. [2022-04-15 11:40:06,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1560 transitions. [2022-04-15 11:40:06,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:06,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:06,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:40:06,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:40:06,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 866 states have (on average 1.426096997690531) internal successors, (1235), 866 states have internal predecessors, (1235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:06,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1239 transitions. [2022-04-15 11:40:06,559 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1239 transitions. Word has length 156 [2022-04-15 11:40:06,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:40:06,559 INFO L478 AbstractCegarLoop]: Abstraction has 871 states and 1239 transitions. [2022-04-15 11:40:06,559 INFO L479 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-15 11:40:06,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 871 states and 1239 transitions. [2022-04-15 11:40:07,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1239 edges. 1239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:40:07,601 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1239 transitions. [2022-04-15 11:40:07,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-15 11:40:07,602 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:40:07,615 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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] [2022-04-15 11:40:07,615 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 11:40:07,615 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:40:07,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:40:07,615 INFO L85 PathProgramCache]: Analyzing trace with hash -35280706, now seen corresponding path program 1 times [2022-04-15 11:40:07,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:07,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1196859692] [2022-04-15 11:40:18,890 WARN L232 SmtUtils]: Spent 6.74s 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-15 11:40:24,346 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:40:24,346 INFO L85 PathProgramCache]: Analyzing trace with hash -35280706, now seen corresponding path program 2 times [2022-04-15 11:40:24,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:40:24,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914655416] [2022-04-15 11:40:24,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:40:24,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:40:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:24,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:40:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:24,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {92297#(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); {92290#true} is VALID [2022-04-15 11:40:24,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {92290#true} assume true; {92290#true} is VALID [2022-04-15 11:40:24,498 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {92290#true} {92290#true} #593#return; {92290#true} is VALID [2022-04-15 11:40:24,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {92290#true} call ULTIMATE.init(); {92297#(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-15 11:40:24,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {92297#(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); {92290#true} is VALID [2022-04-15 11:40:24,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {92290#true} assume true; {92290#true} is VALID [2022-04-15 11:40:24,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92290#true} {92290#true} #593#return; {92290#true} is VALID [2022-04-15 11:40:24,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {92290#true} call #t~ret158 := main(); {92290#true} is VALID [2022-04-15 11:40:24,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {92290#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; {92290#true} is VALID [2022-04-15 11:40:24,499 INFO L272 TraceCheckUtils]: 6: Hoare triple {92290#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {92290#true} is VALID [2022-04-15 11:40:24,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {92290#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); {92290#true} is VALID [2022-04-15 11:40:24,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {92290#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; {92290#true} is VALID [2022-04-15 11:40:24,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {92290#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; {92290#true} is VALID [2022-04-15 11:40:24,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {92290#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {92290#true} is VALID [2022-04-15 11:40:24,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {92290#true} assume !false; {92290#true} is VALID [2022-04-15 11:40:24,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {92290#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); {92290#true} is VALID [2022-04-15 11:40:24,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {92290#true} assume 12292 == #t~mem49;havoc #t~mem49; {92290#true} is VALID [2022-04-15 11:40:24,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {92290#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; {92290#true} is VALID [2022-04-15 11:40:24,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {92290#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {92290#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {92290#true} is VALID [2022-04-15 11:40:24,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {92290#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,500 INFO L290 TraceCheckUtils]: 18: Hoare triple {92290#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); {92290#true} is VALID [2022-04-15 11:40:24,500 INFO L290 TraceCheckUtils]: 19: Hoare triple {92290#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {92290#true} is VALID [2022-04-15 11:40:24,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {92290#true} assume !(0 == ~tmp___4~0); {92290#true} is VALID [2022-04-15 11:40:24,500 INFO L290 TraceCheckUtils]: 21: Hoare triple {92290#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); {92290#true} is VALID [2022-04-15 11:40:24,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {92290#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); {92290#true} is VALID [2022-04-15 11:40:24,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {92290#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {92290#true} is VALID [2022-04-15 11:40:24,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {92290#true} ~skip~0 := 0; {92290#true} is VALID [2022-04-15 11:40:24,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {92290#true} assume !false; {92290#true} is VALID [2022-04-15 11:40:24,500 INFO L290 TraceCheckUtils]: 26: Hoare triple {92290#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); {92290#true} is VALID [2022-04-15 11:40:24,500 INFO L290 TraceCheckUtils]: 27: Hoare triple {92290#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,500 INFO L290 TraceCheckUtils]: 28: Hoare triple {92290#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,501 INFO L290 TraceCheckUtils]: 29: Hoare triple {92290#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,501 INFO L290 TraceCheckUtils]: 30: Hoare triple {92290#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,501 INFO L290 TraceCheckUtils]: 31: Hoare triple {92290#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,501 INFO L290 TraceCheckUtils]: 32: Hoare triple {92290#true} assume 4368 == #t~mem54;havoc #t~mem54; {92290#true} is VALID [2022-04-15 11:40:24,501 INFO L290 TraceCheckUtils]: 33: Hoare triple {92290#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; {92290#true} is VALID [2022-04-15 11:40:24,501 INFO L290 TraceCheckUtils]: 34: Hoare triple {92290#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {92290#true} is VALID [2022-04-15 11:40:24,501 INFO L290 TraceCheckUtils]: 35: Hoare triple {92290#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); {92290#true} is VALID [2022-04-15 11:40:24,501 INFO L290 TraceCheckUtils]: 36: Hoare triple {92290#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; {92290#true} is VALID [2022-04-15 11:40:24,501 INFO L290 TraceCheckUtils]: 37: Hoare triple {92290#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); {92290#true} is VALID [2022-04-15 11:40:24,501 INFO L290 TraceCheckUtils]: 38: Hoare triple {92290#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {92290#true} is VALID [2022-04-15 11:40:24,501 INFO L290 TraceCheckUtils]: 39: Hoare triple {92290#true} ~skip~0 := 0; {92290#true} is VALID [2022-04-15 11:40:24,501 INFO L290 TraceCheckUtils]: 40: Hoare triple {92290#true} assume !false; {92290#true} is VALID [2022-04-15 11:40:24,501 INFO L290 TraceCheckUtils]: 41: Hoare triple {92290#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); {92290#true} is VALID [2022-04-15 11:40:24,501 INFO L290 TraceCheckUtils]: 42: Hoare triple {92290#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,501 INFO L290 TraceCheckUtils]: 43: Hoare triple {92290#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,502 INFO L290 TraceCheckUtils]: 44: Hoare triple {92290#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,502 INFO L290 TraceCheckUtils]: 45: Hoare triple {92290#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,502 INFO L290 TraceCheckUtils]: 46: Hoare triple {92290#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,502 INFO L290 TraceCheckUtils]: 47: Hoare triple {92290#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,502 INFO L290 TraceCheckUtils]: 48: Hoare triple {92290#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,502 INFO L290 TraceCheckUtils]: 49: Hoare triple {92290#true} assume 4384 == #t~mem56;havoc #t~mem56; {92290#true} is VALID [2022-04-15 11:40:24,502 INFO L290 TraceCheckUtils]: 50: Hoare triple {92290#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {92290#true} is VALID [2022-04-15 11:40:24,502 INFO L290 TraceCheckUtils]: 51: Hoare triple {92290#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {92290#true} is VALID [2022-04-15 11:40:24,502 INFO L290 TraceCheckUtils]: 52: Hoare triple {92290#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,502 INFO L290 TraceCheckUtils]: 53: Hoare triple {92290#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,502 INFO L290 TraceCheckUtils]: 54: Hoare triple {92290#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,502 INFO L290 TraceCheckUtils]: 55: Hoare triple {92290#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); {92290#true} is VALID [2022-04-15 11:40:24,502 INFO L290 TraceCheckUtils]: 56: Hoare triple {92290#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {92290#true} is VALID [2022-04-15 11:40:24,502 INFO L290 TraceCheckUtils]: 57: Hoare triple {92290#true} ~skip~0 := 0; {92290#true} is VALID [2022-04-15 11:40:24,503 INFO L290 TraceCheckUtils]: 58: Hoare triple {92290#true} assume !false; {92290#true} is VALID [2022-04-15 11:40:24,503 INFO L290 TraceCheckUtils]: 59: Hoare triple {92290#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); {92290#true} is VALID [2022-04-15 11:40:24,503 INFO L290 TraceCheckUtils]: 60: Hoare triple {92290#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,503 INFO L290 TraceCheckUtils]: 61: Hoare triple {92290#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,503 INFO L290 TraceCheckUtils]: 62: Hoare triple {92290#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,503 INFO L290 TraceCheckUtils]: 63: Hoare triple {92290#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,503 INFO L290 TraceCheckUtils]: 64: Hoare triple {92290#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,503 INFO L290 TraceCheckUtils]: 65: Hoare triple {92290#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,503 INFO L290 TraceCheckUtils]: 66: Hoare triple {92290#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,503 INFO L290 TraceCheckUtils]: 67: Hoare triple {92290#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,503 INFO L290 TraceCheckUtils]: 68: Hoare triple {92290#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,503 INFO L290 TraceCheckUtils]: 69: Hoare triple {92290#true} assume 4400 == #t~mem58;havoc #t~mem58; {92290#true} is VALID [2022-04-15 11:40:24,503 INFO L290 TraceCheckUtils]: 70: Hoare triple {92290#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); {92290#true} is VALID [2022-04-15 11:40:24,503 INFO L290 TraceCheckUtils]: 71: Hoare triple {92290#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; {92290#true} is VALID [2022-04-15 11:40:24,504 INFO L290 TraceCheckUtils]: 72: Hoare triple {92290#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {92290#true} is VALID [2022-04-15 11:40:24,504 INFO L290 TraceCheckUtils]: 73: Hoare triple {92290#true} assume !(~ret~0 <= 0); {92290#true} is VALID [2022-04-15 11:40:24,504 INFO L290 TraceCheckUtils]: 74: Hoare triple {92290#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,504 INFO L290 TraceCheckUtils]: 75: Hoare triple {92290#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); {92290#true} is VALID [2022-04-15 11:40:24,504 INFO L290 TraceCheckUtils]: 76: Hoare triple {92290#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {92290#true} is VALID [2022-04-15 11:40:24,504 INFO L290 TraceCheckUtils]: 77: Hoare triple {92290#true} ~skip~0 := 0; {92290#true} is VALID [2022-04-15 11:40:24,504 INFO L290 TraceCheckUtils]: 78: Hoare triple {92290#true} assume !false; {92290#true} is VALID [2022-04-15 11:40:24,504 INFO L290 TraceCheckUtils]: 79: Hoare triple {92290#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); {92290#true} is VALID [2022-04-15 11:40:24,504 INFO L290 TraceCheckUtils]: 80: Hoare triple {92290#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,504 INFO L290 TraceCheckUtils]: 81: Hoare triple {92290#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,504 INFO L290 TraceCheckUtils]: 82: Hoare triple {92290#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,504 INFO L290 TraceCheckUtils]: 83: Hoare triple {92290#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,504 INFO L290 TraceCheckUtils]: 84: Hoare triple {92290#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,504 INFO L290 TraceCheckUtils]: 85: Hoare triple {92290#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,504 INFO L290 TraceCheckUtils]: 86: Hoare triple {92290#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,505 INFO L290 TraceCheckUtils]: 87: Hoare triple {92290#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,505 INFO L290 TraceCheckUtils]: 88: Hoare triple {92290#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,505 INFO L290 TraceCheckUtils]: 89: Hoare triple {92290#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,505 INFO L290 TraceCheckUtils]: 90: Hoare triple {92290#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-15 11:40:24,505 INFO L290 TraceCheckUtils]: 91: Hoare triple {92290#true} assume 4416 == #t~mem60;havoc #t~mem60; {92290#true} is VALID [2022-04-15 11:40:24,505 INFO L290 TraceCheckUtils]: 92: Hoare triple {92290#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {92290#true} is VALID [2022-04-15 11:40:24,505 INFO L290 TraceCheckUtils]: 93: Hoare triple {92290#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {92290#true} is VALID [2022-04-15 11:40:24,506 INFO L290 TraceCheckUtils]: 94: Hoare triple {92290#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); {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:24,506 INFO L290 TraceCheckUtils]: 95: Hoare triple {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:24,506 INFO L290 TraceCheckUtils]: 96: Hoare triple {92295#(not (= 4401 (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); {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:24,507 INFO L290 TraceCheckUtils]: 97: Hoare triple {92295#(not (= 4401 (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; {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:24,507 INFO L290 TraceCheckUtils]: 98: Hoare triple {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:24,507 INFO L290 TraceCheckUtils]: 99: Hoare triple {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:24,508 INFO L290 TraceCheckUtils]: 100: Hoare triple {92295#(not (= 4401 (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); {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:24,508 INFO L290 TraceCheckUtils]: 101: Hoare triple {92295#(not (= 4401 (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); {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:24,508 INFO L290 TraceCheckUtils]: 102: Hoare triple {92295#(not (= 4401 (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); {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:24,508 INFO L290 TraceCheckUtils]: 103: Hoare triple {92295#(not (= 4401 (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); {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:24,509 INFO L290 TraceCheckUtils]: 104: Hoare triple {92295#(not (= 4401 (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); {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:24,509 INFO L290 TraceCheckUtils]: 105: Hoare triple {92295#(not (= 4401 (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); {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:24,509 INFO L290 TraceCheckUtils]: 106: Hoare triple {92295#(not (= 4401 (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); {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:24,510 INFO L290 TraceCheckUtils]: 107: Hoare triple {92295#(not (= 4401 (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); {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:24,510 INFO L290 TraceCheckUtils]: 108: Hoare triple {92295#(not (= 4401 (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); {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:24,510 INFO L290 TraceCheckUtils]: 109: Hoare triple {92295#(not (= 4401 (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); {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:24,511 INFO L290 TraceCheckUtils]: 110: Hoare triple {92295#(not (= 4401 (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); {92296#(not (= |ssl3_connect_#t~mem59| 4401))} is VALID [2022-04-15 11:40:24,511 INFO L290 TraceCheckUtils]: 111: Hoare triple {92296#(not (= |ssl3_connect_#t~mem59| 4401))} assume 4401 == #t~mem59;havoc #t~mem59; {92291#false} is VALID [2022-04-15 11:40:24,511 INFO L290 TraceCheckUtils]: 112: Hoare triple {92291#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); {92291#false} is VALID [2022-04-15 11:40:24,511 INFO L290 TraceCheckUtils]: 113: Hoare triple {92291#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;~skip~0 := 1; {92291#false} is VALID [2022-04-15 11:40:24,511 INFO L290 TraceCheckUtils]: 114: Hoare triple {92291#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {92291#false} is VALID [2022-04-15 11:40:24,511 INFO L290 TraceCheckUtils]: 115: Hoare triple {92291#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); {92291#false} is VALID [2022-04-15 11:40:24,511 INFO L290 TraceCheckUtils]: 116: Hoare triple {92291#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {92291#false} is VALID [2022-04-15 11:40:24,511 INFO L290 TraceCheckUtils]: 117: Hoare triple {92291#false} ~skip~0 := 0; {92291#false} is VALID [2022-04-15 11:40:24,511 INFO L290 TraceCheckUtils]: 118: Hoare triple {92291#false} assume !false; {92291#false} is VALID [2022-04-15 11:40:24,511 INFO L290 TraceCheckUtils]: 119: Hoare triple {92291#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); {92291#false} is VALID [2022-04-15 11:40:24,511 INFO L290 TraceCheckUtils]: 120: Hoare triple {92291#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-15 11:40:24,512 INFO L290 TraceCheckUtils]: 121: Hoare triple {92291#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-15 11:40:24,512 INFO L290 TraceCheckUtils]: 122: Hoare triple {92291#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-15 11:40:24,512 INFO L290 TraceCheckUtils]: 123: Hoare triple {92291#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-15 11:40:24,512 INFO L290 TraceCheckUtils]: 124: Hoare triple {92291#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-15 11:40:24,512 INFO L290 TraceCheckUtils]: 125: Hoare triple {92291#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-15 11:40:24,512 INFO L290 TraceCheckUtils]: 126: Hoare triple {92291#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-15 11:40:24,512 INFO L290 TraceCheckUtils]: 127: Hoare triple {92291#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-15 11:40:24,512 INFO L290 TraceCheckUtils]: 128: Hoare triple {92291#false} assume 4385 == #t~mem57;havoc #t~mem57; {92291#false} is VALID [2022-04-15 11:40:24,512 INFO L290 TraceCheckUtils]: 129: Hoare triple {92291#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {92291#false} is VALID [2022-04-15 11:40:24,512 INFO L290 TraceCheckUtils]: 130: Hoare triple {92291#false} assume !(1 == ~blastFlag~0); {92291#false} is VALID [2022-04-15 11:40:24,512 INFO L290 TraceCheckUtils]: 131: Hoare triple {92291#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {92291#false} is VALID [2022-04-15 11:40:24,512 INFO L290 TraceCheckUtils]: 132: Hoare triple {92291#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {92291#false} is VALID [2022-04-15 11:40:24,512 INFO L290 TraceCheckUtils]: 133: Hoare triple {92291#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-15 11:40:24,512 INFO L290 TraceCheckUtils]: 134: Hoare triple {92291#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {92291#false} is VALID [2022-04-15 11:40:24,512 INFO L290 TraceCheckUtils]: 135: Hoare triple {92291#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); {92291#false} is VALID [2022-04-15 11:40:24,513 INFO L290 TraceCheckUtils]: 136: Hoare triple {92291#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {92291#false} is VALID [2022-04-15 11:40:24,513 INFO L290 TraceCheckUtils]: 137: Hoare triple {92291#false} ~skip~0 := 0; {92291#false} is VALID [2022-04-15 11:40:24,513 INFO L290 TraceCheckUtils]: 138: Hoare triple {92291#false} assume !false; {92291#false} is VALID [2022-04-15 11:40:24,513 INFO L290 TraceCheckUtils]: 139: Hoare triple {92291#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); {92291#false} is VALID [2022-04-15 11:40:24,513 INFO L290 TraceCheckUtils]: 140: Hoare triple {92291#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-15 11:40:24,513 INFO L290 TraceCheckUtils]: 141: Hoare triple {92291#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-15 11:40:24,513 INFO L290 TraceCheckUtils]: 142: Hoare triple {92291#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-15 11:40:24,513 INFO L290 TraceCheckUtils]: 143: Hoare triple {92291#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-15 11:40:24,513 INFO L290 TraceCheckUtils]: 144: Hoare triple {92291#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-15 11:40:24,513 INFO L290 TraceCheckUtils]: 145: Hoare triple {92291#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-15 11:40:24,513 INFO L290 TraceCheckUtils]: 146: Hoare triple {92291#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-15 11:40:24,513 INFO L290 TraceCheckUtils]: 147: Hoare triple {92291#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-15 11:40:24,513 INFO L290 TraceCheckUtils]: 148: Hoare triple {92291#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-15 11:40:24,513 INFO L290 TraceCheckUtils]: 149: Hoare triple {92291#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-15 11:40:24,514 INFO L290 TraceCheckUtils]: 150: Hoare triple {92291#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-15 11:40:24,514 INFO L290 TraceCheckUtils]: 151: Hoare triple {92291#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-15 11:40:24,514 INFO L290 TraceCheckUtils]: 152: Hoare triple {92291#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-15 11:40:24,514 INFO L290 TraceCheckUtils]: 153: Hoare triple {92291#false} assume 4432 == #t~mem62;havoc #t~mem62; {92291#false} is VALID [2022-04-15 11:40:24,514 INFO L290 TraceCheckUtils]: 154: Hoare triple {92291#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {92291#false} is VALID [2022-04-15 11:40:24,514 INFO L290 TraceCheckUtils]: 155: Hoare triple {92291#false} assume 5 == ~blastFlag~0; {92291#false} is VALID [2022-04-15 11:40:24,514 INFO L290 TraceCheckUtils]: 156: Hoare triple {92291#false} assume !false; {92291#false} is VALID [2022-04-15 11:40:24,514 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-15 11:40:24,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:40:24,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914655416] [2022-04-15 11:40:24,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914655416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:40:24,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:40:24,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:40:24,515 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:40:24,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1196859692] [2022-04-15 11:40:24,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1196859692] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:40:24,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:40:24,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:40:24,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871043310] [2022-04-15 11:40:24,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:40:24,516 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 157 [2022-04-15 11:40:24,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:40:24,516 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-15 11:40:24,587 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-15 11:40:24,587 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:40:24,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:24,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:40:24,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:40:24,587 INFO L87 Difference]: Start difference. First operand 871 states and 1239 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-15 11:40:26,605 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:40:27,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:27,667 INFO L93 Difference]: Finished difference Result 2085 states and 2976 transitions. [2022-04-15 11:40:27,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:40:27,667 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 157 [2022-04-15 11:40:27,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:40:27,667 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-15 11:40:27,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-15 11:40:27,669 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-15 11:40:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-15 11:40:27,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-15 11:40:27,951 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-15 11:40:28,015 INFO L225 Difference]: With dead ends: 2085 [2022-04-15 11:40:28,015 INFO L226 Difference]: Without dead ends: 1230 [2022-04-15 11:40:28,016 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:40:28,017 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 107 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:40:28,017 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:40:28,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2022-04-15 11:40:28,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 886. [2022-04-15 11:40:28,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:40:28,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1230 states. Second operand has 886 states, 881 states have (on average 1.4301929625425653) internal successors, (1260), 881 states have internal predecessors, (1260), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:28,065 INFO L74 IsIncluded]: Start isIncluded. First operand 1230 states. Second operand has 886 states, 881 states have (on average 1.4301929625425653) internal successors, (1260), 881 states have internal predecessors, (1260), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:28,065 INFO L87 Difference]: Start difference. First operand 1230 states. Second operand has 886 states, 881 states have (on average 1.4301929625425653) internal successors, (1260), 881 states have internal predecessors, (1260), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:28,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:28,102 INFO L93 Difference]: Finished difference Result 1230 states and 1752 transitions. [2022-04-15 11:40:28,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1752 transitions. [2022-04-15 11:40:28,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:28,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:28,103 INFO L74 IsIncluded]: Start isIncluded. First operand has 886 states, 881 states have (on average 1.4301929625425653) internal successors, (1260), 881 states have internal predecessors, (1260), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1230 states. [2022-04-15 11:40:28,104 INFO L87 Difference]: Start difference. First operand has 886 states, 881 states have (on average 1.4301929625425653) internal successors, (1260), 881 states have internal predecessors, (1260), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1230 states. [2022-04-15 11:40:28,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:28,141 INFO L93 Difference]: Finished difference Result 1230 states and 1752 transitions. [2022-04-15 11:40:28,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1752 transitions. [2022-04-15 11:40:28,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:28,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:28,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:40:28,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:40:28,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 881 states have (on average 1.4301929625425653) internal successors, (1260), 881 states have internal predecessors, (1260), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:28,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1264 transitions. [2022-04-15 11:40:28,173 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1264 transitions. Word has length 157 [2022-04-15 11:40:28,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:40:28,173 INFO L478 AbstractCegarLoop]: Abstraction has 886 states and 1264 transitions. [2022-04-15 11:40:28,173 INFO L479 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-15 11:40:28,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 886 states and 1264 transitions. [2022-04-15 11:40:29,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1264 edges. 1264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:40:29,283 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1264 transitions. [2022-04-15 11:40:29,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-04-15 11:40:29,284 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:40:29,284 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:40:29,285 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 11:40:29,285 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:40:29,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:40:29,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1137385555, now seen corresponding path program 1 times [2022-04-15 11:40:29,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:29,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [253099713] [2022-04-15 11:40:42,817 WARN L232 SmtUtils]: Spent 9.07s 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-15 11:40:51,165 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:40:51,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1137385555, now seen corresponding path program 2 times [2022-04-15 11:40:51,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:40:51,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436792337] [2022-04-15 11:40:51,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:40:51,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:40:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:51,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:40:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:51,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {100714#(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); {100704#true} is VALID [2022-04-15 11:40:51,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {100704#true} assume true; {100704#true} is VALID [2022-04-15 11:40:51,350 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {100704#true} {100704#true} #593#return; {100704#true} is VALID [2022-04-15 11:40:51,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {100704#true} call ULTIMATE.init(); {100714#(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-15 11:40:51,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {100714#(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); {100704#true} is VALID [2022-04-15 11:40:51,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {100704#true} assume true; {100704#true} is VALID [2022-04-15 11:40:51,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100704#true} {100704#true} #593#return; {100704#true} is VALID [2022-04-15 11:40:51,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {100704#true} call #t~ret158 := main(); {100704#true} is VALID [2022-04-15 11:40:51,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {100704#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; {100704#true} is VALID [2022-04-15 11:40:51,351 INFO L272 TraceCheckUtils]: 6: Hoare triple {100704#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {100704#true} is VALID [2022-04-15 11:40:51,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:40:51,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {100704#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; {100704#true} is VALID [2022-04-15 11:40:51,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {100704#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; {100704#true} is VALID [2022-04-15 11:40:51,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {100704#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {100704#true} is VALID [2022-04-15 11:40:51,351 INFO L290 TraceCheckUtils]: 11: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-15 11:40:51,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:40:51,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {100704#true} assume 12292 == #t~mem49;havoc #t~mem49; {100704#true} is VALID [2022-04-15 11:40:51,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {100704#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; {100704#true} is VALID [2022-04-15 11:40:51,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {100704#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {100704#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {100704#true} is VALID [2022-04-15 11:40:51,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {100704#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:40:51,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {100704#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {100704#true} is VALID [2022-04-15 11:40:51,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {100704#true} assume !(0 == ~tmp___4~0); {100704#true} is VALID [2022-04-15 11:40:51,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:40:51,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:40:51,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-15 11:40:51,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-15 11:40:51,352 INFO L290 TraceCheckUtils]: 25: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-15 11:40:51,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:40:51,353 INFO L290 TraceCheckUtils]: 27: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,353 INFO L290 TraceCheckUtils]: 28: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {100704#true} assume 4368 == #t~mem54;havoc #t~mem54; {100704#true} is VALID [2022-04-15 11:40:51,353 INFO L290 TraceCheckUtils]: 33: Hoare triple {100704#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; {100704#true} is VALID [2022-04-15 11:40:51,353 INFO L290 TraceCheckUtils]: 34: Hoare triple {100704#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {100704#true} is VALID [2022-04-15 11:40:51,353 INFO L290 TraceCheckUtils]: 35: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:40:51,353 INFO L290 TraceCheckUtils]: 36: Hoare triple {100704#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; {100704#true} is VALID [2022-04-15 11:40:51,353 INFO L290 TraceCheckUtils]: 37: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:40:51,353 INFO L290 TraceCheckUtils]: 38: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-15 11:40:51,353 INFO L290 TraceCheckUtils]: 39: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-15 11:40:51,353 INFO L290 TraceCheckUtils]: 40: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-15 11:40:51,354 INFO L290 TraceCheckUtils]: 41: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:40:51,354 INFO L290 TraceCheckUtils]: 42: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,354 INFO L290 TraceCheckUtils]: 43: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,354 INFO L290 TraceCheckUtils]: 44: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,354 INFO L290 TraceCheckUtils]: 45: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,354 INFO L290 TraceCheckUtils]: 46: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,354 INFO L290 TraceCheckUtils]: 47: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,354 INFO L290 TraceCheckUtils]: 48: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,354 INFO L290 TraceCheckUtils]: 49: Hoare triple {100704#true} assume 4384 == #t~mem56;havoc #t~mem56; {100704#true} is VALID [2022-04-15 11:40:51,354 INFO L290 TraceCheckUtils]: 50: Hoare triple {100704#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {100704#true} is VALID [2022-04-15 11:40:51,354 INFO L290 TraceCheckUtils]: 51: Hoare triple {100704#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {100704#true} is VALID [2022-04-15 11:40:51,354 INFO L290 TraceCheckUtils]: 52: Hoare triple {100704#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,354 INFO L290 TraceCheckUtils]: 53: Hoare triple {100704#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,354 INFO L290 TraceCheckUtils]: 54: Hoare triple {100704#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,354 INFO L290 TraceCheckUtils]: 55: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:40:51,355 INFO L290 TraceCheckUtils]: 56: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-15 11:40:51,355 INFO L290 TraceCheckUtils]: 57: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-15 11:40:51,355 INFO L290 TraceCheckUtils]: 58: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-15 11:40:51,355 INFO L290 TraceCheckUtils]: 59: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:40:51,355 INFO L290 TraceCheckUtils]: 60: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,355 INFO L290 TraceCheckUtils]: 61: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,355 INFO L290 TraceCheckUtils]: 62: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,355 INFO L290 TraceCheckUtils]: 63: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,355 INFO L290 TraceCheckUtils]: 64: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,355 INFO L290 TraceCheckUtils]: 65: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,355 INFO L290 TraceCheckUtils]: 66: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,355 INFO L290 TraceCheckUtils]: 67: Hoare triple {100704#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,355 INFO L290 TraceCheckUtils]: 68: Hoare triple {100704#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,355 INFO L290 TraceCheckUtils]: 69: Hoare triple {100704#true} assume 4400 == #t~mem58;havoc #t~mem58; {100704#true} is VALID [2022-04-15 11:40:51,355 INFO L290 TraceCheckUtils]: 70: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:40:51,356 INFO L290 TraceCheckUtils]: 71: Hoare triple {100704#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; {100704#true} is VALID [2022-04-15 11:40:51,356 INFO L290 TraceCheckUtils]: 72: Hoare triple {100704#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {100704#true} is VALID [2022-04-15 11:40:51,356 INFO L290 TraceCheckUtils]: 73: Hoare triple {100704#true} assume !(~ret~0 <= 0); {100704#true} is VALID [2022-04-15 11:40:51,356 INFO L290 TraceCheckUtils]: 74: Hoare triple {100704#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,356 INFO L290 TraceCheckUtils]: 75: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:40:51,356 INFO L290 TraceCheckUtils]: 76: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-15 11:40:51,356 INFO L290 TraceCheckUtils]: 77: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-15 11:40:51,356 INFO L290 TraceCheckUtils]: 78: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-15 11:40:51,356 INFO L290 TraceCheckUtils]: 79: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:40:51,374 INFO L290 TraceCheckUtils]: 80: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,374 INFO L290 TraceCheckUtils]: 81: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,374 INFO L290 TraceCheckUtils]: 82: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,374 INFO L290 TraceCheckUtils]: 83: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,374 INFO L290 TraceCheckUtils]: 84: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,374 INFO L290 TraceCheckUtils]: 85: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,374 INFO L290 TraceCheckUtils]: 86: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,374 INFO L290 TraceCheckUtils]: 87: Hoare triple {100704#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,374 INFO L290 TraceCheckUtils]: 88: Hoare triple {100704#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,374 INFO L290 TraceCheckUtils]: 89: Hoare triple {100704#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,374 INFO L290 TraceCheckUtils]: 90: Hoare triple {100704#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,374 INFO L290 TraceCheckUtils]: 91: Hoare triple {100704#true} assume 4416 == #t~mem60;havoc #t~mem60; {100704#true} is VALID [2022-04-15 11:40:51,374 INFO L290 TraceCheckUtils]: 92: Hoare triple {100704#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {100704#true} is VALID [2022-04-15 11:40:51,375 INFO L290 TraceCheckUtils]: 93: Hoare triple {100704#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {100704#true} is VALID [2022-04-15 11:40:51,375 INFO L290 TraceCheckUtils]: 94: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:40:51,375 INFO L290 TraceCheckUtils]: 95: Hoare triple {100704#true} assume !(0 == ~tmp___6~0); {100704#true} is VALID [2022-04-15 11:40:51,375 INFO L290 TraceCheckUtils]: 96: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:40:51,375 INFO L290 TraceCheckUtils]: 97: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-15 11:40:51,375 INFO L290 TraceCheckUtils]: 98: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-15 11:40:51,375 INFO L290 TraceCheckUtils]: 99: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-15 11:40:51,375 INFO L290 TraceCheckUtils]: 100: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:40:51,375 INFO L290 TraceCheckUtils]: 101: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,375 INFO L290 TraceCheckUtils]: 102: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,375 INFO L290 TraceCheckUtils]: 103: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,375 INFO L290 TraceCheckUtils]: 104: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,375 INFO L290 TraceCheckUtils]: 105: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,375 INFO L290 TraceCheckUtils]: 106: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,376 INFO L290 TraceCheckUtils]: 107: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,376 INFO L290 TraceCheckUtils]: 108: Hoare triple {100704#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,377 INFO L290 TraceCheckUtils]: 109: Hoare triple {100704#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {100709#(= |ssl3_connect_#t~mem58| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:51,378 INFO L290 TraceCheckUtils]: 110: Hoare triple {100709#(= |ssl3_connect_#t~mem58| (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); {100710#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:51,378 INFO L290 TraceCheckUtils]: 111: Hoare triple {100710#(not (= 4400 (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); {100710#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:51,378 INFO L290 TraceCheckUtils]: 112: Hoare triple {100710#(not (= 4400 (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); {100710#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:51,379 INFO L290 TraceCheckUtils]: 113: Hoare triple {100710#(not (= 4400 (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); {100711#(not (= |ssl3_connect_#t~mem62| 4400))} is VALID [2022-04-15 11:40:51,379 INFO L290 TraceCheckUtils]: 114: Hoare triple {100711#(not (= |ssl3_connect_#t~mem62| 4400))} assume 4432 == #t~mem62;havoc #t~mem62; {100704#true} is VALID [2022-04-15 11:40:51,379 INFO L290 TraceCheckUtils]: 115: Hoare triple {100704#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {100704#true} is VALID [2022-04-15 11:40:51,379 INFO L290 TraceCheckUtils]: 116: Hoare triple {100704#true} assume !(5 == ~blastFlag~0); {100704#true} is VALID [2022-04-15 11:40:51,379 INFO L290 TraceCheckUtils]: 117: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:40:51,379 INFO L290 TraceCheckUtils]: 118: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:40:51,379 INFO L290 TraceCheckUtils]: 119: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-15 11:40:51,379 INFO L290 TraceCheckUtils]: 120: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-15 11:40:51,379 INFO L290 TraceCheckUtils]: 121: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-15 11:40:51,379 INFO L290 TraceCheckUtils]: 122: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:40:51,379 INFO L290 TraceCheckUtils]: 123: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,380 INFO L290 TraceCheckUtils]: 124: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,380 INFO L290 TraceCheckUtils]: 125: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,380 INFO L290 TraceCheckUtils]: 126: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,380 INFO L290 TraceCheckUtils]: 127: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,380 INFO L290 TraceCheckUtils]: 128: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,380 INFO L290 TraceCheckUtils]: 129: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,380 INFO L290 TraceCheckUtils]: 130: Hoare triple {100704#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,380 INFO L290 TraceCheckUtils]: 131: Hoare triple {100704#true} assume 4385 == #t~mem57;havoc #t~mem57; {100704#true} is VALID [2022-04-15 11:40:51,380 INFO L290 TraceCheckUtils]: 132: Hoare triple {100704#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {100704#true} is VALID [2022-04-15 11:40:51,380 INFO L290 TraceCheckUtils]: 133: Hoare triple {100704#true} assume !(1 == ~blastFlag~0); {100704#true} is VALID [2022-04-15 11:40:51,380 INFO L290 TraceCheckUtils]: 134: Hoare triple {100704#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {100704#true} is VALID [2022-04-15 11:40:51,380 INFO L290 TraceCheckUtils]: 135: Hoare triple {100704#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:40:51,381 INFO L290 TraceCheckUtils]: 136: Hoare triple {100704#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:51,381 INFO L290 TraceCheckUtils]: 137: Hoare triple {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:51,382 INFO L290 TraceCheckUtils]: 138: Hoare triple {100712#(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); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:51,382 INFO L290 TraceCheckUtils]: 139: Hoare triple {100712#(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; {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:51,382 INFO L290 TraceCheckUtils]: 140: Hoare triple {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:51,383 INFO L290 TraceCheckUtils]: 141: Hoare triple {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:51,383 INFO L290 TraceCheckUtils]: 142: Hoare triple {100712#(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); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:51,383 INFO L290 TraceCheckUtils]: 143: Hoare triple {100712#(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); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:51,383 INFO L290 TraceCheckUtils]: 144: Hoare triple {100712#(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); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:51,384 INFO L290 TraceCheckUtils]: 145: Hoare triple {100712#(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); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:51,384 INFO L290 TraceCheckUtils]: 146: Hoare triple {100712#(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); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:51,384 INFO L290 TraceCheckUtils]: 147: Hoare triple {100712#(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); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:51,384 INFO L290 TraceCheckUtils]: 148: Hoare triple {100712#(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); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:51,385 INFO L290 TraceCheckUtils]: 149: Hoare triple {100712#(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); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:51,385 INFO L290 TraceCheckUtils]: 150: Hoare triple {100712#(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); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:51,385 INFO L290 TraceCheckUtils]: 151: Hoare triple {100712#(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); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:51,385 INFO L290 TraceCheckUtils]: 152: Hoare triple {100712#(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); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:51,386 INFO L290 TraceCheckUtils]: 153: Hoare triple {100712#(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); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:51,386 INFO L290 TraceCheckUtils]: 154: Hoare triple {100712#(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); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:51,386 INFO L290 TraceCheckUtils]: 155: Hoare triple {100712#(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); {100713#(not (= |ssl3_connect_#t~mem62| 4432))} is VALID [2022-04-15 11:40:51,386 INFO L290 TraceCheckUtils]: 156: Hoare triple {100713#(not (= |ssl3_connect_#t~mem62| 4432))} assume 4432 == #t~mem62;havoc #t~mem62; {100705#false} is VALID [2022-04-15 11:40:51,387 INFO L290 TraceCheckUtils]: 157: Hoare triple {100705#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {100705#false} is VALID [2022-04-15 11:40:51,387 INFO L290 TraceCheckUtils]: 158: Hoare triple {100705#false} assume 5 == ~blastFlag~0; {100705#false} is VALID [2022-04-15 11:40:51,387 INFO L290 TraceCheckUtils]: 159: Hoare triple {100705#false} assume !false; {100705#false} is VALID [2022-04-15 11:40:51,387 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 94 proven. 5 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2022-04-15 11:40:51,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:40:51,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436792337] [2022-04-15 11:40:51,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436792337] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:40:51,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635430904] [2022-04-15 11:40:51,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:40:51,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:40:51,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:40:51,389 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-15 11:40:51,401 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-15 11:42:19,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:42:19,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:42:19,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 1465 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 11:42:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:19,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:42:19,619 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-15 11:42:19,619 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-15 11:42:19,622 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-15 11:42:19,627 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-15 11:42:19,633 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-15 11:42:19,804 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-04-15 11:42:19,804 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-15 11:42:19,814 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-15 11:42:19,826 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-15 11:42:19,867 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-15 11:42:19,867 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-15 11:42:20,074 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 0 case distinctions, treesize of input 13 treesize of output 9 [2022-04-15 11:42:20,103 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-15 11:42:20,103 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-15 11:42:20,187 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-15 11:42:20,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {100704#true} call ULTIMATE.init(); {100704#true} is VALID [2022-04-15 11:42:20,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {100704#true} assume true; {100704#true} is VALID [2022-04-15 11:42:20,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100704#true} {100704#true} #593#return; {100704#true} is VALID [2022-04-15 11:42:20,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {100704#true} call #t~ret158 := main(); {100704#true} is VALID [2022-04-15 11:42:20,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {100704#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; {100704#true} is VALID [2022-04-15 11:42:20,207 INFO L272 TraceCheckUtils]: 6: Hoare triple {100704#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {100704#true} is VALID [2022-04-15 11:42:20,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {100704#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; {100704#true} is VALID [2022-04-15 11:42:20,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {100704#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; {100704#true} is VALID [2022-04-15 11:42:20,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {100704#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {100704#true} is VALID [2022-04-15 11:42:20,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-15 11:42:20,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {100704#true} assume 12292 == #t~mem49;havoc #t~mem49; {100704#true} is VALID [2022-04-15 11:42:20,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {100704#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; {100704#true} is VALID [2022-04-15 11:42:20,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {100704#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {100704#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {100704#true} is VALID [2022-04-15 11:42:20,208 INFO L290 TraceCheckUtils]: 17: Hoare triple {100704#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {100704#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {100704#true} is VALID [2022-04-15 11:42:20,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {100704#true} assume !(0 == ~tmp___4~0); {100704#true} is VALID [2022-04-15 11:42:20,209 INFO L290 TraceCheckUtils]: 21: Hoare triple {100704#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); {100781#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:42:20,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {100781#(= 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); {100781#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:42:20,210 INFO L290 TraceCheckUtils]: 23: Hoare triple {100781#(= 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; {100781#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:42:20,210 INFO L290 TraceCheckUtils]: 24: Hoare triple {100781#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} ~skip~0 := 0; {100781#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:42:20,211 INFO L290 TraceCheckUtils]: 25: Hoare triple {100781#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !false; {100781#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:42:20,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {100781#(= 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); {100781#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:42:20,211 INFO L290 TraceCheckUtils]: 27: Hoare triple {100781#(= 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); {100781#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:42:20,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {100781#(= 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); {100781#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:42:20,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {100781#(= 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); {100781#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:42:20,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {100781#(= 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); {100781#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:42:20,212 INFO L290 TraceCheckUtils]: 31: Hoare triple {100781#(= 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); {100704#true} is VALID [2022-04-15 11:42:20,212 INFO L290 TraceCheckUtils]: 32: Hoare triple {100704#true} assume 4368 == #t~mem54;havoc #t~mem54; {100704#true} is VALID [2022-04-15 11:42:20,212 INFO L290 TraceCheckUtils]: 33: Hoare triple {100704#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; {100704#true} is VALID [2022-04-15 11:42:20,213 INFO L290 TraceCheckUtils]: 34: Hoare triple {100704#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {100704#true} is VALID [2022-04-15 11:42:20,213 INFO L290 TraceCheckUtils]: 35: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,213 INFO L290 TraceCheckUtils]: 36: Hoare triple {100704#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; {100704#true} is VALID [2022-04-15 11:42:20,213 INFO L290 TraceCheckUtils]: 37: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,213 INFO L290 TraceCheckUtils]: 38: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-15 11:42:20,213 INFO L290 TraceCheckUtils]: 39: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-15 11:42:20,213 INFO L290 TraceCheckUtils]: 40: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-15 11:42:20,213 INFO L290 TraceCheckUtils]: 41: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,213 INFO L290 TraceCheckUtils]: 42: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,213 INFO L290 TraceCheckUtils]: 43: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,213 INFO L290 TraceCheckUtils]: 44: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,213 INFO L290 TraceCheckUtils]: 45: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,213 INFO L290 TraceCheckUtils]: 46: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,213 INFO L290 TraceCheckUtils]: 47: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,213 INFO L290 TraceCheckUtils]: 48: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,214 INFO L290 TraceCheckUtils]: 49: Hoare triple {100704#true} assume 4384 == #t~mem56;havoc #t~mem56; {100704#true} is VALID [2022-04-15 11:42:20,214 INFO L290 TraceCheckUtils]: 50: Hoare triple {100704#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {100704#true} is VALID [2022-04-15 11:42:20,214 INFO L290 TraceCheckUtils]: 51: Hoare triple {100704#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {100704#true} is VALID [2022-04-15 11:42:20,214 INFO L290 TraceCheckUtils]: 52: Hoare triple {100704#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,214 INFO L290 TraceCheckUtils]: 53: Hoare triple {100704#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,214 INFO L290 TraceCheckUtils]: 54: Hoare triple {100704#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,214 INFO L290 TraceCheckUtils]: 55: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,214 INFO L290 TraceCheckUtils]: 56: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-15 11:42:20,214 INFO L290 TraceCheckUtils]: 57: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-15 11:42:20,214 INFO L290 TraceCheckUtils]: 58: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-15 11:42:20,216 INFO L290 TraceCheckUtils]: 59: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,216 INFO L290 TraceCheckUtils]: 60: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,216 INFO L290 TraceCheckUtils]: 61: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,216 INFO L290 TraceCheckUtils]: 62: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,216 INFO L290 TraceCheckUtils]: 63: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,216 INFO L290 TraceCheckUtils]: 64: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,216 INFO L290 TraceCheckUtils]: 65: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,216 INFO L290 TraceCheckUtils]: 66: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,216 INFO L290 TraceCheckUtils]: 67: Hoare triple {100704#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,216 INFO L290 TraceCheckUtils]: 68: Hoare triple {100704#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,216 INFO L290 TraceCheckUtils]: 69: Hoare triple {100704#true} assume 4400 == #t~mem58;havoc #t~mem58; {100704#true} is VALID [2022-04-15 11:42:20,217 INFO L290 TraceCheckUtils]: 70: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,217 INFO L290 TraceCheckUtils]: 71: Hoare triple {100704#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; {100704#true} is VALID [2022-04-15 11:42:20,217 INFO L290 TraceCheckUtils]: 72: Hoare triple {100704#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {100704#true} is VALID [2022-04-15 11:42:20,217 INFO L290 TraceCheckUtils]: 73: Hoare triple {100704#true} assume !(~ret~0 <= 0); {100704#true} is VALID [2022-04-15 11:42:20,217 INFO L290 TraceCheckUtils]: 74: Hoare triple {100704#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,217 INFO L290 TraceCheckUtils]: 75: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,217 INFO L290 TraceCheckUtils]: 76: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-15 11:42:20,217 INFO L290 TraceCheckUtils]: 77: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-15 11:42:20,217 INFO L290 TraceCheckUtils]: 78: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-15 11:42:20,217 INFO L290 TraceCheckUtils]: 79: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,217 INFO L290 TraceCheckUtils]: 80: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,217 INFO L290 TraceCheckUtils]: 81: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,217 INFO L290 TraceCheckUtils]: 82: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,218 INFO L290 TraceCheckUtils]: 83: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,218 INFO L290 TraceCheckUtils]: 84: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,234 INFO L290 TraceCheckUtils]: 85: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,234 INFO L290 TraceCheckUtils]: 86: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,234 INFO L290 TraceCheckUtils]: 87: Hoare triple {100704#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,234 INFO L290 TraceCheckUtils]: 88: Hoare triple {100704#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,234 INFO L290 TraceCheckUtils]: 89: Hoare triple {100704#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,234 INFO L290 TraceCheckUtils]: 90: Hoare triple {100704#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,234 INFO L290 TraceCheckUtils]: 91: Hoare triple {100704#true} assume 4416 == #t~mem60;havoc #t~mem60; {100704#true} is VALID [2022-04-15 11:42:20,234 INFO L290 TraceCheckUtils]: 92: Hoare triple {100704#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {100704#true} is VALID [2022-04-15 11:42:20,234 INFO L290 TraceCheckUtils]: 93: Hoare triple {100704#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {100704#true} is VALID [2022-04-15 11:42:20,234 INFO L290 TraceCheckUtils]: 94: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,235 INFO L290 TraceCheckUtils]: 95: Hoare triple {100704#true} assume !(0 == ~tmp___6~0); {100704#true} is VALID [2022-04-15 11:42:20,236 INFO L290 TraceCheckUtils]: 96: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,236 INFO L290 TraceCheckUtils]: 97: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-15 11:42:20,236 INFO L290 TraceCheckUtils]: 98: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-15 11:42:20,236 INFO L290 TraceCheckUtils]: 99: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-15 11:42:20,236 INFO L290 TraceCheckUtils]: 100: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,237 INFO L290 TraceCheckUtils]: 101: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,237 INFO L290 TraceCheckUtils]: 102: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,237 INFO L290 TraceCheckUtils]: 103: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,237 INFO L290 TraceCheckUtils]: 104: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,237 INFO L290 TraceCheckUtils]: 105: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,237 INFO L290 TraceCheckUtils]: 106: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,237 INFO L290 TraceCheckUtils]: 107: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,237 INFO L290 TraceCheckUtils]: 108: Hoare triple {100704#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,237 INFO L290 TraceCheckUtils]: 109: Hoare triple {100704#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,237 INFO L290 TraceCheckUtils]: 110: Hoare triple {100704#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,237 INFO L290 TraceCheckUtils]: 111: Hoare triple {100704#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,237 INFO L290 TraceCheckUtils]: 112: Hoare triple {100704#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,237 INFO L290 TraceCheckUtils]: 113: Hoare triple {100704#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,237 INFO L290 TraceCheckUtils]: 114: Hoare triple {100704#true} assume 4432 == #t~mem62;havoc #t~mem62; {100704#true} is VALID [2022-04-15 11:42:20,238 INFO L290 TraceCheckUtils]: 115: Hoare triple {100704#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {100704#true} is VALID [2022-04-15 11:42:20,238 INFO L290 TraceCheckUtils]: 116: Hoare triple {100704#true} assume !(5 == ~blastFlag~0); {100704#true} is VALID [2022-04-15 11:42:20,238 INFO L290 TraceCheckUtils]: 117: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,238 INFO L290 TraceCheckUtils]: 118: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,238 INFO L290 TraceCheckUtils]: 119: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-15 11:42:20,238 INFO L290 TraceCheckUtils]: 120: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-15 11:42:20,238 INFO L290 TraceCheckUtils]: 121: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-15 11:42:20,238 INFO L290 TraceCheckUtils]: 122: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,238 INFO L290 TraceCheckUtils]: 123: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,238 INFO L290 TraceCheckUtils]: 124: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,238 INFO L290 TraceCheckUtils]: 125: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,238 INFO L290 TraceCheckUtils]: 126: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,238 INFO L290 TraceCheckUtils]: 127: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,238 INFO L290 TraceCheckUtils]: 128: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,238 INFO L290 TraceCheckUtils]: 129: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,239 INFO L290 TraceCheckUtils]: 130: Hoare triple {100704#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,239 INFO L290 TraceCheckUtils]: 131: Hoare triple {100704#true} assume 4385 == #t~mem57;havoc #t~mem57; {100704#true} is VALID [2022-04-15 11:42:20,239 INFO L290 TraceCheckUtils]: 132: Hoare triple {100704#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {100704#true} is VALID [2022-04-15 11:42:20,239 INFO L290 TraceCheckUtils]: 133: Hoare triple {100704#true} assume !(1 == ~blastFlag~0); {100704#true} is VALID [2022-04-15 11:42:20,239 INFO L290 TraceCheckUtils]: 134: Hoare triple {100704#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {100704#true} is VALID [2022-04-15 11:42:20,239 INFO L290 TraceCheckUtils]: 135: Hoare triple {100704#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,240 INFO L290 TraceCheckUtils]: 136: Hoare triple {100704#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-15 11:42:20,241 INFO L290 TraceCheckUtils]: 137: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-15 11:42:20,241 INFO L290 TraceCheckUtils]: 138: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} 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); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-15 11:42:20,241 INFO L290 TraceCheckUtils]: 139: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-15 11:42:20,241 INFO L290 TraceCheckUtils]: 140: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} ~skip~0 := 0; {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-15 11:42:20,242 INFO L290 TraceCheckUtils]: 141: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !false; {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-15 11:42:20,242 INFO L290 TraceCheckUtils]: 142: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} 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); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-15 11:42:20,242 INFO L290 TraceCheckUtils]: 143: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-15 11:42:20,242 INFO L290 TraceCheckUtils]: 144: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-15 11:42:20,243 INFO L290 TraceCheckUtils]: 145: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-15 11:42:20,243 INFO L290 TraceCheckUtils]: 146: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-15 11:42:20,243 INFO L290 TraceCheckUtils]: 147: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-15 11:42:20,243 INFO L290 TraceCheckUtils]: 148: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-15 11:42:20,244 INFO L290 TraceCheckUtils]: 149: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-15 11:42:20,244 INFO L290 TraceCheckUtils]: 150: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-15 11:42:20,244 INFO L290 TraceCheckUtils]: 151: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-15 11:42:20,244 INFO L290 TraceCheckUtils]: 152: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-15 11:42:20,245 INFO L290 TraceCheckUtils]: 153: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-15 11:42:20,245 INFO L290 TraceCheckUtils]: 154: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-15 11:42:20,245 INFO L290 TraceCheckUtils]: 155: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {101185#(<= |ssl3_connect_#t~mem62| 4400)} is VALID [2022-04-15 11:42:20,245 INFO L290 TraceCheckUtils]: 156: Hoare triple {101185#(<= |ssl3_connect_#t~mem62| 4400)} assume 4432 == #t~mem62;havoc #t~mem62; {100705#false} is VALID [2022-04-15 11:42:20,245 INFO L290 TraceCheckUtils]: 157: Hoare triple {100705#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {100705#false} is VALID [2022-04-15 11:42:20,245 INFO L290 TraceCheckUtils]: 158: Hoare triple {100705#false} assume 5 == ~blastFlag~0; {100705#false} is VALID [2022-04-15 11:42:20,246 INFO L290 TraceCheckUtils]: 159: Hoare triple {100705#false} assume !false; {100705#false} is VALID [2022-04-15 11:42:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 88 proven. 60 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-04-15 11:42:20,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:42:20,532 INFO L290 TraceCheckUtils]: 159: Hoare triple {100705#false} assume !false; {100705#false} is VALID [2022-04-15 11:42:20,532 INFO L290 TraceCheckUtils]: 158: Hoare triple {100705#false} assume 5 == ~blastFlag~0; {100705#false} is VALID [2022-04-15 11:42:20,532 INFO L290 TraceCheckUtils]: 157: Hoare triple {100705#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {100705#false} is VALID [2022-04-15 11:42:20,532 INFO L290 TraceCheckUtils]: 156: Hoare triple {101207#(not (<= 4432 |ssl3_connect_#t~mem62|))} assume 4432 == #t~mem62;havoc #t~mem62; {100705#false} is VALID [2022-04-15 11:42:20,533 INFO L290 TraceCheckUtils]: 155: Hoare triple {101211#(< (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); {101207#(not (<= 4432 |ssl3_connect_#t~mem62|))} is VALID [2022-04-15 11:42:20,533 INFO L290 TraceCheckUtils]: 154: Hoare triple {101211#(< (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); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:42:20,534 INFO L290 TraceCheckUtils]: 153: Hoare triple {101211#(< (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); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:42:20,534 INFO L290 TraceCheckUtils]: 152: Hoare triple {101211#(< (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); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:42:20,534 INFO L290 TraceCheckUtils]: 151: Hoare triple {101211#(< (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); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:42:20,535 INFO L290 TraceCheckUtils]: 150: Hoare triple {101211#(< (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); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:42:20,535 INFO L290 TraceCheckUtils]: 149: Hoare triple {101211#(< (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); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:42:20,535 INFO L290 TraceCheckUtils]: 148: Hoare triple {101211#(< (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); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:42:20,535 INFO L290 TraceCheckUtils]: 147: Hoare triple {101211#(< (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); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:42:20,536 INFO L290 TraceCheckUtils]: 146: Hoare triple {101211#(< (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); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:42:20,536 INFO L290 TraceCheckUtils]: 145: Hoare triple {101211#(< (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); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:42:20,536 INFO L290 TraceCheckUtils]: 144: Hoare triple {101211#(< (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); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:42:20,537 INFO L290 TraceCheckUtils]: 143: Hoare triple {101211#(< (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); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:42:20,537 INFO L290 TraceCheckUtils]: 142: Hoare triple {101211#(< (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); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:42:20,537 INFO L290 TraceCheckUtils]: 141: Hoare triple {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !false; {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:42:20,538 INFO L290 TraceCheckUtils]: 140: Hoare triple {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} ~skip~0 := 0; {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:42:20,538 INFO L290 TraceCheckUtils]: 139: Hoare triple {101211#(< (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; {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:42:20,538 INFO L290 TraceCheckUtils]: 138: Hoare triple {101211#(< (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); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:42:20,539 INFO L290 TraceCheckUtils]: 137: Hoare triple {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:42:20,540 INFO L290 TraceCheckUtils]: 136: Hoare triple {100704#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:42:20,540 INFO L290 TraceCheckUtils]: 135: Hoare triple {100704#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,540 INFO L290 TraceCheckUtils]: 134: Hoare triple {100704#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {100704#true} is VALID [2022-04-15 11:42:20,540 INFO L290 TraceCheckUtils]: 133: Hoare triple {100704#true} assume !(1 == ~blastFlag~0); {100704#true} is VALID [2022-04-15 11:42:20,540 INFO L290 TraceCheckUtils]: 132: Hoare triple {100704#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {100704#true} is VALID [2022-04-15 11:42:20,540 INFO L290 TraceCheckUtils]: 131: Hoare triple {100704#true} assume 4385 == #t~mem57;havoc #t~mem57; {100704#true} is VALID [2022-04-15 11:42:20,540 INFO L290 TraceCheckUtils]: 130: Hoare triple {100704#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,540 INFO L290 TraceCheckUtils]: 129: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,540 INFO L290 TraceCheckUtils]: 128: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,541 INFO L290 TraceCheckUtils]: 127: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,541 INFO L290 TraceCheckUtils]: 126: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,541 INFO L290 TraceCheckUtils]: 125: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,541 INFO L290 TraceCheckUtils]: 124: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,541 INFO L290 TraceCheckUtils]: 123: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,541 INFO L290 TraceCheckUtils]: 122: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,541 INFO L290 TraceCheckUtils]: 121: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-15 11:42:20,541 INFO L290 TraceCheckUtils]: 120: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-15 11:42:20,541 INFO L290 TraceCheckUtils]: 119: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-15 11:42:20,541 INFO L290 TraceCheckUtils]: 118: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,541 INFO L290 TraceCheckUtils]: 117: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,541 INFO L290 TraceCheckUtils]: 116: Hoare triple {100704#true} assume !(5 == ~blastFlag~0); {100704#true} is VALID [2022-04-15 11:42:20,541 INFO L290 TraceCheckUtils]: 115: Hoare triple {100704#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {100704#true} is VALID [2022-04-15 11:42:20,541 INFO L290 TraceCheckUtils]: 114: Hoare triple {100704#true} assume 4432 == #t~mem62;havoc #t~mem62; {100704#true} is VALID [2022-04-15 11:42:20,541 INFO L290 TraceCheckUtils]: 113: Hoare triple {100704#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,542 INFO L290 TraceCheckUtils]: 112: Hoare triple {100704#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,542 INFO L290 TraceCheckUtils]: 111: Hoare triple {100704#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,542 INFO L290 TraceCheckUtils]: 110: Hoare triple {100704#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,542 INFO L290 TraceCheckUtils]: 109: Hoare triple {100704#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,542 INFO L290 TraceCheckUtils]: 108: Hoare triple {100704#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,542 INFO L290 TraceCheckUtils]: 107: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,542 INFO L290 TraceCheckUtils]: 106: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,542 INFO L290 TraceCheckUtils]: 105: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,542 INFO L290 TraceCheckUtils]: 104: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,542 INFO L290 TraceCheckUtils]: 103: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,542 INFO L290 TraceCheckUtils]: 102: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,542 INFO L290 TraceCheckUtils]: 101: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,542 INFO L290 TraceCheckUtils]: 100: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,542 INFO L290 TraceCheckUtils]: 99: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-15 11:42:20,543 INFO L290 TraceCheckUtils]: 98: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-15 11:42:20,543 INFO L290 TraceCheckUtils]: 97: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-15 11:42:20,543 INFO L290 TraceCheckUtils]: 96: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,543 INFO L290 TraceCheckUtils]: 95: Hoare triple {100704#true} assume !(0 == ~tmp___6~0); {100704#true} is VALID [2022-04-15 11:42:20,543 INFO L290 TraceCheckUtils]: 94: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,543 INFO L290 TraceCheckUtils]: 93: Hoare triple {100704#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {100704#true} is VALID [2022-04-15 11:42:20,543 INFO L290 TraceCheckUtils]: 92: Hoare triple {100704#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {100704#true} is VALID [2022-04-15 11:42:20,543 INFO L290 TraceCheckUtils]: 91: Hoare triple {100704#true} assume 4416 == #t~mem60;havoc #t~mem60; {100704#true} is VALID [2022-04-15 11:42:20,543 INFO L290 TraceCheckUtils]: 90: Hoare triple {100704#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,543 INFO L290 TraceCheckUtils]: 89: Hoare triple {100704#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,543 INFO L290 TraceCheckUtils]: 88: Hoare triple {100704#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,543 INFO L290 TraceCheckUtils]: 87: Hoare triple {100704#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,543 INFO L290 TraceCheckUtils]: 86: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,543 INFO L290 TraceCheckUtils]: 85: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,544 INFO L290 TraceCheckUtils]: 84: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,544 INFO L290 TraceCheckUtils]: 83: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,544 INFO L290 TraceCheckUtils]: 82: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,544 INFO L290 TraceCheckUtils]: 81: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,544 INFO L290 TraceCheckUtils]: 80: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,544 INFO L290 TraceCheckUtils]: 79: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,544 INFO L290 TraceCheckUtils]: 78: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-15 11:42:20,544 INFO L290 TraceCheckUtils]: 77: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-15 11:42:20,544 INFO L290 TraceCheckUtils]: 76: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-15 11:42:20,544 INFO L290 TraceCheckUtils]: 75: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,544 INFO L290 TraceCheckUtils]: 74: Hoare triple {100704#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,544 INFO L290 TraceCheckUtils]: 73: Hoare triple {100704#true} assume !(~ret~0 <= 0); {100704#true} is VALID [2022-04-15 11:42:20,544 INFO L290 TraceCheckUtils]: 72: Hoare triple {100704#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {100704#true} is VALID [2022-04-15 11:42:20,544 INFO L290 TraceCheckUtils]: 71: Hoare triple {100704#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; {100704#true} is VALID [2022-04-15 11:42:20,545 INFO L290 TraceCheckUtils]: 70: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,545 INFO L290 TraceCheckUtils]: 69: Hoare triple {100704#true} assume 4400 == #t~mem58;havoc #t~mem58; {100704#true} is VALID [2022-04-15 11:42:20,545 INFO L290 TraceCheckUtils]: 68: Hoare triple {100704#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,545 INFO L290 TraceCheckUtils]: 67: Hoare triple {100704#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,545 INFO L290 TraceCheckUtils]: 66: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,545 INFO L290 TraceCheckUtils]: 65: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,545 INFO L290 TraceCheckUtils]: 64: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,545 INFO L290 TraceCheckUtils]: 63: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,545 INFO L290 TraceCheckUtils]: 62: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,545 INFO L290 TraceCheckUtils]: 61: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,545 INFO L290 TraceCheckUtils]: 60: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,545 INFO L290 TraceCheckUtils]: 59: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,545 INFO L290 TraceCheckUtils]: 58: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-15 11:42:20,545 INFO L290 TraceCheckUtils]: 57: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-15 11:42:20,545 INFO L290 TraceCheckUtils]: 56: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-15 11:42:20,546 INFO L290 TraceCheckUtils]: 55: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,546 INFO L290 TraceCheckUtils]: 54: Hoare triple {100704#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,546 INFO L290 TraceCheckUtils]: 53: Hoare triple {100704#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,546 INFO L290 TraceCheckUtils]: 52: Hoare triple {100704#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,546 INFO L290 TraceCheckUtils]: 51: Hoare triple {100704#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {100704#true} is VALID [2022-04-15 11:42:20,546 INFO L290 TraceCheckUtils]: 50: Hoare triple {100704#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {100704#true} is VALID [2022-04-15 11:42:20,546 INFO L290 TraceCheckUtils]: 49: Hoare triple {100704#true} assume 4384 == #t~mem56;havoc #t~mem56; {100704#true} is VALID [2022-04-15 11:42:20,546 INFO L290 TraceCheckUtils]: 48: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,546 INFO L290 TraceCheckUtils]: 47: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,546 INFO L290 TraceCheckUtils]: 46: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,546 INFO L290 TraceCheckUtils]: 45: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,546 INFO L290 TraceCheckUtils]: 44: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,546 INFO L290 TraceCheckUtils]: 43: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,546 INFO L290 TraceCheckUtils]: 42: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,547 INFO L290 TraceCheckUtils]: 41: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,547 INFO L290 TraceCheckUtils]: 40: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-15 11:42:20,547 INFO L290 TraceCheckUtils]: 39: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-15 11:42:20,547 INFO L290 TraceCheckUtils]: 38: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-15 11:42:20,547 INFO L290 TraceCheckUtils]: 37: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,547 INFO L290 TraceCheckUtils]: 36: Hoare triple {100704#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; {100704#true} is VALID [2022-04-15 11:42:20,547 INFO L290 TraceCheckUtils]: 35: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,547 INFO L290 TraceCheckUtils]: 34: Hoare triple {100704#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {100704#true} is VALID [2022-04-15 11:42:20,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {100704#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; {100704#true} is VALID [2022-04-15 11:42:20,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {100704#true} assume 4368 == #t~mem54;havoc #t~mem54; {100704#true} is VALID [2022-04-15 11:42:20,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,547 INFO L290 TraceCheckUtils]: 29: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,547 INFO L290 TraceCheckUtils]: 28: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-15 11:42:20,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-15 11:42:20,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-15 11:42:20,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {100704#true} assume !(0 == ~tmp___4~0); {100704#true} is VALID [2022-04-15 11:42:20,548 INFO L290 TraceCheckUtils]: 19: Hoare triple {100704#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {100704#true} is VALID [2022-04-15 11:42:20,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,548 INFO L290 TraceCheckUtils]: 17: Hoare triple {100704#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {100704#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {100704#true} is VALID [2022-04-15 11:42:20,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {100704#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {100704#true} is VALID [2022-04-15 11:42:20,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {100704#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; {100704#true} is VALID [2022-04-15 11:42:20,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {100704#true} assume 12292 == #t~mem49;havoc #t~mem49; {100704#true} is VALID [2022-04-15 11:42:20,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-15 11:42:20,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {100704#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {100704#true} is VALID [2022-04-15 11:42:20,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {100704#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; {100704#true} is VALID [2022-04-15 11:42:20,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {100704#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; {100704#true} is VALID [2022-04-15 11:42:20,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,549 INFO L272 TraceCheckUtils]: 6: Hoare triple {100704#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {100704#true} is VALID [2022-04-15 11:42:20,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {100704#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; {100704#true} is VALID [2022-04-15 11:42:20,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {100704#true} call #t~ret158 := main(); {100704#true} is VALID [2022-04-15 11:42:20,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100704#true} {100704#true} #593#return; {100704#true} is VALID [2022-04-15 11:42:20,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {100704#true} assume true; {100704#true} is VALID [2022-04-15 11:42:20,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {100704#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); {100704#true} is VALID [2022-04-15 11:42:20,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {100704#true} call ULTIMATE.init(); {100704#true} is VALID [2022-04-15 11:42:20,550 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2022-04-15 11:42:20,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635430904] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 11:42:20,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:42:20,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8, 5] total 13 [2022-04-15 11:42:20,551 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:42:20,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [253099713] [2022-04-15 11:42:20,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [253099713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:20,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:20,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:42:20,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323606342] [2022-04-15 11:42:20,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:42:20,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 160 [2022-04-15 11:42:20,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:42:20,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-15 11:42:20,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:20,608 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:42:20,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:20,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:42:20,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-04-15 11:42:20,609 INFO L87 Difference]: Start difference. First operand 886 states and 1264 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-15 11:42:26,690 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:42:27,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:27,798 INFO L93 Difference]: Finished difference Result 2213 states and 3154 transitions. [2022-04-15 11:42:27,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:42:27,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 160 [2022-04-15 11:42:27,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:42:27,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-15 11:42:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2022-04-15 11:42:27,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-15 11:42:27,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2022-04-15 11:42:27,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 471 transitions. [2022-04-15 11:42:28,092 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-15 11:42:28,160 INFO L225 Difference]: With dead ends: 2213 [2022-04-15 11:42:28,160 INFO L226 Difference]: Without dead ends: 1343 [2022-04-15 11:42:28,161 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 319 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-15 11:42:28,161 INFO L913 BasicCegarLoop]: 113 mSDtfsCounter, 94 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:42:28,161 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 314 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 11:42:28,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2022-04-15 11:42:28,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1015. [2022-04-15 11:42:28,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:42:28,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1343 states. Second operand has 1015 states, 1010 states have (on average 1.4297029702970296) internal successors, (1444), 1010 states have internal predecessors, (1444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:28,496 INFO L74 IsIncluded]: Start isIncluded. First operand 1343 states. Second operand has 1015 states, 1010 states have (on average 1.4297029702970296) internal successors, (1444), 1010 states have internal predecessors, (1444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:28,497 INFO L87 Difference]: Start difference. First operand 1343 states. Second operand has 1015 states, 1010 states have (on average 1.4297029702970296) internal successors, (1444), 1010 states have internal predecessors, (1444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:28,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:28,540 INFO L93 Difference]: Finished difference Result 1343 states and 1905 transitions. [2022-04-15 11:42:28,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1905 transitions. [2022-04-15 11:42:28,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:28,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:28,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 1015 states, 1010 states have (on average 1.4297029702970296) internal successors, (1444), 1010 states have internal predecessors, (1444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1343 states. [2022-04-15 11:42:28,543 INFO L87 Difference]: Start difference. First operand has 1015 states, 1010 states have (on average 1.4297029702970296) internal successors, (1444), 1010 states have internal predecessors, (1444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1343 states. [2022-04-15 11:42:28,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:28,586 INFO L93 Difference]: Finished difference Result 1343 states and 1905 transitions. [2022-04-15 11:42:28,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1905 transitions. [2022-04-15 11:42:28,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:28,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:28,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:42:28,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:42:28,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1010 states have (on average 1.4297029702970296) internal successors, (1444), 1010 states have internal predecessors, (1444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:28,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1448 transitions. [2022-04-15 11:42:28,627 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1448 transitions. Word has length 160 [2022-04-15 11:42:28,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:42:28,627 INFO L478 AbstractCegarLoop]: Abstraction has 1015 states and 1448 transitions. [2022-04-15 11:42:28,627 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-15 11:42:28,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1015 states and 1448 transitions. [2022-04-15 11:42:29,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1448 edges. 1448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:29,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1448 transitions. [2022-04-15 11:42:29,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-04-15 11:42:29,974 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:42:29,974 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:42:30,018 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-15 11:42:30,174 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-15 11:42:30,174 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:42:30,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:42:30,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1271399061, now seen corresponding path program 1 times [2022-04-15 11:42:30,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:30,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [868004096] [2022-04-15 11:42:43,269 WARN L232 SmtUtils]: Spent 8.67s 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-15 11:42:50,090 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:42:50,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1271399061, now seen corresponding path program 2 times [2022-04-15 11:42:50,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:42:50,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446398230] [2022-04-15 11:42:50,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:42:50,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:42:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:50,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:42:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:50,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {110831#(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); {110823#true} is VALID [2022-04-15 11:42:50,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {110823#true} assume true; {110823#true} is VALID [2022-04-15 11:42:50,297 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {110823#true} {110823#true} #593#return; {110823#true} is VALID [2022-04-15 11:42:50,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {110823#true} call ULTIMATE.init(); {110831#(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-15 11:42:50,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {110831#(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); {110823#true} is VALID [2022-04-15 11:42:50,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {110823#true} assume true; {110823#true} is VALID [2022-04-15 11:42:50,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110823#true} {110823#true} #593#return; {110823#true} is VALID [2022-04-15 11:42:50,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {110823#true} call #t~ret158 := main(); {110823#true} is VALID [2022-04-15 11:42:50,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {110823#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; {110823#true} is VALID [2022-04-15 11:42:50,298 INFO L272 TraceCheckUtils]: 6: Hoare triple {110823#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {110823#true} is VALID [2022-04-15 11:42:50,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:42:50,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {110823#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; {110823#true} is VALID [2022-04-15 11:42:50,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {110823#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; {110823#true} is VALID [2022-04-15 11:42:50,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {110823#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {110823#true} is VALID [2022-04-15 11:42:50,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-15 11:42:50,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:42:50,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {110823#true} assume 12292 == #t~mem49;havoc #t~mem49; {110823#true} is VALID [2022-04-15 11:42:50,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {110823#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; {110823#true} is VALID [2022-04-15 11:42:50,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {110823#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:42:50,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {110823#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {110823#true} is VALID [2022-04-15 11:42:50,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {110823#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:42:50,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:42:50,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {110823#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {110823#true} is VALID [2022-04-15 11:42:50,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {110823#true} assume !(0 == ~tmp___4~0); {110823#true} is VALID [2022-04-15 11:42:50,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:42:50,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:42:50,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {110823#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110823#true} is VALID [2022-04-15 11:42:50,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {110823#true} ~skip~0 := 0; {110823#true} is VALID [2022-04-15 11:42:50,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-15 11:42:50,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:42:50,300 INFO L290 TraceCheckUtils]: 27: Hoare triple {110823#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:42:50,300 INFO L290 TraceCheckUtils]: 28: Hoare triple {110823#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:42:50,300 INFO L290 TraceCheckUtils]: 29: Hoare triple {110823#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:42:50,300 INFO L290 TraceCheckUtils]: 30: Hoare triple {110823#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:42:50,300 INFO L290 TraceCheckUtils]: 31: Hoare triple {110823#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:42:50,300 INFO L290 TraceCheckUtils]: 32: Hoare triple {110823#true} assume 4368 == #t~mem54;havoc #t~mem54; {110823#true} is VALID [2022-04-15 11:42:50,300 INFO L290 TraceCheckUtils]: 33: Hoare triple {110823#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; {110823#true} is VALID [2022-04-15 11:42:50,300 INFO L290 TraceCheckUtils]: 34: Hoare triple {110823#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {110823#true} is VALID [2022-04-15 11:42:50,300 INFO L290 TraceCheckUtils]: 35: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:42:50,300 INFO L290 TraceCheckUtils]: 36: Hoare triple {110823#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; {110823#true} is VALID [2022-04-15 11:42:50,300 INFO L290 TraceCheckUtils]: 37: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:42:50,300 INFO L290 TraceCheckUtils]: 38: Hoare triple {110823#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110823#true} is VALID [2022-04-15 11:42:50,300 INFO L290 TraceCheckUtils]: 39: Hoare triple {110823#true} ~skip~0 := 0; {110823#true} is VALID [2022-04-15 11:42:50,301 INFO L290 TraceCheckUtils]: 40: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-15 11:42:50,301 INFO L290 TraceCheckUtils]: 41: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:42:50,301 INFO L290 TraceCheckUtils]: 42: Hoare triple {110823#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:42:50,301 INFO L290 TraceCheckUtils]: 43: Hoare triple {110823#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:42:50,301 INFO L290 TraceCheckUtils]: 44: Hoare triple {110823#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:42:50,301 INFO L290 TraceCheckUtils]: 45: Hoare triple {110823#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:42:50,301 INFO L290 TraceCheckUtils]: 46: Hoare triple {110823#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:42:50,301 INFO L290 TraceCheckUtils]: 47: Hoare triple {110823#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:42:50,301 INFO L290 TraceCheckUtils]: 48: Hoare triple {110823#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:42:50,301 INFO L290 TraceCheckUtils]: 49: Hoare triple {110823#true} assume 4384 == #t~mem56;havoc #t~mem56; {110823#true} is VALID [2022-04-15 11:42:50,301 INFO L290 TraceCheckUtils]: 50: Hoare triple {110823#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {110823#true} is VALID [2022-04-15 11:42:50,301 INFO L290 TraceCheckUtils]: 51: Hoare triple {110823#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {110823#true} is VALID [2022-04-15 11:42:50,302 INFO L290 TraceCheckUtils]: 52: Hoare triple {110823#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {110828#(= |ssl3_connect_#t~mem93| (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:42:50,303 INFO L290 TraceCheckUtils]: 53: Hoare triple {110828#(= |ssl3_connect_#t~mem93| (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)))} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,303 INFO L290 TraceCheckUtils]: 54: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,304 INFO L290 TraceCheckUtils]: 55: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,304 INFO L290 TraceCheckUtils]: 56: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,304 INFO L290 TraceCheckUtils]: 57: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,305 INFO L290 TraceCheckUtils]: 58: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,305 INFO L290 TraceCheckUtils]: 59: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,305 INFO L290 TraceCheckUtils]: 60: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,306 INFO L290 TraceCheckUtils]: 61: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,306 INFO L290 TraceCheckUtils]: 62: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,306 INFO L290 TraceCheckUtils]: 63: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,307 INFO L290 TraceCheckUtils]: 64: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,307 INFO L290 TraceCheckUtils]: 65: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,307 INFO L290 TraceCheckUtils]: 66: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,308 INFO L290 TraceCheckUtils]: 67: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,308 INFO L290 TraceCheckUtils]: 68: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,308 INFO L290 TraceCheckUtils]: 69: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4400 == #t~mem58;havoc #t~mem58; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,309 INFO L290 TraceCheckUtils]: 70: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} 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); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,309 INFO L290 TraceCheckUtils]: 71: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} 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; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,309 INFO L290 TraceCheckUtils]: 72: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,310 INFO L290 TraceCheckUtils]: 73: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,311 INFO L290 TraceCheckUtils]: 74: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,311 INFO L290 TraceCheckUtils]: 75: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,311 INFO L290 TraceCheckUtils]: 76: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,312 INFO L290 TraceCheckUtils]: 77: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,312 INFO L290 TraceCheckUtils]: 78: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,312 INFO L290 TraceCheckUtils]: 79: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,313 INFO L290 TraceCheckUtils]: 80: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,313 INFO L290 TraceCheckUtils]: 81: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,313 INFO L290 TraceCheckUtils]: 82: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,314 INFO L290 TraceCheckUtils]: 83: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,314 INFO L290 TraceCheckUtils]: 84: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,314 INFO L290 TraceCheckUtils]: 85: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,315 INFO L290 TraceCheckUtils]: 86: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,315 INFO L290 TraceCheckUtils]: 87: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,315 INFO L290 TraceCheckUtils]: 88: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,316 INFO L290 TraceCheckUtils]: 89: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,316 INFO L290 TraceCheckUtils]: 90: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,316 INFO L290 TraceCheckUtils]: 91: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4416 == #t~mem60;havoc #t~mem60; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,317 INFO L290 TraceCheckUtils]: 92: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,317 INFO L290 TraceCheckUtils]: 93: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,318 INFO L290 TraceCheckUtils]: 94: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,318 INFO L290 TraceCheckUtils]: 95: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == ~tmp___6~0); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,319 INFO L290 TraceCheckUtils]: 96: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,319 INFO L290 TraceCheckUtils]: 97: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,319 INFO L290 TraceCheckUtils]: 98: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,319 INFO L290 TraceCheckUtils]: 99: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,320 INFO L290 TraceCheckUtils]: 100: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,320 INFO L290 TraceCheckUtils]: 101: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,320 INFO L290 TraceCheckUtils]: 102: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,321 INFO L290 TraceCheckUtils]: 103: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,321 INFO L290 TraceCheckUtils]: 104: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,321 INFO L290 TraceCheckUtils]: 105: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,322 INFO L290 TraceCheckUtils]: 106: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,322 INFO L290 TraceCheckUtils]: 107: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,322 INFO L290 TraceCheckUtils]: 108: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,323 INFO L290 TraceCheckUtils]: 109: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,323 INFO L290 TraceCheckUtils]: 110: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,323 INFO L290 TraceCheckUtils]: 111: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,324 INFO L290 TraceCheckUtils]: 112: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,324 INFO L290 TraceCheckUtils]: 113: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,324 INFO L290 TraceCheckUtils]: 114: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4432 == #t~mem62;havoc #t~mem62; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,324 INFO L290 TraceCheckUtils]: 115: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,325 INFO L290 TraceCheckUtils]: 116: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(5 == ~blastFlag~0); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,326 INFO L290 TraceCheckUtils]: 117: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,326 INFO L290 TraceCheckUtils]: 118: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,326 INFO L290 TraceCheckUtils]: 119: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,327 INFO L290 TraceCheckUtils]: 120: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,327 INFO L290 TraceCheckUtils]: 121: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,327 INFO L290 TraceCheckUtils]: 122: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,328 INFO L290 TraceCheckUtils]: 123: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,328 INFO L290 TraceCheckUtils]: 124: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,328 INFO L290 TraceCheckUtils]: 125: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,329 INFO L290 TraceCheckUtils]: 126: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,329 INFO L290 TraceCheckUtils]: 127: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,329 INFO L290 TraceCheckUtils]: 128: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,329 INFO L290 TraceCheckUtils]: 129: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,330 INFO L290 TraceCheckUtils]: 130: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,330 INFO L290 TraceCheckUtils]: 131: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4385 == #t~mem57;havoc #t~mem57; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,330 INFO L290 TraceCheckUtils]: 132: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,331 INFO L290 TraceCheckUtils]: 133: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(1 == ~blastFlag~0); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,331 INFO L290 TraceCheckUtils]: 134: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:42:50,331 INFO L290 TraceCheckUtils]: 135: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {110830#(= |ssl3_connect_#t~mem93| 0)} is VALID [2022-04-15 11:42:50,332 INFO L290 TraceCheckUtils]: 136: Hoare triple {110830#(= |ssl3_connect_#t~mem93| 0)} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {110824#false} is VALID [2022-04-15 11:42:50,332 INFO L290 TraceCheckUtils]: 137: Hoare triple {110824#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {110824#false} is VALID [2022-04-15 11:42:50,332 INFO L290 TraceCheckUtils]: 138: Hoare triple {110824#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); {110824#false} is VALID [2022-04-15 11:42:50,332 INFO L290 TraceCheckUtils]: 139: Hoare triple {110824#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110824#false} is VALID [2022-04-15 11:42:50,332 INFO L290 TraceCheckUtils]: 140: Hoare triple {110824#false} ~skip~0 := 0; {110824#false} is VALID [2022-04-15 11:42:50,332 INFO L290 TraceCheckUtils]: 141: Hoare triple {110824#false} assume !false; {110824#false} is VALID [2022-04-15 11:42:50,332 INFO L290 TraceCheckUtils]: 142: Hoare triple {110824#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); {110824#false} is VALID [2022-04-15 11:42:50,332 INFO L290 TraceCheckUtils]: 143: Hoare triple {110824#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110824#false} is VALID [2022-04-15 11:42:50,332 INFO L290 TraceCheckUtils]: 144: Hoare triple {110824#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110824#false} is VALID [2022-04-15 11:42:50,332 INFO L290 TraceCheckUtils]: 145: Hoare triple {110824#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110824#false} is VALID [2022-04-15 11:42:50,332 INFO L290 TraceCheckUtils]: 146: Hoare triple {110824#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110824#false} is VALID [2022-04-15 11:42:50,332 INFO L290 TraceCheckUtils]: 147: Hoare triple {110824#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110824#false} is VALID [2022-04-15 11:42:50,333 INFO L290 TraceCheckUtils]: 148: Hoare triple {110824#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110824#false} is VALID [2022-04-15 11:42:50,333 INFO L290 TraceCheckUtils]: 149: Hoare triple {110824#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110824#false} is VALID [2022-04-15 11:42:50,333 INFO L290 TraceCheckUtils]: 150: Hoare triple {110824#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {110824#false} is VALID [2022-04-15 11:42:50,333 INFO L290 TraceCheckUtils]: 151: Hoare triple {110824#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {110824#false} is VALID [2022-04-15 11:42:50,333 INFO L290 TraceCheckUtils]: 152: Hoare triple {110824#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {110824#false} is VALID [2022-04-15 11:42:50,333 INFO L290 TraceCheckUtils]: 153: Hoare triple {110824#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {110824#false} is VALID [2022-04-15 11:42:50,333 INFO L290 TraceCheckUtils]: 154: Hoare triple {110824#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {110824#false} is VALID [2022-04-15 11:42:50,333 INFO L290 TraceCheckUtils]: 155: Hoare triple {110824#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {110824#false} is VALID [2022-04-15 11:42:50,333 INFO L290 TraceCheckUtils]: 156: Hoare triple {110824#false} assume 4432 == #t~mem62;havoc #t~mem62; {110824#false} is VALID [2022-04-15 11:42:50,333 INFO L290 TraceCheckUtils]: 157: Hoare triple {110824#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {110824#false} is VALID [2022-04-15 11:42:50,333 INFO L290 TraceCheckUtils]: 158: Hoare triple {110824#false} assume 5 == ~blastFlag~0; {110824#false} is VALID [2022-04-15 11:42:50,333 INFO L290 TraceCheckUtils]: 159: Hoare triple {110824#false} assume !false; {110824#false} is VALID [2022-04-15 11:42:50,334 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 206 proven. 1 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-04-15 11:42:50,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:42:50,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446398230] [2022-04-15 11:42:50,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446398230] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:42:50,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024790410] [2022-04-15 11:42:50,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:42:50,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:42:50,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:42:50,335 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-15 11:42:50,336 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-15 11:43:33,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:43:33,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:43:33,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 1464 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 11:43:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:33,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:43:33,551 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-15 11:43:33,551 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-15 11:43:33,553 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-15 11:43:33,567 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-15 11:43:33,574 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-15 11:43:33,742 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 25 treesize of output 13 [2022-04-15 11:43:33,803 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-15 11:43:33,803 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-15 11:43:33,979 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 0 case distinctions, treesize of input 13 treesize of output 9 [2022-04-15 11:43:34,004 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-15 11:43:34,004 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-15 11:43:34,083 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-15 11:43:34,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {110823#true} call ULTIMATE.init(); {110823#true} is VALID [2022-04-15 11:43:34,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {110823#true} assume true; {110823#true} is VALID [2022-04-15 11:43:34,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110823#true} {110823#true} #593#return; {110823#true} is VALID [2022-04-15 11:43:34,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {110823#true} call #t~ret158 := main(); {110823#true} is VALID [2022-04-15 11:43:34,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {110823#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; {110823#true} is VALID [2022-04-15 11:43:34,101 INFO L272 TraceCheckUtils]: 6: Hoare triple {110823#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {110823#true} is VALID [2022-04-15 11:43:34,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {110823#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; {110823#true} is VALID [2022-04-15 11:43:34,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {110823#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; {110823#true} is VALID [2022-04-15 11:43:34,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {110823#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {110823#true} is VALID [2022-04-15 11:43:34,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-15 11:43:34,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {110823#true} assume 12292 == #t~mem49;havoc #t~mem49; {110823#true} is VALID [2022-04-15 11:43:34,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {110823#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; {110823#true} is VALID [2022-04-15 11:43:34,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {110823#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {110823#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {110823#true} is VALID [2022-04-15 11:43:34,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {110823#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {110823#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {110823#true} is VALID [2022-04-15 11:43:34,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {110823#true} assume !(0 == ~tmp___4~0); {110823#true} is VALID [2022-04-15 11:43:34,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {110823#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); {110898#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,103 INFO L290 TraceCheckUtils]: 22: Hoare triple {110898#(= 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); {110898#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,103 INFO L290 TraceCheckUtils]: 23: Hoare triple {110898#(= 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; {110898#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,104 INFO L290 TraceCheckUtils]: 24: Hoare triple {110898#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} ~skip~0 := 0; {110898#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,104 INFO L290 TraceCheckUtils]: 25: Hoare triple {110898#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !false; {110898#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,104 INFO L290 TraceCheckUtils]: 26: Hoare triple {110898#(= 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); {110898#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,104 INFO L290 TraceCheckUtils]: 27: Hoare triple {110898#(= 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); {110898#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,105 INFO L290 TraceCheckUtils]: 28: Hoare triple {110898#(= 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); {110898#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,105 INFO L290 TraceCheckUtils]: 29: Hoare triple {110898#(= 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); {110898#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,106 INFO L290 TraceCheckUtils]: 30: Hoare triple {110898#(= 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); {110898#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,106 INFO L290 TraceCheckUtils]: 31: Hoare triple {110898#(= 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); {110823#true} is VALID [2022-04-15 11:43:34,106 INFO L290 TraceCheckUtils]: 32: Hoare triple {110823#true} assume 4368 == #t~mem54;havoc #t~mem54; {110823#true} is VALID [2022-04-15 11:43:34,106 INFO L290 TraceCheckUtils]: 33: Hoare triple {110823#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; {110823#true} is VALID [2022-04-15 11:43:34,106 INFO L290 TraceCheckUtils]: 34: Hoare triple {110823#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {110823#true} is VALID [2022-04-15 11:43:34,106 INFO L290 TraceCheckUtils]: 35: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,106 INFO L290 TraceCheckUtils]: 36: Hoare triple {110823#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; {110823#true} is VALID [2022-04-15 11:43:34,106 INFO L290 TraceCheckUtils]: 37: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,106 INFO L290 TraceCheckUtils]: 38: Hoare triple {110823#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110823#true} is VALID [2022-04-15 11:43:34,106 INFO L290 TraceCheckUtils]: 39: Hoare triple {110823#true} ~skip~0 := 0; {110823#true} is VALID [2022-04-15 11:43:34,106 INFO L290 TraceCheckUtils]: 40: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-15 11:43:34,106 INFO L290 TraceCheckUtils]: 41: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,106 INFO L290 TraceCheckUtils]: 42: Hoare triple {110823#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,106 INFO L290 TraceCheckUtils]: 43: Hoare triple {110823#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,106 INFO L290 TraceCheckUtils]: 44: Hoare triple {110823#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,107 INFO L290 TraceCheckUtils]: 45: Hoare triple {110823#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,107 INFO L290 TraceCheckUtils]: 46: Hoare triple {110823#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,107 INFO L290 TraceCheckUtils]: 47: Hoare triple {110823#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,107 INFO L290 TraceCheckUtils]: 48: Hoare triple {110823#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,107 INFO L290 TraceCheckUtils]: 49: Hoare triple {110823#true} assume 4384 == #t~mem56;havoc #t~mem56; {110823#true} is VALID [2022-04-15 11:43:34,107 INFO L290 TraceCheckUtils]: 50: Hoare triple {110823#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {110823#true} is VALID [2022-04-15 11:43:34,107 INFO L290 TraceCheckUtils]: 51: Hoare triple {110823#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {110823#true} is VALID [2022-04-15 11:43:34,107 INFO L290 TraceCheckUtils]: 52: Hoare triple {110823#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,107 INFO L290 TraceCheckUtils]: 53: Hoare triple {110823#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,107 INFO L290 TraceCheckUtils]: 54: Hoare triple {110823#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,107 INFO L290 TraceCheckUtils]: 55: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,107 INFO L290 TraceCheckUtils]: 56: Hoare triple {110823#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110823#true} is VALID [2022-04-15 11:43:34,107 INFO L290 TraceCheckUtils]: 57: Hoare triple {110823#true} ~skip~0 := 0; {110823#true} is VALID [2022-04-15 11:43:34,107 INFO L290 TraceCheckUtils]: 58: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-15 11:43:34,108 INFO L290 TraceCheckUtils]: 59: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,108 INFO L290 TraceCheckUtils]: 60: Hoare triple {110823#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,108 INFO L290 TraceCheckUtils]: 61: Hoare triple {110823#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,108 INFO L290 TraceCheckUtils]: 62: Hoare triple {110823#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,108 INFO L290 TraceCheckUtils]: 63: Hoare triple {110823#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,108 INFO L290 TraceCheckUtils]: 64: Hoare triple {110823#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,108 INFO L290 TraceCheckUtils]: 65: Hoare triple {110823#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,108 INFO L290 TraceCheckUtils]: 66: Hoare triple {110823#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,108 INFO L290 TraceCheckUtils]: 67: Hoare triple {110823#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,108 INFO L290 TraceCheckUtils]: 68: Hoare triple {110823#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,108 INFO L290 TraceCheckUtils]: 69: Hoare triple {110823#true} assume 4400 == #t~mem58;havoc #t~mem58; {110823#true} is VALID [2022-04-15 11:43:34,108 INFO L290 TraceCheckUtils]: 70: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,108 INFO L290 TraceCheckUtils]: 71: Hoare triple {110823#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; {110823#true} is VALID [2022-04-15 11:43:34,108 INFO L290 TraceCheckUtils]: 72: Hoare triple {110823#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {110823#true} is VALID [2022-04-15 11:43:34,108 INFO L290 TraceCheckUtils]: 73: Hoare triple {110823#true} assume !(~ret~0 <= 0); {110823#true} is VALID [2022-04-15 11:43:34,109 INFO L290 TraceCheckUtils]: 74: Hoare triple {110823#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,109 INFO L290 TraceCheckUtils]: 75: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,109 INFO L290 TraceCheckUtils]: 76: Hoare triple {110823#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110823#true} is VALID [2022-04-15 11:43:34,109 INFO L290 TraceCheckUtils]: 77: Hoare triple {110823#true} ~skip~0 := 0; {110823#true} is VALID [2022-04-15 11:43:34,109 INFO L290 TraceCheckUtils]: 78: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-15 11:43:34,109 INFO L290 TraceCheckUtils]: 79: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,109 INFO L290 TraceCheckUtils]: 80: Hoare triple {110823#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,109 INFO L290 TraceCheckUtils]: 81: Hoare triple {110823#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,109 INFO L290 TraceCheckUtils]: 82: Hoare triple {110823#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,109 INFO L290 TraceCheckUtils]: 83: Hoare triple {110823#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,109 INFO L290 TraceCheckUtils]: 84: Hoare triple {110823#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,109 INFO L290 TraceCheckUtils]: 85: Hoare triple {110823#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,109 INFO L290 TraceCheckUtils]: 86: Hoare triple {110823#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,109 INFO L290 TraceCheckUtils]: 87: Hoare triple {110823#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,110 INFO L290 TraceCheckUtils]: 88: Hoare triple {110823#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,110 INFO L290 TraceCheckUtils]: 89: Hoare triple {110823#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,110 INFO L290 TraceCheckUtils]: 90: Hoare triple {110823#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,110 INFO L290 TraceCheckUtils]: 91: Hoare triple {110823#true} assume 4416 == #t~mem60;havoc #t~mem60; {110823#true} is VALID [2022-04-15 11:43:34,110 INFO L290 TraceCheckUtils]: 92: Hoare triple {110823#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {110823#true} is VALID [2022-04-15 11:43:34,110 INFO L290 TraceCheckUtils]: 93: Hoare triple {110823#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {110823#true} is VALID [2022-04-15 11:43:34,110 INFO L290 TraceCheckUtils]: 94: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,110 INFO L290 TraceCheckUtils]: 95: Hoare triple {110823#true} assume !(0 == ~tmp___6~0); {110823#true} is VALID [2022-04-15 11:43:34,110 INFO L290 TraceCheckUtils]: 96: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,110 INFO L290 TraceCheckUtils]: 97: Hoare triple {110823#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110823#true} is VALID [2022-04-15 11:43:34,110 INFO L290 TraceCheckUtils]: 98: Hoare triple {110823#true} ~skip~0 := 0; {110823#true} is VALID [2022-04-15 11:43:34,110 INFO L290 TraceCheckUtils]: 99: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-15 11:43:34,110 INFO L290 TraceCheckUtils]: 100: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,110 INFO L290 TraceCheckUtils]: 101: Hoare triple {110823#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,110 INFO L290 TraceCheckUtils]: 102: Hoare triple {110823#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,111 INFO L290 TraceCheckUtils]: 103: Hoare triple {110823#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,111 INFO L290 TraceCheckUtils]: 104: Hoare triple {110823#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,111 INFO L290 TraceCheckUtils]: 105: Hoare triple {110823#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,111 INFO L290 TraceCheckUtils]: 106: Hoare triple {110823#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,111 INFO L290 TraceCheckUtils]: 107: Hoare triple {110823#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,111 INFO L290 TraceCheckUtils]: 108: Hoare triple {110823#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,111 INFO L290 TraceCheckUtils]: 109: Hoare triple {110823#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,111 INFO L290 TraceCheckUtils]: 110: Hoare triple {110823#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,111 INFO L290 TraceCheckUtils]: 111: Hoare triple {110823#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,111 INFO L290 TraceCheckUtils]: 112: Hoare triple {110823#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,111 INFO L290 TraceCheckUtils]: 113: Hoare triple {110823#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,111 INFO L290 TraceCheckUtils]: 114: Hoare triple {110823#true} assume 4432 == #t~mem62;havoc #t~mem62; {110823#true} is VALID [2022-04-15 11:43:34,111 INFO L290 TraceCheckUtils]: 115: Hoare triple {110823#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {110823#true} is VALID [2022-04-15 11:43:34,111 INFO L290 TraceCheckUtils]: 116: Hoare triple {110823#true} assume !(5 == ~blastFlag~0); {110823#true} is VALID [2022-04-15 11:43:34,111 INFO L290 TraceCheckUtils]: 117: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,112 INFO L290 TraceCheckUtils]: 118: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,112 INFO L290 TraceCheckUtils]: 119: Hoare triple {110823#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110823#true} is VALID [2022-04-15 11:43:34,112 INFO L290 TraceCheckUtils]: 120: Hoare triple {110823#true} ~skip~0 := 0; {110823#true} is VALID [2022-04-15 11:43:34,112 INFO L290 TraceCheckUtils]: 121: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-15 11:43:34,112 INFO L290 TraceCheckUtils]: 122: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,112 INFO L290 TraceCheckUtils]: 123: Hoare triple {110823#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,112 INFO L290 TraceCheckUtils]: 124: Hoare triple {110823#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,112 INFO L290 TraceCheckUtils]: 125: Hoare triple {110823#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,112 INFO L290 TraceCheckUtils]: 126: Hoare triple {110823#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,112 INFO L290 TraceCheckUtils]: 127: Hoare triple {110823#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,112 INFO L290 TraceCheckUtils]: 128: Hoare triple {110823#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,112 INFO L290 TraceCheckUtils]: 129: Hoare triple {110823#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,112 INFO L290 TraceCheckUtils]: 130: Hoare triple {110823#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,112 INFO L290 TraceCheckUtils]: 131: Hoare triple {110823#true} assume 4385 == #t~mem57;havoc #t~mem57; {110823#true} is VALID [2022-04-15 11:43:34,113 INFO L290 TraceCheckUtils]: 132: Hoare triple {110823#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {110823#true} is VALID [2022-04-15 11:43:34,113 INFO L290 TraceCheckUtils]: 133: Hoare triple {110823#true} assume !(1 == ~blastFlag~0); {110823#true} is VALID [2022-04-15 11:43:34,113 INFO L290 TraceCheckUtils]: 134: Hoare triple {110823#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {110823#true} is VALID [2022-04-15 11:43:34,113 INFO L290 TraceCheckUtils]: 135: Hoare triple {110823#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,119 INFO L290 TraceCheckUtils]: 136: Hoare triple {110823#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,119 INFO L290 TraceCheckUtils]: 137: Hoare triple {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,120 INFO L290 TraceCheckUtils]: 138: Hoare triple {111244#(<= 4560 (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); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,120 INFO L290 TraceCheckUtils]: 139: Hoare triple {111244#(<= 4560 (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; {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,120 INFO L290 TraceCheckUtils]: 140: Hoare triple {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,120 INFO L290 TraceCheckUtils]: 141: Hoare triple {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,121 INFO L290 TraceCheckUtils]: 142: Hoare triple {111244#(<= 4560 (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); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,121 INFO L290 TraceCheckUtils]: 143: Hoare triple {111244#(<= 4560 (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); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,121 INFO L290 TraceCheckUtils]: 144: Hoare triple {111244#(<= 4560 (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); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,132 INFO L290 TraceCheckUtils]: 145: Hoare triple {111244#(<= 4560 (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); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,132 INFO L290 TraceCheckUtils]: 146: Hoare triple {111244#(<= 4560 (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); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,133 INFO L290 TraceCheckUtils]: 147: Hoare triple {111244#(<= 4560 (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); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,133 INFO L290 TraceCheckUtils]: 148: Hoare triple {111244#(<= 4560 (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); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,133 INFO L290 TraceCheckUtils]: 149: Hoare triple {111244#(<= 4560 (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); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,134 INFO L290 TraceCheckUtils]: 150: Hoare triple {111244#(<= 4560 (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); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,134 INFO L290 TraceCheckUtils]: 151: Hoare triple {111244#(<= 4560 (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); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,134 INFO L290 TraceCheckUtils]: 152: Hoare triple {111244#(<= 4560 (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); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,134 INFO L290 TraceCheckUtils]: 153: Hoare triple {111244#(<= 4560 (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); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,135 INFO L290 TraceCheckUtils]: 154: Hoare triple {111244#(<= 4560 (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); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,135 INFO L290 TraceCheckUtils]: 155: Hoare triple {111244#(<= 4560 (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); {111302#(<= 4560 |ssl3_connect_#t~mem62|)} is VALID [2022-04-15 11:43:34,135 INFO L290 TraceCheckUtils]: 156: Hoare triple {111302#(<= 4560 |ssl3_connect_#t~mem62|)} assume 4432 == #t~mem62;havoc #t~mem62; {110824#false} is VALID [2022-04-15 11:43:34,136 INFO L290 TraceCheckUtils]: 157: Hoare triple {110824#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {110824#false} is VALID [2022-04-15 11:43:34,136 INFO L290 TraceCheckUtils]: 158: Hoare triple {110824#false} assume 5 == ~blastFlag~0; {110824#false} is VALID [2022-04-15 11:43:34,136 INFO L290 TraceCheckUtils]: 159: Hoare triple {110824#false} assume !false; {110824#false} is VALID [2022-04-15 11:43:34,136 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 88 proven. 60 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-04-15 11:43:34,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:43:34,427 INFO L290 TraceCheckUtils]: 159: Hoare triple {110824#false} assume !false; {110824#false} is VALID [2022-04-15 11:43:34,427 INFO L290 TraceCheckUtils]: 158: Hoare triple {110824#false} assume 5 == ~blastFlag~0; {110824#false} is VALID [2022-04-15 11:43:34,427 INFO L290 TraceCheckUtils]: 157: Hoare triple {110824#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {110824#false} is VALID [2022-04-15 11:43:34,433 INFO L290 TraceCheckUtils]: 156: Hoare triple {111324#(not (<= |ssl3_connect_#t~mem62| 4432))} assume 4432 == #t~mem62;havoc #t~mem62; {110824#false} is VALID [2022-04-15 11:43:34,433 INFO L290 TraceCheckUtils]: 155: Hoare triple {111328#(< 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); {111324#(not (<= |ssl3_connect_#t~mem62| 4432))} is VALID [2022-04-15 11:43:34,433 INFO L290 TraceCheckUtils]: 154: Hoare triple {111328#(< 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); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,434 INFO L290 TraceCheckUtils]: 153: Hoare triple {111328#(< 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); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,434 INFO L290 TraceCheckUtils]: 152: Hoare triple {111328#(< 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); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,434 INFO L290 TraceCheckUtils]: 151: Hoare triple {111328#(< 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); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,434 INFO L290 TraceCheckUtils]: 150: Hoare triple {111328#(< 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); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,435 INFO L290 TraceCheckUtils]: 149: Hoare triple {111328#(< 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); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,435 INFO L290 TraceCheckUtils]: 148: Hoare triple {111328#(< 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); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,435 INFO L290 TraceCheckUtils]: 147: Hoare triple {111328#(< 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); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,436 INFO L290 TraceCheckUtils]: 146: Hoare triple {111328#(< 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); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,436 INFO L290 TraceCheckUtils]: 145: Hoare triple {111328#(< 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); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,436 INFO L290 TraceCheckUtils]: 144: Hoare triple {111328#(< 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); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,437 INFO L290 TraceCheckUtils]: 143: Hoare triple {111328#(< 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); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,437 INFO L290 TraceCheckUtils]: 142: Hoare triple {111328#(< 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); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,437 INFO L290 TraceCheckUtils]: 141: Hoare triple {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,438 INFO L290 TraceCheckUtils]: 140: Hoare triple {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,438 INFO L290 TraceCheckUtils]: 139: Hoare triple {111328#(< 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; {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,438 INFO L290 TraceCheckUtils]: 138: Hoare triple {111328#(< 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); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,439 INFO L290 TraceCheckUtils]: 137: Hoare triple {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,440 INFO L290 TraceCheckUtils]: 136: Hoare triple {110823#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:34,440 INFO L290 TraceCheckUtils]: 135: Hoare triple {110823#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,440 INFO L290 TraceCheckUtils]: 134: Hoare triple {110823#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {110823#true} is VALID [2022-04-15 11:43:34,440 INFO L290 TraceCheckUtils]: 133: Hoare triple {110823#true} assume !(1 == ~blastFlag~0); {110823#true} is VALID [2022-04-15 11:43:34,440 INFO L290 TraceCheckUtils]: 132: Hoare triple {110823#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {110823#true} is VALID [2022-04-15 11:43:34,440 INFO L290 TraceCheckUtils]: 131: Hoare triple {110823#true} assume 4385 == #t~mem57;havoc #t~mem57; {110823#true} is VALID [2022-04-15 11:43:34,440 INFO L290 TraceCheckUtils]: 130: Hoare triple {110823#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,440 INFO L290 TraceCheckUtils]: 129: Hoare triple {110823#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,440 INFO L290 TraceCheckUtils]: 128: Hoare triple {110823#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,440 INFO L290 TraceCheckUtils]: 127: Hoare triple {110823#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,440 INFO L290 TraceCheckUtils]: 126: Hoare triple {110823#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,441 INFO L290 TraceCheckUtils]: 125: Hoare triple {110823#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,441 INFO L290 TraceCheckUtils]: 124: Hoare triple {110823#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,441 INFO L290 TraceCheckUtils]: 123: Hoare triple {110823#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,441 INFO L290 TraceCheckUtils]: 122: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,441 INFO L290 TraceCheckUtils]: 121: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-15 11:43:34,441 INFO L290 TraceCheckUtils]: 120: Hoare triple {110823#true} ~skip~0 := 0; {110823#true} is VALID [2022-04-15 11:43:34,441 INFO L290 TraceCheckUtils]: 119: Hoare triple {110823#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110823#true} is VALID [2022-04-15 11:43:34,441 INFO L290 TraceCheckUtils]: 118: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,441 INFO L290 TraceCheckUtils]: 117: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,441 INFO L290 TraceCheckUtils]: 116: Hoare triple {110823#true} assume !(5 == ~blastFlag~0); {110823#true} is VALID [2022-04-15 11:43:34,441 INFO L290 TraceCheckUtils]: 115: Hoare triple {110823#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {110823#true} is VALID [2022-04-15 11:43:34,441 INFO L290 TraceCheckUtils]: 114: Hoare triple {110823#true} assume 4432 == #t~mem62;havoc #t~mem62; {110823#true} is VALID [2022-04-15 11:43:34,441 INFO L290 TraceCheckUtils]: 113: Hoare triple {110823#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,441 INFO L290 TraceCheckUtils]: 112: Hoare triple {110823#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,441 INFO L290 TraceCheckUtils]: 111: Hoare triple {110823#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,442 INFO L290 TraceCheckUtils]: 110: Hoare triple {110823#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,442 INFO L290 TraceCheckUtils]: 109: Hoare triple {110823#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,442 INFO L290 TraceCheckUtils]: 108: Hoare triple {110823#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,442 INFO L290 TraceCheckUtils]: 107: Hoare triple {110823#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,442 INFO L290 TraceCheckUtils]: 106: Hoare triple {110823#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,442 INFO L290 TraceCheckUtils]: 105: Hoare triple {110823#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,442 INFO L290 TraceCheckUtils]: 104: Hoare triple {110823#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,442 INFO L290 TraceCheckUtils]: 103: Hoare triple {110823#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,442 INFO L290 TraceCheckUtils]: 102: Hoare triple {110823#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,442 INFO L290 TraceCheckUtils]: 101: Hoare triple {110823#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,442 INFO L290 TraceCheckUtils]: 100: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,442 INFO L290 TraceCheckUtils]: 99: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-15 11:43:34,442 INFO L290 TraceCheckUtils]: 98: Hoare triple {110823#true} ~skip~0 := 0; {110823#true} is VALID [2022-04-15 11:43:34,442 INFO L290 TraceCheckUtils]: 97: Hoare triple {110823#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110823#true} is VALID [2022-04-15 11:43:34,443 INFO L290 TraceCheckUtils]: 96: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,443 INFO L290 TraceCheckUtils]: 95: Hoare triple {110823#true} assume !(0 == ~tmp___6~0); {110823#true} is VALID [2022-04-15 11:43:34,443 INFO L290 TraceCheckUtils]: 94: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,443 INFO L290 TraceCheckUtils]: 93: Hoare triple {110823#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {110823#true} is VALID [2022-04-15 11:43:34,443 INFO L290 TraceCheckUtils]: 92: Hoare triple {110823#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {110823#true} is VALID [2022-04-15 11:43:34,443 INFO L290 TraceCheckUtils]: 91: Hoare triple {110823#true} assume 4416 == #t~mem60;havoc #t~mem60; {110823#true} is VALID [2022-04-15 11:43:34,443 INFO L290 TraceCheckUtils]: 90: Hoare triple {110823#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,443 INFO L290 TraceCheckUtils]: 89: Hoare triple {110823#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,443 INFO L290 TraceCheckUtils]: 88: Hoare triple {110823#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,443 INFO L290 TraceCheckUtils]: 87: Hoare triple {110823#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,443 INFO L290 TraceCheckUtils]: 86: Hoare triple {110823#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,443 INFO L290 TraceCheckUtils]: 85: Hoare triple {110823#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,443 INFO L290 TraceCheckUtils]: 84: Hoare triple {110823#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,443 INFO L290 TraceCheckUtils]: 83: Hoare triple {110823#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,443 INFO L290 TraceCheckUtils]: 82: Hoare triple {110823#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,444 INFO L290 TraceCheckUtils]: 81: Hoare triple {110823#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,444 INFO L290 TraceCheckUtils]: 80: Hoare triple {110823#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,444 INFO L290 TraceCheckUtils]: 79: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,444 INFO L290 TraceCheckUtils]: 78: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-15 11:43:34,444 INFO L290 TraceCheckUtils]: 77: Hoare triple {110823#true} ~skip~0 := 0; {110823#true} is VALID [2022-04-15 11:43:34,444 INFO L290 TraceCheckUtils]: 76: Hoare triple {110823#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110823#true} is VALID [2022-04-15 11:43:34,444 INFO L290 TraceCheckUtils]: 75: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,444 INFO L290 TraceCheckUtils]: 74: Hoare triple {110823#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,444 INFO L290 TraceCheckUtils]: 73: Hoare triple {110823#true} assume !(~ret~0 <= 0); {110823#true} is VALID [2022-04-15 11:43:34,444 INFO L290 TraceCheckUtils]: 72: Hoare triple {110823#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {110823#true} is VALID [2022-04-15 11:43:34,444 INFO L290 TraceCheckUtils]: 71: Hoare triple {110823#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; {110823#true} is VALID [2022-04-15 11:43:34,444 INFO L290 TraceCheckUtils]: 70: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,444 INFO L290 TraceCheckUtils]: 69: Hoare triple {110823#true} assume 4400 == #t~mem58;havoc #t~mem58; {110823#true} is VALID [2022-04-15 11:43:34,444 INFO L290 TraceCheckUtils]: 68: Hoare triple {110823#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,445 INFO L290 TraceCheckUtils]: 67: Hoare triple {110823#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,445 INFO L290 TraceCheckUtils]: 66: Hoare triple {110823#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,445 INFO L290 TraceCheckUtils]: 65: Hoare triple {110823#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,445 INFO L290 TraceCheckUtils]: 64: Hoare triple {110823#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,445 INFO L290 TraceCheckUtils]: 63: Hoare triple {110823#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,445 INFO L290 TraceCheckUtils]: 62: Hoare triple {110823#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,445 INFO L290 TraceCheckUtils]: 61: Hoare triple {110823#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,445 INFO L290 TraceCheckUtils]: 60: Hoare triple {110823#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,445 INFO L290 TraceCheckUtils]: 59: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,445 INFO L290 TraceCheckUtils]: 58: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-15 11:43:34,445 INFO L290 TraceCheckUtils]: 57: Hoare triple {110823#true} ~skip~0 := 0; {110823#true} is VALID [2022-04-15 11:43:34,445 INFO L290 TraceCheckUtils]: 56: Hoare triple {110823#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110823#true} is VALID [2022-04-15 11:43:34,445 INFO L290 TraceCheckUtils]: 55: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,445 INFO L290 TraceCheckUtils]: 54: Hoare triple {110823#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,445 INFO L290 TraceCheckUtils]: 53: Hoare triple {110823#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,446 INFO L290 TraceCheckUtils]: 52: Hoare triple {110823#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,446 INFO L290 TraceCheckUtils]: 51: Hoare triple {110823#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {110823#true} is VALID [2022-04-15 11:43:34,446 INFO L290 TraceCheckUtils]: 50: Hoare triple {110823#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {110823#true} is VALID [2022-04-15 11:43:34,446 INFO L290 TraceCheckUtils]: 49: Hoare triple {110823#true} assume 4384 == #t~mem56;havoc #t~mem56; {110823#true} is VALID [2022-04-15 11:43:34,446 INFO L290 TraceCheckUtils]: 48: Hoare triple {110823#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,446 INFO L290 TraceCheckUtils]: 47: Hoare triple {110823#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,446 INFO L290 TraceCheckUtils]: 46: Hoare triple {110823#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,446 INFO L290 TraceCheckUtils]: 45: Hoare triple {110823#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,446 INFO L290 TraceCheckUtils]: 44: Hoare triple {110823#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,446 INFO L290 TraceCheckUtils]: 43: Hoare triple {110823#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,446 INFO L290 TraceCheckUtils]: 42: Hoare triple {110823#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,446 INFO L290 TraceCheckUtils]: 41: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,446 INFO L290 TraceCheckUtils]: 40: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-15 11:43:34,446 INFO L290 TraceCheckUtils]: 39: Hoare triple {110823#true} ~skip~0 := 0; {110823#true} is VALID [2022-04-15 11:43:34,447 INFO L290 TraceCheckUtils]: 38: Hoare triple {110823#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110823#true} is VALID [2022-04-15 11:43:34,447 INFO L290 TraceCheckUtils]: 37: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,447 INFO L290 TraceCheckUtils]: 36: Hoare triple {110823#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; {110823#true} is VALID [2022-04-15 11:43:34,447 INFO L290 TraceCheckUtils]: 35: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,447 INFO L290 TraceCheckUtils]: 34: Hoare triple {110823#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {110823#true} is VALID [2022-04-15 11:43:34,447 INFO L290 TraceCheckUtils]: 33: Hoare triple {110823#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; {110823#true} is VALID [2022-04-15 11:43:34,447 INFO L290 TraceCheckUtils]: 32: Hoare triple {110823#true} assume 4368 == #t~mem54;havoc #t~mem54; {110823#true} is VALID [2022-04-15 11:43:34,447 INFO L290 TraceCheckUtils]: 31: Hoare triple {110823#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,447 INFO L290 TraceCheckUtils]: 30: Hoare triple {110823#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,447 INFO L290 TraceCheckUtils]: 29: Hoare triple {110823#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,447 INFO L290 TraceCheckUtils]: 28: Hoare triple {110823#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {110823#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,447 INFO L290 TraceCheckUtils]: 26: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,447 INFO L290 TraceCheckUtils]: 25: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-15 11:43:34,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {110823#true} ~skip~0 := 0; {110823#true} is VALID [2022-04-15 11:43:34,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {110823#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110823#true} is VALID [2022-04-15 11:43:34,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,448 INFO L290 TraceCheckUtils]: 20: Hoare triple {110823#true} assume !(0 == ~tmp___4~0); {110823#true} is VALID [2022-04-15 11:43:34,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {110823#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {110823#true} is VALID [2022-04-15 11:43:34,448 INFO L290 TraceCheckUtils]: 18: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {110823#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {110823#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {110823#true} is VALID [2022-04-15 11:43:34,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {110823#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {110823#true} is VALID [2022-04-15 11:43:34,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {110823#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; {110823#true} is VALID [2022-04-15 11:43:34,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {110823#true} assume 12292 == #t~mem49;havoc #t~mem49; {110823#true} is VALID [2022-04-15 11:43:34,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-15 11:43:34,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {110823#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {110823#true} is VALID [2022-04-15 11:43:34,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {110823#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; {110823#true} is VALID [2022-04-15 11:43:34,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {110823#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; {110823#true} is VALID [2022-04-15 11:43:34,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,449 INFO L272 TraceCheckUtils]: 6: Hoare triple {110823#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {110823#true} is VALID [2022-04-15 11:43:34,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {110823#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; {110823#true} is VALID [2022-04-15 11:43:34,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {110823#true} call #t~ret158 := main(); {110823#true} is VALID [2022-04-15 11:43:34,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110823#true} {110823#true} #593#return; {110823#true} is VALID [2022-04-15 11:43:34,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {110823#true} assume true; {110823#true} is VALID [2022-04-15 11:43:34,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {110823#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); {110823#true} is VALID [2022-04-15 11:43:34,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {110823#true} call ULTIMATE.init(); {110823#true} is VALID [2022-04-15 11:43:34,450 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2022-04-15 11:43:34,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024790410] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 11:43:34,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:43:34,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 11 [2022-04-15 11:43:34,450 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:43:34,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [868004096] [2022-04-15 11:43:34,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [868004096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:34,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:34,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:43:34,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495587295] [2022-04-15 11:43:34,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:43:34,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 160 [2022-04-15 11:43:34,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:43:34,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-15 11:43:34,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:34,514 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:43:34,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:34,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:43:34,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-04-15 11:43:34,515 INFO L87 Difference]: Start difference. First operand 1015 states and 1448 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-15 11:43:38,554 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:43:42,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:42,196 INFO L93 Difference]: Finished difference Result 2468 states and 3519 transitions. [2022-04-15 11:43:42,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:43:42,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 160 [2022-04-15 11:43:42,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:43:42,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-15 11:43:42,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2022-04-15 11:43:42,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-15 11:43:42,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2022-04-15 11:43:42,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 472 transitions. [2022-04-15 11:43:42,489 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-15 11:43:42,567 INFO L225 Difference]: With dead ends: 2468 [2022-04-15 11:43:42,567 INFO L226 Difference]: Without dead ends: 1469 [2022-04-15 11:43:42,569 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-04-15 11:43:42,569 INFO L913 BasicCegarLoop]: 231 mSDtfsCounter, 99 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:43:42,569 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 545 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 233 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 11:43:42,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2022-04-15 11:43:43,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1011. [2022-04-15 11:43:43,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:43:43,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1469 states. Second operand has 1011 states, 1006 states have (on average 1.4314115308151094) internal successors, (1440), 1006 states have internal predecessors, (1440), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:43,101 INFO L74 IsIncluded]: Start isIncluded. First operand 1469 states. Second operand has 1011 states, 1006 states have (on average 1.4314115308151094) internal successors, (1440), 1006 states have internal predecessors, (1440), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:43,101 INFO L87 Difference]: Start difference. First operand 1469 states. Second operand has 1011 states, 1006 states have (on average 1.4314115308151094) internal successors, (1440), 1006 states have internal predecessors, (1440), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:43,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:43,152 INFO L93 Difference]: Finished difference Result 1469 states and 2086 transitions. [2022-04-15 11:43:43,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 2086 transitions. [2022-04-15 11:43:43,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:43,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:43,154 INFO L74 IsIncluded]: Start isIncluded. First operand has 1011 states, 1006 states have (on average 1.4314115308151094) internal successors, (1440), 1006 states have internal predecessors, (1440), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1469 states. [2022-04-15 11:43:43,155 INFO L87 Difference]: Start difference. First operand has 1011 states, 1006 states have (on average 1.4314115308151094) internal successors, (1440), 1006 states have internal predecessors, (1440), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1469 states. [2022-04-15 11:43:43,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:43,206 INFO L93 Difference]: Finished difference Result 1469 states and 2086 transitions. [2022-04-15 11:43:43,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 2086 transitions. [2022-04-15 11:43:43,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:43,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:43,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:43:43,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:43:43,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1006 states have (on average 1.4314115308151094) internal successors, (1440), 1006 states have internal predecessors, (1440), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:43,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1444 transitions. [2022-04-15 11:43:43,253 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1444 transitions. Word has length 160 [2022-04-15 11:43:43,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:43:43,253 INFO L478 AbstractCegarLoop]: Abstraction has 1011 states and 1444 transitions. [2022-04-15 11:43:43,253 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-15 11:43:43,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1011 states and 1444 transitions. [2022-04-15 11:43:44,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1444 edges. 1444 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:44,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1444 transitions. [2022-04-15 11:43:44,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-04-15 11:43:44,683 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:43:44,684 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:43:44,722 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-15 11:43:44,884 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-15 11:43:44,884 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:43:44,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:43:44,884 INFO L85 PathProgramCache]: Analyzing trace with hash 894528072, now seen corresponding path program 1 times [2022-04-15 11:43:44,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:44,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1330681427] [2022-04-15 11:43:59,639 WARN L232 SmtUtils]: Spent 10.28s 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-15 11:44:08,762 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:44:08,762 INFO L85 PathProgramCache]: Analyzing trace with hash 894528072, now seen corresponding path program 2 times [2022-04-15 11:44:08,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:08,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158747903] [2022-04-15 11:44:08,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:08,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:08,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:08,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {121701#(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); {121694#true} is VALID [2022-04-15 11:44:08,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {121694#true} assume true; {121694#true} is VALID [2022-04-15 11:44:08,924 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {121694#true} {121694#true} #593#return; {121694#true} is VALID [2022-04-15 11:44:08,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {121694#true} call ULTIMATE.init(); {121701#(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-15 11:44:08,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {121701#(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); {121694#true} is VALID [2022-04-15 11:44:08,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {121694#true} assume true; {121694#true} is VALID [2022-04-15 11:44:08,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121694#true} {121694#true} #593#return; {121694#true} is VALID [2022-04-15 11:44:08,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {121694#true} call #t~ret158 := main(); {121694#true} is VALID [2022-04-15 11:44:08,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {121694#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; {121694#true} is VALID [2022-04-15 11:44:08,925 INFO L272 TraceCheckUtils]: 6: Hoare triple {121694#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {121694#true} is VALID [2022-04-15 11:44:08,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {121694#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); {121694#true} is VALID [2022-04-15 11:44:08,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {121694#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; {121694#true} is VALID [2022-04-15 11:44:08,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {121694#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; {121694#true} is VALID [2022-04-15 11:44:08,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {121694#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {121694#true} is VALID [2022-04-15 11:44:08,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {121694#true} assume !false; {121694#true} is VALID [2022-04-15 11:44:08,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {121694#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); {121694#true} is VALID [2022-04-15 11:44:08,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {121694#true} assume 12292 == #t~mem49;havoc #t~mem49; {121694#true} is VALID [2022-04-15 11:44:08,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {121694#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; {121694#true} is VALID [2022-04-15 11:44:08,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {121694#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {121694#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {121694#true} is VALID [2022-04-15 11:44:08,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {121694#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {121694#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); {121694#true} is VALID [2022-04-15 11:44:08,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {121694#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {121694#true} is VALID [2022-04-15 11:44:08,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {121694#true} assume !(0 == ~tmp___4~0); {121694#true} is VALID [2022-04-15 11:44:08,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {121694#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); {121694#true} is VALID [2022-04-15 11:44:08,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {121694#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); {121694#true} is VALID [2022-04-15 11:44:08,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {121694#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {121694#true} is VALID [2022-04-15 11:44:08,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {121694#true} ~skip~0 := 0; {121694#true} is VALID [2022-04-15 11:44:08,927 INFO L290 TraceCheckUtils]: 25: Hoare triple {121694#true} assume !false; {121694#true} is VALID [2022-04-15 11:44:08,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {121694#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); {121694#true} is VALID [2022-04-15 11:44:08,927 INFO L290 TraceCheckUtils]: 27: Hoare triple {121694#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,927 INFO L290 TraceCheckUtils]: 28: Hoare triple {121694#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,927 INFO L290 TraceCheckUtils]: 29: Hoare triple {121694#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,927 INFO L290 TraceCheckUtils]: 30: Hoare triple {121694#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,927 INFO L290 TraceCheckUtils]: 31: Hoare triple {121694#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,927 INFO L290 TraceCheckUtils]: 32: Hoare triple {121694#true} assume 4368 == #t~mem54;havoc #t~mem54; {121694#true} is VALID [2022-04-15 11:44:08,927 INFO L290 TraceCheckUtils]: 33: Hoare triple {121694#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; {121694#true} is VALID [2022-04-15 11:44:08,927 INFO L290 TraceCheckUtils]: 34: Hoare triple {121694#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {121694#true} is VALID [2022-04-15 11:44:08,927 INFO L290 TraceCheckUtils]: 35: Hoare triple {121694#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); {121694#true} is VALID [2022-04-15 11:44:08,927 INFO L290 TraceCheckUtils]: 36: Hoare triple {121694#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; {121694#true} is VALID [2022-04-15 11:44:08,928 INFO L290 TraceCheckUtils]: 37: Hoare triple {121694#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); {121694#true} is VALID [2022-04-15 11:44:08,928 INFO L290 TraceCheckUtils]: 38: Hoare triple {121694#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {121694#true} is VALID [2022-04-15 11:44:08,928 INFO L290 TraceCheckUtils]: 39: Hoare triple {121694#true} ~skip~0 := 0; {121694#true} is VALID [2022-04-15 11:44:08,928 INFO L290 TraceCheckUtils]: 40: Hoare triple {121694#true} assume !false; {121694#true} is VALID [2022-04-15 11:44:08,928 INFO L290 TraceCheckUtils]: 41: Hoare triple {121694#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); {121694#true} is VALID [2022-04-15 11:44:08,928 INFO L290 TraceCheckUtils]: 42: Hoare triple {121694#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,928 INFO L290 TraceCheckUtils]: 43: Hoare triple {121694#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,928 INFO L290 TraceCheckUtils]: 44: Hoare triple {121694#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,928 INFO L290 TraceCheckUtils]: 45: Hoare triple {121694#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,928 INFO L290 TraceCheckUtils]: 46: Hoare triple {121694#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,928 INFO L290 TraceCheckUtils]: 47: Hoare triple {121694#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,928 INFO L290 TraceCheckUtils]: 48: Hoare triple {121694#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,928 INFO L290 TraceCheckUtils]: 49: Hoare triple {121694#true} assume 4384 == #t~mem56;havoc #t~mem56; {121694#true} is VALID [2022-04-15 11:44:08,928 INFO L290 TraceCheckUtils]: 50: Hoare triple {121694#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {121694#true} is VALID [2022-04-15 11:44:08,929 INFO L290 TraceCheckUtils]: 51: Hoare triple {121694#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {121694#true} is VALID [2022-04-15 11:44:08,929 INFO L290 TraceCheckUtils]: 52: Hoare triple {121694#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,929 INFO L290 TraceCheckUtils]: 53: Hoare triple {121694#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,929 INFO L290 TraceCheckUtils]: 54: Hoare triple {121694#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,929 INFO L290 TraceCheckUtils]: 55: Hoare triple {121694#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); {121694#true} is VALID [2022-04-15 11:44:08,929 INFO L290 TraceCheckUtils]: 56: Hoare triple {121694#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {121694#true} is VALID [2022-04-15 11:44:08,929 INFO L290 TraceCheckUtils]: 57: Hoare triple {121694#true} ~skip~0 := 0; {121694#true} is VALID [2022-04-15 11:44:08,929 INFO L290 TraceCheckUtils]: 58: Hoare triple {121694#true} assume !false; {121694#true} is VALID [2022-04-15 11:44:08,929 INFO L290 TraceCheckUtils]: 59: Hoare triple {121694#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); {121694#true} is VALID [2022-04-15 11:44:08,929 INFO L290 TraceCheckUtils]: 60: Hoare triple {121694#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,929 INFO L290 TraceCheckUtils]: 61: Hoare triple {121694#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,929 INFO L290 TraceCheckUtils]: 62: Hoare triple {121694#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,929 INFO L290 TraceCheckUtils]: 63: Hoare triple {121694#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,929 INFO L290 TraceCheckUtils]: 64: Hoare triple {121694#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,929 INFO L290 TraceCheckUtils]: 65: Hoare triple {121694#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,930 INFO L290 TraceCheckUtils]: 66: Hoare triple {121694#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,930 INFO L290 TraceCheckUtils]: 67: Hoare triple {121694#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,930 INFO L290 TraceCheckUtils]: 68: Hoare triple {121694#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,930 INFO L290 TraceCheckUtils]: 69: Hoare triple {121694#true} assume 4400 == #t~mem58;havoc #t~mem58; {121694#true} is VALID [2022-04-15 11:44:08,930 INFO L290 TraceCheckUtils]: 70: Hoare triple {121694#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); {121694#true} is VALID [2022-04-15 11:44:08,930 INFO L290 TraceCheckUtils]: 71: Hoare triple {121694#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; {121694#true} is VALID [2022-04-15 11:44:08,930 INFO L290 TraceCheckUtils]: 72: Hoare triple {121694#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {121694#true} is VALID [2022-04-15 11:44:08,930 INFO L290 TraceCheckUtils]: 73: Hoare triple {121694#true} assume !(~ret~0 <= 0); {121694#true} is VALID [2022-04-15 11:44:08,930 INFO L290 TraceCheckUtils]: 74: Hoare triple {121694#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,930 INFO L290 TraceCheckUtils]: 75: Hoare triple {121694#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); {121694#true} is VALID [2022-04-15 11:44:08,930 INFO L290 TraceCheckUtils]: 76: Hoare triple {121694#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {121694#true} is VALID [2022-04-15 11:44:08,930 INFO L290 TraceCheckUtils]: 77: Hoare triple {121694#true} ~skip~0 := 0; {121694#true} is VALID [2022-04-15 11:44:08,930 INFO L290 TraceCheckUtils]: 78: Hoare triple {121694#true} assume !false; {121694#true} is VALID [2022-04-15 11:44:08,930 INFO L290 TraceCheckUtils]: 79: Hoare triple {121694#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); {121694#true} is VALID [2022-04-15 11:44:08,930 INFO L290 TraceCheckUtils]: 80: Hoare triple {121694#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,931 INFO L290 TraceCheckUtils]: 81: Hoare triple {121694#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,931 INFO L290 TraceCheckUtils]: 82: Hoare triple {121694#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,931 INFO L290 TraceCheckUtils]: 83: Hoare triple {121694#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,931 INFO L290 TraceCheckUtils]: 84: Hoare triple {121694#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,931 INFO L290 TraceCheckUtils]: 85: Hoare triple {121694#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,931 INFO L290 TraceCheckUtils]: 86: Hoare triple {121694#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,931 INFO L290 TraceCheckUtils]: 87: Hoare triple {121694#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,931 INFO L290 TraceCheckUtils]: 88: Hoare triple {121694#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,931 INFO L290 TraceCheckUtils]: 89: Hoare triple {121694#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,931 INFO L290 TraceCheckUtils]: 90: Hoare triple {121694#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,931 INFO L290 TraceCheckUtils]: 91: Hoare triple {121694#true} assume 4416 == #t~mem60;havoc #t~mem60; {121694#true} is VALID [2022-04-15 11:44:08,931 INFO L290 TraceCheckUtils]: 92: Hoare triple {121694#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {121694#true} is VALID [2022-04-15 11:44:08,931 INFO L290 TraceCheckUtils]: 93: Hoare triple {121694#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {121694#true} is VALID [2022-04-15 11:44:08,931 INFO L290 TraceCheckUtils]: 94: Hoare triple {121694#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); {121694#true} is VALID [2022-04-15 11:44:08,932 INFO L290 TraceCheckUtils]: 95: Hoare triple {121694#true} assume !(0 == ~tmp___6~0); {121694#true} is VALID [2022-04-15 11:44:08,932 INFO L290 TraceCheckUtils]: 96: Hoare triple {121694#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); {121694#true} is VALID [2022-04-15 11:44:08,932 INFO L290 TraceCheckUtils]: 97: Hoare triple {121694#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {121694#true} is VALID [2022-04-15 11:44:08,932 INFO L290 TraceCheckUtils]: 98: Hoare triple {121694#true} ~skip~0 := 0; {121694#true} is VALID [2022-04-15 11:44:08,932 INFO L290 TraceCheckUtils]: 99: Hoare triple {121694#true} assume !false; {121694#true} is VALID [2022-04-15 11:44:08,932 INFO L290 TraceCheckUtils]: 100: Hoare triple {121694#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); {121694#true} is VALID [2022-04-15 11:44:08,932 INFO L290 TraceCheckUtils]: 101: Hoare triple {121694#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,932 INFO L290 TraceCheckUtils]: 102: Hoare triple {121694#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,932 INFO L290 TraceCheckUtils]: 103: Hoare triple {121694#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,932 INFO L290 TraceCheckUtils]: 104: Hoare triple {121694#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,932 INFO L290 TraceCheckUtils]: 105: Hoare triple {121694#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,932 INFO L290 TraceCheckUtils]: 106: Hoare triple {121694#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,932 INFO L290 TraceCheckUtils]: 107: Hoare triple {121694#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,932 INFO L290 TraceCheckUtils]: 108: Hoare triple {121694#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,932 INFO L290 TraceCheckUtils]: 109: Hoare triple {121694#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,933 INFO L290 TraceCheckUtils]: 110: Hoare triple {121694#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,933 INFO L290 TraceCheckUtils]: 111: Hoare triple {121694#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,933 INFO L290 TraceCheckUtils]: 112: Hoare triple {121694#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,933 INFO L290 TraceCheckUtils]: 113: Hoare triple {121694#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,933 INFO L290 TraceCheckUtils]: 114: Hoare triple {121694#true} assume 4432 == #t~mem62;havoc #t~mem62; {121694#true} is VALID [2022-04-15 11:44:08,933 INFO L290 TraceCheckUtils]: 115: Hoare triple {121694#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {121694#true} is VALID [2022-04-15 11:44:08,933 INFO L290 TraceCheckUtils]: 116: Hoare triple {121694#true} assume !(5 == ~blastFlag~0); {121694#true} is VALID [2022-04-15 11:44:08,933 INFO L290 TraceCheckUtils]: 117: Hoare triple {121694#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); {121694#true} is VALID [2022-04-15 11:44:08,933 INFO L290 TraceCheckUtils]: 118: Hoare triple {121694#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); {121694#true} is VALID [2022-04-15 11:44:08,933 INFO L290 TraceCheckUtils]: 119: Hoare triple {121694#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {121694#true} is VALID [2022-04-15 11:44:08,933 INFO L290 TraceCheckUtils]: 120: Hoare triple {121694#true} ~skip~0 := 0; {121694#true} is VALID [2022-04-15 11:44:08,933 INFO L290 TraceCheckUtils]: 121: Hoare triple {121694#true} assume !false; {121694#true} is VALID [2022-04-15 11:44:08,933 INFO L290 TraceCheckUtils]: 122: Hoare triple {121694#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); {121694#true} is VALID [2022-04-15 11:44:08,933 INFO L290 TraceCheckUtils]: 123: Hoare triple {121694#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,933 INFO L290 TraceCheckUtils]: 124: Hoare triple {121694#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,934 INFO L290 TraceCheckUtils]: 125: Hoare triple {121694#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,934 INFO L290 TraceCheckUtils]: 126: Hoare triple {121694#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,934 INFO L290 TraceCheckUtils]: 127: Hoare triple {121694#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,934 INFO L290 TraceCheckUtils]: 128: Hoare triple {121694#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,934 INFO L290 TraceCheckUtils]: 129: Hoare triple {121694#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,934 INFO L290 TraceCheckUtils]: 130: Hoare triple {121694#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,934 INFO L290 TraceCheckUtils]: 131: Hoare triple {121694#true} assume 4385 == #t~mem57;havoc #t~mem57; {121694#true} is VALID [2022-04-15 11:44:08,934 INFO L290 TraceCheckUtils]: 132: Hoare triple {121694#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {121694#true} is VALID [2022-04-15 11:44:08,934 INFO L290 TraceCheckUtils]: 133: Hoare triple {121694#true} assume !(1 == ~blastFlag~0); {121694#true} is VALID [2022-04-15 11:44:08,934 INFO L290 TraceCheckUtils]: 134: Hoare triple {121694#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {121694#true} is VALID [2022-04-15 11:44:08,934 INFO L290 TraceCheckUtils]: 135: Hoare triple {121694#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {121694#true} is VALID [2022-04-15 11:44:08,935 INFO L290 TraceCheckUtils]: 136: Hoare triple {121694#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:08,936 INFO L290 TraceCheckUtils]: 137: Hoare triple {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:08,936 INFO L290 TraceCheckUtils]: 138: Hoare triple {121699#(= 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); {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:08,936 INFO L290 TraceCheckUtils]: 139: Hoare triple {121699#(= 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; {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:08,937 INFO L290 TraceCheckUtils]: 140: Hoare triple {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:08,937 INFO L290 TraceCheckUtils]: 141: Hoare triple {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:08,937 INFO L290 TraceCheckUtils]: 142: Hoare triple {121699#(= 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); {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:08,937 INFO L290 TraceCheckUtils]: 143: Hoare triple {121699#(= 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); {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:08,938 INFO L290 TraceCheckUtils]: 144: Hoare triple {121699#(= 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); {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:08,938 INFO L290 TraceCheckUtils]: 145: Hoare triple {121699#(= 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); {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:08,938 INFO L290 TraceCheckUtils]: 146: Hoare triple {121699#(= 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); {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:08,939 INFO L290 TraceCheckUtils]: 147: Hoare triple {121699#(= 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); {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:08,939 INFO L290 TraceCheckUtils]: 148: Hoare triple {121699#(= 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); {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:08,939 INFO L290 TraceCheckUtils]: 149: Hoare triple {121699#(= 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); {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:08,939 INFO L290 TraceCheckUtils]: 150: Hoare triple {121699#(= 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); {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:08,940 INFO L290 TraceCheckUtils]: 151: Hoare triple {121699#(= 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); {121700#(= |ssl3_connect_#t~mem58| 4400)} is VALID [2022-04-15 11:44:08,940 INFO L290 TraceCheckUtils]: 152: Hoare triple {121700#(= |ssl3_connect_#t~mem58| 4400)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {121695#false} is VALID [2022-04-15 11:44:08,940 INFO L290 TraceCheckUtils]: 153: Hoare triple {121695#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {121695#false} is VALID [2022-04-15 11:44:08,940 INFO L290 TraceCheckUtils]: 154: Hoare triple {121695#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {121695#false} is VALID [2022-04-15 11:44:08,940 INFO L290 TraceCheckUtils]: 155: Hoare triple {121695#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {121695#false} is VALID [2022-04-15 11:44:08,940 INFO L290 TraceCheckUtils]: 156: Hoare triple {121695#false} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {121695#false} is VALID [2022-04-15 11:44:08,940 INFO L290 TraceCheckUtils]: 157: Hoare triple {121695#false} assume 4433 == #t~mem63;havoc #t~mem63; {121695#false} is VALID [2022-04-15 11:44:08,940 INFO L290 TraceCheckUtils]: 158: Hoare triple {121695#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {121695#false} is VALID [2022-04-15 11:44:08,941 INFO L290 TraceCheckUtils]: 159: Hoare triple {121695#false} assume 5 == ~blastFlag~0; {121695#false} is VALID [2022-04-15 11:44:08,941 INFO L290 TraceCheckUtils]: 160: Hoare triple {121695#false} assume !false; {121695#false} is VALID [2022-04-15 11:44:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2022-04-15 11:44:08,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:08,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158747903] [2022-04-15 11:44:08,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158747903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:08,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:08,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:08,942 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:08,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1330681427] [2022-04-15 11:44:08,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1330681427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:08,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:08,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:08,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948250473] [2022-04-15 11:44:08,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:08,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 161 [2022-04-15 11:44:08,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:08,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:09,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:09,013 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:44:09,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:09,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:44:09,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:44:09,014 INFO L87 Difference]: Start difference. First operand 1011 states and 1444 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:11,035 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:44:12,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:12,809 INFO L93 Difference]: Finished difference Result 2177 states and 3095 transitions. [2022-04-15 11:44:12,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:44:12,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 161 [2022-04-15 11:44:12,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:12,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:12,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 393 transitions. [2022-04-15 11:44:12,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:12,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 393 transitions. [2022-04-15 11:44:12,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 393 transitions. [2022-04-15 11:44:13,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 393 edges. 393 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:13,106 INFO L225 Difference]: With dead ends: 2177 [2022-04-15 11:44:13,106 INFO L226 Difference]: Without dead ends: 1182 [2022-04-15 11:44:13,107 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:44:13,107 INFO L913 BasicCegarLoop]: 201 mSDtfsCounter, 34 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:44:13,108 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 492 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 374 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:44:13,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2022-04-15 11:44:13,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1095. [2022-04-15 11:44:13,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:13,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1182 states. Second operand has 1095 states, 1090 states have (on average 1.4275229357798165) internal successors, (1556), 1090 states have internal predecessors, (1556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:13,677 INFO L74 IsIncluded]: Start isIncluded. First operand 1182 states. Second operand has 1095 states, 1090 states have (on average 1.4275229357798165) internal successors, (1556), 1090 states have internal predecessors, (1556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:13,677 INFO L87 Difference]: Start difference. First operand 1182 states. Second operand has 1095 states, 1090 states have (on average 1.4275229357798165) internal successors, (1556), 1090 states have internal predecessors, (1556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:13,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:13,713 INFO L93 Difference]: Finished difference Result 1182 states and 1667 transitions. [2022-04-15 11:44:13,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1667 transitions. [2022-04-15 11:44:13,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:13,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:13,715 INFO L74 IsIncluded]: Start isIncluded. First operand has 1095 states, 1090 states have (on average 1.4275229357798165) internal successors, (1556), 1090 states have internal predecessors, (1556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1182 states. [2022-04-15 11:44:13,716 INFO L87 Difference]: Start difference. First operand has 1095 states, 1090 states have (on average 1.4275229357798165) internal successors, (1556), 1090 states have internal predecessors, (1556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1182 states. [2022-04-15 11:44:13,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:13,751 INFO L93 Difference]: Finished difference Result 1182 states and 1667 transitions. [2022-04-15 11:44:13,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1667 transitions. [2022-04-15 11:44:13,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:13,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:13,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:13,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:13,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 1090 states have (on average 1.4275229357798165) internal successors, (1556), 1090 states have internal predecessors, (1556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:13,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1560 transitions. [2022-04-15 11:44:13,799 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1560 transitions. Word has length 161 [2022-04-15 11:44:13,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:13,800 INFO L478 AbstractCegarLoop]: Abstraction has 1095 states and 1560 transitions. [2022-04-15 11:44:13,800 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:13,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1095 states and 1560 transitions. [2022-04-15 11:44:15,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1560 edges. 1560 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:15,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1560 transitions. [2022-04-15 11:44:15,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-04-15 11:44:15,432 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:15,432 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:44:15,432 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 11:44:15,432 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:15,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:15,432 INFO L85 PathProgramCache]: Analyzing trace with hash 753979462, now seen corresponding path program 1 times [2022-04-15 11:44:15,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:15,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1208192147] [2022-04-15 11:44:28,477 WARN L232 SmtUtils]: Spent 8.49s 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-15 11:44:35,565 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:44:35,565 INFO L85 PathProgramCache]: Analyzing trace with hash 753979462, now seen corresponding path program 2 times [2022-04-15 11:44:35,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:35,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924832975] [2022-04-15 11:44:35,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:35,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:35,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:35,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {130622#(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); {130614#true} is VALID [2022-04-15 11:44:35,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {130614#true} assume true; {130614#true} is VALID [2022-04-15 11:44:35,773 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {130614#true} {130614#true} #593#return; {130614#true} is VALID [2022-04-15 11:44:35,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {130614#true} call ULTIMATE.init(); {130622#(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-15 11:44:35,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {130622#(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); {130614#true} is VALID [2022-04-15 11:44:35,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {130614#true} assume true; {130614#true} is VALID [2022-04-15 11:44:35,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {130614#true} {130614#true} #593#return; {130614#true} is VALID [2022-04-15 11:44:35,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {130614#true} call #t~ret158 := main(); {130614#true} is VALID [2022-04-15 11:44:35,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {130614#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; {130614#true} is VALID [2022-04-15 11:44:35,774 INFO L272 TraceCheckUtils]: 6: Hoare triple {130614#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {130614#true} is VALID [2022-04-15 11:44:35,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:44:35,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {130614#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; {130614#true} is VALID [2022-04-15 11:44:35,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {130614#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; {130614#true} is VALID [2022-04-15 11:44:35,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {130614#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {130614#true} is VALID [2022-04-15 11:44:35,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-15 11:44:35,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:44:35,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {130614#true} assume 12292 == #t~mem49;havoc #t~mem49; {130614#true} is VALID [2022-04-15 11:44:35,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {130614#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; {130614#true} is VALID [2022-04-15 11:44:35,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {130614#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:44:35,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {130614#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {130614#true} is VALID [2022-04-15 11:44:35,775 INFO L290 TraceCheckUtils]: 17: Hoare triple {130614#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:44:35,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:44:35,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {130614#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {130614#true} is VALID [2022-04-15 11:44:35,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {130614#true} assume !(0 == ~tmp___4~0); {130614#true} is VALID [2022-04-15 11:44:35,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:44:35,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:44:35,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {130614#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130614#true} is VALID [2022-04-15 11:44:35,775 INFO L290 TraceCheckUtils]: 24: Hoare triple {130614#true} ~skip~0 := 0; {130614#true} is VALID [2022-04-15 11:44:35,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-15 11:44:35,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:44:35,775 INFO L290 TraceCheckUtils]: 27: Hoare triple {130614#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:44:35,775 INFO L290 TraceCheckUtils]: 28: Hoare triple {130614#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:44:35,775 INFO L290 TraceCheckUtils]: 29: Hoare triple {130614#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:44:35,775 INFO L290 TraceCheckUtils]: 30: Hoare triple {130614#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:44:35,776 INFO L290 TraceCheckUtils]: 31: Hoare triple {130614#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:44:35,776 INFO L290 TraceCheckUtils]: 32: Hoare triple {130614#true} assume 4368 == #t~mem54;havoc #t~mem54; {130614#true} is VALID [2022-04-15 11:44:35,776 INFO L290 TraceCheckUtils]: 33: Hoare triple {130614#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; {130614#true} is VALID [2022-04-15 11:44:35,776 INFO L290 TraceCheckUtils]: 34: Hoare triple {130614#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {130614#true} is VALID [2022-04-15 11:44:35,776 INFO L290 TraceCheckUtils]: 35: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:44:35,776 INFO L290 TraceCheckUtils]: 36: Hoare triple {130614#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; {130614#true} is VALID [2022-04-15 11:44:35,776 INFO L290 TraceCheckUtils]: 37: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:44:35,776 INFO L290 TraceCheckUtils]: 38: Hoare triple {130614#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130614#true} is VALID [2022-04-15 11:44:35,776 INFO L290 TraceCheckUtils]: 39: Hoare triple {130614#true} ~skip~0 := 0; {130614#true} is VALID [2022-04-15 11:44:35,776 INFO L290 TraceCheckUtils]: 40: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-15 11:44:35,776 INFO L290 TraceCheckUtils]: 41: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:44:35,776 INFO L290 TraceCheckUtils]: 42: Hoare triple {130614#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:44:35,776 INFO L290 TraceCheckUtils]: 43: Hoare triple {130614#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:44:35,776 INFO L290 TraceCheckUtils]: 44: Hoare triple {130614#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:44:35,776 INFO L290 TraceCheckUtils]: 45: Hoare triple {130614#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:44:35,777 INFO L290 TraceCheckUtils]: 46: Hoare triple {130614#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:44:35,777 INFO L290 TraceCheckUtils]: 47: Hoare triple {130614#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:44:35,777 INFO L290 TraceCheckUtils]: 48: Hoare triple {130614#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:44:35,777 INFO L290 TraceCheckUtils]: 49: Hoare triple {130614#true} assume 4384 == #t~mem56;havoc #t~mem56; {130614#true} is VALID [2022-04-15 11:44:35,777 INFO L290 TraceCheckUtils]: 50: Hoare triple {130614#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {130614#true} is VALID [2022-04-15 11:44:35,777 INFO L290 TraceCheckUtils]: 51: Hoare triple {130614#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {130614#true} is VALID [2022-04-15 11:44:35,777 INFO L290 TraceCheckUtils]: 52: Hoare triple {130614#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {130619#(= |ssl3_connect_#t~mem93| (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:35,778 INFO L290 TraceCheckUtils]: 53: Hoare triple {130619#(= |ssl3_connect_#t~mem93| (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)))} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,779 INFO L290 TraceCheckUtils]: 54: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,779 INFO L290 TraceCheckUtils]: 55: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,779 INFO L290 TraceCheckUtils]: 56: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,779 INFO L290 TraceCheckUtils]: 57: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,780 INFO L290 TraceCheckUtils]: 58: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,780 INFO L290 TraceCheckUtils]: 59: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,780 INFO L290 TraceCheckUtils]: 60: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,781 INFO L290 TraceCheckUtils]: 61: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,781 INFO L290 TraceCheckUtils]: 62: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,781 INFO L290 TraceCheckUtils]: 63: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,781 INFO L290 TraceCheckUtils]: 64: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,782 INFO L290 TraceCheckUtils]: 65: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,782 INFO L290 TraceCheckUtils]: 66: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,782 INFO L290 TraceCheckUtils]: 67: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,782 INFO L290 TraceCheckUtils]: 68: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,783 INFO L290 TraceCheckUtils]: 69: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4400 == #t~mem58;havoc #t~mem58; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,783 INFO L290 TraceCheckUtils]: 70: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} 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); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,783 INFO L290 TraceCheckUtils]: 71: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} 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; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,784 INFO L290 TraceCheckUtils]: 72: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,784 INFO L290 TraceCheckUtils]: 73: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,785 INFO L290 TraceCheckUtils]: 74: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,785 INFO L290 TraceCheckUtils]: 75: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,785 INFO L290 TraceCheckUtils]: 76: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,786 INFO L290 TraceCheckUtils]: 77: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,786 INFO L290 TraceCheckUtils]: 78: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,786 INFO L290 TraceCheckUtils]: 79: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,786 INFO L290 TraceCheckUtils]: 80: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,787 INFO L290 TraceCheckUtils]: 81: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,787 INFO L290 TraceCheckUtils]: 82: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,787 INFO L290 TraceCheckUtils]: 83: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,788 INFO L290 TraceCheckUtils]: 84: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,788 INFO L290 TraceCheckUtils]: 85: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,788 INFO L290 TraceCheckUtils]: 86: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,788 INFO L290 TraceCheckUtils]: 87: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,789 INFO L290 TraceCheckUtils]: 88: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,789 INFO L290 TraceCheckUtils]: 89: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,789 INFO L290 TraceCheckUtils]: 90: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,789 INFO L290 TraceCheckUtils]: 91: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4416 == #t~mem60;havoc #t~mem60; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,790 INFO L290 TraceCheckUtils]: 92: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,790 INFO L290 TraceCheckUtils]: 93: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,791 INFO L290 TraceCheckUtils]: 94: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,791 INFO L290 TraceCheckUtils]: 95: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == ~tmp___6~0); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,791 INFO L290 TraceCheckUtils]: 96: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,792 INFO L290 TraceCheckUtils]: 97: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,792 INFO L290 TraceCheckUtils]: 98: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,792 INFO L290 TraceCheckUtils]: 99: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,793 INFO L290 TraceCheckUtils]: 100: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,793 INFO L290 TraceCheckUtils]: 101: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,793 INFO L290 TraceCheckUtils]: 102: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,793 INFO L290 TraceCheckUtils]: 103: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,794 INFO L290 TraceCheckUtils]: 104: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,794 INFO L290 TraceCheckUtils]: 105: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,794 INFO L290 TraceCheckUtils]: 106: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,794 INFO L290 TraceCheckUtils]: 107: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,795 INFO L290 TraceCheckUtils]: 108: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,795 INFO L290 TraceCheckUtils]: 109: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,795 INFO L290 TraceCheckUtils]: 110: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,795 INFO L290 TraceCheckUtils]: 111: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,796 INFO L290 TraceCheckUtils]: 112: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,796 INFO L290 TraceCheckUtils]: 113: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,796 INFO L290 TraceCheckUtils]: 114: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4432 == #t~mem62;havoc #t~mem62; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,796 INFO L290 TraceCheckUtils]: 115: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,797 INFO L290 TraceCheckUtils]: 116: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(5 == ~blastFlag~0); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,798 INFO L290 TraceCheckUtils]: 117: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,798 INFO L290 TraceCheckUtils]: 118: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,798 INFO L290 TraceCheckUtils]: 119: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,798 INFO L290 TraceCheckUtils]: 120: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,799 INFO L290 TraceCheckUtils]: 121: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,799 INFO L290 TraceCheckUtils]: 122: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,799 INFO L290 TraceCheckUtils]: 123: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,799 INFO L290 TraceCheckUtils]: 124: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,800 INFO L290 TraceCheckUtils]: 125: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,800 INFO L290 TraceCheckUtils]: 126: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,800 INFO L290 TraceCheckUtils]: 127: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,801 INFO L290 TraceCheckUtils]: 128: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,801 INFO L290 TraceCheckUtils]: 129: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,801 INFO L290 TraceCheckUtils]: 130: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,801 INFO L290 TraceCheckUtils]: 131: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4385 == #t~mem57;havoc #t~mem57; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,802 INFO L290 TraceCheckUtils]: 132: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,802 INFO L290 TraceCheckUtils]: 133: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(1 == ~blastFlag~0); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,802 INFO L290 TraceCheckUtils]: 134: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-15 11:44:35,802 INFO L290 TraceCheckUtils]: 135: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {130621#(= |ssl3_connect_#t~mem93| 0)} is VALID [2022-04-15 11:44:35,803 INFO L290 TraceCheckUtils]: 136: Hoare triple {130621#(= |ssl3_connect_#t~mem93| 0)} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-15 11:44:35,803 INFO L290 TraceCheckUtils]: 137: Hoare triple {130615#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {130615#false} is VALID [2022-04-15 11:44:35,803 INFO L290 TraceCheckUtils]: 138: Hoare triple {130615#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); {130615#false} is VALID [2022-04-15 11:44:35,803 INFO L290 TraceCheckUtils]: 139: Hoare triple {130615#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130615#false} is VALID [2022-04-15 11:44:35,803 INFO L290 TraceCheckUtils]: 140: Hoare triple {130615#false} ~skip~0 := 0; {130615#false} is VALID [2022-04-15 11:44:35,803 INFO L290 TraceCheckUtils]: 141: Hoare triple {130615#false} assume !false; {130615#false} is VALID [2022-04-15 11:44:35,803 INFO L290 TraceCheckUtils]: 142: Hoare triple {130615#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); {130615#false} is VALID [2022-04-15 11:44:35,803 INFO L290 TraceCheckUtils]: 143: Hoare triple {130615#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-15 11:44:35,803 INFO L290 TraceCheckUtils]: 144: Hoare triple {130615#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-15 11:44:35,803 INFO L290 TraceCheckUtils]: 145: Hoare triple {130615#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-15 11:44:35,803 INFO L290 TraceCheckUtils]: 146: Hoare triple {130615#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-15 11:44:35,803 INFO L290 TraceCheckUtils]: 147: Hoare triple {130615#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-15 11:44:35,804 INFO L290 TraceCheckUtils]: 148: Hoare triple {130615#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-15 11:44:35,804 INFO L290 TraceCheckUtils]: 149: Hoare triple {130615#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-15 11:44:35,804 INFO L290 TraceCheckUtils]: 150: Hoare triple {130615#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-15 11:44:35,804 INFO L290 TraceCheckUtils]: 151: Hoare triple {130615#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-15 11:44:35,804 INFO L290 TraceCheckUtils]: 152: Hoare triple {130615#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-15 11:44:35,804 INFO L290 TraceCheckUtils]: 153: Hoare triple {130615#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-15 11:44:35,804 INFO L290 TraceCheckUtils]: 154: Hoare triple {130615#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-15 11:44:35,804 INFO L290 TraceCheckUtils]: 155: Hoare triple {130615#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-15 11:44:35,804 INFO L290 TraceCheckUtils]: 156: Hoare triple {130615#false} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-15 11:44:35,804 INFO L290 TraceCheckUtils]: 157: Hoare triple {130615#false} assume 4433 == #t~mem63;havoc #t~mem63; {130615#false} is VALID [2022-04-15 11:44:35,804 INFO L290 TraceCheckUtils]: 158: Hoare triple {130615#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {130615#false} is VALID [2022-04-15 11:44:35,804 INFO L290 TraceCheckUtils]: 159: Hoare triple {130615#false} assume 5 == ~blastFlag~0; {130615#false} is VALID [2022-04-15 11:44:35,804 INFO L290 TraceCheckUtils]: 160: Hoare triple {130615#false} assume !false; {130615#false} is VALID [2022-04-15 11:44:35,805 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 206 proven. 1 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-04-15 11:44:35,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:35,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924832975] [2022-04-15 11:44:35,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924832975] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:44:35,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222263489] [2022-04-15 11:44:35,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:44:35,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:44:35,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:44:35,806 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-15 11:44:35,807 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-15 11:45:50,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:45:50,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:45:50,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 1467 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 11:45:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:50,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:45:50,773 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-15 11:45:50,773 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-15 11:45:50,775 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-15 11:45:50,778 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-15 11:45:50,783 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-15 11:45:50,869 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-04-15 11:45:50,877 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-15 11:45:50,912 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-15 11:45:50,912 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-15 11:45:51,111 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 0 case distinctions, treesize of input 13 treesize of output 9 [2022-04-15 11:45:51,141 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-15 11:45:51,141 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-15 11:45:51,241 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-15 11:45:51,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {130614#true} call ULTIMATE.init(); {130614#true} is VALID [2022-04-15 11:45:51,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {130614#true} assume true; {130614#true} is VALID [2022-04-15 11:45:51,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {130614#true} {130614#true} #593#return; {130614#true} is VALID [2022-04-15 11:45:51,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {130614#true} call #t~ret158 := main(); {130614#true} is VALID [2022-04-15 11:45:51,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {130614#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; {130614#true} is VALID [2022-04-15 11:45:51,261 INFO L272 TraceCheckUtils]: 6: Hoare triple {130614#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {130614#true} is VALID [2022-04-15 11:45:51,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {130614#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; {130614#true} is VALID [2022-04-15 11:45:51,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {130614#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; {130614#true} is VALID [2022-04-15 11:45:51,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {130614#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {130614#true} is VALID [2022-04-15 11:45:51,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-15 11:45:51,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {130614#true} assume 12292 == #t~mem49;havoc #t~mem49; {130614#true} is VALID [2022-04-15 11:45:51,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {130614#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; {130614#true} is VALID [2022-04-15 11:45:51,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {130614#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {130614#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {130614#true} is VALID [2022-04-15 11:45:51,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {130614#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {130614#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {130614#true} is VALID [2022-04-15 11:45:51,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {130614#true} assume !(0 == ~tmp___4~0); {130614#true} is VALID [2022-04-15 11:45:51,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {130614#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); {130689#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {130689#(= 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); {130689#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {130689#(= 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; {130689#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {130689#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} ~skip~0 := 0; {130689#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,265 INFO L290 TraceCheckUtils]: 25: Hoare triple {130689#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !false; {130689#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {130689#(= 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); {130689#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {130689#(= 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); {130689#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,266 INFO L290 TraceCheckUtils]: 28: Hoare triple {130689#(= 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); {130689#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {130689#(= 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); {130689#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {130689#(= 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); {130689#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,267 INFO L290 TraceCheckUtils]: 31: Hoare triple {130689#(= 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); {130614#true} is VALID [2022-04-15 11:45:51,267 INFO L290 TraceCheckUtils]: 32: Hoare triple {130614#true} assume 4368 == #t~mem54;havoc #t~mem54; {130614#true} is VALID [2022-04-15 11:45:51,267 INFO L290 TraceCheckUtils]: 33: Hoare triple {130614#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; {130614#true} is VALID [2022-04-15 11:45:51,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {130614#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {130614#true} is VALID [2022-04-15 11:45:51,267 INFO L290 TraceCheckUtils]: 35: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,267 INFO L290 TraceCheckUtils]: 36: Hoare triple {130614#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; {130614#true} is VALID [2022-04-15 11:45:51,267 INFO L290 TraceCheckUtils]: 37: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,267 INFO L290 TraceCheckUtils]: 38: Hoare triple {130614#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130614#true} is VALID [2022-04-15 11:45:51,267 INFO L290 TraceCheckUtils]: 39: Hoare triple {130614#true} ~skip~0 := 0; {130614#true} is VALID [2022-04-15 11:45:51,267 INFO L290 TraceCheckUtils]: 40: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-15 11:45:51,267 INFO L290 TraceCheckUtils]: 41: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,267 INFO L290 TraceCheckUtils]: 42: Hoare triple {130614#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,267 INFO L290 TraceCheckUtils]: 43: Hoare triple {130614#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,267 INFO L290 TraceCheckUtils]: 44: Hoare triple {130614#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,268 INFO L290 TraceCheckUtils]: 45: Hoare triple {130614#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,268 INFO L290 TraceCheckUtils]: 46: Hoare triple {130614#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,268 INFO L290 TraceCheckUtils]: 47: Hoare triple {130614#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,268 INFO L290 TraceCheckUtils]: 48: Hoare triple {130614#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,268 INFO L290 TraceCheckUtils]: 49: Hoare triple {130614#true} assume 4384 == #t~mem56;havoc #t~mem56; {130614#true} is VALID [2022-04-15 11:45:51,268 INFO L290 TraceCheckUtils]: 50: Hoare triple {130614#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {130614#true} is VALID [2022-04-15 11:45:51,268 INFO L290 TraceCheckUtils]: 51: Hoare triple {130614#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {130614#true} is VALID [2022-04-15 11:45:51,268 INFO L290 TraceCheckUtils]: 52: Hoare triple {130614#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,268 INFO L290 TraceCheckUtils]: 53: Hoare triple {130614#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,268 INFO L290 TraceCheckUtils]: 54: Hoare triple {130614#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,268 INFO L290 TraceCheckUtils]: 55: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,268 INFO L290 TraceCheckUtils]: 56: Hoare triple {130614#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130614#true} is VALID [2022-04-15 11:45:51,268 INFO L290 TraceCheckUtils]: 57: Hoare triple {130614#true} ~skip~0 := 0; {130614#true} is VALID [2022-04-15 11:45:51,268 INFO L290 TraceCheckUtils]: 58: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-15 11:45:51,269 INFO L290 TraceCheckUtils]: 59: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,269 INFO L290 TraceCheckUtils]: 60: Hoare triple {130614#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,269 INFO L290 TraceCheckUtils]: 61: Hoare triple {130614#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,269 INFO L290 TraceCheckUtils]: 62: Hoare triple {130614#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,269 INFO L290 TraceCheckUtils]: 63: Hoare triple {130614#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,269 INFO L290 TraceCheckUtils]: 64: Hoare triple {130614#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,269 INFO L290 TraceCheckUtils]: 65: Hoare triple {130614#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,269 INFO L290 TraceCheckUtils]: 66: Hoare triple {130614#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,269 INFO L290 TraceCheckUtils]: 67: Hoare triple {130614#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,269 INFO L290 TraceCheckUtils]: 68: Hoare triple {130614#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,269 INFO L290 TraceCheckUtils]: 69: Hoare triple {130614#true} assume 4400 == #t~mem58;havoc #t~mem58; {130614#true} is VALID [2022-04-15 11:45:51,269 INFO L290 TraceCheckUtils]: 70: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,269 INFO L290 TraceCheckUtils]: 71: Hoare triple {130614#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; {130614#true} is VALID [2022-04-15 11:45:51,269 INFO L290 TraceCheckUtils]: 72: Hoare triple {130614#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {130614#true} is VALID [2022-04-15 11:45:51,269 INFO L290 TraceCheckUtils]: 73: Hoare triple {130614#true} assume !(~ret~0 <= 0); {130614#true} is VALID [2022-04-15 11:45:51,270 INFO L290 TraceCheckUtils]: 74: Hoare triple {130614#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,270 INFO L290 TraceCheckUtils]: 75: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,270 INFO L290 TraceCheckUtils]: 76: Hoare triple {130614#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130614#true} is VALID [2022-04-15 11:45:51,270 INFO L290 TraceCheckUtils]: 77: Hoare triple {130614#true} ~skip~0 := 0; {130614#true} is VALID [2022-04-15 11:45:51,270 INFO L290 TraceCheckUtils]: 78: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-15 11:45:51,270 INFO L290 TraceCheckUtils]: 79: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,270 INFO L290 TraceCheckUtils]: 80: Hoare triple {130614#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,270 INFO L290 TraceCheckUtils]: 81: Hoare triple {130614#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,270 INFO L290 TraceCheckUtils]: 82: Hoare triple {130614#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,270 INFO L290 TraceCheckUtils]: 83: Hoare triple {130614#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,270 INFO L290 TraceCheckUtils]: 84: Hoare triple {130614#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,270 INFO L290 TraceCheckUtils]: 85: Hoare triple {130614#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,270 INFO L290 TraceCheckUtils]: 86: Hoare triple {130614#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,270 INFO L290 TraceCheckUtils]: 87: Hoare triple {130614#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,270 INFO L290 TraceCheckUtils]: 88: Hoare triple {130614#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,271 INFO L290 TraceCheckUtils]: 89: Hoare triple {130614#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,271 INFO L290 TraceCheckUtils]: 90: Hoare triple {130614#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,271 INFO L290 TraceCheckUtils]: 91: Hoare triple {130614#true} assume 4416 == #t~mem60;havoc #t~mem60; {130614#true} is VALID [2022-04-15 11:45:51,271 INFO L290 TraceCheckUtils]: 92: Hoare triple {130614#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {130614#true} is VALID [2022-04-15 11:45:51,271 INFO L290 TraceCheckUtils]: 93: Hoare triple {130614#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {130614#true} is VALID [2022-04-15 11:45:51,271 INFO L290 TraceCheckUtils]: 94: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,271 INFO L290 TraceCheckUtils]: 95: Hoare triple {130614#true} assume !(0 == ~tmp___6~0); {130614#true} is VALID [2022-04-15 11:45:51,271 INFO L290 TraceCheckUtils]: 96: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,271 INFO L290 TraceCheckUtils]: 97: Hoare triple {130614#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130614#true} is VALID [2022-04-15 11:45:51,271 INFO L290 TraceCheckUtils]: 98: Hoare triple {130614#true} ~skip~0 := 0; {130614#true} is VALID [2022-04-15 11:45:51,271 INFO L290 TraceCheckUtils]: 99: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-15 11:45:51,271 INFO L290 TraceCheckUtils]: 100: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,271 INFO L290 TraceCheckUtils]: 101: Hoare triple {130614#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,271 INFO L290 TraceCheckUtils]: 102: Hoare triple {130614#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,272 INFO L290 TraceCheckUtils]: 103: Hoare triple {130614#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,272 INFO L290 TraceCheckUtils]: 104: Hoare triple {130614#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,272 INFO L290 TraceCheckUtils]: 105: Hoare triple {130614#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,272 INFO L290 TraceCheckUtils]: 106: Hoare triple {130614#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,272 INFO L290 TraceCheckUtils]: 107: Hoare triple {130614#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,272 INFO L290 TraceCheckUtils]: 108: Hoare triple {130614#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,272 INFO L290 TraceCheckUtils]: 109: Hoare triple {130614#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,272 INFO L290 TraceCheckUtils]: 110: Hoare triple {130614#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,272 INFO L290 TraceCheckUtils]: 111: Hoare triple {130614#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,272 INFO L290 TraceCheckUtils]: 112: Hoare triple {130614#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,272 INFO L290 TraceCheckUtils]: 113: Hoare triple {130614#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,272 INFO L290 TraceCheckUtils]: 114: Hoare triple {130614#true} assume 4432 == #t~mem62;havoc #t~mem62; {130614#true} is VALID [2022-04-15 11:45:51,272 INFO L290 TraceCheckUtils]: 115: Hoare triple {130614#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {130614#true} is VALID [2022-04-15 11:45:51,272 INFO L290 TraceCheckUtils]: 116: Hoare triple {130614#true} assume !(5 == ~blastFlag~0); {130614#true} is VALID [2022-04-15 11:45:51,272 INFO L290 TraceCheckUtils]: 117: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,273 INFO L290 TraceCheckUtils]: 118: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,273 INFO L290 TraceCheckUtils]: 119: Hoare triple {130614#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130614#true} is VALID [2022-04-15 11:45:51,273 INFO L290 TraceCheckUtils]: 120: Hoare triple {130614#true} ~skip~0 := 0; {130614#true} is VALID [2022-04-15 11:45:51,273 INFO L290 TraceCheckUtils]: 121: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-15 11:45:51,273 INFO L290 TraceCheckUtils]: 122: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,273 INFO L290 TraceCheckUtils]: 123: Hoare triple {130614#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,273 INFO L290 TraceCheckUtils]: 124: Hoare triple {130614#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,273 INFO L290 TraceCheckUtils]: 125: Hoare triple {130614#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,273 INFO L290 TraceCheckUtils]: 126: Hoare triple {130614#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,273 INFO L290 TraceCheckUtils]: 127: Hoare triple {130614#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,273 INFO L290 TraceCheckUtils]: 128: Hoare triple {130614#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,273 INFO L290 TraceCheckUtils]: 129: Hoare triple {130614#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,273 INFO L290 TraceCheckUtils]: 130: Hoare triple {130614#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,273 INFO L290 TraceCheckUtils]: 131: Hoare triple {130614#true} assume 4385 == #t~mem57;havoc #t~mem57; {130614#true} is VALID [2022-04-15 11:45:51,273 INFO L290 TraceCheckUtils]: 132: Hoare triple {130614#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {130614#true} is VALID [2022-04-15 11:45:51,274 INFO L290 TraceCheckUtils]: 133: Hoare triple {130614#true} assume !(1 == ~blastFlag~0); {130614#true} is VALID [2022-04-15 11:45:51,274 INFO L290 TraceCheckUtils]: 134: Hoare triple {130614#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {130614#true} is VALID [2022-04-15 11:45:51,274 INFO L290 TraceCheckUtils]: 135: Hoare triple {130614#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,274 INFO L290 TraceCheckUtils]: 136: Hoare triple {130614#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,275 INFO L290 TraceCheckUtils]: 137: Hoare triple {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,275 INFO L290 TraceCheckUtils]: 138: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,276 INFO L290 TraceCheckUtils]: 139: Hoare triple {131035#(<= 4560 (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; {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,276 INFO L290 TraceCheckUtils]: 140: Hoare triple {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,276 INFO L290 TraceCheckUtils]: 141: Hoare triple {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,276 INFO L290 TraceCheckUtils]: 142: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,277 INFO L290 TraceCheckUtils]: 143: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,277 INFO L290 TraceCheckUtils]: 144: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,277 INFO L290 TraceCheckUtils]: 145: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,277 INFO L290 TraceCheckUtils]: 146: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,278 INFO L290 TraceCheckUtils]: 147: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,278 INFO L290 TraceCheckUtils]: 148: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,278 INFO L290 TraceCheckUtils]: 149: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,278 INFO L290 TraceCheckUtils]: 150: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,279 INFO L290 TraceCheckUtils]: 151: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,279 INFO L290 TraceCheckUtils]: 152: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,279 INFO L290 TraceCheckUtils]: 153: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,279 INFO L290 TraceCheckUtils]: 154: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,280 INFO L290 TraceCheckUtils]: 155: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,280 INFO L290 TraceCheckUtils]: 156: Hoare triple {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {131096#(<= 4560 |ssl3_connect_#t~mem63|)} is VALID [2022-04-15 11:45:51,280 INFO L290 TraceCheckUtils]: 157: Hoare triple {131096#(<= 4560 |ssl3_connect_#t~mem63|)} assume 4433 == #t~mem63;havoc #t~mem63; {130615#false} is VALID [2022-04-15 11:45:51,280 INFO L290 TraceCheckUtils]: 158: Hoare triple {130615#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {130615#false} is VALID [2022-04-15 11:45:51,281 INFO L290 TraceCheckUtils]: 159: Hoare triple {130615#false} assume 5 == ~blastFlag~0; {130615#false} is VALID [2022-04-15 11:45:51,281 INFO L290 TraceCheckUtils]: 160: Hoare triple {130615#false} assume !false; {130615#false} is VALID [2022-04-15 11:45:51,281 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 88 proven. 60 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-04-15 11:45:51,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:45:51,563 INFO L290 TraceCheckUtils]: 160: Hoare triple {130615#false} assume !false; {130615#false} is VALID [2022-04-15 11:45:51,563 INFO L290 TraceCheckUtils]: 159: Hoare triple {130615#false} assume 5 == ~blastFlag~0; {130615#false} is VALID [2022-04-15 11:45:51,564 INFO L290 TraceCheckUtils]: 158: Hoare triple {130615#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {130615#false} is VALID [2022-04-15 11:45:51,564 INFO L290 TraceCheckUtils]: 157: Hoare triple {131118#(not (<= |ssl3_connect_#t~mem63| 4433))} assume 4433 == #t~mem63;havoc #t~mem63; {130615#false} is VALID [2022-04-15 11:45:51,564 INFO L290 TraceCheckUtils]: 156: Hoare triple {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {131118#(not (<= |ssl3_connect_#t~mem63| 4433))} is VALID [2022-04-15 11:45:51,564 INFO L290 TraceCheckUtils]: 155: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,565 INFO L290 TraceCheckUtils]: 154: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,565 INFO L290 TraceCheckUtils]: 153: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,565 INFO L290 TraceCheckUtils]: 152: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,566 INFO L290 TraceCheckUtils]: 151: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,566 INFO L290 TraceCheckUtils]: 150: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,566 INFO L290 TraceCheckUtils]: 149: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,566 INFO L290 TraceCheckUtils]: 148: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,567 INFO L290 TraceCheckUtils]: 147: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,567 INFO L290 TraceCheckUtils]: 146: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,567 INFO L290 TraceCheckUtils]: 145: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,567 INFO L290 TraceCheckUtils]: 144: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,568 INFO L290 TraceCheckUtils]: 143: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,568 INFO L290 TraceCheckUtils]: 142: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,568 INFO L290 TraceCheckUtils]: 141: Hoare triple {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,568 INFO L290 TraceCheckUtils]: 140: Hoare triple {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,569 INFO L290 TraceCheckUtils]: 139: Hoare triple {131122#(< 4433 (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; {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,569 INFO L290 TraceCheckUtils]: 138: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,570 INFO L290 TraceCheckUtils]: 137: Hoare triple {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,570 INFO L290 TraceCheckUtils]: 136: Hoare triple {130614#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:51,570 INFO L290 TraceCheckUtils]: 135: Hoare triple {130614#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,571 INFO L290 TraceCheckUtils]: 134: Hoare triple {130614#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {130614#true} is VALID [2022-04-15 11:45:51,571 INFO L290 TraceCheckUtils]: 133: Hoare triple {130614#true} assume !(1 == ~blastFlag~0); {130614#true} is VALID [2022-04-15 11:45:51,571 INFO L290 TraceCheckUtils]: 132: Hoare triple {130614#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {130614#true} is VALID [2022-04-15 11:45:51,571 INFO L290 TraceCheckUtils]: 131: Hoare triple {130614#true} assume 4385 == #t~mem57;havoc #t~mem57; {130614#true} is VALID [2022-04-15 11:45:51,571 INFO L290 TraceCheckUtils]: 130: Hoare triple {130614#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,571 INFO L290 TraceCheckUtils]: 129: Hoare triple {130614#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,572 INFO L290 TraceCheckUtils]: 128: Hoare triple {130614#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,572 INFO L290 TraceCheckUtils]: 127: Hoare triple {130614#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,572 INFO L290 TraceCheckUtils]: 126: Hoare triple {130614#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,572 INFO L290 TraceCheckUtils]: 125: Hoare triple {130614#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,572 INFO L290 TraceCheckUtils]: 124: Hoare triple {130614#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,572 INFO L290 TraceCheckUtils]: 123: Hoare triple {130614#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,572 INFO L290 TraceCheckUtils]: 122: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,572 INFO L290 TraceCheckUtils]: 121: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-15 11:45:51,572 INFO L290 TraceCheckUtils]: 120: Hoare triple {130614#true} ~skip~0 := 0; {130614#true} is VALID [2022-04-15 11:45:51,572 INFO L290 TraceCheckUtils]: 119: Hoare triple {130614#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130614#true} is VALID [2022-04-15 11:45:51,572 INFO L290 TraceCheckUtils]: 118: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,572 INFO L290 TraceCheckUtils]: 117: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,572 INFO L290 TraceCheckUtils]: 116: Hoare triple {130614#true} assume !(5 == ~blastFlag~0); {130614#true} is VALID [2022-04-15 11:45:51,572 INFO L290 TraceCheckUtils]: 115: Hoare triple {130614#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {130614#true} is VALID [2022-04-15 11:45:51,573 INFO L290 TraceCheckUtils]: 114: Hoare triple {130614#true} assume 4432 == #t~mem62;havoc #t~mem62; {130614#true} is VALID [2022-04-15 11:45:51,573 INFO L290 TraceCheckUtils]: 113: Hoare triple {130614#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,573 INFO L290 TraceCheckUtils]: 112: Hoare triple {130614#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,573 INFO L290 TraceCheckUtils]: 111: Hoare triple {130614#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,573 INFO L290 TraceCheckUtils]: 110: Hoare triple {130614#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,573 INFO L290 TraceCheckUtils]: 109: Hoare triple {130614#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,573 INFO L290 TraceCheckUtils]: 108: Hoare triple {130614#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,573 INFO L290 TraceCheckUtils]: 107: Hoare triple {130614#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,573 INFO L290 TraceCheckUtils]: 106: Hoare triple {130614#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,573 INFO L290 TraceCheckUtils]: 105: Hoare triple {130614#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,573 INFO L290 TraceCheckUtils]: 104: Hoare triple {130614#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,573 INFO L290 TraceCheckUtils]: 103: Hoare triple {130614#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,573 INFO L290 TraceCheckUtils]: 102: Hoare triple {130614#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,573 INFO L290 TraceCheckUtils]: 101: Hoare triple {130614#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,573 INFO L290 TraceCheckUtils]: 100: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,574 INFO L290 TraceCheckUtils]: 99: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-15 11:45:51,574 INFO L290 TraceCheckUtils]: 98: Hoare triple {130614#true} ~skip~0 := 0; {130614#true} is VALID [2022-04-15 11:45:51,574 INFO L290 TraceCheckUtils]: 97: Hoare triple {130614#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130614#true} is VALID [2022-04-15 11:45:51,574 INFO L290 TraceCheckUtils]: 96: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,574 INFO L290 TraceCheckUtils]: 95: Hoare triple {130614#true} assume !(0 == ~tmp___6~0); {130614#true} is VALID [2022-04-15 11:45:51,574 INFO L290 TraceCheckUtils]: 94: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,574 INFO L290 TraceCheckUtils]: 93: Hoare triple {130614#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {130614#true} is VALID [2022-04-15 11:45:51,574 INFO L290 TraceCheckUtils]: 92: Hoare triple {130614#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {130614#true} is VALID [2022-04-15 11:45:51,574 INFO L290 TraceCheckUtils]: 91: Hoare triple {130614#true} assume 4416 == #t~mem60;havoc #t~mem60; {130614#true} is VALID [2022-04-15 11:45:51,574 INFO L290 TraceCheckUtils]: 90: Hoare triple {130614#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,574 INFO L290 TraceCheckUtils]: 89: Hoare triple {130614#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,574 INFO L290 TraceCheckUtils]: 88: Hoare triple {130614#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,574 INFO L290 TraceCheckUtils]: 87: Hoare triple {130614#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,575 INFO L290 TraceCheckUtils]: 86: Hoare triple {130614#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,575 INFO L290 TraceCheckUtils]: 85: Hoare triple {130614#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,575 INFO L290 TraceCheckUtils]: 84: Hoare triple {130614#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,575 INFO L290 TraceCheckUtils]: 83: Hoare triple {130614#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,575 INFO L290 TraceCheckUtils]: 82: Hoare triple {130614#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,575 INFO L290 TraceCheckUtils]: 81: Hoare triple {130614#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,575 INFO L290 TraceCheckUtils]: 80: Hoare triple {130614#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,575 INFO L290 TraceCheckUtils]: 79: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,575 INFO L290 TraceCheckUtils]: 78: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-15 11:45:51,575 INFO L290 TraceCheckUtils]: 77: Hoare triple {130614#true} ~skip~0 := 0; {130614#true} is VALID [2022-04-15 11:45:51,575 INFO L290 TraceCheckUtils]: 76: Hoare triple {130614#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130614#true} is VALID [2022-04-15 11:45:51,575 INFO L290 TraceCheckUtils]: 75: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,576 INFO L290 TraceCheckUtils]: 74: Hoare triple {130614#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,576 INFO L290 TraceCheckUtils]: 73: Hoare triple {130614#true} assume !(~ret~0 <= 0); {130614#true} is VALID [2022-04-15 11:45:51,576 INFO L290 TraceCheckUtils]: 72: Hoare triple {130614#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {130614#true} is VALID [2022-04-15 11:45:51,576 INFO L290 TraceCheckUtils]: 71: Hoare triple {130614#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; {130614#true} is VALID [2022-04-15 11:45:51,576 INFO L290 TraceCheckUtils]: 70: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,576 INFO L290 TraceCheckUtils]: 69: Hoare triple {130614#true} assume 4400 == #t~mem58;havoc #t~mem58; {130614#true} is VALID [2022-04-15 11:45:51,576 INFO L290 TraceCheckUtils]: 68: Hoare triple {130614#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,576 INFO L290 TraceCheckUtils]: 67: Hoare triple {130614#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,576 INFO L290 TraceCheckUtils]: 66: Hoare triple {130614#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,576 INFO L290 TraceCheckUtils]: 65: Hoare triple {130614#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,576 INFO L290 TraceCheckUtils]: 64: Hoare triple {130614#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,576 INFO L290 TraceCheckUtils]: 63: Hoare triple {130614#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,576 INFO L290 TraceCheckUtils]: 62: Hoare triple {130614#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,576 INFO L290 TraceCheckUtils]: 61: Hoare triple {130614#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,576 INFO L290 TraceCheckUtils]: 60: Hoare triple {130614#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,577 INFO L290 TraceCheckUtils]: 59: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,577 INFO L290 TraceCheckUtils]: 58: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-15 11:45:51,577 INFO L290 TraceCheckUtils]: 57: Hoare triple {130614#true} ~skip~0 := 0; {130614#true} is VALID [2022-04-15 11:45:51,577 INFO L290 TraceCheckUtils]: 56: Hoare triple {130614#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130614#true} is VALID [2022-04-15 11:45:51,577 INFO L290 TraceCheckUtils]: 55: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,577 INFO L290 TraceCheckUtils]: 54: Hoare triple {130614#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,577 INFO L290 TraceCheckUtils]: 53: Hoare triple {130614#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,577 INFO L290 TraceCheckUtils]: 52: Hoare triple {130614#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,577 INFO L290 TraceCheckUtils]: 51: Hoare triple {130614#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {130614#true} is VALID [2022-04-15 11:45:51,577 INFO L290 TraceCheckUtils]: 50: Hoare triple {130614#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {130614#true} is VALID [2022-04-15 11:45:51,577 INFO L290 TraceCheckUtils]: 49: Hoare triple {130614#true} assume 4384 == #t~mem56;havoc #t~mem56; {130614#true} is VALID [2022-04-15 11:45:51,577 INFO L290 TraceCheckUtils]: 48: Hoare triple {130614#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,577 INFO L290 TraceCheckUtils]: 47: Hoare triple {130614#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,577 INFO L290 TraceCheckUtils]: 46: Hoare triple {130614#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,578 INFO L290 TraceCheckUtils]: 45: Hoare triple {130614#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,578 INFO L290 TraceCheckUtils]: 44: Hoare triple {130614#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,578 INFO L290 TraceCheckUtils]: 43: Hoare triple {130614#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,578 INFO L290 TraceCheckUtils]: 42: Hoare triple {130614#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,578 INFO L290 TraceCheckUtils]: 41: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,578 INFO L290 TraceCheckUtils]: 40: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-15 11:45:51,578 INFO L290 TraceCheckUtils]: 39: Hoare triple {130614#true} ~skip~0 := 0; {130614#true} is VALID [2022-04-15 11:45:51,578 INFO L290 TraceCheckUtils]: 38: Hoare triple {130614#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130614#true} is VALID [2022-04-15 11:45:51,578 INFO L290 TraceCheckUtils]: 37: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,578 INFO L290 TraceCheckUtils]: 36: Hoare triple {130614#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; {130614#true} is VALID [2022-04-15 11:45:51,578 INFO L290 TraceCheckUtils]: 35: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,578 INFO L290 TraceCheckUtils]: 34: Hoare triple {130614#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {130614#true} is VALID [2022-04-15 11:45:51,578 INFO L290 TraceCheckUtils]: 33: Hoare triple {130614#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; {130614#true} is VALID [2022-04-15 11:45:51,578 INFO L290 TraceCheckUtils]: 32: Hoare triple {130614#true} assume 4368 == #t~mem54;havoc #t~mem54; {130614#true} is VALID [2022-04-15 11:45:51,578 INFO L290 TraceCheckUtils]: 31: Hoare triple {130614#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {130614#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {130614#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {130614#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {130614#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-15 11:45:51,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {130614#true} ~skip~0 := 0; {130614#true} is VALID [2022-04-15 11:45:51,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {130614#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130614#true} is VALID [2022-04-15 11:45:51,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,601 INFO L290 TraceCheckUtils]: 20: Hoare triple {130614#true} assume !(0 == ~tmp___4~0); {130614#true} is VALID [2022-04-15 11:45:51,601 INFO L290 TraceCheckUtils]: 19: Hoare triple {130614#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {130614#true} is VALID [2022-04-15 11:45:51,601 INFO L290 TraceCheckUtils]: 18: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,601 INFO L290 TraceCheckUtils]: 17: Hoare triple {130614#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,601 INFO L290 TraceCheckUtils]: 16: Hoare triple {130614#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {130614#true} is VALID [2022-04-15 11:45:51,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {130614#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {130614#true} is VALID [2022-04-15 11:45:51,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {130614#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; {130614#true} is VALID [2022-04-15 11:45:51,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {130614#true} assume 12292 == #t~mem49;havoc #t~mem49; {130614#true} is VALID [2022-04-15 11:45:51,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-15 11:45:51,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {130614#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {130614#true} is VALID [2022-04-15 11:45:51,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {130614#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; {130614#true} is VALID [2022-04-15 11:45:51,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {130614#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; {130614#true} is VALID [2022-04-15 11:45:51,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,602 INFO L272 TraceCheckUtils]: 6: Hoare triple {130614#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {130614#true} is VALID [2022-04-15 11:45:51,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {130614#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; {130614#true} is VALID [2022-04-15 11:45:51,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {130614#true} call #t~ret158 := main(); {130614#true} is VALID [2022-04-15 11:45:51,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {130614#true} {130614#true} #593#return; {130614#true} is VALID [2022-04-15 11:45:51,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {130614#true} assume true; {130614#true} is VALID [2022-04-15 11:45:51,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {130614#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); {130614#true} is VALID [2022-04-15 11:45:51,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {130614#true} call ULTIMATE.init(); {130614#true} is VALID [2022-04-15 11:45:51,603 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2022-04-15 11:45:51,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222263489] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 11:45:51,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:45:51,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 11 [2022-04-15 11:45:51,603 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:45:51,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1208192147] [2022-04-15 11:45:51,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1208192147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:51,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:51,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:45:51,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608578199] [2022-04-15 11:45:51,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:45:51,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 161 [2022-04-15 11:45:51,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:45:51,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-15 11:45:51,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:51,669 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:45:51,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:51,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:45:51,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-04-15 11:45:51,670 INFO L87 Difference]: Start difference. First operand 1095 states and 1560 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-15 11:45:55,707 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:59,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:59,803 INFO L93 Difference]: Finished difference Result 2611 states and 3721 transitions. [2022-04-15 11:45:59,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:45:59,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 161 [2022-04-15 11:45:59,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:45:59,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-15 11:45:59,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 466 transitions. [2022-04-15 11:45:59,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-15 11:45:59,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 466 transitions. [2022-04-15 11:45:59,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 466 transitions. [2022-04-15 11:46:00,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 466 edges. 466 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:00,203 INFO L225 Difference]: With dead ends: 2611 [2022-04-15 11:46:00,203 INFO L226 Difference]: Without dead ends: 1532 [2022-04-15 11:46:00,204 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-04-15 11:46:00,205 INFO L913 BasicCegarLoop]: 226 mSDtfsCounter, 93 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:46:00,205 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 535 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 231 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 11:46:00,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2022-04-15 11:46:01,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1225. [2022-04-15 11:46:01,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:46:01,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1532 states. Second operand has 1225 states, 1220 states have (on average 1.4270491803278689) internal successors, (1741), 1220 states have internal predecessors, (1741), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:01,066 INFO L74 IsIncluded]: Start isIncluded. First operand 1532 states. Second operand has 1225 states, 1220 states have (on average 1.4270491803278689) internal successors, (1741), 1220 states have internal predecessors, (1741), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:01,067 INFO L87 Difference]: Start difference. First operand 1532 states. Second operand has 1225 states, 1220 states have (on average 1.4270491803278689) internal successors, (1741), 1220 states have internal predecessors, (1741), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:01,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:01,121 INFO L93 Difference]: Finished difference Result 1532 states and 2176 transitions. [2022-04-15 11:46:01,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 2176 transitions. [2022-04-15 11:46:01,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:01,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:01,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 1225 states, 1220 states have (on average 1.4270491803278689) internal successors, (1741), 1220 states have internal predecessors, (1741), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1532 states. [2022-04-15 11:46:01,123 INFO L87 Difference]: Start difference. First operand has 1225 states, 1220 states have (on average 1.4270491803278689) internal successors, (1741), 1220 states have internal predecessors, (1741), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1532 states. [2022-04-15 11:46:01,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:01,178 INFO L93 Difference]: Finished difference Result 1532 states and 2176 transitions. [2022-04-15 11:46:01,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 2176 transitions. [2022-04-15 11:46:01,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:01,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:01,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:46:01,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:46:01,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1220 states have (on average 1.4270491803278689) internal successors, (1741), 1220 states have internal predecessors, (1741), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:01,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1745 transitions. [2022-04-15 11:46:01,234 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1745 transitions. Word has length 161 [2022-04-15 11:46:01,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:46:01,234 INFO L478 AbstractCegarLoop]: Abstraction has 1225 states and 1745 transitions. [2022-04-15 11:46:01,235 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-15 11:46:01,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1225 states and 1745 transitions. [2022-04-15 11:46:02,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1745 edges. 1745 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:02,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1745 transitions. [2022-04-15 11:46:02,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-04-15 11:46:02,991 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:46:02,992 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:46:03,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 11:46:03,219 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:46:03,219 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:46:03,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:46:03,220 INFO L85 PathProgramCache]: Analyzing trace with hash 911024446, now seen corresponding path program 1 times [2022-04-15 11:46:03,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:03,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1100213173] [2022-04-15 11:46:21,238 WARN L232 SmtUtils]: Spent 11.92s 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-15 11:46:28,471 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:46:28,471 INFO L85 PathProgramCache]: Analyzing trace with hash 911024446, now seen corresponding path program 2 times [2022-04-15 11:46:28,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:46:28,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932942506] [2022-04-15 11:46:28,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:46:28,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:46:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:28,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:46:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:28,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {142340#(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); {142331#true} is VALID [2022-04-15 11:46:28,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {142331#true} assume true; {142331#true} is VALID [2022-04-15 11:46:28,647 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {142331#true} {142331#true} #593#return; {142331#true} is VALID [2022-04-15 11:46:28,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {142331#true} call ULTIMATE.init(); {142340#(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-15 11:46:28,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {142340#(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); {142331#true} is VALID [2022-04-15 11:46:28,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {142331#true} assume true; {142331#true} is VALID [2022-04-15 11:46:28,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142331#true} {142331#true} #593#return; {142331#true} is VALID [2022-04-15 11:46:28,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {142331#true} call #t~ret158 := main(); {142331#true} is VALID [2022-04-15 11:46:28,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {142331#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; {142331#true} is VALID [2022-04-15 11:46:28,648 INFO L272 TraceCheckUtils]: 6: Hoare triple {142331#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {142331#true} is VALID [2022-04-15 11:46:28,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:46:28,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {142331#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; {142331#true} is VALID [2022-04-15 11:46:28,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {142331#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; {142331#true} is VALID [2022-04-15 11:46:28,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {142331#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {142331#true} is VALID [2022-04-15 11:46:28,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-15 11:46:28,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:46:28,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {142331#true} assume 12292 == #t~mem49;havoc #t~mem49; {142331#true} is VALID [2022-04-15 11:46:28,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {142331#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; {142331#true} is VALID [2022-04-15 11:46:28,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {142331#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {142331#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {142331#true} is VALID [2022-04-15 11:46:28,649 INFO L290 TraceCheckUtils]: 17: Hoare triple {142331#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,649 INFO L290 TraceCheckUtils]: 18: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:46:28,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {142331#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {142331#true} is VALID [2022-04-15 11:46:28,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {142331#true} assume !(0 == ~tmp___4~0); {142331#true} is VALID [2022-04-15 11:46:28,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:46:28,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:46:28,650 INFO L290 TraceCheckUtils]: 23: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-15 11:46:28,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-15 11:46:28,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-15 11:46:28,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:46:28,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,650 INFO L290 TraceCheckUtils]: 31: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,650 INFO L290 TraceCheckUtils]: 32: Hoare triple {142331#true} assume 4368 == #t~mem54;havoc #t~mem54; {142331#true} is VALID [2022-04-15 11:46:28,650 INFO L290 TraceCheckUtils]: 33: Hoare triple {142331#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; {142331#true} is VALID [2022-04-15 11:46:28,650 INFO L290 TraceCheckUtils]: 34: Hoare triple {142331#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {142331#true} is VALID [2022-04-15 11:46:28,650 INFO L290 TraceCheckUtils]: 35: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:46:28,650 INFO L290 TraceCheckUtils]: 36: Hoare triple {142331#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; {142331#true} is VALID [2022-04-15 11:46:28,651 INFO L290 TraceCheckUtils]: 37: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:46:28,651 INFO L290 TraceCheckUtils]: 38: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-15 11:46:28,651 INFO L290 TraceCheckUtils]: 39: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-15 11:46:28,651 INFO L290 TraceCheckUtils]: 40: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-15 11:46:28,651 INFO L290 TraceCheckUtils]: 41: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:46:28,651 INFO L290 TraceCheckUtils]: 42: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,651 INFO L290 TraceCheckUtils]: 43: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,651 INFO L290 TraceCheckUtils]: 44: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,651 INFO L290 TraceCheckUtils]: 45: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,651 INFO L290 TraceCheckUtils]: 46: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,651 INFO L290 TraceCheckUtils]: 47: Hoare triple {142331#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,651 INFO L290 TraceCheckUtils]: 48: Hoare triple {142331#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,651 INFO L290 TraceCheckUtils]: 49: Hoare triple {142331#true} assume 4384 == #t~mem56;havoc #t~mem56; {142331#true} is VALID [2022-04-15 11:46:28,651 INFO L290 TraceCheckUtils]: 50: Hoare triple {142331#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {142331#true} is VALID [2022-04-15 11:46:28,651 INFO L290 TraceCheckUtils]: 51: Hoare triple {142331#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {142331#true} is VALID [2022-04-15 11:46:28,652 INFO L290 TraceCheckUtils]: 52: Hoare triple {142331#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,652 INFO L290 TraceCheckUtils]: 53: Hoare triple {142331#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,652 INFO L290 TraceCheckUtils]: 54: Hoare triple {142331#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,652 INFO L290 TraceCheckUtils]: 55: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:46:28,652 INFO L290 TraceCheckUtils]: 56: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-15 11:46:28,652 INFO L290 TraceCheckUtils]: 57: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-15 11:46:28,652 INFO L290 TraceCheckUtils]: 58: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-15 11:46:28,652 INFO L290 TraceCheckUtils]: 59: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:46:28,652 INFO L290 TraceCheckUtils]: 60: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,652 INFO L290 TraceCheckUtils]: 61: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,652 INFO L290 TraceCheckUtils]: 62: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,653 INFO L290 TraceCheckUtils]: 63: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142336#(= |ssl3_connect_#t~mem53| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:46:28,653 INFO L290 TraceCheckUtils]: 64: Hoare triple {142336#(= |ssl3_connect_#t~mem53| (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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:28,653 INFO L290 TraceCheckUtils]: 65: Hoare triple {142337#(not (= 4099 (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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:28,653 INFO L290 TraceCheckUtils]: 66: Hoare triple {142337#(not (= 4099 (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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:28,654 INFO L290 TraceCheckUtils]: 67: Hoare triple {142337#(not (= 4099 (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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:28,654 INFO L290 TraceCheckUtils]: 68: Hoare triple {142337#(not (= 4099 (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); {142338#(not (= |ssl3_connect_#t~mem58| 4099))} is VALID [2022-04-15 11:46:28,654 INFO L290 TraceCheckUtils]: 69: Hoare triple {142338#(not (= |ssl3_connect_#t~mem58| 4099))} assume 4400 == #t~mem58;havoc #t~mem58; {142331#true} is VALID [2022-04-15 11:46:28,654 INFO L290 TraceCheckUtils]: 70: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:46:28,654 INFO L290 TraceCheckUtils]: 71: Hoare triple {142331#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; {142331#true} is VALID [2022-04-15 11:46:28,654 INFO L290 TraceCheckUtils]: 72: Hoare triple {142331#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {142331#true} is VALID [2022-04-15 11:46:28,654 INFO L290 TraceCheckUtils]: 73: Hoare triple {142331#true} assume !(~ret~0 <= 0); {142331#true} is VALID [2022-04-15 11:46:28,654 INFO L290 TraceCheckUtils]: 74: Hoare triple {142331#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,654 INFO L290 TraceCheckUtils]: 75: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:46:28,655 INFO L290 TraceCheckUtils]: 76: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-15 11:46:28,655 INFO L290 TraceCheckUtils]: 77: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-15 11:46:28,655 INFO L290 TraceCheckUtils]: 78: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-15 11:46:28,655 INFO L290 TraceCheckUtils]: 79: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:46:28,655 INFO L290 TraceCheckUtils]: 80: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,655 INFO L290 TraceCheckUtils]: 81: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,655 INFO L290 TraceCheckUtils]: 82: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,655 INFO L290 TraceCheckUtils]: 83: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,655 INFO L290 TraceCheckUtils]: 84: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,655 INFO L290 TraceCheckUtils]: 85: Hoare triple {142331#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,655 INFO L290 TraceCheckUtils]: 86: Hoare triple {142331#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,655 INFO L290 TraceCheckUtils]: 87: Hoare triple {142331#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,655 INFO L290 TraceCheckUtils]: 88: Hoare triple {142331#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,655 INFO L290 TraceCheckUtils]: 89: Hoare triple {142331#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,655 INFO L290 TraceCheckUtils]: 90: Hoare triple {142331#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,656 INFO L290 TraceCheckUtils]: 91: Hoare triple {142331#true} assume 4416 == #t~mem60;havoc #t~mem60; {142331#true} is VALID [2022-04-15 11:46:28,656 INFO L290 TraceCheckUtils]: 92: Hoare triple {142331#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {142331#true} is VALID [2022-04-15 11:46:28,656 INFO L290 TraceCheckUtils]: 93: Hoare triple {142331#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {142331#true} is VALID [2022-04-15 11:46:28,656 INFO L290 TraceCheckUtils]: 94: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:46:28,656 INFO L290 TraceCheckUtils]: 95: Hoare triple {142331#true} assume !(0 == ~tmp___6~0); {142331#true} is VALID [2022-04-15 11:46:28,656 INFO L290 TraceCheckUtils]: 96: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:46:28,656 INFO L290 TraceCheckUtils]: 97: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-15 11:46:28,656 INFO L290 TraceCheckUtils]: 98: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-15 11:46:28,656 INFO L290 TraceCheckUtils]: 99: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-15 11:46:28,656 INFO L290 TraceCheckUtils]: 100: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:46:28,656 INFO L290 TraceCheckUtils]: 101: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,656 INFO L290 TraceCheckUtils]: 102: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,656 INFO L290 TraceCheckUtils]: 103: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,656 INFO L290 TraceCheckUtils]: 104: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,656 INFO L290 TraceCheckUtils]: 105: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,657 INFO L290 TraceCheckUtils]: 106: Hoare triple {142331#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,657 INFO L290 TraceCheckUtils]: 107: Hoare triple {142331#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,657 INFO L290 TraceCheckUtils]: 108: Hoare triple {142331#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,657 INFO L290 TraceCheckUtils]: 109: Hoare triple {142331#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,657 INFO L290 TraceCheckUtils]: 110: Hoare triple {142331#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,657 INFO L290 TraceCheckUtils]: 111: Hoare triple {142331#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,657 INFO L290 TraceCheckUtils]: 112: Hoare triple {142331#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,657 INFO L290 TraceCheckUtils]: 113: Hoare triple {142331#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,657 INFO L290 TraceCheckUtils]: 114: Hoare triple {142331#true} assume 4432 == #t~mem62;havoc #t~mem62; {142331#true} is VALID [2022-04-15 11:46:28,657 INFO L290 TraceCheckUtils]: 115: Hoare triple {142331#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {142331#true} is VALID [2022-04-15 11:46:28,657 INFO L290 TraceCheckUtils]: 116: Hoare triple {142331#true} assume !(5 == ~blastFlag~0); {142331#true} is VALID [2022-04-15 11:46:28,657 INFO L290 TraceCheckUtils]: 117: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:46:28,657 INFO L290 TraceCheckUtils]: 118: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:46:28,657 INFO L290 TraceCheckUtils]: 119: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-15 11:46:28,657 INFO L290 TraceCheckUtils]: 120: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-15 11:46:28,658 INFO L290 TraceCheckUtils]: 121: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-15 11:46:28,658 INFO L290 TraceCheckUtils]: 122: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:46:28,658 INFO L290 TraceCheckUtils]: 123: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,658 INFO L290 TraceCheckUtils]: 124: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,658 INFO L290 TraceCheckUtils]: 125: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,658 INFO L290 TraceCheckUtils]: 126: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,658 INFO L290 TraceCheckUtils]: 127: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,658 INFO L290 TraceCheckUtils]: 128: Hoare triple {142331#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,658 INFO L290 TraceCheckUtils]: 129: Hoare triple {142331#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,658 INFO L290 TraceCheckUtils]: 130: Hoare triple {142331#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,658 INFO L290 TraceCheckUtils]: 131: Hoare triple {142331#true} assume 4385 == #t~mem57;havoc #t~mem57; {142331#true} is VALID [2022-04-15 11:46:28,658 INFO L290 TraceCheckUtils]: 132: Hoare triple {142331#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {142331#true} is VALID [2022-04-15 11:46:28,658 INFO L290 TraceCheckUtils]: 133: Hoare triple {142331#true} assume !(1 == ~blastFlag~0); {142331#true} is VALID [2022-04-15 11:46:28,658 INFO L290 TraceCheckUtils]: 134: Hoare triple {142331#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {142331#true} is VALID [2022-04-15 11:46:28,658 INFO L290 TraceCheckUtils]: 135: Hoare triple {142331#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:46:28,659 INFO L290 TraceCheckUtils]: 136: Hoare triple {142331#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:28,660 INFO L290 TraceCheckUtils]: 137: Hoare triple {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:28,660 INFO L290 TraceCheckUtils]: 138: Hoare triple {142337#(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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:28,660 INFO L290 TraceCheckUtils]: 139: Hoare triple {142337#(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; {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:28,660 INFO L290 TraceCheckUtils]: 140: Hoare triple {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:28,661 INFO L290 TraceCheckUtils]: 141: Hoare triple {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:28,661 INFO L290 TraceCheckUtils]: 142: Hoare triple {142337#(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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:28,661 INFO L290 TraceCheckUtils]: 143: Hoare triple {142337#(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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:28,661 INFO L290 TraceCheckUtils]: 144: Hoare triple {142337#(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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:28,661 INFO L290 TraceCheckUtils]: 145: Hoare triple {142337#(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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:28,662 INFO L290 TraceCheckUtils]: 146: Hoare triple {142337#(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); {142339#(not (= |ssl3_connect_#t~mem53| 4099))} is VALID [2022-04-15 11:46:28,662 INFO L290 TraceCheckUtils]: 147: Hoare triple {142339#(not (= |ssl3_connect_#t~mem53| 4099))} assume 4099 == #t~mem53;havoc #t~mem53; {142332#false} is VALID [2022-04-15 11:46:28,662 INFO L290 TraceCheckUtils]: 148: Hoare triple {142332#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:46:28,662 INFO L290 TraceCheckUtils]: 149: Hoare triple {142332#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {142332#false} is VALID [2022-04-15 11:46:28,662 INFO L290 TraceCheckUtils]: 150: Hoare triple {142332#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:46:28,662 INFO L290 TraceCheckUtils]: 151: Hoare triple {142332#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); {142332#false} is VALID [2022-04-15 11:46:28,662 INFO L290 TraceCheckUtils]: 152: Hoare triple {142332#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {142332#false} is VALID [2022-04-15 11:46:28,662 INFO L290 TraceCheckUtils]: 153: Hoare triple {142332#false} assume !(0 == ~tmp___4~0); {142332#false} is VALID [2022-04-15 11:46:28,663 INFO L290 TraceCheckUtils]: 154: Hoare triple {142332#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); {142332#false} is VALID [2022-04-15 11:46:28,663 INFO L290 TraceCheckUtils]: 155: Hoare triple {142332#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); {142332#false} is VALID [2022-04-15 11:46:28,663 INFO L290 TraceCheckUtils]: 156: Hoare triple {142332#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142332#false} is VALID [2022-04-15 11:46:28,663 INFO L290 TraceCheckUtils]: 157: Hoare triple {142332#false} ~skip~0 := 0; {142332#false} is VALID [2022-04-15 11:46:28,663 INFO L290 TraceCheckUtils]: 158: Hoare triple {142332#false} assume !false; {142332#false} is VALID [2022-04-15 11:46:28,663 INFO L290 TraceCheckUtils]: 159: Hoare triple {142332#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); {142332#false} is VALID [2022-04-15 11:46:28,663 INFO L290 TraceCheckUtils]: 160: Hoare triple {142332#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:46:28,663 INFO L290 TraceCheckUtils]: 161: Hoare triple {142332#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:46:28,663 INFO L290 TraceCheckUtils]: 162: Hoare triple {142332#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:46:28,663 INFO L290 TraceCheckUtils]: 163: Hoare triple {142332#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:46:28,663 INFO L290 TraceCheckUtils]: 164: Hoare triple {142332#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:46:28,663 INFO L290 TraceCheckUtils]: 165: Hoare triple {142332#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:46:28,663 INFO L290 TraceCheckUtils]: 166: Hoare triple {142332#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:46:28,663 INFO L290 TraceCheckUtils]: 167: Hoare triple {142332#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:46:28,663 INFO L290 TraceCheckUtils]: 168: Hoare triple {142332#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:46:28,664 INFO L290 TraceCheckUtils]: 169: Hoare triple {142332#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:46:28,664 INFO L290 TraceCheckUtils]: 170: Hoare triple {142332#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:46:28,664 INFO L290 TraceCheckUtils]: 171: Hoare triple {142332#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:46:28,664 INFO L290 TraceCheckUtils]: 172: Hoare triple {142332#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:46:28,664 INFO L290 TraceCheckUtils]: 173: Hoare triple {142332#false} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:46:28,664 INFO L290 TraceCheckUtils]: 174: Hoare triple {142332#false} assume 4433 == #t~mem63;havoc #t~mem63; {142332#false} is VALID [2022-04-15 11:46:28,664 INFO L290 TraceCheckUtils]: 175: Hoare triple {142332#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {142332#false} is VALID [2022-04-15 11:46:28,664 INFO L290 TraceCheckUtils]: 176: Hoare triple {142332#false} assume 5 == ~blastFlag~0; {142332#false} is VALID [2022-04-15 11:46:28,664 INFO L290 TraceCheckUtils]: 177: Hoare triple {142332#false} assume !false; {142332#false} is VALID [2022-04-15 11:46:28,664 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 180 proven. 18 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-04-15 11:46:28,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:46:28,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932942506] [2022-04-15 11:46:28,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932942506] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:46:28,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628062975] [2022-04-15 11:46:28,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:46:28,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:46:28,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:46:28,666 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-15 11:46:28,667 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-15 11:47:19,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:47:19,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:47:19,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 1584 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 11:47:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:19,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:47:19,903 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-15 11:47:19,903 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-15 11:47:19,906 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-15 11:47:19,910 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-15 11:47:19,914 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-15 11:47:20,034 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-15 11:47:20,192 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-04-15 11:47:20,192 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-15 11:47:20,203 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-15 11:47:20,218 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-15 11:47:20,262 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-15 11:47:20,262 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-15 11:47:20,332 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-15 11:47:20,445 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 0 case distinctions, treesize of input 13 treesize of output 9 [2022-04-15 11:47:20,469 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-15 11:47:20,469 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-15 11:47:20,510 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-15 11:47:20,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {142331#true} call ULTIMATE.init(); {142331#true} is VALID [2022-04-15 11:47:20,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {142331#true} assume true; {142331#true} is VALID [2022-04-15 11:47:20,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142331#true} {142331#true} #593#return; {142331#true} is VALID [2022-04-15 11:47:20,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {142331#true} call #t~ret158 := main(); {142331#true} is VALID [2022-04-15 11:47:20,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {142331#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; {142331#true} is VALID [2022-04-15 11:47:20,557 INFO L272 TraceCheckUtils]: 6: Hoare triple {142331#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {142331#true} is VALID [2022-04-15 11:47:20,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {142331#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; {142331#true} is VALID [2022-04-15 11:47:20,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {142331#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; {142331#true} is VALID [2022-04-15 11:47:20,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {142331#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {142331#true} is VALID [2022-04-15 11:47:20,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-15 11:47:20,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {142331#true} assume 12292 == #t~mem49;havoc #t~mem49; {142331#true} is VALID [2022-04-15 11:47:20,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {142331#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; {142331#true} is VALID [2022-04-15 11:47:20,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {142331#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {142331#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {142331#true} is VALID [2022-04-15 11:47:20,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {142331#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {142331#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {142331#true} is VALID [2022-04-15 11:47:20,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {142331#true} assume !(0 == ~tmp___4~0); {142331#true} is VALID [2022-04-15 11:47:20,561 INFO L290 TraceCheckUtils]: 21: Hoare triple {142331#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); {142407#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:20,561 INFO L290 TraceCheckUtils]: 22: Hoare triple {142407#(= 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); {142407#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:20,561 INFO L290 TraceCheckUtils]: 23: Hoare triple {142407#(= 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; {142407#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:20,562 INFO L290 TraceCheckUtils]: 24: Hoare triple {142407#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} ~skip~0 := 0; {142407#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:20,562 INFO L290 TraceCheckUtils]: 25: Hoare triple {142407#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !false; {142407#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:20,562 INFO L290 TraceCheckUtils]: 26: Hoare triple {142407#(= 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); {142407#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:20,563 INFO L290 TraceCheckUtils]: 27: Hoare triple {142407#(= 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); {142407#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:20,563 INFO L290 TraceCheckUtils]: 28: Hoare triple {142407#(= 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); {142407#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:20,563 INFO L290 TraceCheckUtils]: 29: Hoare triple {142407#(= 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); {142407#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:20,564 INFO L290 TraceCheckUtils]: 30: Hoare triple {142407#(= 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); {142407#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:20,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {142407#(= 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); {142331#true} is VALID [2022-04-15 11:47:20,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {142331#true} assume 4368 == #t~mem54;havoc #t~mem54; {142331#true} is VALID [2022-04-15 11:47:20,564 INFO L290 TraceCheckUtils]: 33: Hoare triple {142331#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; {142331#true} is VALID [2022-04-15 11:47:20,564 INFO L290 TraceCheckUtils]: 34: Hoare triple {142331#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {142331#true} is VALID [2022-04-15 11:47:20,564 INFO L290 TraceCheckUtils]: 35: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,564 INFO L290 TraceCheckUtils]: 36: Hoare triple {142331#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; {142331#true} is VALID [2022-04-15 11:47:20,564 INFO L290 TraceCheckUtils]: 37: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,564 INFO L290 TraceCheckUtils]: 38: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-15 11:47:20,564 INFO L290 TraceCheckUtils]: 39: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-15 11:47:20,564 INFO L290 TraceCheckUtils]: 40: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-15 11:47:20,565 INFO L290 TraceCheckUtils]: 41: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,565 INFO L290 TraceCheckUtils]: 42: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,565 INFO L290 TraceCheckUtils]: 43: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,565 INFO L290 TraceCheckUtils]: 44: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,565 INFO L290 TraceCheckUtils]: 45: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,565 INFO L290 TraceCheckUtils]: 46: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,565 INFO L290 TraceCheckUtils]: 47: Hoare triple {142331#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,565 INFO L290 TraceCheckUtils]: 48: Hoare triple {142331#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,565 INFO L290 TraceCheckUtils]: 49: Hoare triple {142331#true} assume 4384 == #t~mem56;havoc #t~mem56; {142331#true} is VALID [2022-04-15 11:47:20,565 INFO L290 TraceCheckUtils]: 50: Hoare triple {142331#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {142331#true} is VALID [2022-04-15 11:47:20,565 INFO L290 TraceCheckUtils]: 51: Hoare triple {142331#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {142331#true} is VALID [2022-04-15 11:47:20,565 INFO L290 TraceCheckUtils]: 52: Hoare triple {142331#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,565 INFO L290 TraceCheckUtils]: 53: Hoare triple {142331#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,565 INFO L290 TraceCheckUtils]: 54: Hoare triple {142331#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,565 INFO L290 TraceCheckUtils]: 55: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,566 INFO L290 TraceCheckUtils]: 56: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-15 11:47:20,566 INFO L290 TraceCheckUtils]: 57: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-15 11:47:20,566 INFO L290 TraceCheckUtils]: 58: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-15 11:47:20,566 INFO L290 TraceCheckUtils]: 59: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,566 INFO L290 TraceCheckUtils]: 60: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,566 INFO L290 TraceCheckUtils]: 61: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,566 INFO L290 TraceCheckUtils]: 62: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,566 INFO L290 TraceCheckUtils]: 63: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142336#(= |ssl3_connect_#t~mem53| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:20,567 INFO L290 TraceCheckUtils]: 64: Hoare triple {142336#(= |ssl3_connect_#t~mem53| (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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:47:20,567 INFO L290 TraceCheckUtils]: 65: Hoare triple {142337#(not (= 4099 (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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:47:20,567 INFO L290 TraceCheckUtils]: 66: Hoare triple {142337#(not (= 4099 (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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:47:20,567 INFO L290 TraceCheckUtils]: 67: Hoare triple {142337#(not (= 4099 (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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:47:20,568 INFO L290 TraceCheckUtils]: 68: Hoare triple {142337#(not (= 4099 (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); {142338#(not (= |ssl3_connect_#t~mem58| 4099))} is VALID [2022-04-15 11:47:20,568 INFO L290 TraceCheckUtils]: 69: Hoare triple {142338#(not (= |ssl3_connect_#t~mem58| 4099))} assume 4400 == #t~mem58;havoc #t~mem58; {142331#true} is VALID [2022-04-15 11:47:20,568 INFO L290 TraceCheckUtils]: 70: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,568 INFO L290 TraceCheckUtils]: 71: Hoare triple {142331#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; {142331#true} is VALID [2022-04-15 11:47:20,568 INFO L290 TraceCheckUtils]: 72: Hoare triple {142331#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {142331#true} is VALID [2022-04-15 11:47:20,568 INFO L290 TraceCheckUtils]: 73: Hoare triple {142331#true} assume !(~ret~0 <= 0); {142331#true} is VALID [2022-04-15 11:47:20,568 INFO L290 TraceCheckUtils]: 74: Hoare triple {142331#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,568 INFO L290 TraceCheckUtils]: 75: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,568 INFO L290 TraceCheckUtils]: 76: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-15 11:47:20,568 INFO L290 TraceCheckUtils]: 77: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-15 11:47:20,569 INFO L290 TraceCheckUtils]: 78: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-15 11:47:20,569 INFO L290 TraceCheckUtils]: 79: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,569 INFO L290 TraceCheckUtils]: 80: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,569 INFO L290 TraceCheckUtils]: 81: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,569 INFO L290 TraceCheckUtils]: 82: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,569 INFO L290 TraceCheckUtils]: 83: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,569 INFO L290 TraceCheckUtils]: 84: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,569 INFO L290 TraceCheckUtils]: 85: Hoare triple {142331#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,569 INFO L290 TraceCheckUtils]: 86: Hoare triple {142331#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,569 INFO L290 TraceCheckUtils]: 87: Hoare triple {142331#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,569 INFO L290 TraceCheckUtils]: 88: Hoare triple {142331#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,569 INFO L290 TraceCheckUtils]: 89: Hoare triple {142331#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,569 INFO L290 TraceCheckUtils]: 90: Hoare triple {142331#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,569 INFO L290 TraceCheckUtils]: 91: Hoare triple {142331#true} assume 4416 == #t~mem60;havoc #t~mem60; {142331#true} is VALID [2022-04-15 11:47:20,570 INFO L290 TraceCheckUtils]: 92: Hoare triple {142331#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {142331#true} is VALID [2022-04-15 11:47:20,570 INFO L290 TraceCheckUtils]: 93: Hoare triple {142331#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {142331#true} is VALID [2022-04-15 11:47:20,570 INFO L290 TraceCheckUtils]: 94: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,570 INFO L290 TraceCheckUtils]: 95: Hoare triple {142331#true} assume !(0 == ~tmp___6~0); {142331#true} is VALID [2022-04-15 11:47:20,570 INFO L290 TraceCheckUtils]: 96: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,570 INFO L290 TraceCheckUtils]: 97: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-15 11:47:20,570 INFO L290 TraceCheckUtils]: 98: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-15 11:47:20,570 INFO L290 TraceCheckUtils]: 99: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-15 11:47:20,570 INFO L290 TraceCheckUtils]: 100: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,570 INFO L290 TraceCheckUtils]: 101: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,570 INFO L290 TraceCheckUtils]: 102: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,570 INFO L290 TraceCheckUtils]: 103: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,570 INFO L290 TraceCheckUtils]: 104: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,570 INFO L290 TraceCheckUtils]: 105: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,570 INFO L290 TraceCheckUtils]: 106: Hoare triple {142331#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,571 INFO L290 TraceCheckUtils]: 107: Hoare triple {142331#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,571 INFO L290 TraceCheckUtils]: 108: Hoare triple {142331#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,571 INFO L290 TraceCheckUtils]: 109: Hoare triple {142331#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,571 INFO L290 TraceCheckUtils]: 110: Hoare triple {142331#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,571 INFO L290 TraceCheckUtils]: 111: Hoare triple {142331#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,571 INFO L290 TraceCheckUtils]: 112: Hoare triple {142331#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,571 INFO L290 TraceCheckUtils]: 113: Hoare triple {142331#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,571 INFO L290 TraceCheckUtils]: 114: Hoare triple {142331#true} assume 4432 == #t~mem62;havoc #t~mem62; {142331#true} is VALID [2022-04-15 11:47:20,571 INFO L290 TraceCheckUtils]: 115: Hoare triple {142331#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {142331#true} is VALID [2022-04-15 11:47:20,571 INFO L290 TraceCheckUtils]: 116: Hoare triple {142331#true} assume !(5 == ~blastFlag~0); {142331#true} is VALID [2022-04-15 11:47:20,571 INFO L290 TraceCheckUtils]: 117: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,571 INFO L290 TraceCheckUtils]: 118: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,571 INFO L290 TraceCheckUtils]: 119: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-15 11:47:20,571 INFO L290 TraceCheckUtils]: 120: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-15 11:47:20,572 INFO L290 TraceCheckUtils]: 121: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-15 11:47:20,572 INFO L290 TraceCheckUtils]: 122: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,572 INFO L290 TraceCheckUtils]: 123: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,572 INFO L290 TraceCheckUtils]: 124: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,572 INFO L290 TraceCheckUtils]: 125: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,572 INFO L290 TraceCheckUtils]: 126: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,572 INFO L290 TraceCheckUtils]: 127: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,572 INFO L290 TraceCheckUtils]: 128: Hoare triple {142331#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,572 INFO L290 TraceCheckUtils]: 129: Hoare triple {142331#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,572 INFO L290 TraceCheckUtils]: 130: Hoare triple {142331#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,572 INFO L290 TraceCheckUtils]: 131: Hoare triple {142331#true} assume 4385 == #t~mem57;havoc #t~mem57; {142331#true} is VALID [2022-04-15 11:47:20,572 INFO L290 TraceCheckUtils]: 132: Hoare triple {142331#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {142331#true} is VALID [2022-04-15 11:47:20,572 INFO L290 TraceCheckUtils]: 133: Hoare triple {142331#true} assume !(1 == ~blastFlag~0); {142331#true} is VALID [2022-04-15 11:47:20,572 INFO L290 TraceCheckUtils]: 134: Hoare triple {142331#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {142331#true} is VALID [2022-04-15 11:47:20,573 INFO L290 TraceCheckUtils]: 135: Hoare triple {142331#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,576 INFO L290 TraceCheckUtils]: 136: Hoare triple {142331#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {142753#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:20,576 INFO L290 TraceCheckUtils]: 137: Hoare triple {142753#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {142753#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:20,577 INFO L290 TraceCheckUtils]: 138: Hoare triple {142753#(= 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); {142753#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:20,577 INFO L290 TraceCheckUtils]: 139: Hoare triple {142753#(= 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; {142753#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:20,577 INFO L290 TraceCheckUtils]: 140: Hoare triple {142753#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {142753#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:20,578 INFO L290 TraceCheckUtils]: 141: Hoare triple {142753#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {142753#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:20,578 INFO L290 TraceCheckUtils]: 142: Hoare triple {142753#(= 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); {142753#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:20,578 INFO L290 TraceCheckUtils]: 143: Hoare triple {142753#(= 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); {142753#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:20,578 INFO L290 TraceCheckUtils]: 144: Hoare triple {142753#(= 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); {142753#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:20,579 INFO L290 TraceCheckUtils]: 145: Hoare triple {142753#(= 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); {142753#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:20,579 INFO L290 TraceCheckUtils]: 146: Hoare triple {142753#(= 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); {142784#(= |ssl3_connect_#t~mem53| 4400)} is VALID [2022-04-15 11:47:20,579 INFO L290 TraceCheckUtils]: 147: Hoare triple {142784#(= |ssl3_connect_#t~mem53| 4400)} assume 4099 == #t~mem53;havoc #t~mem53; {142332#false} is VALID [2022-04-15 11:47:20,579 INFO L290 TraceCheckUtils]: 148: Hoare triple {142332#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,579 INFO L290 TraceCheckUtils]: 149: Hoare triple {142332#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {142332#false} is VALID [2022-04-15 11:47:20,579 INFO L290 TraceCheckUtils]: 150: Hoare triple {142332#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,580 INFO L290 TraceCheckUtils]: 151: Hoare triple {142332#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); {142332#false} is VALID [2022-04-15 11:47:20,580 INFO L290 TraceCheckUtils]: 152: Hoare triple {142332#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {142332#false} is VALID [2022-04-15 11:47:20,580 INFO L290 TraceCheckUtils]: 153: Hoare triple {142332#false} assume !(0 == ~tmp___4~0); {142332#false} is VALID [2022-04-15 11:47:20,580 INFO L290 TraceCheckUtils]: 154: Hoare triple {142332#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); {142332#false} is VALID [2022-04-15 11:47:20,580 INFO L290 TraceCheckUtils]: 155: Hoare triple {142332#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); {142332#false} is VALID [2022-04-15 11:47:20,580 INFO L290 TraceCheckUtils]: 156: Hoare triple {142332#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142332#false} is VALID [2022-04-15 11:47:20,580 INFO L290 TraceCheckUtils]: 157: Hoare triple {142332#false} ~skip~0 := 0; {142332#false} is VALID [2022-04-15 11:47:20,580 INFO L290 TraceCheckUtils]: 158: Hoare triple {142332#false} assume !false; {142332#false} is VALID [2022-04-15 11:47:20,580 INFO L290 TraceCheckUtils]: 159: Hoare triple {142332#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); {142332#false} is VALID [2022-04-15 11:47:20,580 INFO L290 TraceCheckUtils]: 160: Hoare triple {142332#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,580 INFO L290 TraceCheckUtils]: 161: Hoare triple {142332#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,580 INFO L290 TraceCheckUtils]: 162: Hoare triple {142332#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,580 INFO L290 TraceCheckUtils]: 163: Hoare triple {142332#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,580 INFO L290 TraceCheckUtils]: 164: Hoare triple {142332#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,581 INFO L290 TraceCheckUtils]: 165: Hoare triple {142332#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,581 INFO L290 TraceCheckUtils]: 166: Hoare triple {142332#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,581 INFO L290 TraceCheckUtils]: 167: Hoare triple {142332#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,581 INFO L290 TraceCheckUtils]: 168: Hoare triple {142332#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,581 INFO L290 TraceCheckUtils]: 169: Hoare triple {142332#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,581 INFO L290 TraceCheckUtils]: 170: Hoare triple {142332#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,581 INFO L290 TraceCheckUtils]: 171: Hoare triple {142332#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,600 INFO L290 TraceCheckUtils]: 172: Hoare triple {142332#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,600 INFO L290 TraceCheckUtils]: 173: Hoare triple {142332#false} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,600 INFO L290 TraceCheckUtils]: 174: Hoare triple {142332#false} assume 4433 == #t~mem63;havoc #t~mem63; {142332#false} is VALID [2022-04-15 11:47:20,600 INFO L290 TraceCheckUtils]: 175: Hoare triple {142332#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {142332#false} is VALID [2022-04-15 11:47:20,600 INFO L290 TraceCheckUtils]: 176: Hoare triple {142332#false} assume 5 == ~blastFlag~0; {142332#false} is VALID [2022-04-15 11:47:20,600 INFO L290 TraceCheckUtils]: 177: Hoare triple {142332#false} assume !false; {142332#false} is VALID [2022-04-15 11:47:20,600 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 172 proven. 78 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2022-04-15 11:47:20,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:47:20,825 INFO L290 TraceCheckUtils]: 177: Hoare triple {142332#false} assume !false; {142332#false} is VALID [2022-04-15 11:47:20,825 INFO L290 TraceCheckUtils]: 176: Hoare triple {142332#false} assume 5 == ~blastFlag~0; {142332#false} is VALID [2022-04-15 11:47:20,825 INFO L290 TraceCheckUtils]: 175: Hoare triple {142332#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {142332#false} is VALID [2022-04-15 11:47:20,825 INFO L290 TraceCheckUtils]: 174: Hoare triple {142332#false} assume 4433 == #t~mem63;havoc #t~mem63; {142332#false} is VALID [2022-04-15 11:47:20,825 INFO L290 TraceCheckUtils]: 173: Hoare triple {142332#false} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,825 INFO L290 TraceCheckUtils]: 172: Hoare triple {142332#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,825 INFO L290 TraceCheckUtils]: 171: Hoare triple {142332#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,825 INFO L290 TraceCheckUtils]: 170: Hoare triple {142332#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,825 INFO L290 TraceCheckUtils]: 169: Hoare triple {142332#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,825 INFO L290 TraceCheckUtils]: 168: Hoare triple {142332#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,826 INFO L290 TraceCheckUtils]: 167: Hoare triple {142332#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,826 INFO L290 TraceCheckUtils]: 166: Hoare triple {142332#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,826 INFO L290 TraceCheckUtils]: 165: Hoare triple {142332#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,826 INFO L290 TraceCheckUtils]: 164: Hoare triple {142332#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,826 INFO L290 TraceCheckUtils]: 163: Hoare triple {142332#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,826 INFO L290 TraceCheckUtils]: 162: Hoare triple {142332#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,826 INFO L290 TraceCheckUtils]: 161: Hoare triple {142332#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,826 INFO L290 TraceCheckUtils]: 160: Hoare triple {142332#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,826 INFO L290 TraceCheckUtils]: 159: Hoare triple {142332#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); {142332#false} is VALID [2022-04-15 11:47:20,826 INFO L290 TraceCheckUtils]: 158: Hoare triple {142332#false} assume !false; {142332#false} is VALID [2022-04-15 11:47:20,826 INFO L290 TraceCheckUtils]: 157: Hoare triple {142332#false} ~skip~0 := 0; {142332#false} is VALID [2022-04-15 11:47:20,826 INFO L290 TraceCheckUtils]: 156: Hoare triple {142332#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142332#false} is VALID [2022-04-15 11:47:20,826 INFO L290 TraceCheckUtils]: 155: Hoare triple {142332#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); {142332#false} is VALID [2022-04-15 11:47:20,826 INFO L290 TraceCheckUtils]: 154: Hoare triple {142332#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); {142332#false} is VALID [2022-04-15 11:47:20,826 INFO L290 TraceCheckUtils]: 153: Hoare triple {142332#false} assume !(0 == ~tmp___4~0); {142332#false} is VALID [2022-04-15 11:47:20,827 INFO L290 TraceCheckUtils]: 152: Hoare triple {142332#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {142332#false} is VALID [2022-04-15 11:47:20,827 INFO L290 TraceCheckUtils]: 151: Hoare triple {142332#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); {142332#false} is VALID [2022-04-15 11:47:20,827 INFO L290 TraceCheckUtils]: 150: Hoare triple {142332#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,827 INFO L290 TraceCheckUtils]: 149: Hoare triple {142332#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {142332#false} is VALID [2022-04-15 11:47:20,827 INFO L290 TraceCheckUtils]: 148: Hoare triple {142332#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {142332#false} is VALID [2022-04-15 11:47:20,827 INFO L290 TraceCheckUtils]: 147: Hoare triple {142339#(not (= |ssl3_connect_#t~mem53| 4099))} assume 4099 == #t~mem53;havoc #t~mem53; {142332#false} is VALID [2022-04-15 11:47:20,828 INFO L290 TraceCheckUtils]: 146: Hoare triple {142337#(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); {142339#(not (= |ssl3_connect_#t~mem53| 4099))} is VALID [2022-04-15 11:47:20,828 INFO L290 TraceCheckUtils]: 145: Hoare triple {142337#(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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:47:20,828 INFO L290 TraceCheckUtils]: 144: Hoare triple {142337#(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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:47:20,828 INFO L290 TraceCheckUtils]: 143: Hoare triple {142337#(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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:47:20,829 INFO L290 TraceCheckUtils]: 142: Hoare triple {142337#(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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:47:20,829 INFO L290 TraceCheckUtils]: 141: Hoare triple {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:47:20,829 INFO L290 TraceCheckUtils]: 140: Hoare triple {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:47:20,830 INFO L290 TraceCheckUtils]: 139: Hoare triple {142337#(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; {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:47:20,830 INFO L290 TraceCheckUtils]: 138: Hoare triple {142337#(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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:47:20,831 INFO L290 TraceCheckUtils]: 137: Hoare triple {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:47:20,831 INFO L290 TraceCheckUtils]: 136: Hoare triple {142331#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:47:20,831 INFO L290 TraceCheckUtils]: 135: Hoare triple {142331#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,831 INFO L290 TraceCheckUtils]: 134: Hoare triple {142331#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {142331#true} is VALID [2022-04-15 11:47:20,831 INFO L290 TraceCheckUtils]: 133: Hoare triple {142331#true} assume !(1 == ~blastFlag~0); {142331#true} is VALID [2022-04-15 11:47:20,831 INFO L290 TraceCheckUtils]: 132: Hoare triple {142331#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {142331#true} is VALID [2022-04-15 11:47:20,832 INFO L290 TraceCheckUtils]: 131: Hoare triple {142331#true} assume 4385 == #t~mem57;havoc #t~mem57; {142331#true} is VALID [2022-04-15 11:47:20,832 INFO L290 TraceCheckUtils]: 130: Hoare triple {142331#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,832 INFO L290 TraceCheckUtils]: 129: Hoare triple {142331#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,832 INFO L290 TraceCheckUtils]: 128: Hoare triple {142331#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,832 INFO L290 TraceCheckUtils]: 127: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,832 INFO L290 TraceCheckUtils]: 126: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,832 INFO L290 TraceCheckUtils]: 125: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,832 INFO L290 TraceCheckUtils]: 124: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,832 INFO L290 TraceCheckUtils]: 123: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,832 INFO L290 TraceCheckUtils]: 122: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,832 INFO L290 TraceCheckUtils]: 121: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-15 11:47:20,832 INFO L290 TraceCheckUtils]: 120: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-15 11:47:20,832 INFO L290 TraceCheckUtils]: 119: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-15 11:47:20,832 INFO L290 TraceCheckUtils]: 118: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,832 INFO L290 TraceCheckUtils]: 117: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,833 INFO L290 TraceCheckUtils]: 116: Hoare triple {142331#true} assume !(5 == ~blastFlag~0); {142331#true} is VALID [2022-04-15 11:47:20,833 INFO L290 TraceCheckUtils]: 115: Hoare triple {142331#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {142331#true} is VALID [2022-04-15 11:47:20,833 INFO L290 TraceCheckUtils]: 114: Hoare triple {142331#true} assume 4432 == #t~mem62;havoc #t~mem62; {142331#true} is VALID [2022-04-15 11:47:20,833 INFO L290 TraceCheckUtils]: 113: Hoare triple {142331#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,833 INFO L290 TraceCheckUtils]: 112: Hoare triple {142331#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,833 INFO L290 TraceCheckUtils]: 111: Hoare triple {142331#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,833 INFO L290 TraceCheckUtils]: 110: Hoare triple {142331#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,833 INFO L290 TraceCheckUtils]: 109: Hoare triple {142331#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,833 INFO L290 TraceCheckUtils]: 108: Hoare triple {142331#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,833 INFO L290 TraceCheckUtils]: 107: Hoare triple {142331#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,833 INFO L290 TraceCheckUtils]: 106: Hoare triple {142331#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,833 INFO L290 TraceCheckUtils]: 105: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,833 INFO L290 TraceCheckUtils]: 104: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,834 INFO L290 TraceCheckUtils]: 103: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,834 INFO L290 TraceCheckUtils]: 102: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,834 INFO L290 TraceCheckUtils]: 101: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,834 INFO L290 TraceCheckUtils]: 100: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,834 INFO L290 TraceCheckUtils]: 99: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-15 11:47:20,834 INFO L290 TraceCheckUtils]: 98: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-15 11:47:20,834 INFO L290 TraceCheckUtils]: 97: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-15 11:47:20,834 INFO L290 TraceCheckUtils]: 96: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,834 INFO L290 TraceCheckUtils]: 95: Hoare triple {142331#true} assume !(0 == ~tmp___6~0); {142331#true} is VALID [2022-04-15 11:47:20,834 INFO L290 TraceCheckUtils]: 94: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,834 INFO L290 TraceCheckUtils]: 93: Hoare triple {142331#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {142331#true} is VALID [2022-04-15 11:47:20,834 INFO L290 TraceCheckUtils]: 92: Hoare triple {142331#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {142331#true} is VALID [2022-04-15 11:47:20,834 INFO L290 TraceCheckUtils]: 91: Hoare triple {142331#true} assume 4416 == #t~mem60;havoc #t~mem60; {142331#true} is VALID [2022-04-15 11:47:20,834 INFO L290 TraceCheckUtils]: 90: Hoare triple {142331#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,834 INFO L290 TraceCheckUtils]: 89: Hoare triple {142331#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,835 INFO L290 TraceCheckUtils]: 88: Hoare triple {142331#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,835 INFO L290 TraceCheckUtils]: 87: Hoare triple {142331#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,835 INFO L290 TraceCheckUtils]: 86: Hoare triple {142331#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,835 INFO L290 TraceCheckUtils]: 85: Hoare triple {142331#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,835 INFO L290 TraceCheckUtils]: 84: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,835 INFO L290 TraceCheckUtils]: 83: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,835 INFO L290 TraceCheckUtils]: 82: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,835 INFO L290 TraceCheckUtils]: 81: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,835 INFO L290 TraceCheckUtils]: 80: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,835 INFO L290 TraceCheckUtils]: 79: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,835 INFO L290 TraceCheckUtils]: 78: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-15 11:47:20,835 INFO L290 TraceCheckUtils]: 77: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-15 11:47:20,835 INFO L290 TraceCheckUtils]: 76: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-15 11:47:20,835 INFO L290 TraceCheckUtils]: 75: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,836 INFO L290 TraceCheckUtils]: 74: Hoare triple {142331#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,836 INFO L290 TraceCheckUtils]: 73: Hoare triple {142331#true} assume !(~ret~0 <= 0); {142331#true} is VALID [2022-04-15 11:47:20,836 INFO L290 TraceCheckUtils]: 72: Hoare triple {142331#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {142331#true} is VALID [2022-04-15 11:47:20,836 INFO L290 TraceCheckUtils]: 71: Hoare triple {142331#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; {142331#true} is VALID [2022-04-15 11:47:20,836 INFO L290 TraceCheckUtils]: 70: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,836 INFO L290 TraceCheckUtils]: 69: Hoare triple {142331#true} assume 4400 == #t~mem58;havoc #t~mem58; {142331#true} is VALID [2022-04-15 11:47:20,836 INFO L290 TraceCheckUtils]: 68: Hoare triple {142331#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,836 INFO L290 TraceCheckUtils]: 67: Hoare triple {142331#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,836 INFO L290 TraceCheckUtils]: 66: Hoare triple {142331#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,836 INFO L290 TraceCheckUtils]: 65: Hoare triple {142331#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,836 INFO L290 TraceCheckUtils]: 64: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,836 INFO L290 TraceCheckUtils]: 63: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,836 INFO L290 TraceCheckUtils]: 62: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,836 INFO L290 TraceCheckUtils]: 61: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,837 INFO L290 TraceCheckUtils]: 60: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,837 INFO L290 TraceCheckUtils]: 59: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,837 INFO L290 TraceCheckUtils]: 58: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-15 11:47:20,837 INFO L290 TraceCheckUtils]: 57: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-15 11:47:20,837 INFO L290 TraceCheckUtils]: 56: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-15 11:47:20,837 INFO L290 TraceCheckUtils]: 55: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,837 INFO L290 TraceCheckUtils]: 54: Hoare triple {142331#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,837 INFO L290 TraceCheckUtils]: 53: Hoare triple {142331#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,837 INFO L290 TraceCheckUtils]: 52: Hoare triple {142331#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,837 INFO L290 TraceCheckUtils]: 51: Hoare triple {142331#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {142331#true} is VALID [2022-04-15 11:47:20,837 INFO L290 TraceCheckUtils]: 50: Hoare triple {142331#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {142331#true} is VALID [2022-04-15 11:47:20,837 INFO L290 TraceCheckUtils]: 49: Hoare triple {142331#true} assume 4384 == #t~mem56;havoc #t~mem56; {142331#true} is VALID [2022-04-15 11:47:20,837 INFO L290 TraceCheckUtils]: 48: Hoare triple {142331#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,837 INFO L290 TraceCheckUtils]: 47: Hoare triple {142331#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,837 INFO L290 TraceCheckUtils]: 46: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,838 INFO L290 TraceCheckUtils]: 45: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,838 INFO L290 TraceCheckUtils]: 44: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,838 INFO L290 TraceCheckUtils]: 43: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,838 INFO L290 TraceCheckUtils]: 42: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,838 INFO L290 TraceCheckUtils]: 41: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,838 INFO L290 TraceCheckUtils]: 40: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-15 11:47:20,838 INFO L290 TraceCheckUtils]: 39: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-15 11:47:20,838 INFO L290 TraceCheckUtils]: 38: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-15 11:47:20,838 INFO L290 TraceCheckUtils]: 37: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,838 INFO L290 TraceCheckUtils]: 36: Hoare triple {142331#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; {142331#true} is VALID [2022-04-15 11:47:20,838 INFO L290 TraceCheckUtils]: 35: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,838 INFO L290 TraceCheckUtils]: 34: Hoare triple {142331#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {142331#true} is VALID [2022-04-15 11:47:20,838 INFO L290 TraceCheckUtils]: 33: Hoare triple {142331#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; {142331#true} is VALID [2022-04-15 11:47:20,838 INFO L290 TraceCheckUtils]: 32: Hoare triple {142331#true} assume 4368 == #t~mem54;havoc #t~mem54; {142331#true} is VALID [2022-04-15 11:47:20,839 INFO L290 TraceCheckUtils]: 31: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,839 INFO L290 TraceCheckUtils]: 30: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,839 INFO L290 TraceCheckUtils]: 28: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,839 INFO L290 TraceCheckUtils]: 27: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,839 INFO L290 TraceCheckUtils]: 26: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-15 11:47:20,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-15 11:47:20,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-15 11:47:20,839 INFO L290 TraceCheckUtils]: 22: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,839 INFO L290 TraceCheckUtils]: 20: Hoare triple {142331#true} assume !(0 == ~tmp___4~0); {142331#true} is VALID [2022-04-15 11:47:20,839 INFO L290 TraceCheckUtils]: 19: Hoare triple {142331#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {142331#true} is VALID [2022-04-15 11:47:20,839 INFO L290 TraceCheckUtils]: 18: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {142331#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {142331#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {142331#true} is VALID [2022-04-15 11:47:20,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {142331#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {142331#true} is VALID [2022-04-15 11:47:20,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {142331#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; {142331#true} is VALID [2022-04-15 11:47:20,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {142331#true} assume 12292 == #t~mem49;havoc #t~mem49; {142331#true} is VALID [2022-04-15 11:47:20,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-15 11:47:20,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {142331#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {142331#true} is VALID [2022-04-15 11:47:20,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {142331#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; {142331#true} is VALID [2022-04-15 11:47:20,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {142331#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; {142331#true} is VALID [2022-04-15 11:47:20,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,840 INFO L272 TraceCheckUtils]: 6: Hoare triple {142331#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {142331#true} is VALID [2022-04-15 11:47:20,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {142331#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; {142331#true} is VALID [2022-04-15 11:47:20,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {142331#true} call #t~ret158 := main(); {142331#true} is VALID [2022-04-15 11:47:20,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142331#true} {142331#true} #593#return; {142331#true} is VALID [2022-04-15 11:47:20,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {142331#true} assume true; {142331#true} is VALID [2022-04-15 11:47:20,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {142331#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); {142331#true} is VALID [2022-04-15 11:47:20,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {142331#true} call ULTIMATE.init(); {142331#true} is VALID [2022-04-15 11:47:20,841 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2022-04-15 11:47:20,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628062975] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 11:47:20,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:47:20,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 8] total 10 [2022-04-15 11:47:20,842 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:20,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1100213173] [2022-04-15 11:47:20,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1100213173] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:20,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:20,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:47:20,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171349793] [2022-04-15 11:47:20,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:20,842 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 178 [2022-04-15 11:47:20,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:20,843 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-15 11:47:20,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:20,913 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:47:20,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:20,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:47:20,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-15 11:47:20,914 INFO L87 Difference]: Start difference. First operand 1225 states and 1745 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-15 11:47:24,954 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:29,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:29,078 INFO L93 Difference]: Finished difference Result 2778 states and 3958 transitions. [2022-04-15 11:47:29,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:47:29,079 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 178 [2022-04-15 11:47:29,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:29,079 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-15 11:47:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2022-04-15 11:47:29,084 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-15 11:47:29,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2022-04-15 11:47:29,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 471 transitions. [2022-04-15 11:47:29,370 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-15 11:47:29,473 INFO L225 Difference]: With dead ends: 2778 [2022-04-15 11:47:29,473 INFO L226 Difference]: Without dead ends: 1569 [2022-04-15 11:47:29,475 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-15 11:47:29,475 INFO L913 BasicCegarLoop]: 100 mSDtfsCounter, 113 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:29,475 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 282 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 11:47:29,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2022-04-15 11:47:30,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1225. [2022-04-15 11:47:30,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:30,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1569 states. Second operand has 1225 states, 1220 states have (on average 1.407377049180328) internal successors, (1717), 1220 states have internal predecessors, (1717), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:30,302 INFO L74 IsIncluded]: Start isIncluded. First operand 1569 states. Second operand has 1225 states, 1220 states have (on average 1.407377049180328) internal successors, (1717), 1220 states have internal predecessors, (1717), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:30,303 INFO L87 Difference]: Start difference. First operand 1569 states. Second operand has 1225 states, 1220 states have (on average 1.407377049180328) internal successors, (1717), 1220 states have internal predecessors, (1717), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:30,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:30,368 INFO L93 Difference]: Finished difference Result 1569 states and 2209 transitions. [2022-04-15 11:47:30,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2209 transitions. [2022-04-15 11:47:30,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:30,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:30,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 1225 states, 1220 states have (on average 1.407377049180328) internal successors, (1717), 1220 states have internal predecessors, (1717), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1569 states. [2022-04-15 11:47:30,372 INFO L87 Difference]: Start difference. First operand has 1225 states, 1220 states have (on average 1.407377049180328) internal successors, (1717), 1220 states have internal predecessors, (1717), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1569 states. [2022-04-15 11:47:30,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:30,444 INFO L93 Difference]: Finished difference Result 1569 states and 2209 transitions. [2022-04-15 11:47:30,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2209 transitions. [2022-04-15 11:47:30,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:30,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:30,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:30,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:30,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1220 states have (on average 1.407377049180328) internal successors, (1717), 1220 states have internal predecessors, (1717), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:30,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1721 transitions. [2022-04-15 11:47:30,502 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1721 transitions. Word has length 178 [2022-04-15 11:47:30,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:30,502 INFO L478 AbstractCegarLoop]: Abstraction has 1225 states and 1721 transitions. [2022-04-15 11:47:30,503 INFO L479 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-15 11:47:30,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1225 states and 1721 transitions. [2022-04-15 11:47:32,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1721 edges. 1721 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:32,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1721 transitions. [2022-04-15 11:47:32,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-04-15 11:47:32,363 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:32,364 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:47:32,404 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-15 11:47:32,564 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-15 11:47:32,564 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:32,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:32,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1310777641, now seen corresponding path program 1 times [2022-04-15 11:47:32,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:32,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1289259644] [2022-04-15 11:47:45,807 WARN L232 SmtUtils]: Spent 7.75s 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-15 11:47:54,106 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:54,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1310777641, now seen corresponding path program 2 times [2022-04-15 11:47:54,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:54,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952798903] [2022-04-15 11:47:54,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:54,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:54,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:54,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {154564#(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); {154557#true} is VALID [2022-04-15 11:47:54,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {154557#true} assume true; {154557#true} is VALID [2022-04-15 11:47:54,298 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154557#true} {154557#true} #593#return; {154557#true} is VALID [2022-04-15 11:47:54,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {154557#true} call ULTIMATE.init(); {154564#(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-15 11:47:54,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {154564#(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); {154557#true} is VALID [2022-04-15 11:47:54,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {154557#true} assume true; {154557#true} is VALID [2022-04-15 11:47:54,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154557#true} {154557#true} #593#return; {154557#true} is VALID [2022-04-15 11:47:54,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {154557#true} call #t~ret158 := main(); {154557#true} is VALID [2022-04-15 11:47:54,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {154557#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; {154557#true} is VALID [2022-04-15 11:47:54,299 INFO L272 TraceCheckUtils]: 6: Hoare triple {154557#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {154557#true} is VALID [2022-04-15 11:47:54,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {154557#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); {154557#true} is VALID [2022-04-15 11:47:54,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {154557#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; {154557#true} is VALID [2022-04-15 11:47:54,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {154557#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; {154557#true} is VALID [2022-04-15 11:47:54,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {154557#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {154557#true} is VALID [2022-04-15 11:47:54,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {154557#true} assume !false; {154557#true} is VALID [2022-04-15 11:47:54,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {154557#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); {154557#true} is VALID [2022-04-15 11:47:54,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {154557#true} assume 12292 == #t~mem49;havoc #t~mem49; {154557#true} is VALID [2022-04-15 11:47:54,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {154557#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; {154557#true} is VALID [2022-04-15 11:47:54,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {154557#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {154557#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {154557#true} is VALID [2022-04-15 11:47:54,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {154557#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {154557#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); {154557#true} is VALID [2022-04-15 11:47:54,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {154557#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {154557#true} is VALID [2022-04-15 11:47:54,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {154557#true} assume !(0 == ~tmp___4~0); {154557#true} is VALID [2022-04-15 11:47:54,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {154557#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); {154557#true} is VALID [2022-04-15 11:47:54,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {154557#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); {154557#true} is VALID [2022-04-15 11:47:54,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {154557#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {154557#true} is VALID [2022-04-15 11:47:54,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {154557#true} ~skip~0 := 0; {154557#true} is VALID [2022-04-15 11:47:54,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {154557#true} assume !false; {154557#true} is VALID [2022-04-15 11:47:54,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {154557#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); {154557#true} is VALID [2022-04-15 11:47:54,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {154557#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {154557#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {154557#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {154557#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {154557#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {154557#true} assume 4368 == #t~mem54;havoc #t~mem54; {154557#true} is VALID [2022-04-15 11:47:54,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {154557#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; {154557#true} is VALID [2022-04-15 11:47:54,301 INFO L290 TraceCheckUtils]: 34: Hoare triple {154557#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {154557#true} is VALID [2022-04-15 11:47:54,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {154557#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); {154557#true} is VALID [2022-04-15 11:47:54,301 INFO L290 TraceCheckUtils]: 36: Hoare triple {154557#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; {154557#true} is VALID [2022-04-15 11:47:54,301 INFO L290 TraceCheckUtils]: 37: Hoare triple {154557#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); {154557#true} is VALID [2022-04-15 11:47:54,302 INFO L290 TraceCheckUtils]: 38: Hoare triple {154557#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {154557#true} is VALID [2022-04-15 11:47:54,302 INFO L290 TraceCheckUtils]: 39: Hoare triple {154557#true} ~skip~0 := 0; {154557#true} is VALID [2022-04-15 11:47:54,302 INFO L290 TraceCheckUtils]: 40: Hoare triple {154557#true} assume !false; {154557#true} is VALID [2022-04-15 11:47:54,302 INFO L290 TraceCheckUtils]: 41: Hoare triple {154557#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); {154557#true} is VALID [2022-04-15 11:47:54,302 INFO L290 TraceCheckUtils]: 42: Hoare triple {154557#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,302 INFO L290 TraceCheckUtils]: 43: Hoare triple {154557#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,302 INFO L290 TraceCheckUtils]: 44: Hoare triple {154557#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,302 INFO L290 TraceCheckUtils]: 45: Hoare triple {154557#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,302 INFO L290 TraceCheckUtils]: 46: Hoare triple {154557#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,302 INFO L290 TraceCheckUtils]: 47: Hoare triple {154557#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,302 INFO L290 TraceCheckUtils]: 48: Hoare triple {154557#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,302 INFO L290 TraceCheckUtils]: 49: Hoare triple {154557#true} assume 4384 == #t~mem56;havoc #t~mem56; {154557#true} is VALID [2022-04-15 11:47:54,302 INFO L290 TraceCheckUtils]: 50: Hoare triple {154557#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {154557#true} is VALID [2022-04-15 11:47:54,302 INFO L290 TraceCheckUtils]: 51: Hoare triple {154557#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {154557#true} is VALID [2022-04-15 11:47:54,302 INFO L290 TraceCheckUtils]: 52: Hoare triple {154557#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,303 INFO L290 TraceCheckUtils]: 53: Hoare triple {154557#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,303 INFO L290 TraceCheckUtils]: 54: Hoare triple {154557#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,303 INFO L290 TraceCheckUtils]: 55: Hoare triple {154557#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); {154557#true} is VALID [2022-04-15 11:47:54,303 INFO L290 TraceCheckUtils]: 56: Hoare triple {154557#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {154557#true} is VALID [2022-04-15 11:47:54,303 INFO L290 TraceCheckUtils]: 57: Hoare triple {154557#true} ~skip~0 := 0; {154557#true} is VALID [2022-04-15 11:47:54,303 INFO L290 TraceCheckUtils]: 58: Hoare triple {154557#true} assume !false; {154557#true} is VALID [2022-04-15 11:47:54,303 INFO L290 TraceCheckUtils]: 59: Hoare triple {154557#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); {154557#true} is VALID [2022-04-15 11:47:54,303 INFO L290 TraceCheckUtils]: 60: Hoare triple {154557#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,303 INFO L290 TraceCheckUtils]: 61: Hoare triple {154557#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,303 INFO L290 TraceCheckUtils]: 62: Hoare triple {154557#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,303 INFO L290 TraceCheckUtils]: 63: Hoare triple {154557#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,303 INFO L290 TraceCheckUtils]: 64: Hoare triple {154557#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,303 INFO L290 TraceCheckUtils]: 65: Hoare triple {154557#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,303 INFO L290 TraceCheckUtils]: 66: Hoare triple {154557#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,303 INFO L290 TraceCheckUtils]: 67: Hoare triple {154557#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,304 INFO L290 TraceCheckUtils]: 68: Hoare triple {154557#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,304 INFO L290 TraceCheckUtils]: 69: Hoare triple {154557#true} assume 4400 == #t~mem58;havoc #t~mem58; {154557#true} is VALID [2022-04-15 11:47:54,304 INFO L290 TraceCheckUtils]: 70: Hoare triple {154557#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); {154557#true} is VALID [2022-04-15 11:47:54,304 INFO L290 TraceCheckUtils]: 71: Hoare triple {154557#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; {154557#true} is VALID [2022-04-15 11:47:54,304 INFO L290 TraceCheckUtils]: 72: Hoare triple {154557#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {154557#true} is VALID [2022-04-15 11:47:54,304 INFO L290 TraceCheckUtils]: 73: Hoare triple {154557#true} assume !(~ret~0 <= 0); {154557#true} is VALID [2022-04-15 11:47:54,304 INFO L290 TraceCheckUtils]: 74: Hoare triple {154557#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,304 INFO L290 TraceCheckUtils]: 75: Hoare triple {154557#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); {154557#true} is VALID [2022-04-15 11:47:54,304 INFO L290 TraceCheckUtils]: 76: Hoare triple {154557#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {154557#true} is VALID [2022-04-15 11:47:54,304 INFO L290 TraceCheckUtils]: 77: Hoare triple {154557#true} ~skip~0 := 0; {154557#true} is VALID [2022-04-15 11:47:54,304 INFO L290 TraceCheckUtils]: 78: Hoare triple {154557#true} assume !false; {154557#true} is VALID [2022-04-15 11:47:54,304 INFO L290 TraceCheckUtils]: 79: Hoare triple {154557#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); {154557#true} is VALID [2022-04-15 11:47:54,304 INFO L290 TraceCheckUtils]: 80: Hoare triple {154557#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,304 INFO L290 TraceCheckUtils]: 81: Hoare triple {154557#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,305 INFO L290 TraceCheckUtils]: 82: Hoare triple {154557#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,305 INFO L290 TraceCheckUtils]: 83: Hoare triple {154557#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,305 INFO L290 TraceCheckUtils]: 84: Hoare triple {154557#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,305 INFO L290 TraceCheckUtils]: 85: Hoare triple {154557#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,305 INFO L290 TraceCheckUtils]: 86: Hoare triple {154557#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,305 INFO L290 TraceCheckUtils]: 87: Hoare triple {154557#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,305 INFO L290 TraceCheckUtils]: 88: Hoare triple {154557#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,305 INFO L290 TraceCheckUtils]: 89: Hoare triple {154557#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,305 INFO L290 TraceCheckUtils]: 90: Hoare triple {154557#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,305 INFO L290 TraceCheckUtils]: 91: Hoare triple {154557#true} assume 4416 == #t~mem60;havoc #t~mem60; {154557#true} is VALID [2022-04-15 11:47:54,305 INFO L290 TraceCheckUtils]: 92: Hoare triple {154557#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {154557#true} is VALID [2022-04-15 11:47:54,305 INFO L290 TraceCheckUtils]: 93: Hoare triple {154557#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {154557#true} is VALID [2022-04-15 11:47:54,305 INFO L290 TraceCheckUtils]: 94: Hoare triple {154557#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); {154557#true} is VALID [2022-04-15 11:47:54,305 INFO L290 TraceCheckUtils]: 95: Hoare triple {154557#true} assume !(0 == ~tmp___6~0); {154557#true} is VALID [2022-04-15 11:47:54,305 INFO L290 TraceCheckUtils]: 96: Hoare triple {154557#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); {154557#true} is VALID [2022-04-15 11:47:54,306 INFO L290 TraceCheckUtils]: 97: Hoare triple {154557#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {154557#true} is VALID [2022-04-15 11:47:54,306 INFO L290 TraceCheckUtils]: 98: Hoare triple {154557#true} ~skip~0 := 0; {154557#true} is VALID [2022-04-15 11:47:54,306 INFO L290 TraceCheckUtils]: 99: Hoare triple {154557#true} assume !false; {154557#true} is VALID [2022-04-15 11:47:54,306 INFO L290 TraceCheckUtils]: 100: Hoare triple {154557#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); {154557#true} is VALID [2022-04-15 11:47:54,306 INFO L290 TraceCheckUtils]: 101: Hoare triple {154557#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,306 INFO L290 TraceCheckUtils]: 102: Hoare triple {154557#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,306 INFO L290 TraceCheckUtils]: 103: Hoare triple {154557#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,306 INFO L290 TraceCheckUtils]: 104: Hoare triple {154557#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,306 INFO L290 TraceCheckUtils]: 105: Hoare triple {154557#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,306 INFO L290 TraceCheckUtils]: 106: Hoare triple {154557#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,306 INFO L290 TraceCheckUtils]: 107: Hoare triple {154557#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,306 INFO L290 TraceCheckUtils]: 108: Hoare triple {154557#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,306 INFO L290 TraceCheckUtils]: 109: Hoare triple {154557#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,306 INFO L290 TraceCheckUtils]: 110: Hoare triple {154557#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,306 INFO L290 TraceCheckUtils]: 111: Hoare triple {154557#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,307 INFO L290 TraceCheckUtils]: 112: Hoare triple {154557#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,307 INFO L290 TraceCheckUtils]: 113: Hoare triple {154557#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,307 INFO L290 TraceCheckUtils]: 114: Hoare triple {154557#true} assume 4432 == #t~mem62;havoc #t~mem62; {154557#true} is VALID [2022-04-15 11:47:54,307 INFO L290 TraceCheckUtils]: 115: Hoare triple {154557#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {154557#true} is VALID [2022-04-15 11:47:54,307 INFO L290 TraceCheckUtils]: 116: Hoare triple {154557#true} assume !(5 == ~blastFlag~0); {154557#true} is VALID [2022-04-15 11:47:54,307 INFO L290 TraceCheckUtils]: 117: Hoare triple {154557#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); {154557#true} is VALID [2022-04-15 11:47:54,307 INFO L290 TraceCheckUtils]: 118: Hoare triple {154557#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); {154557#true} is VALID [2022-04-15 11:47:54,307 INFO L290 TraceCheckUtils]: 119: Hoare triple {154557#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {154557#true} is VALID [2022-04-15 11:47:54,307 INFO L290 TraceCheckUtils]: 120: Hoare triple {154557#true} ~skip~0 := 0; {154557#true} is VALID [2022-04-15 11:47:54,307 INFO L290 TraceCheckUtils]: 121: Hoare triple {154557#true} assume !false; {154557#true} is VALID [2022-04-15 11:47:54,307 INFO L290 TraceCheckUtils]: 122: Hoare triple {154557#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); {154557#true} is VALID [2022-04-15 11:47:54,307 INFO L290 TraceCheckUtils]: 123: Hoare triple {154557#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,307 INFO L290 TraceCheckUtils]: 124: Hoare triple {154557#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,307 INFO L290 TraceCheckUtils]: 125: Hoare triple {154557#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,307 INFO L290 TraceCheckUtils]: 126: Hoare triple {154557#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,308 INFO L290 TraceCheckUtils]: 127: Hoare triple {154557#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,308 INFO L290 TraceCheckUtils]: 128: Hoare triple {154557#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,308 INFO L290 TraceCheckUtils]: 129: Hoare triple {154557#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,308 INFO L290 TraceCheckUtils]: 130: Hoare triple {154557#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,308 INFO L290 TraceCheckUtils]: 131: Hoare triple {154557#true} assume 4385 == #t~mem57;havoc #t~mem57; {154557#true} is VALID [2022-04-15 11:47:54,308 INFO L290 TraceCheckUtils]: 132: Hoare triple {154557#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {154557#true} is VALID [2022-04-15 11:47:54,308 INFO L290 TraceCheckUtils]: 133: Hoare triple {154557#true} assume !(1 == ~blastFlag~0); {154557#true} is VALID [2022-04-15 11:47:54,308 INFO L290 TraceCheckUtils]: 134: Hoare triple {154557#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {154557#true} is VALID [2022-04-15 11:47:54,308 INFO L290 TraceCheckUtils]: 135: Hoare triple {154557#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,308 INFO L290 TraceCheckUtils]: 136: Hoare triple {154557#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,308 INFO L290 TraceCheckUtils]: 137: Hoare triple {154557#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,308 INFO L290 TraceCheckUtils]: 138: Hoare triple {154557#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); {154557#true} is VALID [2022-04-15 11:47:54,308 INFO L290 TraceCheckUtils]: 139: Hoare triple {154557#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {154557#true} is VALID [2022-04-15 11:47:54,308 INFO L290 TraceCheckUtils]: 140: Hoare triple {154557#true} ~skip~0 := 0; {154557#true} is VALID [2022-04-15 11:47:54,308 INFO L290 TraceCheckUtils]: 141: Hoare triple {154557#true} assume !false; {154557#true} is VALID [2022-04-15 11:47:54,309 INFO L290 TraceCheckUtils]: 142: Hoare triple {154557#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); {154557#true} is VALID [2022-04-15 11:47:54,309 INFO L290 TraceCheckUtils]: 143: Hoare triple {154557#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,309 INFO L290 TraceCheckUtils]: 144: Hoare triple {154557#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,309 INFO L290 TraceCheckUtils]: 145: Hoare triple {154557#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,309 INFO L290 TraceCheckUtils]: 146: Hoare triple {154557#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,309 INFO L290 TraceCheckUtils]: 147: Hoare triple {154557#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,309 INFO L290 TraceCheckUtils]: 148: Hoare triple {154557#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,309 INFO L290 TraceCheckUtils]: 149: Hoare triple {154557#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,309 INFO L290 TraceCheckUtils]: 150: Hoare triple {154557#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,309 INFO L290 TraceCheckUtils]: 151: Hoare triple {154557#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {154557#true} is VALID [2022-04-15 11:47:54,309 INFO L290 TraceCheckUtils]: 152: Hoare triple {154557#true} assume 4400 == #t~mem58;havoc #t~mem58; {154557#true} is VALID [2022-04-15 11:47:54,309 INFO L290 TraceCheckUtils]: 153: Hoare triple {154557#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); {154557#true} is VALID [2022-04-15 11:47:54,309 INFO L290 TraceCheckUtils]: 154: Hoare triple {154557#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;~skip~0 := 1; {154557#true} is VALID [2022-04-15 11:47:54,310 INFO L290 TraceCheckUtils]: 155: Hoare triple {154557#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {154562#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:54,311 INFO L290 TraceCheckUtils]: 156: Hoare triple {154562#(= 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); {154562#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:54,311 INFO L290 TraceCheckUtils]: 157: Hoare triple {154562#(= 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; {154562#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:54,311 INFO L290 TraceCheckUtils]: 158: Hoare triple {154562#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {154562#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:54,312 INFO L290 TraceCheckUtils]: 159: Hoare triple {154562#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {154562#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:54,312 INFO L290 TraceCheckUtils]: 160: Hoare triple {154562#(= 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); {154562#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:54,312 INFO L290 TraceCheckUtils]: 161: Hoare triple {154562#(= 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); {154562#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:54,313 INFO L290 TraceCheckUtils]: 162: Hoare triple {154562#(= 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); {154562#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:54,313 INFO L290 TraceCheckUtils]: 163: Hoare triple {154562#(= 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); {154562#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:54,313 INFO L290 TraceCheckUtils]: 164: Hoare triple {154562#(= 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); {154562#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:54,314 INFO L290 TraceCheckUtils]: 165: Hoare triple {154562#(= 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); {154562#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:54,314 INFO L290 TraceCheckUtils]: 166: Hoare triple {154562#(= 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); {154562#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:54,314 INFO L290 TraceCheckUtils]: 167: Hoare triple {154562#(= 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); {154562#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:54,315 INFO L290 TraceCheckUtils]: 168: Hoare triple {154562#(= 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); {154562#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:54,315 INFO L290 TraceCheckUtils]: 169: Hoare triple {154562#(= 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); {154562#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:54,315 INFO L290 TraceCheckUtils]: 170: Hoare triple {154562#(= 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); {154562#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:54,316 INFO L290 TraceCheckUtils]: 171: Hoare triple {154562#(= 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); {154563#(= |ssl3_connect_#t~mem60| 4416)} is VALID [2022-04-15 11:47:54,316 INFO L290 TraceCheckUtils]: 172: Hoare triple {154563#(= |ssl3_connect_#t~mem60| 4416)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {154558#false} is VALID [2022-04-15 11:47:54,316 INFO L290 TraceCheckUtils]: 173: Hoare triple {154558#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {154558#false} is VALID [2022-04-15 11:47:54,316 INFO L290 TraceCheckUtils]: 174: Hoare triple {154558#false} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {154558#false} is VALID [2022-04-15 11:47:54,316 INFO L290 TraceCheckUtils]: 175: Hoare triple {154558#false} assume 4433 == #t~mem63;havoc #t~mem63; {154558#false} is VALID [2022-04-15 11:47:54,316 INFO L290 TraceCheckUtils]: 176: Hoare triple {154558#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {154558#false} is VALID [2022-04-15 11:47:54,316 INFO L290 TraceCheckUtils]: 177: Hoare triple {154558#false} assume 5 == ~blastFlag~0; {154558#false} is VALID [2022-04-15 11:47:54,316 INFO L290 TraceCheckUtils]: 178: Hoare triple {154558#false} assume !false; {154558#false} is VALID [2022-04-15 11:47:54,317 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2022-04-15 11:47:54,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:54,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952798903] [2022-04-15 11:47:54,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952798903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:54,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:54,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:54,317 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:54,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1289259644] [2022-04-15 11:47:54,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1289259644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:54,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:54,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:54,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977696099] [2022-04-15 11:47:54,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:54,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 179 [2022-04-15 11:47:54,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:54,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:54,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:54,376 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:47:54,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:54,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:47:54,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:47:54,377 INFO L87 Difference]: Start difference. First operand 1225 states and 1721 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)