/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.02.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 08:31:50,765 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:31:50,767 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:31:50,809 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:31:50,809 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:31:50,810 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:31:50,816 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:31:50,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:31:50,821 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:31:50,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:31:50,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:31:50,827 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:31:50,827 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:31:50,829 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:31:50,830 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:31:50,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:31:50,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:31:50,833 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:31:50,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:31:50,842 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:31:50,844 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:31:50,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:31:50,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:31:50,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:31:50,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:31:50,858 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:31:50,858 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:31:50,858 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:31:50,859 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:31:50,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:31:50,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:31:50,861 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:31:50,862 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:31:50,863 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:31:50,863 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:31:50,864 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:31:50,864 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:31:50,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:31:50,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:31:50,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:31:50,865 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:31:50,867 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:31:50,867 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 08:31:50,879 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:31:50,880 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:31:50,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:31:50,881 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:31:50,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:31:50,881 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:31:50,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:31:50,881 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:31:50,881 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:31:50,882 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:31:50,882 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:31:50,882 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:31:50,882 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:31:50,883 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:31:50,883 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:31:50,883 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:31:50,883 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:31:50,883 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:31:50,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:31:50,883 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:31:50,883 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:31:50,883 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:31:50,884 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:31:50,884 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:31:50,884 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:31:50,884 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 08:31:51,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:31:51,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:31:51,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:31:51,146 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:31:51,147 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:31:51,148 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.02.i.cil-2.c [2022-04-28 08:31:51,224 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ddda9cff/e6f3822cb1e440c3a1613dc64482164b/FLAGda39353c3 [2022-04-28 08:31:51,696 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:31:51,696 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.02.i.cil-2.c [2022-04-28 08:31:51,711 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ddda9cff/e6f3822cb1e440c3a1613dc64482164b/FLAGda39353c3 [2022-04-28 08:31:52,014 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ddda9cff/e6f3822cb1e440c3a1613dc64482164b [2022-04-28 08:31:52,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:31:52,017 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:31:52,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:31:52,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:31:52,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:31:52,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:31:52" (1/1) ... [2022-04-28 08:31:52,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc7c3b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:31:52, skipping insertion in model container [2022-04-28 08:31:52,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:31:52" (1/1) ... [2022-04-28 08:31:52,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:31:52,080 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:31:52,453 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.02.i.cil-2.c[65398,65411] [2022-04-28 08:31:52,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:31:52,495 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:31:52,580 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.02.i.cil-2.c[65398,65411] [2022-04-28 08:31:52,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:31:52,598 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:31:52,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:31:52 WrapperNode [2022-04-28 08:31:52,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:31:52,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:31:52,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:31:52,600 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:31:52,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:31:52" (1/1) ... [2022-04-28 08:31:52,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:31:52" (1/1) ... [2022-04-28 08:31:52,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:31:52" (1/1) ... [2022-04-28 08:31:52,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:31:52" (1/1) ... [2022-04-28 08:31:52,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:31:52" (1/1) ... [2022-04-28 08:31:52,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:31:52" (1/1) ... [2022-04-28 08:31:52,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:31:52" (1/1) ... [2022-04-28 08:31:52,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:31:52,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:31:52,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:31:52,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:31:52,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:31:52" (1/1) ... [2022-04-28 08:31:52,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:31:52,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:31:52,784 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 08:31:52,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 08:31:52,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:31:52,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:31:52,826 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:31:52,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-28 08:31:52,826 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-28 08:31:52,826 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:31:52,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-28 08:31:52,826 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-28 08:31:52,827 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-28 08:31:52,827 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-28 08:31:52,827 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:31:52,828 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:31:52,828 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:31:52,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:31:52,828 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 08:31:52,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 08:31:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:31:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 08:31:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 08:31:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-28 08:31:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-28 08:31:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-28 08:31:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-28 08:31:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-28 08:31:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-28 08:31:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 08:31:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:31:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 08:31:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:31:52,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 08:31:52,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:31:52,830 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-28 08:31:52,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-28 08:31:52,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:31:52,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:31:52,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:31:52,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-28 08:31:52,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-28 08:31:52,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-28 08:31:52,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-28 08:31:52,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:31:53,019 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:31:53,020 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:31:54,438 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:31:55,015 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-28 08:31:55,015 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-28 08:31:55,038 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:31:55,046 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:31:55,046 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 08:31:55,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:31:55 BoogieIcfgContainer [2022-04-28 08:31:55,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:31:55,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:31:55,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:31:55,056 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:31:55,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:31:52" (1/3) ... [2022-04-28 08:31:55,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ca942e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:31:55, skipping insertion in model container [2022-04-28 08:31:55,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:31:52" (2/3) ... [2022-04-28 08:31:55,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ca942e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:31:55, skipping insertion in model container [2022-04-28 08:31:55,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:31:55" (3/3) ... [2022-04-28 08:31:55,059 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-2.c [2022-04-28 08:31:55,073 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:31:55,073 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:31:55,124 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:31:55,129 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2b92786c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4037ab60 [2022-04-28 08:31:55,129 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:31:55,138 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 08:31:55,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 08:31:55,146 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:31:55,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:31:55,147 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:31:55,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:31:55,151 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 1 times [2022-04-28 08:31:55,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:31:55,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2036608583] [2022-04-28 08:31:55,166 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:31:55,167 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 2 times [2022-04-28 08:31:55,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:31:55,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094257362] [2022-04-28 08:31:55,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:31:55,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:31:55,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:31:55,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:31:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:31:55,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {141#true} is VALID [2022-04-28 08:31:55,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-28 08:31:55,944 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-28 08:31:55,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:31:55,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {141#true} is VALID [2022-04-28 08:31:55,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-28 08:31:55,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-28 08:31:55,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {141#true} call #t~ret158 := main(); {141#true} is VALID [2022-04-28 08:31:55,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {141#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {141#true} is VALID [2022-04-28 08:31:55,955 INFO L272 TraceCheckUtils]: 6: Hoare triple {141#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {141#true} is VALID [2022-04-28 08:31:55,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:31:55,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:31:55,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:31:55,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:31:55,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:31:55,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {147#(= 12292 |ssl3_connect_#t~mem49|)} is VALID [2022-04-28 08:31:55,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {147#(= 12292 |ssl3_connect_#t~mem49|)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-28 08:31:55,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {142#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-28 08:31:55,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {142#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-28 08:31:55,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {142#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-28 08:31:55,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {142#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-28 08:31:55,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {142#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-28 08:31:55,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {142#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-28 08:31:55,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {142#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-28 08:31:55,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {142#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-28 08:31:55,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {142#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-28 08:31:55,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {142#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-28 08:31:55,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {142#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-28 08:31:55,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {142#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-28 08:31:55,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {142#false} assume 4432 == #t~mem62;havoc #t~mem62; {142#false} is VALID [2022-04-28 08:31:55,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {142#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {142#false} is VALID [2022-04-28 08:31:55,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {142#false} assume 5 == ~blastFlag~0; {142#false} is VALID [2022-04-28 08:31:55,976 INFO L290 TraceCheckUtils]: 29: Hoare triple {142#false} assume !false; {142#false} is VALID [2022-04-28 08:31:55,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:31:55,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:31:55,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094257362] [2022-04-28 08:31:55,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094257362] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:31:55,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:31:55,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:31:55,987 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:31:55,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2036608583] [2022-04-28 08:31:55,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2036608583] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:31:55,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:31:55,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:31:55,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396022032] [2022-04-28 08:31:55,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:31:55,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 08:31:55,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:31:56,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:31:56,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:31:56,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:31:56,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:31:56,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:31:56,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:31:56,082 INFO L87 Difference]: Start difference. First operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:31:58,142 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:31:59,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:31:59,592 INFO L93 Difference]: Finished difference Result 267 states and 442 transitions. [2022-04-28 08:31:59,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:31:59,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 08:31:59,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:31:59,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:31:59,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-28 08:31:59,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:31:59,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-28 08:31:59,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-28 08:31:59,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:32:00,001 INFO L225 Difference]: With dead ends: 267 [2022-04-28 08:32:00,001 INFO L226 Difference]: Without dead ends: 122 [2022-04-28 08:32:00,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:32:00,007 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 7 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 08:32:00,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 555 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 320 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 08:32:00,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-28 08:32:00,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-04-28 08:32:00,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:32:00,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:00,044 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:00,045 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:00,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:32:00,051 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-28 08:32:00,051 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-28 08:32:00,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:32:00,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:32:00,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-28 08:32:00,054 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-28 08:32:00,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:32:00,059 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-28 08:32:00,060 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-28 08:32:00,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:32:00,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:32:00,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:32:00,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:32:00,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:00,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2022-04-28 08:32:00,068 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 30 [2022-04-28 08:32:00,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:32:00,068 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2022-04-28 08:32:00,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:00,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 178 transitions. [2022-04-28 08:32:00,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:32:00,216 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2022-04-28 08:32:00,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 08:32:00,217 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:32:00,217 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:32:00,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:32:00,218 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:32:00,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:32:00,218 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 1 times [2022-04-28 08:32:00,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:32:00,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [336019937] [2022-04-28 08:32:00,219 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:32:00,220 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 2 times [2022-04-28 08:32:00,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:32:00,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271932978] [2022-04-28 08:32:00,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:32:00,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:32:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:32:00,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:32:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:32:00,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {1179#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1173#true} is VALID [2022-04-28 08:32:00,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-28 08:32:00,539 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-28 08:32:00,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} call ULTIMATE.init(); {1179#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:32:00,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {1179#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1173#true} is VALID [2022-04-28 08:32:00,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-28 08:32:00,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-28 08:32:00,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} call #t~ret158 := main(); {1173#true} is VALID [2022-04-28 08:32:00,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {1173#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {1173#true} is VALID [2022-04-28 08:32:00,541 INFO L272 TraceCheckUtils]: 6: Hoare triple {1173#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {1173#true} is VALID [2022-04-28 08:32:00,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {1173#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 12292 == #t~mem49;havoc #t~mem49; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call write~int(0, ~s.base, 36 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,551 INFO L290 TraceCheckUtils]: 16: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,553 INFO L290 TraceCheckUtils]: 19: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___4~0); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,556 INFO L290 TraceCheckUtils]: 24: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} ~skip~0 := 0; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,558 INFO L290 TraceCheckUtils]: 27: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,559 INFO L290 TraceCheckUtils]: 28: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,559 INFO L290 TraceCheckUtils]: 29: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,559 INFO L290 TraceCheckUtils]: 30: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,560 INFO L290 TraceCheckUtils]: 31: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,560 INFO L290 TraceCheckUtils]: 32: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,561 INFO L290 TraceCheckUtils]: 33: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,561 INFO L290 TraceCheckUtils]: 34: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,562 INFO L290 TraceCheckUtils]: 35: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,562 INFO L290 TraceCheckUtils]: 36: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,563 INFO L290 TraceCheckUtils]: 37: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,563 INFO L290 TraceCheckUtils]: 38: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,564 INFO L290 TraceCheckUtils]: 39: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,564 INFO L290 TraceCheckUtils]: 40: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 4432 == #t~mem62;havoc #t~mem62; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,564 INFO L290 TraceCheckUtils]: 41: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:32:00,565 INFO L290 TraceCheckUtils]: 42: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 5 == ~blastFlag~0; {1174#false} is VALID [2022-04-28 08:32:00,565 INFO L290 TraceCheckUtils]: 43: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-28 08:32:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 08:32:00,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:32:00,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271932978] [2022-04-28 08:32:00,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271932978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:32:00,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:32:00,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:32:00,567 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:32:00,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [336019937] [2022-04-28 08:32:00,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [336019937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:32:00,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:32:00,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:32:00,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301905273] [2022-04-28 08:32:00,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:32:00,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-28 08:32:00,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:32:00,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:00,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:32:00,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:32:00,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:32:00,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:32:00,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:32:00,627 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:02,653 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:32:03,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:32:03,391 INFO L93 Difference]: Finished difference Result 326 states and 488 transitions. [2022-04-28 08:32:03,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:32:03,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-28 08:32:03,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:32:03,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:03,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2022-04-28 08:32:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:03,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2022-04-28 08:32:03,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 485 transitions. [2022-04-28 08:32:03,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 485 edges. 485 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:32:03,818 INFO L225 Difference]: With dead ends: 326 [2022-04-28 08:32:03,818 INFO L226 Difference]: Without dead ends: 221 [2022-04-28 08:32:03,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:32:03,820 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 123 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:32:03,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 320 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 08:32:03,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-04-28 08:32:03,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2022-04-28 08:32:03,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:32:03,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:03,839 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:03,840 INFO L87 Difference]: Start difference. First operand 221 states. Second operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:03,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:32:03,848 INFO L93 Difference]: Finished difference Result 221 states and 325 transitions. [2022-04-28 08:32:03,848 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 325 transitions. [2022-04-28 08:32:03,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:32:03,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:32:03,851 INFO L74 IsIncluded]: Start isIncluded. First operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 221 states. [2022-04-28 08:32:03,851 INFO L87 Difference]: Start difference. First operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 221 states. [2022-04-28 08:32:03,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:32:03,861 INFO L93 Difference]: Finished difference Result 221 states and 325 transitions. [2022-04-28 08:32:03,861 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 325 transitions. [2022-04-28 08:32:03,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:32:03,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:32:03,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:32:03,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:32:03,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:03,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 325 transitions. [2022-04-28 08:32:03,873 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 325 transitions. Word has length 44 [2022-04-28 08:32:03,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:32:03,873 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 325 transitions. [2022-04-28 08:32:03,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:03,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 221 states and 325 transitions. [2022-04-28 08:32:04,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 325 edges. 325 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:32:04,152 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 325 transitions. [2022-04-28 08:32:04,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 08:32:04,154 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:32:04,154 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:32:04,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:32:04,155 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:32:04,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:32:04,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1147706284, now seen corresponding path program 1 times [2022-04-28 08:32:04,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:32:04,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1071902461] [2022-04-28 08:32:04,156 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:32:04,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1147706284, now seen corresponding path program 2 times [2022-04-28 08:32:04,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:32:04,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024673028] [2022-04-28 08:32:04,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:32:04,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:32:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:32:04,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:32:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:32:04,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {2725#(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); {2718#true} is VALID [2022-04-28 08:32:04,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {2718#true} assume true; {2718#true} is VALID [2022-04-28 08:32:04,431 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2718#true} {2718#true} #593#return; {2718#true} is VALID [2022-04-28 08:32:04,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {2718#true} call ULTIMATE.init(); {2725#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:32:04,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {2725#(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); {2718#true} is VALID [2022-04-28 08:32:04,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {2718#true} assume true; {2718#true} is VALID [2022-04-28 08:32:04,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2718#true} {2718#true} #593#return; {2718#true} is VALID [2022-04-28 08:32:04,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {2718#true} call #t~ret158 := main(); {2718#true} is VALID [2022-04-28 08:32:04,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {2718#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; {2718#true} is VALID [2022-04-28 08:32:04,433 INFO L272 TraceCheckUtils]: 6: Hoare triple {2718#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {2718#true} is VALID [2022-04-28 08:32:04,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {2718#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); {2718#true} is VALID [2022-04-28 08:32:04,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {2718#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; {2718#true} is VALID [2022-04-28 08:32:04,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {2718#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; {2718#true} is VALID [2022-04-28 08:32:04,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {2718#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {2718#true} is VALID [2022-04-28 08:32:04,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {2718#true} assume !false; {2718#true} is VALID [2022-04-28 08:32:04,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {2718#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {2718#true} is VALID [2022-04-28 08:32:04,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {2718#true} assume 12292 == #t~mem49;havoc #t~mem49; {2718#true} is VALID [2022-04-28 08:32:04,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {2718#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; {2718#true} is VALID [2022-04-28 08:32:04,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {2718#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {2718#true} is VALID [2022-04-28 08:32:04,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {2718#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {2718#true} is VALID [2022-04-28 08:32:04,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {2718#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {2718#true} is VALID [2022-04-28 08:32:04,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {2718#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); {2718#true} is VALID [2022-04-28 08:32:04,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {2718#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {2718#true} is VALID [2022-04-28 08:32:04,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {2718#true} assume !(0 == ~tmp___4~0); {2718#true} is VALID [2022-04-28 08:32:04,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {2718#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); {2718#true} is VALID [2022-04-28 08:32:04,438 INFO L290 TraceCheckUtils]: 22: Hoare triple {2718#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); {2718#true} is VALID [2022-04-28 08:32:04,438 INFO L290 TraceCheckUtils]: 23: Hoare triple {2718#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {2718#true} is VALID [2022-04-28 08:32:04,438 INFO L290 TraceCheckUtils]: 24: Hoare triple {2718#true} ~skip~0 := 0; {2718#true} is VALID [2022-04-28 08:32:04,438 INFO L290 TraceCheckUtils]: 25: Hoare triple {2718#true} assume !false; {2718#true} is VALID [2022-04-28 08:32:04,439 INFO L290 TraceCheckUtils]: 26: Hoare triple {2718#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {2718#true} is VALID [2022-04-28 08:32:04,439 INFO L290 TraceCheckUtils]: 27: Hoare triple {2718#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {2718#true} is VALID [2022-04-28 08:32:04,442 INFO L290 TraceCheckUtils]: 28: Hoare triple {2718#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {2718#true} is VALID [2022-04-28 08:32:04,442 INFO L290 TraceCheckUtils]: 29: Hoare triple {2718#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {2718#true} is VALID [2022-04-28 08:32:04,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {2718#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {2718#true} is VALID [2022-04-28 08:32:04,443 INFO L290 TraceCheckUtils]: 31: Hoare triple {2718#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {2718#true} is VALID [2022-04-28 08:32:04,443 INFO L290 TraceCheckUtils]: 32: Hoare triple {2718#true} assume 4368 == #t~mem54;havoc #t~mem54; {2718#true} is VALID [2022-04-28 08:32:04,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {2718#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; {2718#true} is VALID [2022-04-28 08:32:04,445 INFO L290 TraceCheckUtils]: 34: Hoare triple {2718#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2718#true} is VALID [2022-04-28 08:32:04,446 INFO L290 TraceCheckUtils]: 35: Hoare triple {2718#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); {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:32:04,455 INFO L290 TraceCheckUtils]: 36: Hoare triple {2723#(= 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; {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:32:04,456 INFO L290 TraceCheckUtils]: 37: Hoare triple {2723#(= 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); {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:32:04,459 INFO L290 TraceCheckUtils]: 38: Hoare triple {2723#(= 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; {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:32:04,460 INFO L290 TraceCheckUtils]: 39: Hoare triple {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:32:04,461 INFO L290 TraceCheckUtils]: 40: Hoare triple {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:32:04,461 INFO L290 TraceCheckUtils]: 41: Hoare triple {2723#(= 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); {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:32:04,462 INFO L290 TraceCheckUtils]: 42: Hoare triple {2723#(= 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); {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:32:04,463 INFO L290 TraceCheckUtils]: 43: Hoare triple {2723#(= 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); {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:32:04,463 INFO L290 TraceCheckUtils]: 44: Hoare triple {2723#(= 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); {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:32:04,464 INFO L290 TraceCheckUtils]: 45: Hoare triple {2723#(= 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); {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:32:04,464 INFO L290 TraceCheckUtils]: 46: Hoare triple {2723#(= 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); {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:32:04,465 INFO L290 TraceCheckUtils]: 47: Hoare triple {2723#(= 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); {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:32:04,465 INFO L290 TraceCheckUtils]: 48: Hoare triple {2723#(= 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); {2724#(= |ssl3_connect_#t~mem56| 4384)} is VALID [2022-04-28 08:32:04,465 INFO L290 TraceCheckUtils]: 49: Hoare triple {2724#(= |ssl3_connect_#t~mem56| 4384)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {2719#false} is VALID [2022-04-28 08:32:04,466 INFO L290 TraceCheckUtils]: 50: Hoare triple {2719#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {2719#false} is VALID [2022-04-28 08:32:04,466 INFO L290 TraceCheckUtils]: 51: Hoare triple {2719#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {2719#false} is VALID [2022-04-28 08:32:04,466 INFO L290 TraceCheckUtils]: 52: Hoare triple {2719#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {2719#false} is VALID [2022-04-28 08:32:04,466 INFO L290 TraceCheckUtils]: 53: Hoare triple {2719#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {2719#false} is VALID [2022-04-28 08:32:04,466 INFO L290 TraceCheckUtils]: 54: Hoare triple {2719#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {2719#false} is VALID [2022-04-28 08:32:04,466 INFO L290 TraceCheckUtils]: 55: Hoare triple {2719#false} assume 4432 == #t~mem62;havoc #t~mem62; {2719#false} is VALID [2022-04-28 08:32:04,467 INFO L290 TraceCheckUtils]: 56: Hoare triple {2719#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {2719#false} is VALID [2022-04-28 08:32:04,468 INFO L290 TraceCheckUtils]: 57: Hoare triple {2719#false} assume 5 == ~blastFlag~0; {2719#false} is VALID [2022-04-28 08:32:04,468 INFO L290 TraceCheckUtils]: 58: Hoare triple {2719#false} assume !false; {2719#false} is VALID [2022-04-28 08:32:04,469 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 08:32:04,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:32:04,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024673028] [2022-04-28 08:32:04,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024673028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:32:04,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:32:04,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:32:04,470 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:32:04,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1071902461] [2022-04-28 08:32:04,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1071902461] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:32:04,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:32:04,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:32:04,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691029722] [2022-04-28 08:32:04,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:32:04,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-28 08:32:04,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:32:04,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:04,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:32:04,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:32:04,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:32:04,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:32:04,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:32:04,536 INFO L87 Difference]: Start difference. First operand 221 states and 325 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:06,565 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:32:07,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:32:07,801 INFO L93 Difference]: Finished difference Result 362 states and 538 transitions. [2022-04-28 08:32:07,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:32:07,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-28 08:32:07,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:32:07,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:07,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-28 08:32:07,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:07,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-28 08:32:07,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 388 transitions. [2022-04-28 08:32:08,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:32:08,124 INFO L225 Difference]: With dead ends: 362 [2022-04-28 08:32:08,124 INFO L226 Difference]: Without dead ends: 257 [2022-04-28 08:32:08,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:32:08,126 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 33 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:32:08,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 484 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 359 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:32:08,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-28 08:32:08,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 239. [2022-04-28 08:32:08,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:32:08,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand has 239 states, 234 states have (on average 1.5) internal successors, (351), 234 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:08,140 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand has 239 states, 234 states have (on average 1.5) internal successors, (351), 234 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:08,141 INFO L87 Difference]: Start difference. First operand 257 states. Second operand has 239 states, 234 states have (on average 1.5) internal successors, (351), 234 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:08,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:32:08,149 INFO L93 Difference]: Finished difference Result 257 states and 379 transitions. [2022-04-28 08:32:08,149 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 379 transitions. [2022-04-28 08:32:08,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:32:08,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:32:08,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 234 states have (on average 1.5) internal successors, (351), 234 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 257 states. [2022-04-28 08:32:08,151 INFO L87 Difference]: Start difference. First operand has 239 states, 234 states have (on average 1.5) internal successors, (351), 234 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 257 states. [2022-04-28 08:32:08,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:32:08,159 INFO L93 Difference]: Finished difference Result 257 states and 379 transitions. [2022-04-28 08:32:08,159 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 379 transitions. [2022-04-28 08:32:08,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:32:08,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:32:08,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:32:08,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:32:08,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 234 states have (on average 1.5) internal successors, (351), 234 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:08,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 355 transitions. [2022-04-28 08:32:08,168 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 355 transitions. Word has length 59 [2022-04-28 08:32:08,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:32:08,168 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 355 transitions. [2022-04-28 08:32:08,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:08,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 239 states and 355 transitions. [2022-04-28 08:32:08,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 355 edges. 355 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:32:08,420 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 355 transitions. [2022-04-28 08:32:08,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 08:32:08,421 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:32:08,421 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:32:08,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 08:32:08,421 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:32:08,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:32:08,422 INFO L85 PathProgramCache]: Analyzing trace with hash -861449916, now seen corresponding path program 3 times [2022-04-28 08:32:08,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:32:08,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1588237197] [2022-04-28 08:32:18,498 WARN L232 SmtUtils]: Spent 9.12s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:32:27,178 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:32:27,179 INFO L85 PathProgramCache]: Analyzing trace with hash -861449916, now seen corresponding path program 4 times [2022-04-28 08:32:27,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:32:27,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030020191] [2022-04-28 08:32:27,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:32:27,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:32:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:32:27,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:32:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:32:27,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {4453#(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); {4446#true} is VALID [2022-04-28 08:32:27,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {4446#true} assume true; {4446#true} is VALID [2022-04-28 08:32:27,461 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4446#true} {4446#true} #593#return; {4446#true} is VALID [2022-04-28 08:32:27,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {4446#true} call ULTIMATE.init(); {4453#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:32:27,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {4453#(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); {4446#true} is VALID [2022-04-28 08:32:27,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {4446#true} assume true; {4446#true} is VALID [2022-04-28 08:32:27,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4446#true} {4446#true} #593#return; {4446#true} is VALID [2022-04-28 08:32:27,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {4446#true} call #t~ret158 := main(); {4446#true} is VALID [2022-04-28 08:32:27,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {4446#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; {4446#true} is VALID [2022-04-28 08:32:27,462 INFO L272 TraceCheckUtils]: 6: Hoare triple {4446#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {4446#true} is VALID [2022-04-28 08:32:27,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {4446#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); {4446#true} is VALID [2022-04-28 08:32:27,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {4446#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; {4446#true} is VALID [2022-04-28 08:32:27,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {4446#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; {4446#true} is VALID [2022-04-28 08:32:27,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {4446#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4446#true} is VALID [2022-04-28 08:32:27,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {4446#true} assume !false; {4446#true} is VALID [2022-04-28 08:32:27,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {4446#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4446#true} is VALID [2022-04-28 08:32:27,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {4446#true} assume 12292 == #t~mem49;havoc #t~mem49; {4446#true} is VALID [2022-04-28 08:32:27,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {4446#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; {4446#true} is VALID [2022-04-28 08:32:27,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {4446#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4446#true} is VALID [2022-04-28 08:32:27,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {4446#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4446#true} is VALID [2022-04-28 08:32:27,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {4446#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4446#true} is VALID [2022-04-28 08:32:27,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {4446#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); {4446#true} is VALID [2022-04-28 08:32:27,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {4446#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4446#true} is VALID [2022-04-28 08:32:27,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {4446#true} assume !(0 == ~tmp___4~0); {4446#true} is VALID [2022-04-28 08:32:27,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {4446#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); {4446#true} is VALID [2022-04-28 08:32:27,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {4446#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); {4446#true} is VALID [2022-04-28 08:32:27,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {4446#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4446#true} is VALID [2022-04-28 08:32:27,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {4446#true} ~skip~0 := 0; {4446#true} is VALID [2022-04-28 08:32:27,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {4446#true} assume !false; {4446#true} is VALID [2022-04-28 08:32:27,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {4446#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4446#true} is VALID [2022-04-28 08:32:27,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {4446#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4446#true} is VALID [2022-04-28 08:32:27,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {4446#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4446#true} is VALID [2022-04-28 08:32:27,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {4446#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4446#true} is VALID [2022-04-28 08:32:27,467 INFO L290 TraceCheckUtils]: 30: Hoare triple {4446#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4446#true} is VALID [2022-04-28 08:32:27,467 INFO L290 TraceCheckUtils]: 31: Hoare triple {4446#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4446#true} is VALID [2022-04-28 08:32:27,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {4446#true} assume 4368 == #t~mem54;havoc #t~mem54; {4446#true} is VALID [2022-04-28 08:32:27,467 INFO L290 TraceCheckUtils]: 33: Hoare triple {4446#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; {4446#true} is VALID [2022-04-28 08:32:27,467 INFO L290 TraceCheckUtils]: 34: Hoare triple {4446#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4446#true} is VALID [2022-04-28 08:32:27,469 INFO L290 TraceCheckUtils]: 35: Hoare triple {4446#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); {4451#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:32:27,469 INFO L290 TraceCheckUtils]: 36: Hoare triple {4451#(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; {4451#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:32:27,470 INFO L290 TraceCheckUtils]: 37: Hoare triple {4451#(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); {4451#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:32:27,470 INFO L290 TraceCheckUtils]: 38: Hoare triple {4451#(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; {4451#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:32:27,470 INFO L290 TraceCheckUtils]: 39: Hoare triple {4451#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {4451#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:32:27,471 INFO L290 TraceCheckUtils]: 40: Hoare triple {4451#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {4451#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:32:27,471 INFO L290 TraceCheckUtils]: 41: Hoare triple {4451#(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); {4452#(not (= 12292 |ssl3_connect_#t~mem49|))} is VALID [2022-04-28 08:32:27,472 INFO L290 TraceCheckUtils]: 42: Hoare triple {4452#(not (= 12292 |ssl3_connect_#t~mem49|))} assume 12292 == #t~mem49;havoc #t~mem49; {4447#false} is VALID [2022-04-28 08:32:27,472 INFO L290 TraceCheckUtils]: 43: Hoare triple {4447#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; {4447#false} is VALID [2022-04-28 08:32:27,472 INFO L290 TraceCheckUtils]: 44: Hoare triple {4447#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4447#false} is VALID [2022-04-28 08:32:27,472 INFO L290 TraceCheckUtils]: 45: Hoare triple {4447#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4447#false} is VALID [2022-04-28 08:32:27,472 INFO L290 TraceCheckUtils]: 46: Hoare triple {4447#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4447#false} is VALID [2022-04-28 08:32:27,472 INFO L290 TraceCheckUtils]: 47: Hoare triple {4447#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); {4447#false} is VALID [2022-04-28 08:32:27,472 INFO L290 TraceCheckUtils]: 48: Hoare triple {4447#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4447#false} is VALID [2022-04-28 08:32:27,472 INFO L290 TraceCheckUtils]: 49: Hoare triple {4447#false} assume !(0 == ~tmp___4~0); {4447#false} is VALID [2022-04-28 08:32:27,473 INFO L290 TraceCheckUtils]: 50: Hoare triple {4447#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); {4447#false} is VALID [2022-04-28 08:32:27,473 INFO L290 TraceCheckUtils]: 51: Hoare triple {4447#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); {4447#false} is VALID [2022-04-28 08:32:27,473 INFO L290 TraceCheckUtils]: 52: Hoare triple {4447#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4447#false} is VALID [2022-04-28 08:32:27,473 INFO L290 TraceCheckUtils]: 53: Hoare triple {4447#false} ~skip~0 := 0; {4447#false} is VALID [2022-04-28 08:32:27,473 INFO L290 TraceCheckUtils]: 54: Hoare triple {4447#false} assume !false; {4447#false} is VALID [2022-04-28 08:32:27,473 INFO L290 TraceCheckUtils]: 55: Hoare triple {4447#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); {4447#false} is VALID [2022-04-28 08:32:27,477 INFO L290 TraceCheckUtils]: 56: Hoare triple {4447#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4447#false} is VALID [2022-04-28 08:32:27,478 INFO L290 TraceCheckUtils]: 57: Hoare triple {4447#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4447#false} is VALID [2022-04-28 08:32:27,478 INFO L290 TraceCheckUtils]: 58: Hoare triple {4447#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4447#false} is VALID [2022-04-28 08:32:27,478 INFO L290 TraceCheckUtils]: 59: Hoare triple {4447#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4447#false} is VALID [2022-04-28 08:32:27,478 INFO L290 TraceCheckUtils]: 60: Hoare triple {4447#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4447#false} is VALID [2022-04-28 08:32:27,478 INFO L290 TraceCheckUtils]: 61: Hoare triple {4447#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4447#false} is VALID [2022-04-28 08:32:27,478 INFO L290 TraceCheckUtils]: 62: Hoare triple {4447#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4447#false} is VALID [2022-04-28 08:32:27,478 INFO L290 TraceCheckUtils]: 63: Hoare triple {4447#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4447#false} is VALID [2022-04-28 08:32:27,479 INFO L290 TraceCheckUtils]: 64: Hoare triple {4447#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4447#false} is VALID [2022-04-28 08:32:27,479 INFO L290 TraceCheckUtils]: 65: Hoare triple {4447#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4447#false} is VALID [2022-04-28 08:32:27,479 INFO L290 TraceCheckUtils]: 66: Hoare triple {4447#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4447#false} is VALID [2022-04-28 08:32:27,479 INFO L290 TraceCheckUtils]: 67: Hoare triple {4447#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4447#false} is VALID [2022-04-28 08:32:27,479 INFO L290 TraceCheckUtils]: 68: Hoare triple {4447#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4447#false} is VALID [2022-04-28 08:32:27,479 INFO L290 TraceCheckUtils]: 69: Hoare triple {4447#false} assume 4432 == #t~mem62;havoc #t~mem62; {4447#false} is VALID [2022-04-28 08:32:27,479 INFO L290 TraceCheckUtils]: 70: Hoare triple {4447#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {4447#false} is VALID [2022-04-28 08:32:27,479 INFO L290 TraceCheckUtils]: 71: Hoare triple {4447#false} assume 5 == ~blastFlag~0; {4447#false} is VALID [2022-04-28 08:32:27,480 INFO L290 TraceCheckUtils]: 72: Hoare triple {4447#false} assume !false; {4447#false} is VALID [2022-04-28 08:32:27,480 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 08:32:27,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:32:27,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030020191] [2022-04-28 08:32:27,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030020191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:32:27,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:32:27,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:32:27,481 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:32:27,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1588237197] [2022-04-28 08:32:27,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1588237197] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:32:27,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:32:27,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:32:27,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048760544] [2022-04-28 08:32:27,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:32:27,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-28 08:32:27,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:32:27,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:27,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:32:27,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:32:27,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:32:27,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:32:27,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:32:27,536 INFO L87 Difference]: Start difference. First operand 239 states and 355 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:29,558 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:32:30,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:32:30,670 INFO L93 Difference]: Finished difference Result 642 states and 963 transitions. [2022-04-28 08:32:30,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:32:30,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-28 08:32:30,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:32:30,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:30,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-28 08:32:30,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:30,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-28 08:32:30,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-28 08:32:31,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:32:31,036 INFO L225 Difference]: With dead ends: 642 [2022-04-28 08:32:31,036 INFO L226 Difference]: Without dead ends: 419 [2022-04-28 08:32:31,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:32:31,037 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 112 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:32:31,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 296 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 379 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:32:31,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-04-28 08:32:31,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 261. [2022-04-28 08:32:31,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:32:31,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 419 states. Second operand has 261 states, 256 states have (on average 1.4921875) internal successors, (382), 256 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:31,069 INFO L74 IsIncluded]: Start isIncluded. First operand 419 states. Second operand has 261 states, 256 states have (on average 1.4921875) internal successors, (382), 256 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:31,069 INFO L87 Difference]: Start difference. First operand 419 states. Second operand has 261 states, 256 states have (on average 1.4921875) internal successors, (382), 256 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:31,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:32:31,082 INFO L93 Difference]: Finished difference Result 419 states and 625 transitions. [2022-04-28 08:32:31,082 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 625 transitions. [2022-04-28 08:32:31,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:32:31,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:32:31,084 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.4921875) internal successors, (382), 256 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 419 states. [2022-04-28 08:32:31,085 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.4921875) internal successors, (382), 256 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 419 states. [2022-04-28 08:32:31,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:32:31,096 INFO L93 Difference]: Finished difference Result 419 states and 625 transitions. [2022-04-28 08:32:31,096 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 625 transitions. [2022-04-28 08:32:31,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:32:31,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:32:31,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:32:31,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:32:31,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.4921875) internal successors, (382), 256 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:31,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 386 transitions. [2022-04-28 08:32:31,104 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 386 transitions. Word has length 73 [2022-04-28 08:32:31,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:32:31,105 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 386 transitions. [2022-04-28 08:32:31,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:31,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 261 states and 386 transitions. [2022-04-28 08:32:31,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 386 edges. 386 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:32:31,425 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 386 transitions. [2022-04-28 08:32:31,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 08:32:31,425 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:32:31,426 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:32:31,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 08:32:31,426 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:32:31,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:32:31,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1970430362, now seen corresponding path program 1 times [2022-04-28 08:32:31,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:32:31,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1307205753] [2022-04-28 08:32:44,079 WARN L232 SmtUtils]: Spent 7.30s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:32:51,510 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:32:51,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1970430362, now seen corresponding path program 2 times [2022-04-28 08:32:51,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:32:51,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630996880] [2022-04-28 08:32:51,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:32:51,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:32:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:32:51,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:32:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:32:51,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {7109#(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); {7102#true} is VALID [2022-04-28 08:32:51,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {7102#true} assume true; {7102#true} is VALID [2022-04-28 08:32:51,727 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7102#true} {7102#true} #593#return; {7102#true} is VALID [2022-04-28 08:32:51,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {7102#true} call ULTIMATE.init(); {7109#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:32:51,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {7109#(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); {7102#true} is VALID [2022-04-28 08:32:51,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {7102#true} assume true; {7102#true} is VALID [2022-04-28 08:32:51,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7102#true} {7102#true} #593#return; {7102#true} is VALID [2022-04-28 08:32:51,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {7102#true} call #t~ret158 := main(); {7102#true} is VALID [2022-04-28 08:32:51,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {7102#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; {7102#true} is VALID [2022-04-28 08:32:51,729 INFO L272 TraceCheckUtils]: 6: Hoare triple {7102#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {7102#true} is VALID [2022-04-28 08:32:51,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {7102#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); {7102#true} is VALID [2022-04-28 08:32:51,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {7102#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; {7102#true} is VALID [2022-04-28 08:32:51,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {7102#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; {7102#true} is VALID [2022-04-28 08:32:51,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {7102#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7102#true} is VALID [2022-04-28 08:32:51,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {7102#true} assume !false; {7102#true} is VALID [2022-04-28 08:32:51,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {7102#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7102#true} is VALID [2022-04-28 08:32:51,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {7102#true} assume 12292 == #t~mem49;havoc #t~mem49; {7102#true} is VALID [2022-04-28 08:32:51,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {7102#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; {7102#true} is VALID [2022-04-28 08:32:51,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {7102#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7102#true} is VALID [2022-04-28 08:32:51,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {7102#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7102#true} is VALID [2022-04-28 08:32:51,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {7102#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7102#true} is VALID [2022-04-28 08:32:51,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {7102#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); {7102#true} is VALID [2022-04-28 08:32:51,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {7102#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7102#true} is VALID [2022-04-28 08:32:51,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {7102#true} assume !(0 == ~tmp___4~0); {7102#true} is VALID [2022-04-28 08:32:51,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {7102#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); {7102#true} is VALID [2022-04-28 08:32:51,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {7102#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); {7102#true} is VALID [2022-04-28 08:32:51,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {7102#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7102#true} is VALID [2022-04-28 08:32:51,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {7102#true} ~skip~0 := 0; {7102#true} is VALID [2022-04-28 08:32:51,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {7102#true} assume !false; {7102#true} is VALID [2022-04-28 08:32:51,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {7102#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7102#true} is VALID [2022-04-28 08:32:51,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {7102#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7102#true} is VALID [2022-04-28 08:32:51,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {7102#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7102#true} is VALID [2022-04-28 08:32:51,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {7102#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7102#true} is VALID [2022-04-28 08:32:51,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {7102#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7102#true} is VALID [2022-04-28 08:32:51,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {7102#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7102#true} is VALID [2022-04-28 08:32:51,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {7102#true} assume 4368 == #t~mem54;havoc #t~mem54; {7102#true} is VALID [2022-04-28 08:32:51,743 INFO L290 TraceCheckUtils]: 33: Hoare triple {7102#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; {7102#true} is VALID [2022-04-28 08:32:51,743 INFO L290 TraceCheckUtils]: 34: Hoare triple {7102#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7102#true} is VALID [2022-04-28 08:32:51,745 INFO L290 TraceCheckUtils]: 35: Hoare triple {7102#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); {7107#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:32:51,746 INFO L290 TraceCheckUtils]: 36: Hoare triple {7107#(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; {7107#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:32:51,746 INFO L290 TraceCheckUtils]: 37: Hoare triple {7107#(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); {7107#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:32:51,747 INFO L290 TraceCheckUtils]: 38: Hoare triple {7107#(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; {7107#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:32:51,747 INFO L290 TraceCheckUtils]: 39: Hoare triple {7107#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {7107#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:32:51,748 INFO L290 TraceCheckUtils]: 40: Hoare triple {7107#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {7107#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:32:51,748 INFO L290 TraceCheckUtils]: 41: Hoare triple {7107#(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); {7107#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:32:51,749 INFO L290 TraceCheckUtils]: 42: Hoare triple {7107#(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); {7108#(not (= |ssl3_connect_#t~mem50| 16384))} is VALID [2022-04-28 08:32:51,749 INFO L290 TraceCheckUtils]: 43: Hoare triple {7108#(not (= |ssl3_connect_#t~mem50| 16384))} assume 16384 == #t~mem50;havoc #t~mem50; {7103#false} is VALID [2022-04-28 08:32:51,749 INFO L290 TraceCheckUtils]: 44: Hoare triple {7103#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7103#false} is VALID [2022-04-28 08:32:51,749 INFO L290 TraceCheckUtils]: 45: Hoare triple {7103#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7103#false} is VALID [2022-04-28 08:32:51,749 INFO L290 TraceCheckUtils]: 46: Hoare triple {7103#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7103#false} is VALID [2022-04-28 08:32:51,749 INFO L290 TraceCheckUtils]: 47: Hoare triple {7103#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); {7103#false} is VALID [2022-04-28 08:32:51,750 INFO L290 TraceCheckUtils]: 48: Hoare triple {7103#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7103#false} is VALID [2022-04-28 08:32:51,750 INFO L290 TraceCheckUtils]: 49: Hoare triple {7103#false} assume !(0 == ~tmp___4~0); {7103#false} is VALID [2022-04-28 08:32:51,750 INFO L290 TraceCheckUtils]: 50: Hoare triple {7103#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); {7103#false} is VALID [2022-04-28 08:32:51,751 INFO L290 TraceCheckUtils]: 51: Hoare triple {7103#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); {7103#false} is VALID [2022-04-28 08:32:51,751 INFO L290 TraceCheckUtils]: 52: Hoare triple {7103#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7103#false} is VALID [2022-04-28 08:32:51,751 INFO L290 TraceCheckUtils]: 53: Hoare triple {7103#false} ~skip~0 := 0; {7103#false} is VALID [2022-04-28 08:32:51,751 INFO L290 TraceCheckUtils]: 54: Hoare triple {7103#false} assume !false; {7103#false} is VALID [2022-04-28 08:32:51,751 INFO L290 TraceCheckUtils]: 55: Hoare triple {7103#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); {7103#false} is VALID [2022-04-28 08:32:51,751 INFO L290 TraceCheckUtils]: 56: Hoare triple {7103#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7103#false} is VALID [2022-04-28 08:32:51,751 INFO L290 TraceCheckUtils]: 57: Hoare triple {7103#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7103#false} is VALID [2022-04-28 08:32:51,752 INFO L290 TraceCheckUtils]: 58: Hoare triple {7103#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7103#false} is VALID [2022-04-28 08:32:51,752 INFO L290 TraceCheckUtils]: 59: Hoare triple {7103#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7103#false} is VALID [2022-04-28 08:32:51,752 INFO L290 TraceCheckUtils]: 60: Hoare triple {7103#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7103#false} is VALID [2022-04-28 08:32:51,752 INFO L290 TraceCheckUtils]: 61: Hoare triple {7103#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7103#false} is VALID [2022-04-28 08:32:51,752 INFO L290 TraceCheckUtils]: 62: Hoare triple {7103#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7103#false} is VALID [2022-04-28 08:32:51,752 INFO L290 TraceCheckUtils]: 63: Hoare triple {7103#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7103#false} is VALID [2022-04-28 08:32:51,752 INFO L290 TraceCheckUtils]: 64: Hoare triple {7103#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7103#false} is VALID [2022-04-28 08:32:51,752 INFO L290 TraceCheckUtils]: 65: Hoare triple {7103#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7103#false} is VALID [2022-04-28 08:32:51,752 INFO L290 TraceCheckUtils]: 66: Hoare triple {7103#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7103#false} is VALID [2022-04-28 08:32:51,752 INFO L290 TraceCheckUtils]: 67: Hoare triple {7103#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7103#false} is VALID [2022-04-28 08:32:51,753 INFO L290 TraceCheckUtils]: 68: Hoare triple {7103#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7103#false} is VALID [2022-04-28 08:32:51,753 INFO L290 TraceCheckUtils]: 69: Hoare triple {7103#false} assume 4432 == #t~mem62;havoc #t~mem62; {7103#false} is VALID [2022-04-28 08:32:51,753 INFO L290 TraceCheckUtils]: 70: Hoare triple {7103#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {7103#false} is VALID [2022-04-28 08:32:51,753 INFO L290 TraceCheckUtils]: 71: Hoare triple {7103#false} assume 5 == ~blastFlag~0; {7103#false} is VALID [2022-04-28 08:32:51,753 INFO L290 TraceCheckUtils]: 72: Hoare triple {7103#false} assume !false; {7103#false} is VALID [2022-04-28 08:32:51,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-28 08:32:51,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:32:51,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630996880] [2022-04-28 08:32:51,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630996880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:32:51,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:32:51,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:32:51,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:32:51,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1307205753] [2022-04-28 08:32:51,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1307205753] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:32:51,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:32:51,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:32:51,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450409139] [2022-04-28 08:32:51,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:32:51,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-28 08:32:51,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:32:51,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:51,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:32:51,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:32:51,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:32:51,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:32:51,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:32:51,825 INFO L87 Difference]: Start difference. First operand 261 states and 386 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:53,852 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:32:55,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:32:55,059 INFO L93 Difference]: Finished difference Result 665 states and 992 transitions. [2022-04-28 08:32:55,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:32:55,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-28 08:32:55,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:32:55,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:55,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-28 08:32:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:55,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-28 08:32:55,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-28 08:32:55,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:32:55,487 INFO L225 Difference]: With dead ends: 665 [2022-04-28 08:32:55,488 INFO L226 Difference]: Without dead ends: 420 [2022-04-28 08:32:55,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:32:55,493 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 119 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 08:32:55,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 08:32:55,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-04-28 08:32:55,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 263. [2022-04-28 08:32:55,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:32:55,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 420 states. Second operand has 263 states, 258 states have (on average 1.4844961240310077) internal successors, (383), 258 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:55,512 INFO L74 IsIncluded]: Start isIncluded. First operand 420 states. Second operand has 263 states, 258 states have (on average 1.4844961240310077) internal successors, (383), 258 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:55,513 INFO L87 Difference]: Start difference. First operand 420 states. Second operand has 263 states, 258 states have (on average 1.4844961240310077) internal successors, (383), 258 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:55,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:32:55,524 INFO L93 Difference]: Finished difference Result 420 states and 623 transitions. [2022-04-28 08:32:55,524 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 623 transitions. [2022-04-28 08:32:55,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:32:55,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:32:55,526 INFO L74 IsIncluded]: Start isIncluded. First operand has 263 states, 258 states have (on average 1.4844961240310077) internal successors, (383), 258 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 420 states. [2022-04-28 08:32:55,526 INFO L87 Difference]: Start difference. First operand has 263 states, 258 states have (on average 1.4844961240310077) internal successors, (383), 258 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 420 states. [2022-04-28 08:32:55,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:32:55,565 INFO L93 Difference]: Finished difference Result 420 states and 623 transitions. [2022-04-28 08:32:55,565 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 623 transitions. [2022-04-28 08:32:55,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:32:55,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:32:55,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:32:55,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:32:55,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 258 states have (on average 1.4844961240310077) internal successors, (383), 258 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:55,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 387 transitions. [2022-04-28 08:32:55,574 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 387 transitions. Word has length 73 [2022-04-28 08:32:55,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:32:55,574 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 387 transitions. [2022-04-28 08:32:55,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:55,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 263 states and 387 transitions. [2022-04-28 08:32:55,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:32:55,886 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 387 transitions. [2022-04-28 08:32:55,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 08:32:55,887 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:32:55,887 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:32:55,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 08:32:55,887 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:32:55,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:32:55,887 INFO L85 PathProgramCache]: Analyzing trace with hash -899406007, now seen corresponding path program 1 times [2022-04-28 08:32:55,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:32:55,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [717124090] [2022-04-28 08:33:05,364 WARN L232 SmtUtils]: Spent 8.64s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:33:18,396 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:33:18,396 INFO L85 PathProgramCache]: Analyzing trace with hash -899406007, now seen corresponding path program 2 times [2022-04-28 08:33:18,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:33:18,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245074328] [2022-04-28 08:33:18,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:33:18,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:33:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:18,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:33:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:18,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {9817#(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); {9810#true} is VALID [2022-04-28 08:33:18,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {9810#true} assume true; {9810#true} is VALID [2022-04-28 08:33:18,588 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9810#true} {9810#true} #593#return; {9810#true} is VALID [2022-04-28 08:33:18,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {9810#true} call ULTIMATE.init(); {9817#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:33:18,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {9817#(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); {9810#true} is VALID [2022-04-28 08:33:18,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {9810#true} assume true; {9810#true} is VALID [2022-04-28 08:33:18,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9810#true} {9810#true} #593#return; {9810#true} is VALID [2022-04-28 08:33:18,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {9810#true} call #t~ret158 := main(); {9810#true} is VALID [2022-04-28 08:33:18,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {9810#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; {9810#true} is VALID [2022-04-28 08:33:18,590 INFO L272 TraceCheckUtils]: 6: Hoare triple {9810#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {9810#true} is VALID [2022-04-28 08:33:18,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {9810#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); {9810#true} is VALID [2022-04-28 08:33:18,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {9810#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; {9810#true} is VALID [2022-04-28 08:33:18,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {9810#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; {9810#true} is VALID [2022-04-28 08:33:18,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {9810#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9810#true} is VALID [2022-04-28 08:33:18,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {9810#true} assume !false; {9810#true} is VALID [2022-04-28 08:33:18,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {9810#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9810#true} is VALID [2022-04-28 08:33:18,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {9810#true} assume 12292 == #t~mem49;havoc #t~mem49; {9810#true} is VALID [2022-04-28 08:33:18,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {9810#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; {9810#true} is VALID [2022-04-28 08:33:18,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {9810#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9810#true} is VALID [2022-04-28 08:33:18,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {9810#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9810#true} is VALID [2022-04-28 08:33:18,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {9810#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9810#true} is VALID [2022-04-28 08:33:18,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {9810#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); {9810#true} is VALID [2022-04-28 08:33:18,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {9810#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9810#true} is VALID [2022-04-28 08:33:18,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {9810#true} assume !(0 == ~tmp___4~0); {9810#true} is VALID [2022-04-28 08:33:18,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {9810#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); {9810#true} is VALID [2022-04-28 08:33:18,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {9810#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); {9810#true} is VALID [2022-04-28 08:33:18,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {9810#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9810#true} is VALID [2022-04-28 08:33:18,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {9810#true} ~skip~0 := 0; {9810#true} is VALID [2022-04-28 08:33:18,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {9810#true} assume !false; {9810#true} is VALID [2022-04-28 08:33:18,592 INFO L290 TraceCheckUtils]: 26: Hoare triple {9810#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9810#true} is VALID [2022-04-28 08:33:18,592 INFO L290 TraceCheckUtils]: 27: Hoare triple {9810#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9810#true} is VALID [2022-04-28 08:33:18,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {9810#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9810#true} is VALID [2022-04-28 08:33:18,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {9810#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9810#true} is VALID [2022-04-28 08:33:18,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {9810#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9810#true} is VALID [2022-04-28 08:33:18,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {9810#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9810#true} is VALID [2022-04-28 08:33:18,593 INFO L290 TraceCheckUtils]: 32: Hoare triple {9810#true} assume 4368 == #t~mem54;havoc #t~mem54; {9810#true} is VALID [2022-04-28 08:33:18,593 INFO L290 TraceCheckUtils]: 33: Hoare triple {9810#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; {9810#true} is VALID [2022-04-28 08:33:18,593 INFO L290 TraceCheckUtils]: 34: Hoare triple {9810#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9810#true} is VALID [2022-04-28 08:33:18,594 INFO L290 TraceCheckUtils]: 35: Hoare triple {9810#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); {9815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:18,595 INFO L290 TraceCheckUtils]: 36: Hoare triple {9815#(= 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; {9815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:18,595 INFO L290 TraceCheckUtils]: 37: Hoare triple {9815#(= 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); {9815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:18,596 INFO L290 TraceCheckUtils]: 38: Hoare triple {9815#(= 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; {9815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:18,596 INFO L290 TraceCheckUtils]: 39: Hoare triple {9815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {9815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:18,597 INFO L290 TraceCheckUtils]: 40: Hoare triple {9815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {9815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:18,597 INFO L290 TraceCheckUtils]: 41: Hoare triple {9815#(= 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); {9815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:18,597 INFO L290 TraceCheckUtils]: 42: Hoare triple {9815#(= 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); {9815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:18,598 INFO L290 TraceCheckUtils]: 43: Hoare triple {9815#(= 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); {9816#(= |ssl3_connect_#t~mem51| 4384)} is VALID [2022-04-28 08:33:18,598 INFO L290 TraceCheckUtils]: 44: Hoare triple {9816#(= |ssl3_connect_#t~mem51| 4384)} assume 4096 == #t~mem51;havoc #t~mem51; {9811#false} is VALID [2022-04-28 08:33:18,598 INFO L290 TraceCheckUtils]: 45: Hoare triple {9811#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9811#false} is VALID [2022-04-28 08:33:18,599 INFO L290 TraceCheckUtils]: 46: Hoare triple {9811#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9811#false} is VALID [2022-04-28 08:33:18,599 INFO L290 TraceCheckUtils]: 47: Hoare triple {9811#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9811#false} is VALID [2022-04-28 08:33:18,599 INFO L290 TraceCheckUtils]: 48: Hoare triple {9811#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); {9811#false} is VALID [2022-04-28 08:33:18,599 INFO L290 TraceCheckUtils]: 49: Hoare triple {9811#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9811#false} is VALID [2022-04-28 08:33:18,599 INFO L290 TraceCheckUtils]: 50: Hoare triple {9811#false} assume !(0 == ~tmp___4~0); {9811#false} is VALID [2022-04-28 08:33:18,599 INFO L290 TraceCheckUtils]: 51: Hoare triple {9811#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); {9811#false} is VALID [2022-04-28 08:33:18,599 INFO L290 TraceCheckUtils]: 52: Hoare triple {9811#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); {9811#false} is VALID [2022-04-28 08:33:18,599 INFO L290 TraceCheckUtils]: 53: Hoare triple {9811#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9811#false} is VALID [2022-04-28 08:33:18,600 INFO L290 TraceCheckUtils]: 54: Hoare triple {9811#false} ~skip~0 := 0; {9811#false} is VALID [2022-04-28 08:33:18,600 INFO L290 TraceCheckUtils]: 55: Hoare triple {9811#false} assume !false; {9811#false} is VALID [2022-04-28 08:33:18,600 INFO L290 TraceCheckUtils]: 56: Hoare triple {9811#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); {9811#false} is VALID [2022-04-28 08:33:18,600 INFO L290 TraceCheckUtils]: 57: Hoare triple {9811#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9811#false} is VALID [2022-04-28 08:33:18,600 INFO L290 TraceCheckUtils]: 58: Hoare triple {9811#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9811#false} is VALID [2022-04-28 08:33:18,600 INFO L290 TraceCheckUtils]: 59: Hoare triple {9811#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9811#false} is VALID [2022-04-28 08:33:18,600 INFO L290 TraceCheckUtils]: 60: Hoare triple {9811#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9811#false} is VALID [2022-04-28 08:33:18,600 INFO L290 TraceCheckUtils]: 61: Hoare triple {9811#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9811#false} is VALID [2022-04-28 08:33:18,600 INFO L290 TraceCheckUtils]: 62: Hoare triple {9811#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9811#false} is VALID [2022-04-28 08:33:18,600 INFO L290 TraceCheckUtils]: 63: Hoare triple {9811#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9811#false} is VALID [2022-04-28 08:33:18,601 INFO L290 TraceCheckUtils]: 64: Hoare triple {9811#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9811#false} is VALID [2022-04-28 08:33:18,601 INFO L290 TraceCheckUtils]: 65: Hoare triple {9811#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9811#false} is VALID [2022-04-28 08:33:18,601 INFO L290 TraceCheckUtils]: 66: Hoare triple {9811#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9811#false} is VALID [2022-04-28 08:33:18,601 INFO L290 TraceCheckUtils]: 67: Hoare triple {9811#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9811#false} is VALID [2022-04-28 08:33:18,601 INFO L290 TraceCheckUtils]: 68: Hoare triple {9811#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9811#false} is VALID [2022-04-28 08:33:18,601 INFO L290 TraceCheckUtils]: 69: Hoare triple {9811#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9811#false} is VALID [2022-04-28 08:33:18,601 INFO L290 TraceCheckUtils]: 70: Hoare triple {9811#false} assume 4432 == #t~mem62;havoc #t~mem62; {9811#false} is VALID [2022-04-28 08:33:18,601 INFO L290 TraceCheckUtils]: 71: Hoare triple {9811#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {9811#false} is VALID [2022-04-28 08:33:18,601 INFO L290 TraceCheckUtils]: 72: Hoare triple {9811#false} assume 5 == ~blastFlag~0; {9811#false} is VALID [2022-04-28 08:33:18,601 INFO L290 TraceCheckUtils]: 73: Hoare triple {9811#false} assume !false; {9811#false} is VALID [2022-04-28 08:33:18,602 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 08:33:18,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:33:18,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245074328] [2022-04-28 08:33:18,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245074328] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:18,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:18,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:33:18,603 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:33:18,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [717124090] [2022-04-28 08:33:18,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [717124090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:18,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:18,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:33:18,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937492145] [2022-04-28 08:33:18,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:33:18,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-28 08:33:18,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:33:18,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:18,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:33:18,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:33:18,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:18,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:33:18,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:33:18,670 INFO L87 Difference]: Start difference. First operand 263 states and 387 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:20,697 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:33:21,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:21,698 INFO L93 Difference]: Finished difference Result 415 states and 613 transitions. [2022-04-28 08:33:21,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:33:21,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-28 08:33:21,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:33:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:21,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-28 08:33:21,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:21,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-28 08:33:21,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 384 transitions. [2022-04-28 08:33:21,980 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-28 08:33:21,986 INFO L225 Difference]: With dead ends: 415 [2022-04-28 08:33:21,986 INFO L226 Difference]: Without dead ends: 280 [2022-04-28 08:33:21,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:33:21,988 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 35 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 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-28 08:33:21,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 480 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 350 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:33:21,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-28 08:33:21,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 263. [2022-04-28 08:33:21,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:33:22,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 280 states. Second operand has 263 states, 258 states have (on average 1.4806201550387597) internal successors, (382), 258 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:22,001 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand has 263 states, 258 states have (on average 1.4806201550387597) internal successors, (382), 258 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:22,001 INFO L87 Difference]: Start difference. First operand 280 states. Second operand has 263 states, 258 states have (on average 1.4806201550387597) internal successors, (382), 258 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:22,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:22,007 INFO L93 Difference]: Finished difference Result 280 states and 409 transitions. [2022-04-28 08:33:22,007 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 409 transitions. [2022-04-28 08:33:22,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:33:22,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:33:22,008 INFO L74 IsIncluded]: Start isIncluded. First operand has 263 states, 258 states have (on average 1.4806201550387597) internal successors, (382), 258 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 280 states. [2022-04-28 08:33:22,009 INFO L87 Difference]: Start difference. First operand has 263 states, 258 states have (on average 1.4806201550387597) internal successors, (382), 258 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 280 states. [2022-04-28 08:33:22,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:22,015 INFO L93 Difference]: Finished difference Result 280 states and 409 transitions. [2022-04-28 08:33:22,015 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 409 transitions. [2022-04-28 08:33:22,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:33:22,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:33:22,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:33:22,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:33:22,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 258 states have (on average 1.4806201550387597) internal successors, (382), 258 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:22,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 386 transitions. [2022-04-28 08:33:22,023 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 386 transitions. Word has length 74 [2022-04-28 08:33:22,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:33:22,023 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 386 transitions. [2022-04-28 08:33:22,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:22,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 263 states and 386 transitions. [2022-04-28 08:33:22,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 386 edges. 386 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:33:22,339 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 386 transitions. [2022-04-28 08:33:22,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 08:33:22,340 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:33:22,340 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:33:22,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 08:33:22,341 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:33:22,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:33:22,341 INFO L85 PathProgramCache]: Analyzing trace with hash -2000808735, now seen corresponding path program 1 times [2022-04-28 08:33:22,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:22,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1895594523] [2022-04-28 08:33:38,389 WARN L232 SmtUtils]: Spent 10.13s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:33:44,848 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:33:44,849 INFO L85 PathProgramCache]: Analyzing trace with hash -2000808735, now seen corresponding path program 2 times [2022-04-28 08:33:44,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:33:44,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321135331] [2022-04-28 08:33:44,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:33:44,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:33:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:45,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:33:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:45,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {11745#(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); {11738#true} is VALID [2022-04-28 08:33:45,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {11738#true} assume true; {11738#true} is VALID [2022-04-28 08:33:45,024 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11738#true} {11738#true} #593#return; {11738#true} is VALID [2022-04-28 08:33:45,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {11738#true} call ULTIMATE.init(); {11745#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:33:45,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {11745#(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); {11738#true} is VALID [2022-04-28 08:33:45,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {11738#true} assume true; {11738#true} is VALID [2022-04-28 08:33:45,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11738#true} {11738#true} #593#return; {11738#true} is VALID [2022-04-28 08:33:45,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {11738#true} call #t~ret158 := main(); {11738#true} is VALID [2022-04-28 08:33:45,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {11738#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; {11738#true} is VALID [2022-04-28 08:33:45,026 INFO L272 TraceCheckUtils]: 6: Hoare triple {11738#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {11738#true} is VALID [2022-04-28 08:33:45,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {11738#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); {11738#true} is VALID [2022-04-28 08:33:45,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {11738#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; {11738#true} is VALID [2022-04-28 08:33:45,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {11738#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; {11738#true} is VALID [2022-04-28 08:33:45,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {11738#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11738#true} is VALID [2022-04-28 08:33:45,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {11738#true} assume !false; {11738#true} is VALID [2022-04-28 08:33:45,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {11738#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11738#true} is VALID [2022-04-28 08:33:45,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {11738#true} assume 12292 == #t~mem49;havoc #t~mem49; {11738#true} is VALID [2022-04-28 08:33:45,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {11738#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; {11738#true} is VALID [2022-04-28 08:33:45,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {11738#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11738#true} is VALID [2022-04-28 08:33:45,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {11738#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11738#true} is VALID [2022-04-28 08:33:45,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {11738#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11738#true} is VALID [2022-04-28 08:33:45,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {11738#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); {11738#true} is VALID [2022-04-28 08:33:45,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {11738#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {11738#true} is VALID [2022-04-28 08:33:45,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {11738#true} assume !(0 == ~tmp___4~0); {11738#true} is VALID [2022-04-28 08:33:45,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {11738#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); {11738#true} is VALID [2022-04-28 08:33:45,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {11738#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); {11738#true} is VALID [2022-04-28 08:33:45,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {11738#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11738#true} is VALID [2022-04-28 08:33:45,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {11738#true} ~skip~0 := 0; {11738#true} is VALID [2022-04-28 08:33:45,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {11738#true} assume !false; {11738#true} is VALID [2022-04-28 08:33:45,028 INFO L290 TraceCheckUtils]: 26: Hoare triple {11738#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11738#true} is VALID [2022-04-28 08:33:45,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {11738#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11738#true} is VALID [2022-04-28 08:33:45,029 INFO L290 TraceCheckUtils]: 28: Hoare triple {11738#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11738#true} is VALID [2022-04-28 08:33:45,029 INFO L290 TraceCheckUtils]: 29: Hoare triple {11738#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11738#true} is VALID [2022-04-28 08:33:45,029 INFO L290 TraceCheckUtils]: 30: Hoare triple {11738#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11738#true} is VALID [2022-04-28 08:33:45,029 INFO L290 TraceCheckUtils]: 31: Hoare triple {11738#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11738#true} is VALID [2022-04-28 08:33:45,029 INFO L290 TraceCheckUtils]: 32: Hoare triple {11738#true} assume 4368 == #t~mem54;havoc #t~mem54; {11738#true} is VALID [2022-04-28 08:33:45,029 INFO L290 TraceCheckUtils]: 33: Hoare triple {11738#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; {11738#true} is VALID [2022-04-28 08:33:45,029 INFO L290 TraceCheckUtils]: 34: Hoare triple {11738#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11738#true} is VALID [2022-04-28 08:33:45,031 INFO L290 TraceCheckUtils]: 35: Hoare triple {11738#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); {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:45,031 INFO L290 TraceCheckUtils]: 36: Hoare triple {11743#(= 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; {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:45,032 INFO L290 TraceCheckUtils]: 37: Hoare triple {11743#(= 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); {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:45,032 INFO L290 TraceCheckUtils]: 38: Hoare triple {11743#(= 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; {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:45,032 INFO L290 TraceCheckUtils]: 39: Hoare triple {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:45,033 INFO L290 TraceCheckUtils]: 40: Hoare triple {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:45,033 INFO L290 TraceCheckUtils]: 41: Hoare triple {11743#(= 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); {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:45,034 INFO L290 TraceCheckUtils]: 42: Hoare triple {11743#(= 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); {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:45,034 INFO L290 TraceCheckUtils]: 43: Hoare triple {11743#(= 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); {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:45,034 INFO L290 TraceCheckUtils]: 44: Hoare triple {11743#(= 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); {11744#(= |ssl3_connect_#t~mem52| 4384)} is VALID [2022-04-28 08:33:45,035 INFO L290 TraceCheckUtils]: 45: Hoare triple {11744#(= |ssl3_connect_#t~mem52| 4384)} assume 20480 == #t~mem52;havoc #t~mem52; {11739#false} is VALID [2022-04-28 08:33:45,035 INFO L290 TraceCheckUtils]: 46: Hoare triple {11739#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11739#false} is VALID [2022-04-28 08:33:45,035 INFO L290 TraceCheckUtils]: 47: Hoare triple {11739#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11739#false} is VALID [2022-04-28 08:33:45,035 INFO L290 TraceCheckUtils]: 48: Hoare triple {11739#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11739#false} is VALID [2022-04-28 08:33:45,035 INFO L290 TraceCheckUtils]: 49: Hoare triple {11739#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); {11739#false} is VALID [2022-04-28 08:33:45,035 INFO L290 TraceCheckUtils]: 50: Hoare triple {11739#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {11739#false} is VALID [2022-04-28 08:33:45,036 INFO L290 TraceCheckUtils]: 51: Hoare triple {11739#false} assume !(0 == ~tmp___4~0); {11739#false} is VALID [2022-04-28 08:33:45,036 INFO L290 TraceCheckUtils]: 52: Hoare triple {11739#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); {11739#false} is VALID [2022-04-28 08:33:45,036 INFO L290 TraceCheckUtils]: 53: Hoare triple {11739#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); {11739#false} is VALID [2022-04-28 08:33:45,036 INFO L290 TraceCheckUtils]: 54: Hoare triple {11739#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11739#false} is VALID [2022-04-28 08:33:45,036 INFO L290 TraceCheckUtils]: 55: Hoare triple {11739#false} ~skip~0 := 0; {11739#false} is VALID [2022-04-28 08:33:45,036 INFO L290 TraceCheckUtils]: 56: Hoare triple {11739#false} assume !false; {11739#false} is VALID [2022-04-28 08:33:45,036 INFO L290 TraceCheckUtils]: 57: Hoare triple {11739#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); {11739#false} is VALID [2022-04-28 08:33:45,036 INFO L290 TraceCheckUtils]: 58: Hoare triple {11739#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11739#false} is VALID [2022-04-28 08:33:45,036 INFO L290 TraceCheckUtils]: 59: Hoare triple {11739#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11739#false} is VALID [2022-04-28 08:33:45,036 INFO L290 TraceCheckUtils]: 60: Hoare triple {11739#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11739#false} is VALID [2022-04-28 08:33:45,036 INFO L290 TraceCheckUtils]: 61: Hoare triple {11739#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11739#false} is VALID [2022-04-28 08:33:45,037 INFO L290 TraceCheckUtils]: 62: Hoare triple {11739#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11739#false} is VALID [2022-04-28 08:33:45,037 INFO L290 TraceCheckUtils]: 63: Hoare triple {11739#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11739#false} is VALID [2022-04-28 08:33:45,037 INFO L290 TraceCheckUtils]: 64: Hoare triple {11739#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11739#false} is VALID [2022-04-28 08:33:45,037 INFO L290 TraceCheckUtils]: 65: Hoare triple {11739#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11739#false} is VALID [2022-04-28 08:33:45,037 INFO L290 TraceCheckUtils]: 66: Hoare triple {11739#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {11739#false} is VALID [2022-04-28 08:33:45,037 INFO L290 TraceCheckUtils]: 67: Hoare triple {11739#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {11739#false} is VALID [2022-04-28 08:33:45,037 INFO L290 TraceCheckUtils]: 68: Hoare triple {11739#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {11739#false} is VALID [2022-04-28 08:33:45,037 INFO L290 TraceCheckUtils]: 69: Hoare triple {11739#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {11739#false} is VALID [2022-04-28 08:33:45,037 INFO L290 TraceCheckUtils]: 70: Hoare triple {11739#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {11739#false} is VALID [2022-04-28 08:33:45,037 INFO L290 TraceCheckUtils]: 71: Hoare triple {11739#false} assume 4432 == #t~mem62;havoc #t~mem62; {11739#false} is VALID [2022-04-28 08:33:45,038 INFO L290 TraceCheckUtils]: 72: Hoare triple {11739#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {11739#false} is VALID [2022-04-28 08:33:45,038 INFO L290 TraceCheckUtils]: 73: Hoare triple {11739#false} assume 5 == ~blastFlag~0; {11739#false} is VALID [2022-04-28 08:33:45,038 INFO L290 TraceCheckUtils]: 74: Hoare triple {11739#false} assume !false; {11739#false} is VALID [2022-04-28 08:33:45,038 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 08:33:45,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:33:45,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321135331] [2022-04-28 08:33:45,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321135331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:45,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:45,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:33:45,039 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:33:45,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1895594523] [2022-04-28 08:33:45,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1895594523] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:45,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:45,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:33:45,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975875550] [2022-04-28 08:33:45,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:33:45,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-28 08:33:45,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:33:45,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:45,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:33:45,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:33:45,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:45,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:33:45,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:33:45,106 INFO L87 Difference]: Start difference. First operand 263 states and 386 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:47,136 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:33:48,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:48,116 INFO L93 Difference]: Finished difference Result 415 states and 611 transitions. [2022-04-28 08:33:48,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:33:48,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-28 08:33:48,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:33:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:48,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2022-04-28 08:33:48,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:48,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2022-04-28 08:33:48,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 383 transitions. [2022-04-28 08:33:48,431 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-28 08:33:48,438 INFO L225 Difference]: With dead ends: 415 [2022-04-28 08:33:48,438 INFO L226 Difference]: Without dead ends: 280 [2022-04-28 08:33:48,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:33:48,439 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 33 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:33:48,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 478 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 349 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:33:48,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-28 08:33:48,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 263. [2022-04-28 08:33:48,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:33:48,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 280 states. Second operand has 263 states, 258 states have (on average 1.4767441860465116) internal successors, (381), 258 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:48,452 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand has 263 states, 258 states have (on average 1.4767441860465116) internal successors, (381), 258 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:48,452 INFO L87 Difference]: Start difference. First operand 280 states. Second operand has 263 states, 258 states have (on average 1.4767441860465116) internal successors, (381), 258 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:48,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:48,458 INFO L93 Difference]: Finished difference Result 280 states and 408 transitions. [2022-04-28 08:33:48,458 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 408 transitions. [2022-04-28 08:33:48,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:33:48,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:33:48,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 263 states, 258 states have (on average 1.4767441860465116) internal successors, (381), 258 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 280 states. [2022-04-28 08:33:48,460 INFO L87 Difference]: Start difference. First operand has 263 states, 258 states have (on average 1.4767441860465116) internal successors, (381), 258 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 280 states. [2022-04-28 08:33:48,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:48,466 INFO L93 Difference]: Finished difference Result 280 states and 408 transitions. [2022-04-28 08:33:48,466 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 408 transitions. [2022-04-28 08:33:48,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:33:48,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:33:48,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:33:48,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:33:48,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 258 states have (on average 1.4767441860465116) internal successors, (381), 258 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:48,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 385 transitions. [2022-04-28 08:33:48,473 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 385 transitions. Word has length 75 [2022-04-28 08:33:48,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:33:48,473 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 385 transitions. [2022-04-28 08:33:48,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:48,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 263 states and 385 transitions. [2022-04-28 08:33:48,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 385 edges. 385 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:33:48,852 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 385 transitions. [2022-04-28 08:33:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 08:33:48,853 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:33:48,853 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:33:48,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 08:33:48,853 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:33:48,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:33:48,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1727974300, now seen corresponding path program 1 times [2022-04-28 08:33:48,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:48,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1938249968] [2022-04-28 08:34:03,796 WARN L232 SmtUtils]: Spent 8.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-28 08:34:09,545 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:34:09,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1727974300, now seen corresponding path program 2 times [2022-04-28 08:34:09,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:34:09,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448404580] [2022-04-28 08:34:09,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:34:09,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:34:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:34:09,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:34:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:34:09,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {13673#(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); {13666#true} is VALID [2022-04-28 08:34:09,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {13666#true} assume true; {13666#true} is VALID [2022-04-28 08:34:09,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13666#true} {13666#true} #593#return; {13666#true} is VALID [2022-04-28 08:34:09,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {13666#true} call ULTIMATE.init(); {13673#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:34:09,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {13673#(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); {13666#true} is VALID [2022-04-28 08:34:09,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {13666#true} assume true; {13666#true} is VALID [2022-04-28 08:34:09,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13666#true} {13666#true} #593#return; {13666#true} is VALID [2022-04-28 08:34:09,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {13666#true} call #t~ret158 := main(); {13666#true} is VALID [2022-04-28 08:34:09,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {13666#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; {13666#true} is VALID [2022-04-28 08:34:09,739 INFO L272 TraceCheckUtils]: 6: Hoare triple {13666#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {13666#true} is VALID [2022-04-28 08:34:09,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {13666#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); {13666#true} is VALID [2022-04-28 08:34:09,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {13666#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; {13666#true} is VALID [2022-04-28 08:34:09,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {13666#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; {13666#true} is VALID [2022-04-28 08:34:09,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {13666#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {13666#true} is VALID [2022-04-28 08:34:09,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {13666#true} assume !false; {13666#true} is VALID [2022-04-28 08:34:09,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {13666#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13666#true} is VALID [2022-04-28 08:34:09,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {13666#true} assume 12292 == #t~mem49;havoc #t~mem49; {13666#true} is VALID [2022-04-28 08:34:09,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {13666#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; {13666#true} is VALID [2022-04-28 08:34:09,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {13666#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13666#true} is VALID [2022-04-28 08:34:09,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {13666#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13666#true} is VALID [2022-04-28 08:34:09,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {13666#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {13666#true} is VALID [2022-04-28 08:34:09,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {13666#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); {13666#true} is VALID [2022-04-28 08:34:09,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {13666#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {13666#true} is VALID [2022-04-28 08:34:09,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {13666#true} assume !(0 == ~tmp___4~0); {13666#true} is VALID [2022-04-28 08:34:09,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {13666#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); {13666#true} is VALID [2022-04-28 08:34:09,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {13666#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); {13666#true} is VALID [2022-04-28 08:34:09,740 INFO L290 TraceCheckUtils]: 23: Hoare triple {13666#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {13666#true} is VALID [2022-04-28 08:34:09,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {13666#true} ~skip~0 := 0; {13666#true} is VALID [2022-04-28 08:34:09,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {13666#true} assume !false; {13666#true} is VALID [2022-04-28 08:34:09,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {13666#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13666#true} is VALID [2022-04-28 08:34:09,741 INFO L290 TraceCheckUtils]: 27: Hoare triple {13666#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13666#true} is VALID [2022-04-28 08:34:09,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {13666#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13666#true} is VALID [2022-04-28 08:34:09,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {13666#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13666#true} is VALID [2022-04-28 08:34:09,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {13666#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13666#true} is VALID [2022-04-28 08:34:09,741 INFO L290 TraceCheckUtils]: 31: Hoare triple {13666#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13666#true} is VALID [2022-04-28 08:34:09,741 INFO L290 TraceCheckUtils]: 32: Hoare triple {13666#true} assume 4368 == #t~mem54;havoc #t~mem54; {13666#true} is VALID [2022-04-28 08:34:09,741 INFO L290 TraceCheckUtils]: 33: Hoare triple {13666#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; {13666#true} is VALID [2022-04-28 08:34:09,741 INFO L290 TraceCheckUtils]: 34: Hoare triple {13666#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {13666#true} is VALID [2022-04-28 08:34:09,743 INFO L290 TraceCheckUtils]: 35: Hoare triple {13666#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); {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:34:09,743 INFO L290 TraceCheckUtils]: 36: Hoare triple {13671#(= 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; {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:34:09,744 INFO L290 TraceCheckUtils]: 37: Hoare triple {13671#(= 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); {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:34:09,744 INFO L290 TraceCheckUtils]: 38: Hoare triple {13671#(= 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; {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:34:09,744 INFO L290 TraceCheckUtils]: 39: Hoare triple {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:34:09,745 INFO L290 TraceCheckUtils]: 40: Hoare triple {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:34:09,745 INFO L290 TraceCheckUtils]: 41: Hoare triple {13671#(= 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); {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:34:09,746 INFO L290 TraceCheckUtils]: 42: Hoare triple {13671#(= 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); {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:34:09,746 INFO L290 TraceCheckUtils]: 43: Hoare triple {13671#(= 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); {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:34:09,746 INFO L290 TraceCheckUtils]: 44: Hoare triple {13671#(= 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); {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:34:09,747 INFO L290 TraceCheckUtils]: 45: Hoare triple {13671#(= 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); {13672#(= |ssl3_connect_#t~mem53| 4384)} is VALID [2022-04-28 08:34:09,747 INFO L290 TraceCheckUtils]: 46: Hoare triple {13672#(= |ssl3_connect_#t~mem53| 4384)} assume 4099 == #t~mem53;havoc #t~mem53; {13667#false} is VALID [2022-04-28 08:34:09,747 INFO L290 TraceCheckUtils]: 47: Hoare triple {13667#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13667#false} is VALID [2022-04-28 08:34:09,747 INFO L290 TraceCheckUtils]: 48: Hoare triple {13667#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13667#false} is VALID [2022-04-28 08:34:09,747 INFO L290 TraceCheckUtils]: 49: Hoare triple {13667#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {13667#false} is VALID [2022-04-28 08:34:09,748 INFO L290 TraceCheckUtils]: 50: Hoare triple {13667#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); {13667#false} is VALID [2022-04-28 08:34:09,748 INFO L290 TraceCheckUtils]: 51: Hoare triple {13667#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {13667#false} is VALID [2022-04-28 08:34:09,748 INFO L290 TraceCheckUtils]: 52: Hoare triple {13667#false} assume !(0 == ~tmp___4~0); {13667#false} is VALID [2022-04-28 08:34:09,748 INFO L290 TraceCheckUtils]: 53: Hoare triple {13667#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); {13667#false} is VALID [2022-04-28 08:34:09,748 INFO L290 TraceCheckUtils]: 54: Hoare triple {13667#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); {13667#false} is VALID [2022-04-28 08:34:09,748 INFO L290 TraceCheckUtils]: 55: Hoare triple {13667#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {13667#false} is VALID [2022-04-28 08:34:09,748 INFO L290 TraceCheckUtils]: 56: Hoare triple {13667#false} ~skip~0 := 0; {13667#false} is VALID [2022-04-28 08:34:09,749 INFO L290 TraceCheckUtils]: 57: Hoare triple {13667#false} assume !false; {13667#false} is VALID [2022-04-28 08:34:09,749 INFO L290 TraceCheckUtils]: 58: Hoare triple {13667#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); {13667#false} is VALID [2022-04-28 08:34:09,749 INFO L290 TraceCheckUtils]: 59: Hoare triple {13667#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13667#false} is VALID [2022-04-28 08:34:09,749 INFO L290 TraceCheckUtils]: 60: Hoare triple {13667#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13667#false} is VALID [2022-04-28 08:34:09,749 INFO L290 TraceCheckUtils]: 61: Hoare triple {13667#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13667#false} is VALID [2022-04-28 08:34:09,749 INFO L290 TraceCheckUtils]: 62: Hoare triple {13667#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13667#false} is VALID [2022-04-28 08:34:09,749 INFO L290 TraceCheckUtils]: 63: Hoare triple {13667#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13667#false} is VALID [2022-04-28 08:34:09,749 INFO L290 TraceCheckUtils]: 64: Hoare triple {13667#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13667#false} is VALID [2022-04-28 08:34:09,749 INFO L290 TraceCheckUtils]: 65: Hoare triple {13667#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13667#false} is VALID [2022-04-28 08:34:09,749 INFO L290 TraceCheckUtils]: 66: Hoare triple {13667#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13667#false} is VALID [2022-04-28 08:34:09,749 INFO L290 TraceCheckUtils]: 67: Hoare triple {13667#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13667#false} is VALID [2022-04-28 08:34:09,750 INFO L290 TraceCheckUtils]: 68: Hoare triple {13667#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13667#false} is VALID [2022-04-28 08:34:09,750 INFO L290 TraceCheckUtils]: 69: Hoare triple {13667#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13667#false} is VALID [2022-04-28 08:34:09,750 INFO L290 TraceCheckUtils]: 70: Hoare triple {13667#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13667#false} is VALID [2022-04-28 08:34:09,750 INFO L290 TraceCheckUtils]: 71: Hoare triple {13667#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13667#false} is VALID [2022-04-28 08:34:09,750 INFO L290 TraceCheckUtils]: 72: Hoare triple {13667#false} assume 4432 == #t~mem62;havoc #t~mem62; {13667#false} is VALID [2022-04-28 08:34:09,750 INFO L290 TraceCheckUtils]: 73: Hoare triple {13667#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {13667#false} is VALID [2022-04-28 08:34:09,750 INFO L290 TraceCheckUtils]: 74: Hoare triple {13667#false} assume 5 == ~blastFlag~0; {13667#false} is VALID [2022-04-28 08:34:09,750 INFO L290 TraceCheckUtils]: 75: Hoare triple {13667#false} assume !false; {13667#false} is VALID [2022-04-28 08:34:09,751 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 08:34:09,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:34:09,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448404580] [2022-04-28 08:34:09,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448404580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:34:09,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:34:09,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:34:09,751 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:34:09,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1938249968] [2022-04-28 08:34:09,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1938249968] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:34:09,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:34:09,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:34:09,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598186451] [2022-04-28 08:34:09,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:34:09,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-28 08:34:09,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:34:09,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:09,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:34:09,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:34:09,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:34:09,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:34:09,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:34:09,819 INFO L87 Difference]: Start difference. First operand 263 states and 385 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:11,844 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:34:12,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:12,822 INFO L93 Difference]: Finished difference Result 406 states and 598 transitions. [2022-04-28 08:34:12,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:34:12,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-28 08:34:12,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:34:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 371 transitions. [2022-04-28 08:34:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:12,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 371 transitions. [2022-04-28 08:34:12,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 371 transitions. [2022-04-28 08:34:13,125 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-28 08:34:13,131 INFO L225 Difference]: With dead ends: 406 [2022-04-28 08:34:13,131 INFO L226 Difference]: Without dead ends: 271 [2022-04-28 08:34:13,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:34:13,132 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 24 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:34:13,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 464 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 326 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:34:13,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-04-28 08:34:13,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 263. [2022-04-28 08:34:13,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:34:13,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 271 states. Second operand has 263 states, 258 states have (on average 1.4728682170542635) internal successors, (380), 258 states have internal predecessors, (380), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:13,148 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states. Second operand has 263 states, 258 states have (on average 1.4728682170542635) internal successors, (380), 258 states have internal predecessors, (380), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:13,149 INFO L87 Difference]: Start difference. First operand 271 states. Second operand has 263 states, 258 states have (on average 1.4728682170542635) internal successors, (380), 258 states have internal predecessors, (380), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:13,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:13,154 INFO L93 Difference]: Finished difference Result 271 states and 396 transitions. [2022-04-28 08:34:13,154 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 396 transitions. [2022-04-28 08:34:13,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:34:13,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:34:13,156 INFO L74 IsIncluded]: Start isIncluded. First operand has 263 states, 258 states have (on average 1.4728682170542635) internal successors, (380), 258 states have internal predecessors, (380), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 271 states. [2022-04-28 08:34:13,156 INFO L87 Difference]: Start difference. First operand has 263 states, 258 states have (on average 1.4728682170542635) internal successors, (380), 258 states have internal predecessors, (380), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 271 states. [2022-04-28 08:34:13,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:13,161 INFO L93 Difference]: Finished difference Result 271 states and 396 transitions. [2022-04-28 08:34:13,162 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 396 transitions. [2022-04-28 08:34:13,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:34:13,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:34:13,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:34:13,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:34:13,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 258 states have (on average 1.4728682170542635) internal successors, (380), 258 states have internal predecessors, (380), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:13,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 384 transitions. [2022-04-28 08:34:13,169 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 384 transitions. Word has length 76 [2022-04-28 08:34:13,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:34:13,169 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 384 transitions. [2022-04-28 08:34:13,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:13,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 263 states and 384 transitions. [2022-04-28 08:34:13,500 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-28 08:34:13,501 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 384 transitions. [2022-04-28 08:34:13,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 08:34:13,501 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:34:13,502 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:34:13,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 08:34:13,502 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:34:13,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:34:13,502 INFO L85 PathProgramCache]: Analyzing trace with hash -988156823, now seen corresponding path program 1 times [2022-04-28 08:34:13,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:34:13,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1070466453] [2022-04-28 08:34:13,503 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:34:13,503 INFO L85 PathProgramCache]: Analyzing trace with hash -988156823, now seen corresponding path program 2 times [2022-04-28 08:34:13,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:34:13,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878297148] [2022-04-28 08:34:13,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:34:13,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:34:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:34:13,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:34:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:34:13,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {15564#(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); {15558#true} is VALID [2022-04-28 08:34:13,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {15558#true} assume true; {15558#true} is VALID [2022-04-28 08:34:13,670 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15558#true} {15558#true} #593#return; {15558#true} is VALID [2022-04-28 08:34:13,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {15558#true} call ULTIMATE.init(); {15564#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:34:13,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {15564#(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); {15558#true} is VALID [2022-04-28 08:34:13,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {15558#true} assume true; {15558#true} is VALID [2022-04-28 08:34:13,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15558#true} {15558#true} #593#return; {15558#true} is VALID [2022-04-28 08:34:13,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {15558#true} call #t~ret158 := main(); {15558#true} is VALID [2022-04-28 08:34:13,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {15558#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; {15558#true} is VALID [2022-04-28 08:34:13,672 INFO L272 TraceCheckUtils]: 6: Hoare triple {15558#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {15558#true} is VALID [2022-04-28 08:34:13,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {15558#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); {15558#true} is VALID [2022-04-28 08:34:13,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {15558#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; {15558#true} is VALID [2022-04-28 08:34:13,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {15558#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; {15558#true} is VALID [2022-04-28 08:34:13,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {15558#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15558#true} is VALID [2022-04-28 08:34:13,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {15558#true} assume !false; {15558#true} is VALID [2022-04-28 08:34:13,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {15558#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-28 08:34:13,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {15558#true} assume 12292 == #t~mem49;havoc #t~mem49; {15558#true} is VALID [2022-04-28 08:34:13,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {15558#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; {15558#true} is VALID [2022-04-28 08:34:13,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {15558#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {15558#true} is VALID [2022-04-28 08:34:13,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {15558#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15558#true} is VALID [2022-04-28 08:34:13,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {15558#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {15558#true} is VALID [2022-04-28 08:34:13,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {15558#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); {15558#true} is VALID [2022-04-28 08:34:13,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {15558#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {15558#true} is VALID [2022-04-28 08:34:13,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {15558#true} assume !(0 == ~tmp___4~0); {15558#true} is VALID [2022-04-28 08:34:13,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {15558#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); {15558#true} is VALID [2022-04-28 08:34:13,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {15558#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); {15558#true} is VALID [2022-04-28 08:34:13,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {15558#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15558#true} is VALID [2022-04-28 08:34:13,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {15558#true} ~skip~0 := 0; {15558#true} is VALID [2022-04-28 08:34:13,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {15558#true} assume !false; {15558#true} is VALID [2022-04-28 08:34:13,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {15558#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-28 08:34:13,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {15558#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-28 08:34:13,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {15558#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-28 08:34:13,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {15558#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-28 08:34:13,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {15558#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-28 08:34:13,674 INFO L290 TraceCheckUtils]: 31: Hoare triple {15558#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-28 08:34:13,674 INFO L290 TraceCheckUtils]: 32: Hoare triple {15558#true} assume 4368 == #t~mem54;havoc #t~mem54; {15558#true} is VALID [2022-04-28 08:34:13,674 INFO L290 TraceCheckUtils]: 33: Hoare triple {15558#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; {15558#true} is VALID [2022-04-28 08:34:13,675 INFO L290 TraceCheckUtils]: 34: Hoare triple {15558#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15558#true} is VALID [2022-04-28 08:34:13,675 INFO L290 TraceCheckUtils]: 35: Hoare triple {15558#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); {15558#true} is VALID [2022-04-28 08:34:13,675 INFO L290 TraceCheckUtils]: 36: Hoare triple {15558#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; {15558#true} is VALID [2022-04-28 08:34:13,675 INFO L290 TraceCheckUtils]: 37: Hoare triple {15558#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); {15558#true} is VALID [2022-04-28 08:34:13,675 INFO L290 TraceCheckUtils]: 38: Hoare triple {15558#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15558#true} is VALID [2022-04-28 08:34:13,675 INFO L290 TraceCheckUtils]: 39: Hoare triple {15558#true} ~skip~0 := 0; {15558#true} is VALID [2022-04-28 08:34:13,675 INFO L290 TraceCheckUtils]: 40: Hoare triple {15558#true} assume !false; {15558#true} is VALID [2022-04-28 08:34:13,675 INFO L290 TraceCheckUtils]: 41: Hoare triple {15558#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-28 08:34:13,675 INFO L290 TraceCheckUtils]: 42: Hoare triple {15558#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-28 08:34:13,675 INFO L290 TraceCheckUtils]: 43: Hoare triple {15558#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-28 08:34:13,676 INFO L290 TraceCheckUtils]: 44: Hoare triple {15558#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-28 08:34:13,676 INFO L290 TraceCheckUtils]: 45: Hoare triple {15558#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-28 08:34:13,676 INFO L290 TraceCheckUtils]: 46: Hoare triple {15558#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-28 08:34:13,676 INFO L290 TraceCheckUtils]: 47: Hoare triple {15558#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-28 08:34:13,676 INFO L290 TraceCheckUtils]: 48: Hoare triple {15558#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-28 08:34:13,676 INFO L290 TraceCheckUtils]: 49: Hoare triple {15558#true} assume 4384 == #t~mem56;havoc #t~mem56; {15558#true} is VALID [2022-04-28 08:34:13,676 INFO L290 TraceCheckUtils]: 50: Hoare triple {15558#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {15558#true} is VALID [2022-04-28 08:34:13,677 INFO L290 TraceCheckUtils]: 51: Hoare triple {15558#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:13,677 INFO L290 TraceCheckUtils]: 52: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:13,677 INFO L290 TraceCheckUtils]: 53: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:13,678 INFO L290 TraceCheckUtils]: 54: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:13,678 INFO L290 TraceCheckUtils]: 55: Hoare triple {15563#(= 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); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:13,678 INFO L290 TraceCheckUtils]: 56: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:13,679 INFO L290 TraceCheckUtils]: 57: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:13,680 INFO L290 TraceCheckUtils]: 58: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:13,680 INFO L290 TraceCheckUtils]: 59: Hoare triple {15563#(= 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); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:13,680 INFO L290 TraceCheckUtils]: 60: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:13,681 INFO L290 TraceCheckUtils]: 61: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:13,681 INFO L290 TraceCheckUtils]: 62: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:13,681 INFO L290 TraceCheckUtils]: 63: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:13,682 INFO L290 TraceCheckUtils]: 64: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:13,682 INFO L290 TraceCheckUtils]: 65: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:13,682 INFO L290 TraceCheckUtils]: 66: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:13,683 INFO L290 TraceCheckUtils]: 67: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:13,683 INFO L290 TraceCheckUtils]: 68: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:13,683 INFO L290 TraceCheckUtils]: 69: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:13,684 INFO L290 TraceCheckUtils]: 70: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:13,684 INFO L290 TraceCheckUtils]: 71: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:13,684 INFO L290 TraceCheckUtils]: 72: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:13,685 INFO L290 TraceCheckUtils]: 73: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:13,685 INFO L290 TraceCheckUtils]: 74: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:13,685 INFO L290 TraceCheckUtils]: 75: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {15559#false} is VALID [2022-04-28 08:34:13,685 INFO L290 TraceCheckUtils]: 76: Hoare triple {15559#false} assume !false; {15559#false} is VALID [2022-04-28 08:34:13,686 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-28 08:34:13,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:34:13,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878297148] [2022-04-28 08:34:13,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878297148] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:34:13,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:34:13,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:34:13,687 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:34:13,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1070466453] [2022-04-28 08:34:13,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1070466453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:34:13,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:34:13,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:34:13,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48783273] [2022-04-28 08:34:13,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:34:13,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-28 08:34:13,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:34:13,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:13,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:34:13,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:34:13,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:34:13,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:34:13,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:34:13,745 INFO L87 Difference]: Start difference. First operand 263 states and 384 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:15,768 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:34:16,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:16,691 INFO L93 Difference]: Finished difference Result 530 states and 782 transitions. [2022-04-28 08:34:16,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:34:16,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-28 08:34:16,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:34:16,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:16,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-28 08:34:16,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:16,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-28 08:34:16,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 489 transitions. [2022-04-28 08:34:17,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:34:17,109 INFO L225 Difference]: With dead ends: 530 [2022-04-28 08:34:17,110 INFO L226 Difference]: Without dead ends: 395 [2022-04-28 08:34:17,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:34:17,112 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 126 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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-28 08:34:17,113 INFO L414 NwaCegarLoop]: 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-28 08:34:17,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-04-28 08:34:17,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2022-04-28 08:34:17,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:34:17,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 395 states. Second operand has 395 states, 390 states have (on average 1.4666666666666666) internal successors, (572), 390 states have internal predecessors, (572), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:17,143 INFO L74 IsIncluded]: Start isIncluded. First operand 395 states. Second operand has 395 states, 390 states have (on average 1.4666666666666666) internal successors, (572), 390 states have internal predecessors, (572), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:17,144 INFO L87 Difference]: Start difference. First operand 395 states. Second operand has 395 states, 390 states have (on average 1.4666666666666666) internal successors, (572), 390 states have internal predecessors, (572), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:17,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:17,154 INFO L93 Difference]: Finished difference Result 395 states and 576 transitions. [2022-04-28 08:34:17,154 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 576 transitions. [2022-04-28 08:34:17,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:34:17,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:34:17,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 395 states, 390 states have (on average 1.4666666666666666) internal successors, (572), 390 states have internal predecessors, (572), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 395 states. [2022-04-28 08:34:17,157 INFO L87 Difference]: Start difference. First operand has 395 states, 390 states have (on average 1.4666666666666666) internal successors, (572), 390 states have internal predecessors, (572), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 395 states. [2022-04-28 08:34:17,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:17,167 INFO L93 Difference]: Finished difference Result 395 states and 576 transitions. [2022-04-28 08:34:17,167 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 576 transitions. [2022-04-28 08:34:17,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:34:17,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:34:17,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:34:17,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:34:17,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 390 states have (on average 1.4666666666666666) internal successors, (572), 390 states have internal predecessors, (572), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:17,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 576 transitions. [2022-04-28 08:34:17,181 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 576 transitions. Word has length 77 [2022-04-28 08:34:17,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:34:17,181 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 576 transitions. [2022-04-28 08:34:17,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:17,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 395 states and 576 transitions. [2022-04-28 08:34:17,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 576 edges. 576 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:34:17,670 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 576 transitions. [2022-04-28 08:34:17,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 08:34:17,671 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:34:17,671 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:34:17,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 08:34:17,671 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:34:17,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:34:17,671 INFO L85 PathProgramCache]: Analyzing trace with hash -926117209, now seen corresponding path program 1 times [2022-04-28 08:34:17,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:34:17,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [14791532] [2022-04-28 08:34:17,672 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:34:17,672 INFO L85 PathProgramCache]: Analyzing trace with hash -926117209, now seen corresponding path program 2 times [2022-04-28 08:34:17,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:34:17,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059262860] [2022-04-28 08:34:17,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:34:17,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:34:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:34:17,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:34:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:34:17,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {18213#(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); {18207#true} is VALID [2022-04-28 08:34:17,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {18207#true} assume true; {18207#true} is VALID [2022-04-28 08:34:17,842 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18207#true} {18207#true} #593#return; {18207#true} is VALID [2022-04-28 08:34:17,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {18207#true} call ULTIMATE.init(); {18213#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:34:17,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {18213#(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); {18207#true} is VALID [2022-04-28 08:34:17,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {18207#true} assume true; {18207#true} is VALID [2022-04-28 08:34:17,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18207#true} {18207#true} #593#return; {18207#true} is VALID [2022-04-28 08:34:17,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {18207#true} call #t~ret158 := main(); {18207#true} is VALID [2022-04-28 08:34:17,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {18207#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; {18207#true} is VALID [2022-04-28 08:34:17,844 INFO L272 TraceCheckUtils]: 6: Hoare triple {18207#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {18207#true} is VALID [2022-04-28 08:34:17,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {18207#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); {18207#true} is VALID [2022-04-28 08:34:17,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {18207#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; {18207#true} is VALID [2022-04-28 08:34:17,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {18207#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; {18207#true} is VALID [2022-04-28 08:34:17,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {18207#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18207#true} is VALID [2022-04-28 08:34:17,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {18207#true} assume !false; {18207#true} is VALID [2022-04-28 08:34:17,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {18207#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18207#true} is VALID [2022-04-28 08:34:17,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {18207#true} assume 12292 == #t~mem49;havoc #t~mem49; {18207#true} is VALID [2022-04-28 08:34:17,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {18207#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; {18207#true} is VALID [2022-04-28 08:34:17,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {18207#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {18207#true} is VALID [2022-04-28 08:34:17,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {18207#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {18207#true} is VALID [2022-04-28 08:34:17,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {18207#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {18207#true} is VALID [2022-04-28 08:34:17,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {18207#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); {18207#true} is VALID [2022-04-28 08:34:17,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {18207#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {18207#true} is VALID [2022-04-28 08:34:17,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {18207#true} assume !(0 == ~tmp___4~0); {18207#true} is VALID [2022-04-28 08:34:17,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {18207#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); {18207#true} is VALID [2022-04-28 08:34:17,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {18207#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); {18207#true} is VALID [2022-04-28 08:34:17,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {18207#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {18207#true} is VALID [2022-04-28 08:34:17,846 INFO L290 TraceCheckUtils]: 24: Hoare triple {18207#true} ~skip~0 := 0; {18207#true} is VALID [2022-04-28 08:34:17,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {18207#true} assume !false; {18207#true} is VALID [2022-04-28 08:34:17,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {18207#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18207#true} is VALID [2022-04-28 08:34:17,846 INFO L290 TraceCheckUtils]: 27: Hoare triple {18207#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18207#true} is VALID [2022-04-28 08:34:17,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {18207#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18207#true} is VALID [2022-04-28 08:34:17,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {18207#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18207#true} is VALID [2022-04-28 08:34:17,846 INFO L290 TraceCheckUtils]: 30: Hoare triple {18207#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18207#true} is VALID [2022-04-28 08:34:17,847 INFO L290 TraceCheckUtils]: 31: Hoare triple {18207#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18207#true} is VALID [2022-04-28 08:34:17,847 INFO L290 TraceCheckUtils]: 32: Hoare triple {18207#true} assume 4368 == #t~mem54;havoc #t~mem54; {18207#true} is VALID [2022-04-28 08:34:17,847 INFO L290 TraceCheckUtils]: 33: Hoare triple {18207#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; {18207#true} is VALID [2022-04-28 08:34:17,847 INFO L290 TraceCheckUtils]: 34: Hoare triple {18207#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:34:17,847 INFO L290 TraceCheckUtils]: 35: Hoare triple {18212#(= 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); {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:34:17,848 INFO L290 TraceCheckUtils]: 36: Hoare triple {18212#(= 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; {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:34:17,848 INFO L290 TraceCheckUtils]: 37: Hoare triple {18212#(= 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); {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:34:17,848 INFO L290 TraceCheckUtils]: 38: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:34:17,849 INFO L290 TraceCheckUtils]: 39: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:34:17,849 INFO L290 TraceCheckUtils]: 40: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} assume !false; {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:34:17,849 INFO L290 TraceCheckUtils]: 41: Hoare triple {18212#(= 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); {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:34:17,849 INFO L290 TraceCheckUtils]: 42: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:34:17,850 INFO L290 TraceCheckUtils]: 43: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:34:17,850 INFO L290 TraceCheckUtils]: 44: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:34:17,850 INFO L290 TraceCheckUtils]: 45: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:34:17,851 INFO L290 TraceCheckUtils]: 46: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:34:17,851 INFO L290 TraceCheckUtils]: 47: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:34:17,851 INFO L290 TraceCheckUtils]: 48: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:34:17,852 INFO L290 TraceCheckUtils]: 49: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} assume 4384 == #t~mem56;havoc #t~mem56; {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:34:17,852 INFO L290 TraceCheckUtils]: 50: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:34:17,852 INFO L290 TraceCheckUtils]: 51: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {18208#false} is VALID [2022-04-28 08:34:17,852 INFO L290 TraceCheckUtils]: 52: Hoare triple {18208#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {18208#false} is VALID [2022-04-28 08:34:17,853 INFO L290 TraceCheckUtils]: 53: Hoare triple {18208#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-28 08:34:17,853 INFO L290 TraceCheckUtils]: 54: Hoare triple {18208#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {18208#false} is VALID [2022-04-28 08:34:17,853 INFO L290 TraceCheckUtils]: 55: Hoare triple {18208#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); {18208#false} is VALID [2022-04-28 08:34:17,853 INFO L290 TraceCheckUtils]: 56: Hoare triple {18208#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {18208#false} is VALID [2022-04-28 08:34:17,853 INFO L290 TraceCheckUtils]: 57: Hoare triple {18208#false} ~skip~0 := 0; {18208#false} is VALID [2022-04-28 08:34:17,853 INFO L290 TraceCheckUtils]: 58: Hoare triple {18208#false} assume !false; {18208#false} is VALID [2022-04-28 08:34:17,853 INFO L290 TraceCheckUtils]: 59: Hoare triple {18208#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); {18208#false} is VALID [2022-04-28 08:34:17,853 INFO L290 TraceCheckUtils]: 60: Hoare triple {18208#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-28 08:34:17,853 INFO L290 TraceCheckUtils]: 61: Hoare triple {18208#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-28 08:34:17,853 INFO L290 TraceCheckUtils]: 62: Hoare triple {18208#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-28 08:34:17,854 INFO L290 TraceCheckUtils]: 63: Hoare triple {18208#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-28 08:34:17,854 INFO L290 TraceCheckUtils]: 64: Hoare triple {18208#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-28 08:34:17,854 INFO L290 TraceCheckUtils]: 65: Hoare triple {18208#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-28 08:34:17,854 INFO L290 TraceCheckUtils]: 66: Hoare triple {18208#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-28 08:34:17,854 INFO L290 TraceCheckUtils]: 67: Hoare triple {18208#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-28 08:34:17,854 INFO L290 TraceCheckUtils]: 68: Hoare triple {18208#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-28 08:34:17,854 INFO L290 TraceCheckUtils]: 69: Hoare triple {18208#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-28 08:34:17,854 INFO L290 TraceCheckUtils]: 70: Hoare triple {18208#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-28 08:34:17,854 INFO L290 TraceCheckUtils]: 71: Hoare triple {18208#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-28 08:34:17,855 INFO L290 TraceCheckUtils]: 72: Hoare triple {18208#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-28 08:34:17,855 INFO L290 TraceCheckUtils]: 73: Hoare triple {18208#false} assume 4432 == #t~mem62;havoc #t~mem62; {18208#false} is VALID [2022-04-28 08:34:17,855 INFO L290 TraceCheckUtils]: 74: Hoare triple {18208#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {18208#false} is VALID [2022-04-28 08:34:17,855 INFO L290 TraceCheckUtils]: 75: Hoare triple {18208#false} assume 5 == ~blastFlag~0; {18208#false} is VALID [2022-04-28 08:34:17,855 INFO L290 TraceCheckUtils]: 76: Hoare triple {18208#false} assume !false; {18208#false} is VALID [2022-04-28 08:34:17,855 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 08:34:17,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:34:17,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059262860] [2022-04-28 08:34:17,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059262860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:34:17,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:34:17,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:34:17,856 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:34:17,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [14791532] [2022-04-28 08:34:17,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [14791532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:34:17,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:34:17,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:34:17,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223611472] [2022-04-28 08:34:17,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:34:17,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-28 08:34:17,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:34:17,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:17,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:34:17,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:34:17,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:34:17,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:34:17,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:34:17,915 INFO L87 Difference]: Start difference. First operand 395 states and 576 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:19,936 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:34:20,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:20,613 INFO L93 Difference]: Finished difference Result 687 states and 1004 transitions. [2022-04-28 08:34:20,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:34:20,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-28 08:34:20,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:34:20,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:20,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2022-04-28 08:34:20,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:20,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2022-04-28 08:34:20,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 369 transitions. [2022-04-28 08:34:20,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 369 edges. 369 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:34:20,921 INFO L225 Difference]: With dead ends: 687 [2022-04-28 08:34:20,921 INFO L226 Difference]: Without dead ends: 420 [2022-04-28 08:34:20,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:34:20,923 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 16 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:34:20,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 358 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 08:34:20,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-04-28 08:34:20,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2022-04-28 08:34:20,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:34:20,940 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-28 08:34:20,940 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-28 08:34:20,942 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-28 08:34:20,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:20,952 INFO L93 Difference]: Finished difference Result 420 states and 609 transitions. [2022-04-28 08:34:20,952 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 609 transitions. [2022-04-28 08:34:20,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:34:20,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:34:20,974 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-28 08:34:20,974 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-28 08:34:20,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:20,985 INFO L93 Difference]: Finished difference Result 420 states and 609 transitions. [2022-04-28 08:34:20,985 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 609 transitions. [2022-04-28 08:34:20,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:34:20,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:34:20,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:34:20,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:34:20,987 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-28 08:34:21,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 609 transitions. [2022-04-28 08:34:21,000 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 609 transitions. Word has length 77 [2022-04-28 08:34:21,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:34:21,001 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 609 transitions. [2022-04-28 08:34:21,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:21,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 420 states and 609 transitions. [2022-04-28 08:34:21,570 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-28 08:34:21,571 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 609 transitions. [2022-04-28 08:34:21,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-28 08:34:21,572 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:34:21,572 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:34:21,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 08:34:21,572 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:34:21,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:34:21,573 INFO L85 PathProgramCache]: Analyzing trace with hash 140608816, now seen corresponding path program 1 times [2022-04-28 08:34:21,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:34:21,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1472602817] [2022-04-28 08:34:21,573 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:34:21,573 INFO L85 PathProgramCache]: Analyzing trace with hash 140608816, now seen corresponding path program 2 times [2022-04-28 08:34:21,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:34:21,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075325964] [2022-04-28 08:34:21,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:34:21,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:34:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:34:21,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:34:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:34:21,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {21276#(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); {21270#true} is VALID [2022-04-28 08:34:21,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {21270#true} assume true; {21270#true} is VALID [2022-04-28 08:34:21,770 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21270#true} {21270#true} #593#return; {21270#true} is VALID [2022-04-28 08:34:21,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {21270#true} call ULTIMATE.init(); {21276#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:34:21,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {21276#(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); {21270#true} is VALID [2022-04-28 08:34:21,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {21270#true} assume true; {21270#true} is VALID [2022-04-28 08:34:21,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21270#true} {21270#true} #593#return; {21270#true} is VALID [2022-04-28 08:34:21,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {21270#true} call #t~ret158 := main(); {21270#true} is VALID [2022-04-28 08:34:21,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {21270#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; {21270#true} is VALID [2022-04-28 08:34:21,771 INFO L272 TraceCheckUtils]: 6: Hoare triple {21270#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {21270#true} is VALID [2022-04-28 08:34:21,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {21270#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); {21270#true} is VALID [2022-04-28 08:34:21,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {21270#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; {21270#true} is VALID [2022-04-28 08:34:21,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {21270#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; {21270#true} is VALID [2022-04-28 08:34:21,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {21270#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21270#true} is VALID [2022-04-28 08:34:21,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {21270#true} assume !false; {21270#true} is VALID [2022-04-28 08:34:21,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {21270#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {21270#true} assume 12292 == #t~mem49;havoc #t~mem49; {21270#true} is VALID [2022-04-28 08:34:21,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {21270#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; {21270#true} is VALID [2022-04-28 08:34:21,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {21270#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {21270#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {21270#true} is VALID [2022-04-28 08:34:21,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {21270#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {21270#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); {21270#true} is VALID [2022-04-28 08:34:21,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {21270#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {21270#true} is VALID [2022-04-28 08:34:21,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {21270#true} assume !(0 == ~tmp___4~0); {21270#true} is VALID [2022-04-28 08:34:21,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {21270#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); {21270#true} is VALID [2022-04-28 08:34:21,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {21270#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); {21270#true} is VALID [2022-04-28 08:34:21,786 INFO L290 TraceCheckUtils]: 23: Hoare triple {21270#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21270#true} is VALID [2022-04-28 08:34:21,786 INFO L290 TraceCheckUtils]: 24: Hoare triple {21270#true} ~skip~0 := 0; {21270#true} is VALID [2022-04-28 08:34:21,786 INFO L290 TraceCheckUtils]: 25: Hoare triple {21270#true} assume !false; {21270#true} is VALID [2022-04-28 08:34:21,786 INFO L290 TraceCheckUtils]: 26: Hoare triple {21270#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,786 INFO L290 TraceCheckUtils]: 27: Hoare triple {21270#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,786 INFO L290 TraceCheckUtils]: 28: Hoare triple {21270#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,786 INFO L290 TraceCheckUtils]: 29: Hoare triple {21270#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,786 INFO L290 TraceCheckUtils]: 30: Hoare triple {21270#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,787 INFO L290 TraceCheckUtils]: 31: Hoare triple {21270#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,787 INFO L290 TraceCheckUtils]: 32: Hoare triple {21270#true} assume 4368 == #t~mem54;havoc #t~mem54; {21270#true} is VALID [2022-04-28 08:34:21,787 INFO L290 TraceCheckUtils]: 33: Hoare triple {21270#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; {21270#true} is VALID [2022-04-28 08:34:21,787 INFO L290 TraceCheckUtils]: 34: Hoare triple {21270#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21270#true} is VALID [2022-04-28 08:34:21,787 INFO L290 TraceCheckUtils]: 35: Hoare triple {21270#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); {21270#true} is VALID [2022-04-28 08:34:21,787 INFO L290 TraceCheckUtils]: 36: Hoare triple {21270#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; {21270#true} is VALID [2022-04-28 08:34:21,787 INFO L290 TraceCheckUtils]: 37: Hoare triple {21270#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); {21270#true} is VALID [2022-04-28 08:34:21,787 INFO L290 TraceCheckUtils]: 38: Hoare triple {21270#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21270#true} is VALID [2022-04-28 08:34:21,787 INFO L290 TraceCheckUtils]: 39: Hoare triple {21270#true} ~skip~0 := 0; {21270#true} is VALID [2022-04-28 08:34:21,787 INFO L290 TraceCheckUtils]: 40: Hoare triple {21270#true} assume !false; {21270#true} is VALID [2022-04-28 08:34:21,788 INFO L290 TraceCheckUtils]: 41: Hoare triple {21270#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,788 INFO L290 TraceCheckUtils]: 42: Hoare triple {21270#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,788 INFO L290 TraceCheckUtils]: 43: Hoare triple {21270#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,788 INFO L290 TraceCheckUtils]: 44: Hoare triple {21270#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,788 INFO L290 TraceCheckUtils]: 45: Hoare triple {21270#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,788 INFO L290 TraceCheckUtils]: 46: Hoare triple {21270#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,788 INFO L290 TraceCheckUtils]: 47: Hoare triple {21270#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,788 INFO L290 TraceCheckUtils]: 48: Hoare triple {21270#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,788 INFO L290 TraceCheckUtils]: 49: Hoare triple {21270#true} assume 4384 == #t~mem56;havoc #t~mem56; {21270#true} is VALID [2022-04-28 08:34:21,788 INFO L290 TraceCheckUtils]: 50: Hoare triple {21270#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {21270#true} is VALID [2022-04-28 08:34:21,789 INFO L290 TraceCheckUtils]: 51: Hoare triple {21270#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {21270#true} is VALID [2022-04-28 08:34:21,789 INFO L290 TraceCheckUtils]: 52: Hoare triple {21270#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,789 INFO L290 TraceCheckUtils]: 53: Hoare triple {21270#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,789 INFO L290 TraceCheckUtils]: 54: Hoare triple {21270#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,789 INFO L290 TraceCheckUtils]: 55: Hoare triple {21270#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); {21270#true} is VALID [2022-04-28 08:34:21,789 INFO L290 TraceCheckUtils]: 56: Hoare triple {21270#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21270#true} is VALID [2022-04-28 08:34:21,789 INFO L290 TraceCheckUtils]: 57: Hoare triple {21270#true} ~skip~0 := 0; {21270#true} is VALID [2022-04-28 08:34:21,789 INFO L290 TraceCheckUtils]: 58: Hoare triple {21270#true} assume !false; {21270#true} is VALID [2022-04-28 08:34:21,789 INFO L290 TraceCheckUtils]: 59: Hoare triple {21270#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,789 INFO L290 TraceCheckUtils]: 60: Hoare triple {21270#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,790 INFO L290 TraceCheckUtils]: 61: Hoare triple {21270#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,790 INFO L290 TraceCheckUtils]: 62: Hoare triple {21270#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,790 INFO L290 TraceCheckUtils]: 63: Hoare triple {21270#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,790 INFO L290 TraceCheckUtils]: 64: Hoare triple {21270#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,790 INFO L290 TraceCheckUtils]: 65: Hoare triple {21270#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,790 INFO L290 TraceCheckUtils]: 66: Hoare triple {21270#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,790 INFO L290 TraceCheckUtils]: 67: Hoare triple {21270#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,790 INFO L290 TraceCheckUtils]: 68: Hoare triple {21270#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-28 08:34:21,790 INFO L290 TraceCheckUtils]: 69: Hoare triple {21270#true} assume 4400 == #t~mem58;havoc #t~mem58; {21270#true} is VALID [2022-04-28 08:34:21,791 INFO L290 TraceCheckUtils]: 70: Hoare triple {21270#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); {21270#true} is VALID [2022-04-28 08:34:21,791 INFO L290 TraceCheckUtils]: 71: Hoare triple {21270#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; {21270#true} is VALID [2022-04-28 08:34:21,792 INFO L290 TraceCheckUtils]: 72: Hoare triple {21270#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:21,792 INFO L290 TraceCheckUtils]: 73: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:21,792 INFO L290 TraceCheckUtils]: 74: Hoare triple {21275#(= 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); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:21,793 INFO L290 TraceCheckUtils]: 75: Hoare triple {21275#(= 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); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:21,793 INFO L290 TraceCheckUtils]: 76: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:21,793 INFO L290 TraceCheckUtils]: 77: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:21,794 INFO L290 TraceCheckUtils]: 78: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:21,794 INFO L290 TraceCheckUtils]: 79: Hoare triple {21275#(= 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); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:21,794 INFO L290 TraceCheckUtils]: 80: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:21,795 INFO L290 TraceCheckUtils]: 81: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:21,795 INFO L290 TraceCheckUtils]: 82: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:21,795 INFO L290 TraceCheckUtils]: 83: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:21,795 INFO L290 TraceCheckUtils]: 84: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:21,796 INFO L290 TraceCheckUtils]: 85: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:21,796 INFO L290 TraceCheckUtils]: 86: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:21,796 INFO L290 TraceCheckUtils]: 87: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:21,797 INFO L290 TraceCheckUtils]: 88: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:21,797 INFO L290 TraceCheckUtils]: 89: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:21,797 INFO L290 TraceCheckUtils]: 90: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:21,798 INFO L290 TraceCheckUtils]: 91: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:21,798 INFO L290 TraceCheckUtils]: 92: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:21,798 INFO L290 TraceCheckUtils]: 93: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:21,799 INFO L290 TraceCheckUtils]: 94: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:34:21,799 INFO L290 TraceCheckUtils]: 95: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {21271#false} is VALID [2022-04-28 08:34:21,799 INFO L290 TraceCheckUtils]: 96: Hoare triple {21271#false} assume !false; {21271#false} is VALID [2022-04-28 08:34:21,800 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 08:34:21,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:34:21,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075325964] [2022-04-28 08:34:21,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075325964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:34:21,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:34:21,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:34:21,800 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:34:21,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1472602817] [2022-04-28 08:34:21,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1472602817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:34:21,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:34:21,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:34:21,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841585598] [2022-04-28 08:34:21,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:34:21,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2022-04-28 08:34:21,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:34:21,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:21,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:34:21,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:34:21,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:34:21,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:34:21,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:34:21,863 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-28 08:34:23,880 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:34:24,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:24,835 INFO L93 Difference]: Finished difference Result 843 states and 1231 transitions. [2022-04-28 08:34:24,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:34:24,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2022-04-28 08:34:24,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:34:24,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:24,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-28 08:34:24,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:24,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-28 08:34:24,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 488 transitions. [2022-04-28 08:34:25,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:34:25,235 INFO L225 Difference]: With dead ends: 843 [2022-04-28 08:34:25,235 INFO L226 Difference]: Without dead ends: 551 [2022-04-28 08:34:25,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:34:25,236 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 126 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:34:25,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 476 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 338 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:34:25,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-04-28 08:34:25,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2022-04-28 08:34:25,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:34:25,263 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-28 08:34:25,264 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-28 08:34:25,265 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-28 08:34:25,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:25,290 INFO L93 Difference]: Finished difference Result 551 states and 800 transitions. [2022-04-28 08:34:25,290 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 800 transitions. [2022-04-28 08:34:25,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:34:25,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:34:25,294 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-28 08:34:25,295 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-28 08:34:25,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:25,309 INFO L93 Difference]: Finished difference Result 551 states and 800 transitions. [2022-04-28 08:34:25,309 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 800 transitions. [2022-04-28 08:34:25,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:34:25,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:34:25,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:34:25,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:34:25,312 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-28 08:34:25,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 800 transitions. [2022-04-28 08:34:25,331 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 800 transitions. Word has length 97 [2022-04-28 08:34:25,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:34:25,331 INFO L495 AbstractCegarLoop]: Abstraction has 551 states and 800 transitions. [2022-04-28 08:34:25,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:25,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 551 states and 800 transitions. [2022-04-28 08:34:25,923 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-28 08:34:25,923 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 800 transitions. [2022-04-28 08:34:25,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-28 08:34:25,925 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:34:25,925 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:34:25,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 08:34:25,925 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:34:25,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:34:25,926 INFO L85 PathProgramCache]: Analyzing trace with hash -2136926065, now seen corresponding path program 1 times [2022-04-28 08:34:25,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:34:25,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1013209605] [2022-04-28 08:34:25,927 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:34:25,927 INFO L85 PathProgramCache]: Analyzing trace with hash -2136926065, now seen corresponding path program 2 times [2022-04-28 08:34:25,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:34:25,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066638550] [2022-04-28 08:34:25,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:34:25,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:34:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:34:26,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:34:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:34:26,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {25175#(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); {25169#true} is VALID [2022-04-28 08:34:26,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {25169#true} assume true; {25169#true} is VALID [2022-04-28 08:34:26,112 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25169#true} {25169#true} #593#return; {25169#true} is VALID [2022-04-28 08:34:26,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {25169#true} call ULTIMATE.init(); {25175#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:34:26,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {25175#(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); {25169#true} is VALID [2022-04-28 08:34:26,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {25169#true} assume true; {25169#true} is VALID [2022-04-28 08:34:26,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25169#true} {25169#true} #593#return; {25169#true} is VALID [2022-04-28 08:34:26,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {25169#true} call #t~ret158 := main(); {25169#true} is VALID [2022-04-28 08:34:26,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {25169#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; {25169#true} is VALID [2022-04-28 08:34:26,113 INFO L272 TraceCheckUtils]: 6: Hoare triple {25169#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {25169#true} is VALID [2022-04-28 08:34:26,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {25169#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); {25169#true} is VALID [2022-04-28 08:34:26,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {25169#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; {25169#true} is VALID [2022-04-28 08:34:26,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {25169#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; {25169#true} is VALID [2022-04-28 08:34:26,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {25169#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25169#true} is VALID [2022-04-28 08:34:26,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {25169#true} assume !false; {25169#true} is VALID [2022-04-28 08:34:26,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {25169#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {25169#true} assume 12292 == #t~mem49;havoc #t~mem49; {25169#true} is VALID [2022-04-28 08:34:26,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {25169#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; {25169#true} is VALID [2022-04-28 08:34:26,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {25169#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {25169#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {25169#true} is VALID [2022-04-28 08:34:26,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {25169#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {25169#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); {25169#true} is VALID [2022-04-28 08:34:26,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {25169#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {25169#true} is VALID [2022-04-28 08:34:26,115 INFO L290 TraceCheckUtils]: 20: Hoare triple {25169#true} assume !(0 == ~tmp___4~0); {25169#true} is VALID [2022-04-28 08:34:26,115 INFO L290 TraceCheckUtils]: 21: Hoare triple {25169#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); {25169#true} is VALID [2022-04-28 08:34:26,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {25169#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); {25169#true} is VALID [2022-04-28 08:34:26,122 INFO L290 TraceCheckUtils]: 23: Hoare triple {25169#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {25169#true} is VALID [2022-04-28 08:34:26,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {25169#true} ~skip~0 := 0; {25169#true} is VALID [2022-04-28 08:34:26,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {25169#true} assume !false; {25169#true} is VALID [2022-04-28 08:34:26,123 INFO L290 TraceCheckUtils]: 26: Hoare triple {25169#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {25169#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,123 INFO L290 TraceCheckUtils]: 28: Hoare triple {25169#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,123 INFO L290 TraceCheckUtils]: 29: Hoare triple {25169#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,123 INFO L290 TraceCheckUtils]: 30: Hoare triple {25169#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {25169#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,123 INFO L290 TraceCheckUtils]: 32: Hoare triple {25169#true} assume 4368 == #t~mem54;havoc #t~mem54; {25169#true} is VALID [2022-04-28 08:34:26,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {25169#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; {25169#true} is VALID [2022-04-28 08:34:26,124 INFO L290 TraceCheckUtils]: 34: Hoare triple {25169#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25169#true} is VALID [2022-04-28 08:34:26,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {25169#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); {25169#true} is VALID [2022-04-28 08:34:26,124 INFO L290 TraceCheckUtils]: 36: Hoare triple {25169#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; {25169#true} is VALID [2022-04-28 08:34:26,124 INFO L290 TraceCheckUtils]: 37: Hoare triple {25169#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); {25169#true} is VALID [2022-04-28 08:34:26,124 INFO L290 TraceCheckUtils]: 38: Hoare triple {25169#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {25169#true} is VALID [2022-04-28 08:34:26,124 INFO L290 TraceCheckUtils]: 39: Hoare triple {25169#true} ~skip~0 := 0; {25169#true} is VALID [2022-04-28 08:34:26,124 INFO L290 TraceCheckUtils]: 40: Hoare triple {25169#true} assume !false; {25169#true} is VALID [2022-04-28 08:34:26,124 INFO L290 TraceCheckUtils]: 41: Hoare triple {25169#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,124 INFO L290 TraceCheckUtils]: 42: Hoare triple {25169#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,124 INFO L290 TraceCheckUtils]: 43: Hoare triple {25169#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,125 INFO L290 TraceCheckUtils]: 44: Hoare triple {25169#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,125 INFO L290 TraceCheckUtils]: 45: Hoare triple {25169#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,125 INFO L290 TraceCheckUtils]: 46: Hoare triple {25169#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,125 INFO L290 TraceCheckUtils]: 47: Hoare triple {25169#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,125 INFO L290 TraceCheckUtils]: 48: Hoare triple {25169#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,125 INFO L290 TraceCheckUtils]: 49: Hoare triple {25169#true} assume 4384 == #t~mem56;havoc #t~mem56; {25169#true} is VALID [2022-04-28 08:34:26,125 INFO L290 TraceCheckUtils]: 50: Hoare triple {25169#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {25169#true} is VALID [2022-04-28 08:34:26,125 INFO L290 TraceCheckUtils]: 51: Hoare triple {25169#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {25169#true} is VALID [2022-04-28 08:34:26,125 INFO L290 TraceCheckUtils]: 52: Hoare triple {25169#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,125 INFO L290 TraceCheckUtils]: 53: Hoare triple {25169#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,125 INFO L290 TraceCheckUtils]: 54: Hoare triple {25169#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,126 INFO L290 TraceCheckUtils]: 55: Hoare triple {25169#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); {25169#true} is VALID [2022-04-28 08:34:26,126 INFO L290 TraceCheckUtils]: 56: Hoare triple {25169#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {25169#true} is VALID [2022-04-28 08:34:26,126 INFO L290 TraceCheckUtils]: 57: Hoare triple {25169#true} ~skip~0 := 0; {25169#true} is VALID [2022-04-28 08:34:26,126 INFO L290 TraceCheckUtils]: 58: Hoare triple {25169#true} assume !false; {25169#true} is VALID [2022-04-28 08:34:26,126 INFO L290 TraceCheckUtils]: 59: Hoare triple {25169#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,126 INFO L290 TraceCheckUtils]: 60: Hoare triple {25169#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,126 INFO L290 TraceCheckUtils]: 61: Hoare triple {25169#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,126 INFO L290 TraceCheckUtils]: 62: Hoare triple {25169#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,126 INFO L290 TraceCheckUtils]: 63: Hoare triple {25169#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,126 INFO L290 TraceCheckUtils]: 64: Hoare triple {25169#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,127 INFO L290 TraceCheckUtils]: 65: Hoare triple {25169#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,127 INFO L290 TraceCheckUtils]: 66: Hoare triple {25169#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,127 INFO L290 TraceCheckUtils]: 67: Hoare triple {25169#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,127 INFO L290 TraceCheckUtils]: 68: Hoare triple {25169#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,127 INFO L290 TraceCheckUtils]: 69: Hoare triple {25169#true} assume 4400 == #t~mem58;havoc #t~mem58; {25169#true} is VALID [2022-04-28 08:34:26,127 INFO L290 TraceCheckUtils]: 70: Hoare triple {25169#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); {25169#true} is VALID [2022-04-28 08:34:26,127 INFO L290 TraceCheckUtils]: 71: Hoare triple {25169#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; {25169#true} is VALID [2022-04-28 08:34:26,127 INFO L290 TraceCheckUtils]: 72: Hoare triple {25169#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {25169#true} is VALID [2022-04-28 08:34:26,127 INFO L290 TraceCheckUtils]: 73: Hoare triple {25169#true} assume !(~ret~0 <= 0); {25169#true} is VALID [2022-04-28 08:34:26,127 INFO L290 TraceCheckUtils]: 74: Hoare triple {25169#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,128 INFO L290 TraceCheckUtils]: 75: Hoare triple {25169#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); {25169#true} is VALID [2022-04-28 08:34:26,142 INFO L290 TraceCheckUtils]: 76: Hoare triple {25169#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {25169#true} is VALID [2022-04-28 08:34:26,143 INFO L290 TraceCheckUtils]: 77: Hoare triple {25169#true} ~skip~0 := 0; {25169#true} is VALID [2022-04-28 08:34:26,143 INFO L290 TraceCheckUtils]: 78: Hoare triple {25169#true} assume !false; {25169#true} is VALID [2022-04-28 08:34:26,143 INFO L290 TraceCheckUtils]: 79: Hoare triple {25169#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,143 INFO L290 TraceCheckUtils]: 80: Hoare triple {25169#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,143 INFO L290 TraceCheckUtils]: 81: Hoare triple {25169#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,143 INFO L290 TraceCheckUtils]: 82: Hoare triple {25169#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,143 INFO L290 TraceCheckUtils]: 83: Hoare triple {25169#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,143 INFO L290 TraceCheckUtils]: 84: Hoare triple {25169#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,143 INFO L290 TraceCheckUtils]: 85: Hoare triple {25169#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,144 INFO L290 TraceCheckUtils]: 86: Hoare triple {25169#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,144 INFO L290 TraceCheckUtils]: 87: Hoare triple {25169#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,144 INFO L290 TraceCheckUtils]: 88: Hoare triple {25169#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,144 INFO L290 TraceCheckUtils]: 89: Hoare triple {25169#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,144 INFO L290 TraceCheckUtils]: 90: Hoare triple {25169#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 08:34:26,144 INFO L290 TraceCheckUtils]: 91: Hoare triple {25169#true} assume 4416 == #t~mem60;havoc #t~mem60; {25169#true} is VALID [2022-04-28 08:34:26,144 INFO L290 TraceCheckUtils]: 92: Hoare triple {25169#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {25169#true} is VALID [2022-04-28 08:34:26,145 INFO L290 TraceCheckUtils]: 93: Hoare triple {25169#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {25174#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:34:26,145 INFO L290 TraceCheckUtils]: 94: Hoare triple {25174#(= 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); {25174#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:34:26,146 INFO L290 TraceCheckUtils]: 95: Hoare triple {25174#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == ~tmp___6~0); {25174#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:34:26,146 INFO L290 TraceCheckUtils]: 96: Hoare triple {25174#(= 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); {25174#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:34:26,146 INFO L290 TraceCheckUtils]: 97: Hoare triple {25174#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {25174#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:34:26,147 INFO L290 TraceCheckUtils]: 98: Hoare triple {25174#(= ssl3_connect_~blastFlag~0 4)} ~skip~0 := 0; {25174#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:34:26,147 INFO L290 TraceCheckUtils]: 99: Hoare triple {25174#(= ssl3_connect_~blastFlag~0 4)} assume !false; {25174#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:34:26,147 INFO L290 TraceCheckUtils]: 100: Hoare triple {25174#(= 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); {25174#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:34:26,147 INFO L290 TraceCheckUtils]: 101: Hoare triple {25174#(= ssl3_connect_~blastFlag~0 4)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25174#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:34:26,148 INFO L290 TraceCheckUtils]: 102: Hoare triple {25174#(= ssl3_connect_~blastFlag~0 4)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25174#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:34:26,148 INFO L290 TraceCheckUtils]: 103: Hoare triple {25174#(= ssl3_connect_~blastFlag~0 4)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25174#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:34:26,148 INFO L290 TraceCheckUtils]: 104: Hoare triple {25174#(= ssl3_connect_~blastFlag~0 4)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25174#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:34:26,149 INFO L290 TraceCheckUtils]: 105: Hoare triple {25174#(= ssl3_connect_~blastFlag~0 4)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25174#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:34:26,149 INFO L290 TraceCheckUtils]: 106: Hoare triple {25174#(= ssl3_connect_~blastFlag~0 4)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25174#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:34:26,149 INFO L290 TraceCheckUtils]: 107: Hoare triple {25174#(= ssl3_connect_~blastFlag~0 4)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25174#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:34:26,150 INFO L290 TraceCheckUtils]: 108: Hoare triple {25174#(= ssl3_connect_~blastFlag~0 4)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {25174#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:34:26,150 INFO L290 TraceCheckUtils]: 109: Hoare triple {25174#(= ssl3_connect_~blastFlag~0 4)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {25174#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:34:26,150 INFO L290 TraceCheckUtils]: 110: Hoare triple {25174#(= ssl3_connect_~blastFlag~0 4)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {25174#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:34:26,151 INFO L290 TraceCheckUtils]: 111: Hoare triple {25174#(= ssl3_connect_~blastFlag~0 4)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {25174#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:34:26,151 INFO L290 TraceCheckUtils]: 112: Hoare triple {25174#(= ssl3_connect_~blastFlag~0 4)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {25174#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:34:26,151 INFO L290 TraceCheckUtils]: 113: Hoare triple {25174#(= ssl3_connect_~blastFlag~0 4)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {25174#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:34:26,152 INFO L290 TraceCheckUtils]: 114: Hoare triple {25174#(= ssl3_connect_~blastFlag~0 4)} assume 4432 == #t~mem62;havoc #t~mem62; {25174#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:34:26,152 INFO L290 TraceCheckUtils]: 115: Hoare triple {25174#(= ssl3_connect_~blastFlag~0 4)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {25174#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:34:26,152 INFO L290 TraceCheckUtils]: 116: Hoare triple {25174#(= ssl3_connect_~blastFlag~0 4)} assume 5 == ~blastFlag~0; {25170#false} is VALID [2022-04-28 08:34:26,152 INFO L290 TraceCheckUtils]: 117: Hoare triple {25170#false} assume !false; {25170#false} is VALID [2022-04-28 08:34:26,153 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-28 08:34:26,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:34:26,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066638550] [2022-04-28 08:34:26,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066638550] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:34:26,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:34:26,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:34:26,154 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:34:26,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1013209605] [2022-04-28 08:34:26,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1013209605] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:34:26,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:34:26,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:34:26,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257811988] [2022-04-28 08:34:26,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:34:26,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-28 08:34:26,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:34:26,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:26,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:34:26,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:34:26,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:34:26,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:34:26,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:34:26,223 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-28 08:34:28,244 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:34:29,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:29,145 INFO L93 Difference]: Finished difference Result 1087 states and 1587 transitions. [2022-04-28 08:34:29,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:34:29,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-28 08:34:29,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:34:29,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:29,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-28 08:34:29,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:29,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-28 08:34:29,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-28 08:34:29,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:34:29,500 INFO L225 Difference]: With dead ends: 1087 [2022-04-28 08:34:29,501 INFO L226 Difference]: Without dead ends: 664 [2022-04-28 08:34:29,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:34:29,502 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 125 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:34:29,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 475 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 337 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:34:29,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2022-04-28 08:34:29,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 664. [2022-04-28 08:34:29,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:34:29,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 664 states. Second operand has 664 states, 659 states have (on average 1.4582701062215477) internal successors, (961), 659 states have internal predecessors, (961), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:29,525 INFO L74 IsIncluded]: Start isIncluded. First operand 664 states. Second operand has 664 states, 659 states have (on average 1.4582701062215477) internal successors, (961), 659 states have internal predecessors, (961), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:29,526 INFO L87 Difference]: Start difference. First operand 664 states. Second operand has 664 states, 659 states have (on average 1.4582701062215477) internal successors, (961), 659 states have internal predecessors, (961), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:29,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:29,545 INFO L93 Difference]: Finished difference Result 664 states and 965 transitions. [2022-04-28 08:34:29,545 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 965 transitions. [2022-04-28 08:34:29,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:34:29,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:34:29,548 INFO L74 IsIncluded]: Start isIncluded. First operand has 664 states, 659 states have (on average 1.4582701062215477) internal successors, (961), 659 states have internal predecessors, (961), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 664 states. [2022-04-28 08:34:29,549 INFO L87 Difference]: Start difference. First operand has 664 states, 659 states have (on average 1.4582701062215477) internal successors, (961), 659 states have internal predecessors, (961), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 664 states. [2022-04-28 08:34:29,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:29,568 INFO L93 Difference]: Finished difference Result 664 states and 965 transitions. [2022-04-28 08:34:29,568 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 965 transitions. [2022-04-28 08:34:29,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:34:29,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:34:29,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:34:29,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:34:29,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 659 states have (on average 1.4582701062215477) internal successors, (961), 659 states have internal predecessors, (961), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:29,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 965 transitions. [2022-04-28 08:34:29,590 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 965 transitions. Word has length 118 [2022-04-28 08:34:29,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:34:29,590 INFO L495 AbstractCegarLoop]: Abstraction has 664 states and 965 transitions. [2022-04-28 08:34:29,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:29,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 664 states and 965 transitions. [2022-04-28 08:34:30,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 965 edges. 965 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:34:30,292 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 965 transitions. [2022-04-28 08:34:30,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-04-28 08:34:30,294 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:34:30,295 INFO L195 NwaCegarLoop]: 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-28 08:34:30,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 08:34:30,295 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:34:30,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:34:30,295 INFO L85 PathProgramCache]: Analyzing trace with hash -383649488, now seen corresponding path program 1 times [2022-04-28 08:34:30,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:34:30,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1528763921] [2022-04-28 08:34:45,859 WARN L232 SmtUtils]: Spent 9.87s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:34:55,262 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:34:55,263 INFO L85 PathProgramCache]: Analyzing trace with hash -383649488, now seen corresponding path program 2 times [2022-04-28 08:34:55,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:34:55,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786997076] [2022-04-28 08:34:55,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:34:55,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:34:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:34:55,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:34:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:34:55,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {30015#(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); {30008#true} is VALID [2022-04-28 08:34:55,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {30008#true} assume true; {30008#true} is VALID [2022-04-28 08:34:55,511 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30008#true} {30008#true} #593#return; {30008#true} is VALID [2022-04-28 08:34:55,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {30008#true} call ULTIMATE.init(); {30015#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:34:55,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {30015#(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); {30008#true} is VALID [2022-04-28 08:34:55,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {30008#true} assume true; {30008#true} is VALID [2022-04-28 08:34:55,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30008#true} {30008#true} #593#return; {30008#true} is VALID [2022-04-28 08:34:55,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {30008#true} call #t~ret158 := main(); {30008#true} is VALID [2022-04-28 08:34:55,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {30008#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; {30008#true} is VALID [2022-04-28 08:34:55,512 INFO L272 TraceCheckUtils]: 6: Hoare triple {30008#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {30008#true} is VALID [2022-04-28 08:34:55,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {30008#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); {30008#true} is VALID [2022-04-28 08:34:55,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {30008#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; {30008#true} is VALID [2022-04-28 08:34:55,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {30008#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; {30008#true} is VALID [2022-04-28 08:34:55,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {30008#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {30008#true} is VALID [2022-04-28 08:34:55,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {30008#true} assume !false; {30008#true} is VALID [2022-04-28 08:34:55,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {30008#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {30008#true} assume 12292 == #t~mem49;havoc #t~mem49; {30008#true} is VALID [2022-04-28 08:34:55,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {30008#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; {30008#true} is VALID [2022-04-28 08:34:55,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {30008#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {30008#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {30008#true} is VALID [2022-04-28 08:34:55,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {30008#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,513 INFO L290 TraceCheckUtils]: 18: Hoare triple {30008#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); {30008#true} is VALID [2022-04-28 08:34:55,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {30008#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {30008#true} is VALID [2022-04-28 08:34:55,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {30008#true} assume !(0 == ~tmp___4~0); {30008#true} is VALID [2022-04-28 08:34:55,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {30008#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); {30008#true} is VALID [2022-04-28 08:34:55,514 INFO L290 TraceCheckUtils]: 22: Hoare triple {30008#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); {30008#true} is VALID [2022-04-28 08:34:55,514 INFO L290 TraceCheckUtils]: 23: Hoare triple {30008#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {30008#true} is VALID [2022-04-28 08:34:55,514 INFO L290 TraceCheckUtils]: 24: Hoare triple {30008#true} ~skip~0 := 0; {30008#true} is VALID [2022-04-28 08:34:55,514 INFO L290 TraceCheckUtils]: 25: Hoare triple {30008#true} assume !false; {30008#true} is VALID [2022-04-28 08:34:55,514 INFO L290 TraceCheckUtils]: 26: Hoare triple {30008#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,514 INFO L290 TraceCheckUtils]: 27: Hoare triple {30008#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,514 INFO L290 TraceCheckUtils]: 28: Hoare triple {30008#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,515 INFO L290 TraceCheckUtils]: 29: Hoare triple {30008#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,515 INFO L290 TraceCheckUtils]: 30: Hoare triple {30008#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,515 INFO L290 TraceCheckUtils]: 31: Hoare triple {30008#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,515 INFO L290 TraceCheckUtils]: 32: Hoare triple {30008#true} assume 4368 == #t~mem54;havoc #t~mem54; {30008#true} is VALID [2022-04-28 08:34:55,515 INFO L290 TraceCheckUtils]: 33: Hoare triple {30008#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; {30008#true} is VALID [2022-04-28 08:34:55,515 INFO L290 TraceCheckUtils]: 34: Hoare triple {30008#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30008#true} is VALID [2022-04-28 08:34:55,515 INFO L290 TraceCheckUtils]: 35: Hoare triple {30008#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); {30008#true} is VALID [2022-04-28 08:34:55,515 INFO L290 TraceCheckUtils]: 36: Hoare triple {30008#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; {30008#true} is VALID [2022-04-28 08:34:55,515 INFO L290 TraceCheckUtils]: 37: Hoare triple {30008#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); {30008#true} is VALID [2022-04-28 08:34:55,515 INFO L290 TraceCheckUtils]: 38: Hoare triple {30008#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {30008#true} is VALID [2022-04-28 08:34:55,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {30008#true} ~skip~0 := 0; {30008#true} is VALID [2022-04-28 08:34:55,516 INFO L290 TraceCheckUtils]: 40: Hoare triple {30008#true} assume !false; {30008#true} is VALID [2022-04-28 08:34:55,516 INFO L290 TraceCheckUtils]: 41: Hoare triple {30008#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,516 INFO L290 TraceCheckUtils]: 42: Hoare triple {30008#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,516 INFO L290 TraceCheckUtils]: 43: Hoare triple {30008#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,516 INFO L290 TraceCheckUtils]: 44: Hoare triple {30008#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,516 INFO L290 TraceCheckUtils]: 45: Hoare triple {30008#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,516 INFO L290 TraceCheckUtils]: 46: Hoare triple {30008#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,516 INFO L290 TraceCheckUtils]: 47: Hoare triple {30008#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,516 INFO L290 TraceCheckUtils]: 48: Hoare triple {30008#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,516 INFO L290 TraceCheckUtils]: 49: Hoare triple {30008#true} assume 4384 == #t~mem56;havoc #t~mem56; {30008#true} is VALID [2022-04-28 08:34:55,517 INFO L290 TraceCheckUtils]: 50: Hoare triple {30008#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {30008#true} is VALID [2022-04-28 08:34:55,517 INFO L290 TraceCheckUtils]: 51: Hoare triple {30008#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {30008#true} is VALID [2022-04-28 08:34:55,517 INFO L290 TraceCheckUtils]: 52: Hoare triple {30008#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,517 INFO L290 TraceCheckUtils]: 53: Hoare triple {30008#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,517 INFO L290 TraceCheckUtils]: 54: Hoare triple {30008#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,517 INFO L290 TraceCheckUtils]: 55: Hoare triple {30008#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); {30008#true} is VALID [2022-04-28 08:34:55,517 INFO L290 TraceCheckUtils]: 56: Hoare triple {30008#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {30008#true} is VALID [2022-04-28 08:34:55,517 INFO L290 TraceCheckUtils]: 57: Hoare triple {30008#true} ~skip~0 := 0; {30008#true} is VALID [2022-04-28 08:34:55,517 INFO L290 TraceCheckUtils]: 58: Hoare triple {30008#true} assume !false; {30008#true} is VALID [2022-04-28 08:34:55,517 INFO L290 TraceCheckUtils]: 59: Hoare triple {30008#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,518 INFO L290 TraceCheckUtils]: 60: Hoare triple {30008#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,518 INFO L290 TraceCheckUtils]: 61: Hoare triple {30008#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,518 INFO L290 TraceCheckUtils]: 62: Hoare triple {30008#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,518 INFO L290 TraceCheckUtils]: 63: Hoare triple {30008#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,518 INFO L290 TraceCheckUtils]: 64: Hoare triple {30008#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,518 INFO L290 TraceCheckUtils]: 65: Hoare triple {30008#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,518 INFO L290 TraceCheckUtils]: 66: Hoare triple {30008#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,518 INFO L290 TraceCheckUtils]: 67: Hoare triple {30008#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,518 INFO L290 TraceCheckUtils]: 68: Hoare triple {30008#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,518 INFO L290 TraceCheckUtils]: 69: Hoare triple {30008#true} assume 4400 == #t~mem58;havoc #t~mem58; {30008#true} is VALID [2022-04-28 08:34:55,518 INFO L290 TraceCheckUtils]: 70: Hoare triple {30008#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); {30008#true} is VALID [2022-04-28 08:34:55,519 INFO L290 TraceCheckUtils]: 71: Hoare triple {30008#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; {30008#true} is VALID [2022-04-28 08:34:55,519 INFO L290 TraceCheckUtils]: 72: Hoare triple {30008#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {30008#true} is VALID [2022-04-28 08:34:55,519 INFO L290 TraceCheckUtils]: 73: Hoare triple {30008#true} assume !(~ret~0 <= 0); {30008#true} is VALID [2022-04-28 08:34:55,519 INFO L290 TraceCheckUtils]: 74: Hoare triple {30008#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,519 INFO L290 TraceCheckUtils]: 75: Hoare triple {30008#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); {30008#true} is VALID [2022-04-28 08:34:55,519 INFO L290 TraceCheckUtils]: 76: Hoare triple {30008#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {30008#true} is VALID [2022-04-28 08:34:55,519 INFO L290 TraceCheckUtils]: 77: Hoare triple {30008#true} ~skip~0 := 0; {30008#true} is VALID [2022-04-28 08:34:55,519 INFO L290 TraceCheckUtils]: 78: Hoare triple {30008#true} assume !false; {30008#true} is VALID [2022-04-28 08:34:55,519 INFO L290 TraceCheckUtils]: 79: Hoare triple {30008#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,519 INFO L290 TraceCheckUtils]: 80: Hoare triple {30008#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,520 INFO L290 TraceCheckUtils]: 81: Hoare triple {30008#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,520 INFO L290 TraceCheckUtils]: 82: Hoare triple {30008#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,520 INFO L290 TraceCheckUtils]: 83: Hoare triple {30008#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,520 INFO L290 TraceCheckUtils]: 84: Hoare triple {30008#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,520 INFO L290 TraceCheckUtils]: 85: Hoare triple {30008#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,520 INFO L290 TraceCheckUtils]: 86: Hoare triple {30008#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,520 INFO L290 TraceCheckUtils]: 87: Hoare triple {30008#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,520 INFO L290 TraceCheckUtils]: 88: Hoare triple {30008#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,520 INFO L290 TraceCheckUtils]: 89: Hoare triple {30008#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,520 INFO L290 TraceCheckUtils]: 90: Hoare triple {30008#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {30008#true} is VALID [2022-04-28 08:34:55,520 INFO L290 TraceCheckUtils]: 91: Hoare triple {30008#true} assume 4416 == #t~mem60;havoc #t~mem60; {30008#true} is VALID [2022-04-28 08:34:55,521 INFO L290 TraceCheckUtils]: 92: Hoare triple {30008#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {30008#true} is VALID [2022-04-28 08:34:55,521 INFO L290 TraceCheckUtils]: 93: Hoare triple {30008#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {30008#true} is VALID [2022-04-28 08:34:55,522 INFO L290 TraceCheckUtils]: 94: Hoare triple {30008#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); {30013#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:34:55,522 INFO L290 TraceCheckUtils]: 95: Hoare triple {30013#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {30013#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:34:55,523 INFO L290 TraceCheckUtils]: 96: Hoare triple {30013#(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); {30013#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:34:55,523 INFO L290 TraceCheckUtils]: 97: Hoare triple {30013#(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; {30013#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:34:55,524 INFO L290 TraceCheckUtils]: 98: Hoare triple {30013#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {30013#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:34:55,524 INFO L290 TraceCheckUtils]: 99: Hoare triple {30013#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {30013#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:34:55,525 INFO L290 TraceCheckUtils]: 100: Hoare triple {30013#(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); {30013#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:34:55,525 INFO L290 TraceCheckUtils]: 101: Hoare triple {30013#(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); {30013#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:34:55,525 INFO L290 TraceCheckUtils]: 102: Hoare triple {30013#(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); {30013#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:34:55,526 INFO L290 TraceCheckUtils]: 103: Hoare triple {30013#(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); {30013#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:34:55,526 INFO L290 TraceCheckUtils]: 104: Hoare triple {30013#(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); {30013#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:34:55,527 INFO L290 TraceCheckUtils]: 105: Hoare triple {30013#(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); {30014#(not (= |ssl3_connect_#t~mem54| 4368))} is VALID [2022-04-28 08:34:55,527 INFO L290 TraceCheckUtils]: 106: Hoare triple {30014#(not (= |ssl3_connect_#t~mem54| 4368))} assume 4368 == #t~mem54;havoc #t~mem54; {30009#false} is VALID [2022-04-28 08:34:55,527 INFO L290 TraceCheckUtils]: 107: Hoare triple {30009#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; {30009#false} is VALID [2022-04-28 08:34:55,527 INFO L290 TraceCheckUtils]: 108: Hoare triple {30009#false} assume !(0 == ~blastFlag~0); {30009#false} is VALID [2022-04-28 08:34:55,527 INFO L290 TraceCheckUtils]: 109: Hoare triple {30009#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {30009#false} is VALID [2022-04-28 08:34:55,527 INFO L290 TraceCheckUtils]: 110: Hoare triple {30009#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); {30009#false} is VALID [2022-04-28 08:34:55,528 INFO L290 TraceCheckUtils]: 111: Hoare triple {30009#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; {30009#false} is VALID [2022-04-28 08:34:55,528 INFO L290 TraceCheckUtils]: 112: Hoare triple {30009#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); {30009#false} is VALID [2022-04-28 08:34:55,528 INFO L290 TraceCheckUtils]: 113: Hoare triple {30009#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {30009#false} is VALID [2022-04-28 08:34:55,528 INFO L290 TraceCheckUtils]: 114: Hoare triple {30009#false} ~skip~0 := 0; {30009#false} is VALID [2022-04-28 08:34:55,528 INFO L290 TraceCheckUtils]: 115: Hoare triple {30009#false} assume !false; {30009#false} is VALID [2022-04-28 08:34:55,528 INFO L290 TraceCheckUtils]: 116: Hoare triple {30009#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); {30009#false} is VALID [2022-04-28 08:34:55,528 INFO L290 TraceCheckUtils]: 117: Hoare triple {30009#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30009#false} is VALID [2022-04-28 08:34:55,528 INFO L290 TraceCheckUtils]: 118: Hoare triple {30009#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30009#false} is VALID [2022-04-28 08:34:55,528 INFO L290 TraceCheckUtils]: 119: Hoare triple {30009#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30009#false} is VALID [2022-04-28 08:34:55,528 INFO L290 TraceCheckUtils]: 120: Hoare triple {30009#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30009#false} is VALID [2022-04-28 08:34:55,529 INFO L290 TraceCheckUtils]: 121: Hoare triple {30009#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30009#false} is VALID [2022-04-28 08:34:55,529 INFO L290 TraceCheckUtils]: 122: Hoare triple {30009#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30009#false} is VALID [2022-04-28 08:34:55,529 INFO L290 TraceCheckUtils]: 123: Hoare triple {30009#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30009#false} is VALID [2022-04-28 08:34:55,529 INFO L290 TraceCheckUtils]: 124: Hoare triple {30009#false} assume 4384 == #t~mem56;havoc #t~mem56; {30009#false} is VALID [2022-04-28 08:34:55,529 INFO L290 TraceCheckUtils]: 125: Hoare triple {30009#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {30009#false} is VALID [2022-04-28 08:34:55,529 INFO L290 TraceCheckUtils]: 126: Hoare triple {30009#false} assume !(1 == ~blastFlag~0); {30009#false} is VALID [2022-04-28 08:34:55,529 INFO L290 TraceCheckUtils]: 127: Hoare triple {30009#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {30009#false} is VALID [2022-04-28 08:34:55,529 INFO L290 TraceCheckUtils]: 128: Hoare triple {30009#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {30009#false} is VALID [2022-04-28 08:34:55,529 INFO L290 TraceCheckUtils]: 129: Hoare triple {30009#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {30009#false} is VALID [2022-04-28 08:34:55,529 INFO L290 TraceCheckUtils]: 130: Hoare triple {30009#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); {30009#false} is VALID [2022-04-28 08:34:55,530 INFO L290 TraceCheckUtils]: 131: Hoare triple {30009#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {30009#false} is VALID [2022-04-28 08:34:55,530 INFO L290 TraceCheckUtils]: 132: Hoare triple {30009#false} ~skip~0 := 0; {30009#false} is VALID [2022-04-28 08:34:55,530 INFO L290 TraceCheckUtils]: 133: Hoare triple {30009#false} assume !false; {30009#false} is VALID [2022-04-28 08:34:55,530 INFO L290 TraceCheckUtils]: 134: Hoare triple {30009#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); {30009#false} is VALID [2022-04-28 08:34:55,530 INFO L290 TraceCheckUtils]: 135: Hoare triple {30009#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30009#false} is VALID [2022-04-28 08:34:55,530 INFO L290 TraceCheckUtils]: 136: Hoare triple {30009#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30009#false} is VALID [2022-04-28 08:34:55,530 INFO L290 TraceCheckUtils]: 137: Hoare triple {30009#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30009#false} is VALID [2022-04-28 08:34:55,530 INFO L290 TraceCheckUtils]: 138: Hoare triple {30009#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30009#false} is VALID [2022-04-28 08:34:55,530 INFO L290 TraceCheckUtils]: 139: Hoare triple {30009#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30009#false} is VALID [2022-04-28 08:34:55,530 INFO L290 TraceCheckUtils]: 140: Hoare triple {30009#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30009#false} is VALID [2022-04-28 08:34:55,530 INFO L290 TraceCheckUtils]: 141: Hoare triple {30009#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30009#false} is VALID [2022-04-28 08:34:55,531 INFO L290 TraceCheckUtils]: 142: Hoare triple {30009#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30009#false} is VALID [2022-04-28 08:34:55,531 INFO L290 TraceCheckUtils]: 143: Hoare triple {30009#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30009#false} is VALID [2022-04-28 08:34:55,531 INFO L290 TraceCheckUtils]: 144: Hoare triple {30009#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {30009#false} is VALID [2022-04-28 08:34:55,531 INFO L290 TraceCheckUtils]: 145: Hoare triple {30009#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {30009#false} is VALID [2022-04-28 08:34:55,531 INFO L290 TraceCheckUtils]: 146: Hoare triple {30009#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {30009#false} is VALID [2022-04-28 08:34:55,531 INFO L290 TraceCheckUtils]: 147: Hoare triple {30009#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {30009#false} is VALID [2022-04-28 08:34:55,531 INFO L290 TraceCheckUtils]: 148: Hoare triple {30009#false} assume 4432 == #t~mem62;havoc #t~mem62; {30009#false} is VALID [2022-04-28 08:34:55,531 INFO L290 TraceCheckUtils]: 149: Hoare triple {30009#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {30009#false} is VALID [2022-04-28 08:34:55,531 INFO L290 TraceCheckUtils]: 150: Hoare triple {30009#false} assume 5 == ~blastFlag~0; {30009#false} is VALID [2022-04-28 08:34:55,532 INFO L290 TraceCheckUtils]: 151: Hoare triple {30009#false} assume !false; {30009#false} is VALID [2022-04-28 08:34:55,532 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-28 08:34:55,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:34:55,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786997076] [2022-04-28 08:34:55,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786997076] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:34:55,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:34:55,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:34:55,533 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:34:55,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1528763921] [2022-04-28 08:34:55,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1528763921] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:34:55,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:34:55,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:34:55,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358243698] [2022-04-28 08:34:55,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:34:55,534 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-28 08:34:55,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:34:55,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:55,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:34:55,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:34:55,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:34:55,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:34:55,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:34:55,631 INFO L87 Difference]: Start difference. First operand 664 states and 965 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:57,660 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:34:59,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:59,049 INFO L93 Difference]: Finished difference Result 1651 states and 2412 transitions. [2022-04-28 08:34:59,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:34:59,049 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-28 08:34:59,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:34:59,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:59,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-28 08:34:59,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:59,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-28 08:34:59,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-28 08:34:59,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:34:59,434 INFO L225 Difference]: With dead ends: 1651 [2022-04-28 08:34:59,434 INFO L226 Difference]: Without dead ends: 1113 [2022-04-28 08:34:59,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:34:59,435 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 114 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 31 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 08:34:59,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 510 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 504 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 08:34:59,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2022-04-28 08:34:59,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 744. [2022-04-28 08:34:59,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:34:59,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1113 states. Second operand has 744 states, 739 states have (on average 1.4573748308525034) internal successors, (1077), 739 states have internal predecessors, (1077), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:59,475 INFO L74 IsIncluded]: Start isIncluded. First operand 1113 states. Second operand has 744 states, 739 states have (on average 1.4573748308525034) internal successors, (1077), 739 states have internal predecessors, (1077), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:59,476 INFO L87 Difference]: Start difference. First operand 1113 states. Second operand has 744 states, 739 states have (on average 1.4573748308525034) internal successors, (1077), 739 states have internal predecessors, (1077), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:59,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:59,528 INFO L93 Difference]: Finished difference Result 1113 states and 1620 transitions. [2022-04-28 08:34:59,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1620 transitions. [2022-04-28 08:34:59,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:34:59,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:34:59,531 INFO L74 IsIncluded]: Start isIncluded. First operand has 744 states, 739 states have (on average 1.4573748308525034) internal successors, (1077), 739 states have internal predecessors, (1077), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1113 states. [2022-04-28 08:34:59,532 INFO L87 Difference]: Start difference. First operand has 744 states, 739 states have (on average 1.4573748308525034) internal successors, (1077), 739 states have internal predecessors, (1077), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1113 states. [2022-04-28 08:34:59,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:59,578 INFO L93 Difference]: Finished difference Result 1113 states and 1620 transitions. [2022-04-28 08:34:59,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1620 transitions. [2022-04-28 08:34:59,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:34:59,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:34:59,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:34:59,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:34:59,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 739 states have (on average 1.4573748308525034) internal successors, (1077), 739 states have internal predecessors, (1077), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:59,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1081 transitions. [2022-04-28 08:34:59,618 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1081 transitions. Word has length 152 [2022-04-28 08:34:59,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:34:59,619 INFO L495 AbstractCegarLoop]: Abstraction has 744 states and 1081 transitions. [2022-04-28 08:34:59,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:59,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 744 states and 1081 transitions. [2022-04-28 08:35:00,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1081 edges. 1081 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:35:00,619 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1081 transitions. [2022-04-28 08:35:00,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-28 08:35:00,621 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:35:00,621 INFO L195 NwaCegarLoop]: 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-28 08:35:00,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 08:35:00,621 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:35:00,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:35:00,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1211981165, now seen corresponding path program 1 times [2022-04-28 08:35:00,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:35:00,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1970746062] [2022-04-28 08:35:15,163 WARN L232 SmtUtils]: Spent 8.64s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:35:23,722 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:35:23,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1211981165, now seen corresponding path program 2 times [2022-04-28 08:35:23,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:35:23,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746679167] [2022-04-28 08:35:23,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:35:23,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:35:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:23,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:35:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:23,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {37043#(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); {37036#true} is VALID [2022-04-28 08:35:23,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {37036#true} assume true; {37036#true} is VALID [2022-04-28 08:35:23,945 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37036#true} {37036#true} #593#return; {37036#true} is VALID [2022-04-28 08:35:23,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {37036#true} call ULTIMATE.init(); {37043#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:35:23,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {37043#(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); {37036#true} is VALID [2022-04-28 08:35:23,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {37036#true} assume true; {37036#true} is VALID [2022-04-28 08:35:23,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37036#true} {37036#true} #593#return; {37036#true} is VALID [2022-04-28 08:35:23,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {37036#true} call #t~ret158 := main(); {37036#true} is VALID [2022-04-28 08:35:23,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {37036#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; {37036#true} is VALID [2022-04-28 08:35:23,947 INFO L272 TraceCheckUtils]: 6: Hoare triple {37036#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {37036#true} is VALID [2022-04-28 08:35:23,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {37036#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); {37036#true} is VALID [2022-04-28 08:35:23,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {37036#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; {37036#true} is VALID [2022-04-28 08:35:23,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {37036#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; {37036#true} is VALID [2022-04-28 08:35:23,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {37036#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {37036#true} is VALID [2022-04-28 08:35:23,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {37036#true} assume !false; {37036#true} is VALID [2022-04-28 08:35:23,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {37036#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {37036#true} assume 12292 == #t~mem49;havoc #t~mem49; {37036#true} is VALID [2022-04-28 08:35:23,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {37036#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; {37036#true} is VALID [2022-04-28 08:35:23,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {37036#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,949 INFO L290 TraceCheckUtils]: 16: Hoare triple {37036#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {37036#true} is VALID [2022-04-28 08:35:23,949 INFO L290 TraceCheckUtils]: 17: Hoare triple {37036#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {37036#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); {37036#true} is VALID [2022-04-28 08:35:23,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {37036#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {37036#true} is VALID [2022-04-28 08:35:23,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {37036#true} assume !(0 == ~tmp___4~0); {37036#true} is VALID [2022-04-28 08:35:23,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {37036#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); {37036#true} is VALID [2022-04-28 08:35:23,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {37036#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); {37036#true} is VALID [2022-04-28 08:35:23,949 INFO L290 TraceCheckUtils]: 23: Hoare triple {37036#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37036#true} is VALID [2022-04-28 08:35:23,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {37036#true} ~skip~0 := 0; {37036#true} is VALID [2022-04-28 08:35:23,949 INFO L290 TraceCheckUtils]: 25: Hoare triple {37036#true} assume !false; {37036#true} is VALID [2022-04-28 08:35:23,950 INFO L290 TraceCheckUtils]: 26: Hoare triple {37036#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,950 INFO L290 TraceCheckUtils]: 27: Hoare triple {37036#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,950 INFO L290 TraceCheckUtils]: 28: Hoare triple {37036#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,950 INFO L290 TraceCheckUtils]: 29: Hoare triple {37036#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,950 INFO L290 TraceCheckUtils]: 30: Hoare triple {37036#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,950 INFO L290 TraceCheckUtils]: 31: Hoare triple {37036#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,950 INFO L290 TraceCheckUtils]: 32: Hoare triple {37036#true} assume 4368 == #t~mem54;havoc #t~mem54; {37036#true} is VALID [2022-04-28 08:35:23,950 INFO L290 TraceCheckUtils]: 33: Hoare triple {37036#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; {37036#true} is VALID [2022-04-28 08:35:23,950 INFO L290 TraceCheckUtils]: 34: Hoare triple {37036#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37036#true} is VALID [2022-04-28 08:35:23,950 INFO L290 TraceCheckUtils]: 35: Hoare triple {37036#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); {37036#true} is VALID [2022-04-28 08:35:23,951 INFO L290 TraceCheckUtils]: 36: Hoare triple {37036#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; {37036#true} is VALID [2022-04-28 08:35:23,951 INFO L290 TraceCheckUtils]: 37: Hoare triple {37036#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); {37036#true} is VALID [2022-04-28 08:35:23,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {37036#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37036#true} is VALID [2022-04-28 08:35:23,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {37036#true} ~skip~0 := 0; {37036#true} is VALID [2022-04-28 08:35:23,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {37036#true} assume !false; {37036#true} is VALID [2022-04-28 08:35:23,951 INFO L290 TraceCheckUtils]: 41: Hoare triple {37036#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,951 INFO L290 TraceCheckUtils]: 42: Hoare triple {37036#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,951 INFO L290 TraceCheckUtils]: 43: Hoare triple {37036#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,951 INFO L290 TraceCheckUtils]: 44: Hoare triple {37036#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,951 INFO L290 TraceCheckUtils]: 45: Hoare triple {37036#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,951 INFO L290 TraceCheckUtils]: 46: Hoare triple {37036#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,952 INFO L290 TraceCheckUtils]: 47: Hoare triple {37036#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,952 INFO L290 TraceCheckUtils]: 48: Hoare triple {37036#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,952 INFO L290 TraceCheckUtils]: 49: Hoare triple {37036#true} assume 4384 == #t~mem56;havoc #t~mem56; {37036#true} is VALID [2022-04-28 08:35:23,952 INFO L290 TraceCheckUtils]: 50: Hoare triple {37036#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {37036#true} is VALID [2022-04-28 08:35:23,952 INFO L290 TraceCheckUtils]: 51: Hoare triple {37036#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {37036#true} is VALID [2022-04-28 08:35:23,952 INFO L290 TraceCheckUtils]: 52: Hoare triple {37036#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,952 INFO L290 TraceCheckUtils]: 53: Hoare triple {37036#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,952 INFO L290 TraceCheckUtils]: 54: Hoare triple {37036#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,952 INFO L290 TraceCheckUtils]: 55: Hoare triple {37036#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); {37036#true} is VALID [2022-04-28 08:35:23,952 INFO L290 TraceCheckUtils]: 56: Hoare triple {37036#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37036#true} is VALID [2022-04-28 08:35:23,952 INFO L290 TraceCheckUtils]: 57: Hoare triple {37036#true} ~skip~0 := 0; {37036#true} is VALID [2022-04-28 08:35:23,953 INFO L290 TraceCheckUtils]: 58: Hoare triple {37036#true} assume !false; {37036#true} is VALID [2022-04-28 08:35:23,953 INFO L290 TraceCheckUtils]: 59: Hoare triple {37036#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,953 INFO L290 TraceCheckUtils]: 60: Hoare triple {37036#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,953 INFO L290 TraceCheckUtils]: 61: Hoare triple {37036#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,953 INFO L290 TraceCheckUtils]: 62: Hoare triple {37036#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,953 INFO L290 TraceCheckUtils]: 63: Hoare triple {37036#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,953 INFO L290 TraceCheckUtils]: 64: Hoare triple {37036#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,953 INFO L290 TraceCheckUtils]: 65: Hoare triple {37036#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,953 INFO L290 TraceCheckUtils]: 66: Hoare triple {37036#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,953 INFO L290 TraceCheckUtils]: 67: Hoare triple {37036#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,954 INFO L290 TraceCheckUtils]: 68: Hoare triple {37036#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,954 INFO L290 TraceCheckUtils]: 69: Hoare triple {37036#true} assume 4400 == #t~mem58;havoc #t~mem58; {37036#true} is VALID [2022-04-28 08:35:23,954 INFO L290 TraceCheckUtils]: 70: Hoare triple {37036#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); {37036#true} is VALID [2022-04-28 08:35:23,954 INFO L290 TraceCheckUtils]: 71: Hoare triple {37036#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; {37036#true} is VALID [2022-04-28 08:35:23,954 INFO L290 TraceCheckUtils]: 72: Hoare triple {37036#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {37036#true} is VALID [2022-04-28 08:35:23,954 INFO L290 TraceCheckUtils]: 73: Hoare triple {37036#true} assume !(~ret~0 <= 0); {37036#true} is VALID [2022-04-28 08:35:23,954 INFO L290 TraceCheckUtils]: 74: Hoare triple {37036#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,954 INFO L290 TraceCheckUtils]: 75: Hoare triple {37036#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); {37036#true} is VALID [2022-04-28 08:35:23,954 INFO L290 TraceCheckUtils]: 76: Hoare triple {37036#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37036#true} is VALID [2022-04-28 08:35:23,954 INFO L290 TraceCheckUtils]: 77: Hoare triple {37036#true} ~skip~0 := 0; {37036#true} is VALID [2022-04-28 08:35:23,954 INFO L290 TraceCheckUtils]: 78: Hoare triple {37036#true} assume !false; {37036#true} is VALID [2022-04-28 08:35:23,955 INFO L290 TraceCheckUtils]: 79: Hoare triple {37036#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,955 INFO L290 TraceCheckUtils]: 80: Hoare triple {37036#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,955 INFO L290 TraceCheckUtils]: 81: Hoare triple {37036#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,955 INFO L290 TraceCheckUtils]: 82: Hoare triple {37036#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,955 INFO L290 TraceCheckUtils]: 83: Hoare triple {37036#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,955 INFO L290 TraceCheckUtils]: 84: Hoare triple {37036#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,955 INFO L290 TraceCheckUtils]: 85: Hoare triple {37036#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,955 INFO L290 TraceCheckUtils]: 86: Hoare triple {37036#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,955 INFO L290 TraceCheckUtils]: 87: Hoare triple {37036#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,955 INFO L290 TraceCheckUtils]: 88: Hoare triple {37036#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,956 INFO L290 TraceCheckUtils]: 89: Hoare triple {37036#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,956 INFO L290 TraceCheckUtils]: 90: Hoare triple {37036#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {37036#true} is VALID [2022-04-28 08:35:23,956 INFO L290 TraceCheckUtils]: 91: Hoare triple {37036#true} assume 4416 == #t~mem60;havoc #t~mem60; {37036#true} is VALID [2022-04-28 08:35:23,956 INFO L290 TraceCheckUtils]: 92: Hoare triple {37036#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {37036#true} is VALID [2022-04-28 08:35:23,956 INFO L290 TraceCheckUtils]: 93: Hoare triple {37036#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {37036#true} is VALID [2022-04-28 08:35:23,957 INFO L290 TraceCheckUtils]: 94: Hoare triple {37036#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); {37041#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:23,957 INFO L290 TraceCheckUtils]: 95: Hoare triple {37041#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {37041#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:23,958 INFO L290 TraceCheckUtils]: 96: Hoare triple {37041#(= 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); {37041#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:23,958 INFO L290 TraceCheckUtils]: 97: Hoare triple {37041#(= 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; {37041#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:23,958 INFO L290 TraceCheckUtils]: 98: Hoare triple {37041#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {37041#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:23,959 INFO L290 TraceCheckUtils]: 99: Hoare triple {37041#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {37041#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:23,959 INFO L290 TraceCheckUtils]: 100: Hoare triple {37041#(= 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); {37041#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:23,959 INFO L290 TraceCheckUtils]: 101: Hoare triple {37041#(= 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); {37041#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:23,960 INFO L290 TraceCheckUtils]: 102: Hoare triple {37041#(= 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); {37041#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:23,960 INFO L290 TraceCheckUtils]: 103: Hoare triple {37041#(= 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); {37041#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:23,960 INFO L290 TraceCheckUtils]: 104: Hoare triple {37041#(= 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); {37041#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:23,961 INFO L290 TraceCheckUtils]: 105: Hoare triple {37041#(= 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); {37041#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:23,961 INFO L290 TraceCheckUtils]: 106: Hoare triple {37041#(= 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); {37042#(= |ssl3_connect_#t~mem55| 4432)} is VALID [2022-04-28 08:35:23,962 INFO L290 TraceCheckUtils]: 107: Hoare triple {37042#(= |ssl3_connect_#t~mem55| 4432)} assume 4369 == #t~mem55;havoc #t~mem55; {37037#false} is VALID [2022-04-28 08:35:23,962 INFO L290 TraceCheckUtils]: 108: Hoare triple {37037#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; {37037#false} is VALID [2022-04-28 08:35:23,962 INFO L290 TraceCheckUtils]: 109: Hoare triple {37037#false} assume !(0 == ~blastFlag~0); {37037#false} is VALID [2022-04-28 08:35:23,962 INFO L290 TraceCheckUtils]: 110: Hoare triple {37037#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {37037#false} is VALID [2022-04-28 08:35:23,962 INFO L290 TraceCheckUtils]: 111: Hoare triple {37037#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); {37037#false} is VALID [2022-04-28 08:35:23,962 INFO L290 TraceCheckUtils]: 112: Hoare triple {37037#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; {37037#false} is VALID [2022-04-28 08:35:23,962 INFO L290 TraceCheckUtils]: 113: Hoare triple {37037#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); {37037#false} is VALID [2022-04-28 08:35:23,962 INFO L290 TraceCheckUtils]: 114: Hoare triple {37037#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37037#false} is VALID [2022-04-28 08:35:23,962 INFO L290 TraceCheckUtils]: 115: Hoare triple {37037#false} ~skip~0 := 0; {37037#false} is VALID [2022-04-28 08:35:23,962 INFO L290 TraceCheckUtils]: 116: Hoare triple {37037#false} assume !false; {37037#false} is VALID [2022-04-28 08:35:23,963 INFO L290 TraceCheckUtils]: 117: Hoare triple {37037#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); {37037#false} is VALID [2022-04-28 08:35:23,963 INFO L290 TraceCheckUtils]: 118: Hoare triple {37037#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37037#false} is VALID [2022-04-28 08:35:23,963 INFO L290 TraceCheckUtils]: 119: Hoare triple {37037#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37037#false} is VALID [2022-04-28 08:35:23,963 INFO L290 TraceCheckUtils]: 120: Hoare triple {37037#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37037#false} is VALID [2022-04-28 08:35:23,963 INFO L290 TraceCheckUtils]: 121: Hoare triple {37037#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37037#false} is VALID [2022-04-28 08:35:23,963 INFO L290 TraceCheckUtils]: 122: Hoare triple {37037#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37037#false} is VALID [2022-04-28 08:35:23,963 INFO L290 TraceCheckUtils]: 123: Hoare triple {37037#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37037#false} is VALID [2022-04-28 08:35:23,963 INFO L290 TraceCheckUtils]: 124: Hoare triple {37037#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37037#false} is VALID [2022-04-28 08:35:23,963 INFO L290 TraceCheckUtils]: 125: Hoare triple {37037#false} assume 4384 == #t~mem56;havoc #t~mem56; {37037#false} is VALID [2022-04-28 08:35:23,963 INFO L290 TraceCheckUtils]: 126: Hoare triple {37037#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {37037#false} is VALID [2022-04-28 08:35:23,963 INFO L290 TraceCheckUtils]: 127: Hoare triple {37037#false} assume !(1 == ~blastFlag~0); {37037#false} is VALID [2022-04-28 08:35:23,964 INFO L290 TraceCheckUtils]: 128: Hoare triple {37037#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {37037#false} is VALID [2022-04-28 08:35:23,964 INFO L290 TraceCheckUtils]: 129: Hoare triple {37037#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {37037#false} is VALID [2022-04-28 08:35:23,964 INFO L290 TraceCheckUtils]: 130: Hoare triple {37037#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {37037#false} is VALID [2022-04-28 08:35:23,964 INFO L290 TraceCheckUtils]: 131: Hoare triple {37037#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); {37037#false} is VALID [2022-04-28 08:35:23,964 INFO L290 TraceCheckUtils]: 132: Hoare triple {37037#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37037#false} is VALID [2022-04-28 08:35:23,964 INFO L290 TraceCheckUtils]: 133: Hoare triple {37037#false} ~skip~0 := 0; {37037#false} is VALID [2022-04-28 08:35:23,964 INFO L290 TraceCheckUtils]: 134: Hoare triple {37037#false} assume !false; {37037#false} is VALID [2022-04-28 08:35:23,964 INFO L290 TraceCheckUtils]: 135: Hoare triple {37037#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); {37037#false} is VALID [2022-04-28 08:35:23,964 INFO L290 TraceCheckUtils]: 136: Hoare triple {37037#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37037#false} is VALID [2022-04-28 08:35:23,964 INFO L290 TraceCheckUtils]: 137: Hoare triple {37037#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37037#false} is VALID [2022-04-28 08:35:23,965 INFO L290 TraceCheckUtils]: 138: Hoare triple {37037#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37037#false} is VALID [2022-04-28 08:35:23,965 INFO L290 TraceCheckUtils]: 139: Hoare triple {37037#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37037#false} is VALID [2022-04-28 08:35:23,965 INFO L290 TraceCheckUtils]: 140: Hoare triple {37037#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37037#false} is VALID [2022-04-28 08:35:23,965 INFO L290 TraceCheckUtils]: 141: Hoare triple {37037#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37037#false} is VALID [2022-04-28 08:35:23,965 INFO L290 TraceCheckUtils]: 142: Hoare triple {37037#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37037#false} is VALID [2022-04-28 08:35:23,965 INFO L290 TraceCheckUtils]: 143: Hoare triple {37037#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37037#false} is VALID [2022-04-28 08:35:23,965 INFO L290 TraceCheckUtils]: 144: Hoare triple {37037#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37037#false} is VALID [2022-04-28 08:35:23,965 INFO L290 TraceCheckUtils]: 145: Hoare triple {37037#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {37037#false} is VALID [2022-04-28 08:35:23,965 INFO L290 TraceCheckUtils]: 146: Hoare triple {37037#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {37037#false} is VALID [2022-04-28 08:35:23,965 INFO L290 TraceCheckUtils]: 147: Hoare triple {37037#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {37037#false} is VALID [2022-04-28 08:35:23,966 INFO L290 TraceCheckUtils]: 148: Hoare triple {37037#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {37037#false} is VALID [2022-04-28 08:35:23,966 INFO L290 TraceCheckUtils]: 149: Hoare triple {37037#false} assume 4432 == #t~mem62;havoc #t~mem62; {37037#false} is VALID [2022-04-28 08:35:23,966 INFO L290 TraceCheckUtils]: 150: Hoare triple {37037#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {37037#false} is VALID [2022-04-28 08:35:23,966 INFO L290 TraceCheckUtils]: 151: Hoare triple {37037#false} assume 5 == ~blastFlag~0; {37037#false} is VALID [2022-04-28 08:35:23,966 INFO L290 TraceCheckUtils]: 152: Hoare triple {37037#false} assume !false; {37037#false} is VALID [2022-04-28 08:35:23,966 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-28 08:35:23,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:35:23,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746679167] [2022-04-28 08:35:23,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746679167] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:35:23,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:35:23,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:35:23,967 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:35:23,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1970746062] [2022-04-28 08:35:23,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1970746062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:35:23,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:35:23,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:35:23,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739096408] [2022-04-28 08:35:23,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:35:23,968 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-28 08:35:23,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:35:23,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:24,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:35:24,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:35:24,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:35:24,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:35:24,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:35:24,058 INFO L87 Difference]: Start difference. First operand 744 states and 1081 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:26,091 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:35:27,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:27,576 INFO L93 Difference]: Finished difference Result 1693 states and 2470 transitions. [2022-04-28 08:35:27,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:35:27,577 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-28 08:35:27,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:35:27,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:27,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2022-04-28 08:35:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:27,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2022-04-28 08:35:27,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 465 transitions. [2022-04-28 08:35:27,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 465 edges. 465 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:35:27,933 INFO L225 Difference]: With dead ends: 1693 [2022-04-28 08:35:27,933 INFO L226 Difference]: Without dead ends: 1091 [2022-04-28 08:35:27,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:35:27,935 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 97 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 08:35:27,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 567 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 532 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 08:35:27,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2022-04-28 08:35:27,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 812. [2022-04-28 08:35:27,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:35:27,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1091 states. Second operand has 812 states, 807 states have (on average 1.4584882280049567) internal successors, (1177), 807 states have internal predecessors, (1177), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:27,978 INFO L74 IsIncluded]: Start isIncluded. First operand 1091 states. Second operand has 812 states, 807 states have (on average 1.4584882280049567) internal successors, (1177), 807 states have internal predecessors, (1177), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:27,978 INFO L87 Difference]: Start difference. First operand 1091 states. Second operand has 812 states, 807 states have (on average 1.4584882280049567) internal successors, (1177), 807 states have internal predecessors, (1177), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:28,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:28,027 INFO L93 Difference]: Finished difference Result 1091 states and 1591 transitions. [2022-04-28 08:35:28,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1591 transitions. [2022-04-28 08:35:28,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:35:28,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:35:28,031 INFO L74 IsIncluded]: Start isIncluded. First operand has 812 states, 807 states have (on average 1.4584882280049567) internal successors, (1177), 807 states have internal predecessors, (1177), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1091 states. [2022-04-28 08:35:28,032 INFO L87 Difference]: Start difference. First operand has 812 states, 807 states have (on average 1.4584882280049567) internal successors, (1177), 807 states have internal predecessors, (1177), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1091 states. [2022-04-28 08:35:28,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:28,081 INFO L93 Difference]: Finished difference Result 1091 states and 1591 transitions. [2022-04-28 08:35:28,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1591 transitions. [2022-04-28 08:35:28,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:35:28,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:35:28,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:35:28,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:35:28,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 807 states have (on average 1.4584882280049567) internal successors, (1177), 807 states have internal predecessors, (1177), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:28,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1181 transitions. [2022-04-28 08:35:28,125 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1181 transitions. Word has length 153 [2022-04-28 08:35:28,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:35:28,125 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 1181 transitions. [2022-04-28 08:35:28,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:28,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 812 states and 1181 transitions. [2022-04-28 08:35:29,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1181 edges. 1181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:35:29,236 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1181 transitions. [2022-04-28 08:35:29,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-04-28 08:35:29,237 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:35:29,237 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:35:29,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 08:35:29,237 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:35:29,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:35:29,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1496700185, now seen corresponding path program 1 times [2022-04-28 08:35:29,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:35:29,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [705167869] [2022-04-28 08:35:43,399 WARN L232 SmtUtils]: Spent 12.43s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:35:57,030 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:35:57,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1496700185, now seen corresponding path program 2 times [2022-04-28 08:35:57,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:35:57,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143941684] [2022-04-28 08:35:57,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:35:57,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:35:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:57,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:35:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:57,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {44247#(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); {44240#true} is VALID [2022-04-28 08:35:57,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {44240#true} assume true; {44240#true} is VALID [2022-04-28 08:35:57,242 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44240#true} {44240#true} #593#return; {44240#true} is VALID [2022-04-28 08:35:57,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {44240#true} call ULTIMATE.init(); {44247#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:35:57,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {44247#(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); {44240#true} is VALID [2022-04-28 08:35:57,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {44240#true} assume true; {44240#true} is VALID [2022-04-28 08:35:57,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44240#true} {44240#true} #593#return; {44240#true} is VALID [2022-04-28 08:35:57,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {44240#true} call #t~ret158 := main(); {44240#true} is VALID [2022-04-28 08:35:57,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {44240#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; {44240#true} is VALID [2022-04-28 08:35:57,243 INFO L272 TraceCheckUtils]: 6: Hoare triple {44240#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {44240#true} is VALID [2022-04-28 08:35:57,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {44240#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); {44240#true} is VALID [2022-04-28 08:35:57,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {44240#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; {44240#true} is VALID [2022-04-28 08:35:57,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {44240#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; {44240#true} is VALID [2022-04-28 08:35:57,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {44240#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {44240#true} is VALID [2022-04-28 08:35:57,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {44240#true} assume !false; {44240#true} is VALID [2022-04-28 08:35:57,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {44240#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {44240#true} assume 12292 == #t~mem49;havoc #t~mem49; {44240#true} is VALID [2022-04-28 08:35:57,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {44240#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; {44240#true} is VALID [2022-04-28 08:35:57,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {44240#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {44240#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {44240#true} is VALID [2022-04-28 08:35:57,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {44240#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {44240#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); {44240#true} is VALID [2022-04-28 08:35:57,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {44240#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {44240#true} is VALID [2022-04-28 08:35:57,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {44240#true} assume !(0 == ~tmp___4~0); {44240#true} is VALID [2022-04-28 08:35:57,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {44240#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); {44240#true} is VALID [2022-04-28 08:35:57,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {44240#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); {44240#true} is VALID [2022-04-28 08:35:57,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {44240#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44240#true} is VALID [2022-04-28 08:35:57,245 INFO L290 TraceCheckUtils]: 24: Hoare triple {44240#true} ~skip~0 := 0; {44240#true} is VALID [2022-04-28 08:35:57,245 INFO L290 TraceCheckUtils]: 25: Hoare triple {44240#true} assume !false; {44240#true} is VALID [2022-04-28 08:35:57,245 INFO L290 TraceCheckUtils]: 26: Hoare triple {44240#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,245 INFO L290 TraceCheckUtils]: 27: Hoare triple {44240#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,245 INFO L290 TraceCheckUtils]: 28: Hoare triple {44240#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,246 INFO L290 TraceCheckUtils]: 29: Hoare triple {44240#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,246 INFO L290 TraceCheckUtils]: 30: Hoare triple {44240#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,246 INFO L290 TraceCheckUtils]: 31: Hoare triple {44240#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,246 INFO L290 TraceCheckUtils]: 32: Hoare triple {44240#true} assume 4368 == #t~mem54;havoc #t~mem54; {44240#true} is VALID [2022-04-28 08:35:57,246 INFO L290 TraceCheckUtils]: 33: Hoare triple {44240#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; {44240#true} is VALID [2022-04-28 08:35:57,246 INFO L290 TraceCheckUtils]: 34: Hoare triple {44240#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {44240#true} is VALID [2022-04-28 08:35:57,246 INFO L290 TraceCheckUtils]: 35: Hoare triple {44240#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); {44240#true} is VALID [2022-04-28 08:35:57,246 INFO L290 TraceCheckUtils]: 36: Hoare triple {44240#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; {44240#true} is VALID [2022-04-28 08:35:57,246 INFO L290 TraceCheckUtils]: 37: Hoare triple {44240#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); {44240#true} is VALID [2022-04-28 08:35:57,246 INFO L290 TraceCheckUtils]: 38: Hoare triple {44240#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44240#true} is VALID [2022-04-28 08:35:57,246 INFO L290 TraceCheckUtils]: 39: Hoare triple {44240#true} ~skip~0 := 0; {44240#true} is VALID [2022-04-28 08:35:57,247 INFO L290 TraceCheckUtils]: 40: Hoare triple {44240#true} assume !false; {44240#true} is VALID [2022-04-28 08:35:57,247 INFO L290 TraceCheckUtils]: 41: Hoare triple {44240#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,247 INFO L290 TraceCheckUtils]: 42: Hoare triple {44240#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,247 INFO L290 TraceCheckUtils]: 43: Hoare triple {44240#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,247 INFO L290 TraceCheckUtils]: 44: Hoare triple {44240#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,247 INFO L290 TraceCheckUtils]: 45: Hoare triple {44240#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,247 INFO L290 TraceCheckUtils]: 46: Hoare triple {44240#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,247 INFO L290 TraceCheckUtils]: 47: Hoare triple {44240#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,247 INFO L290 TraceCheckUtils]: 48: Hoare triple {44240#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,247 INFO L290 TraceCheckUtils]: 49: Hoare triple {44240#true} assume 4384 == #t~mem56;havoc #t~mem56; {44240#true} is VALID [2022-04-28 08:35:57,248 INFO L290 TraceCheckUtils]: 50: Hoare triple {44240#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {44240#true} is VALID [2022-04-28 08:35:57,248 INFO L290 TraceCheckUtils]: 51: Hoare triple {44240#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {44240#true} is VALID [2022-04-28 08:35:57,248 INFO L290 TraceCheckUtils]: 52: Hoare triple {44240#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,248 INFO L290 TraceCheckUtils]: 53: Hoare triple {44240#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,248 INFO L290 TraceCheckUtils]: 54: Hoare triple {44240#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,248 INFO L290 TraceCheckUtils]: 55: Hoare triple {44240#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); {44240#true} is VALID [2022-04-28 08:35:57,248 INFO L290 TraceCheckUtils]: 56: Hoare triple {44240#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44240#true} is VALID [2022-04-28 08:35:57,248 INFO L290 TraceCheckUtils]: 57: Hoare triple {44240#true} ~skip~0 := 0; {44240#true} is VALID [2022-04-28 08:35:57,248 INFO L290 TraceCheckUtils]: 58: Hoare triple {44240#true} assume !false; {44240#true} is VALID [2022-04-28 08:35:57,249 INFO L290 TraceCheckUtils]: 59: Hoare triple {44240#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,249 INFO L290 TraceCheckUtils]: 60: Hoare triple {44240#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,249 INFO L290 TraceCheckUtils]: 61: Hoare triple {44240#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,249 INFO L290 TraceCheckUtils]: 62: Hoare triple {44240#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,249 INFO L290 TraceCheckUtils]: 63: Hoare triple {44240#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,249 INFO L290 TraceCheckUtils]: 64: Hoare triple {44240#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,249 INFO L290 TraceCheckUtils]: 65: Hoare triple {44240#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,249 INFO L290 TraceCheckUtils]: 66: Hoare triple {44240#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,249 INFO L290 TraceCheckUtils]: 67: Hoare triple {44240#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,249 INFO L290 TraceCheckUtils]: 68: Hoare triple {44240#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,249 INFO L290 TraceCheckUtils]: 69: Hoare triple {44240#true} assume 4400 == #t~mem58;havoc #t~mem58; {44240#true} is VALID [2022-04-28 08:35:57,250 INFO L290 TraceCheckUtils]: 70: Hoare triple {44240#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); {44240#true} is VALID [2022-04-28 08:35:57,250 INFO L290 TraceCheckUtils]: 71: Hoare triple {44240#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; {44240#true} is VALID [2022-04-28 08:35:57,250 INFO L290 TraceCheckUtils]: 72: Hoare triple {44240#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {44240#true} is VALID [2022-04-28 08:35:57,250 INFO L290 TraceCheckUtils]: 73: Hoare triple {44240#true} assume !(~ret~0 <= 0); {44240#true} is VALID [2022-04-28 08:35:57,250 INFO L290 TraceCheckUtils]: 74: Hoare triple {44240#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,250 INFO L290 TraceCheckUtils]: 75: Hoare triple {44240#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); {44240#true} is VALID [2022-04-28 08:35:57,250 INFO L290 TraceCheckUtils]: 76: Hoare triple {44240#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44240#true} is VALID [2022-04-28 08:35:57,250 INFO L290 TraceCheckUtils]: 77: Hoare triple {44240#true} ~skip~0 := 0; {44240#true} is VALID [2022-04-28 08:35:57,250 INFO L290 TraceCheckUtils]: 78: Hoare triple {44240#true} assume !false; {44240#true} is VALID [2022-04-28 08:35:57,250 INFO L290 TraceCheckUtils]: 79: Hoare triple {44240#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,251 INFO L290 TraceCheckUtils]: 80: Hoare triple {44240#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,251 INFO L290 TraceCheckUtils]: 81: Hoare triple {44240#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,251 INFO L290 TraceCheckUtils]: 82: Hoare triple {44240#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,251 INFO L290 TraceCheckUtils]: 83: Hoare triple {44240#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,251 INFO L290 TraceCheckUtils]: 84: Hoare triple {44240#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,251 INFO L290 TraceCheckUtils]: 85: Hoare triple {44240#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,251 INFO L290 TraceCheckUtils]: 86: Hoare triple {44240#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,251 INFO L290 TraceCheckUtils]: 87: Hoare triple {44240#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,251 INFO L290 TraceCheckUtils]: 88: Hoare triple {44240#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,251 INFO L290 TraceCheckUtils]: 89: Hoare triple {44240#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,251 INFO L290 TraceCheckUtils]: 90: Hoare triple {44240#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {44240#true} is VALID [2022-04-28 08:35:57,252 INFO L290 TraceCheckUtils]: 91: Hoare triple {44240#true} assume 4416 == #t~mem60;havoc #t~mem60; {44240#true} is VALID [2022-04-28 08:35:57,252 INFO L290 TraceCheckUtils]: 92: Hoare triple {44240#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {44240#true} is VALID [2022-04-28 08:35:57,252 INFO L290 TraceCheckUtils]: 93: Hoare triple {44240#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {44240#true} is VALID [2022-04-28 08:35:57,253 INFO L290 TraceCheckUtils]: 94: Hoare triple {44240#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); {44245#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:35:57,253 INFO L290 TraceCheckUtils]: 95: Hoare triple {44245#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {44245#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:35:57,254 INFO L290 TraceCheckUtils]: 96: Hoare triple {44245#(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); {44245#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:35:57,254 INFO L290 TraceCheckUtils]: 97: Hoare triple {44245#(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; {44245#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:35:57,255 INFO L290 TraceCheckUtils]: 98: Hoare triple {44245#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {44245#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:35:57,255 INFO L290 TraceCheckUtils]: 99: Hoare triple {44245#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {44245#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:35:57,255 INFO L290 TraceCheckUtils]: 100: Hoare triple {44245#(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); {44245#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:35:57,256 INFO L290 TraceCheckUtils]: 101: Hoare triple {44245#(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); {44245#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:35:57,256 INFO L290 TraceCheckUtils]: 102: Hoare triple {44245#(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); {44246#(not (= |ssl3_connect_#t~mem51| 4096))} is VALID [2022-04-28 08:35:57,257 INFO L290 TraceCheckUtils]: 103: Hoare triple {44246#(not (= |ssl3_connect_#t~mem51| 4096))} assume 4096 == #t~mem51;havoc #t~mem51; {44241#false} is VALID [2022-04-28 08:35:57,257 INFO L290 TraceCheckUtils]: 104: Hoare triple {44241#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,257 INFO L290 TraceCheckUtils]: 105: Hoare triple {44241#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {44241#false} is VALID [2022-04-28 08:35:57,257 INFO L290 TraceCheckUtils]: 106: Hoare triple {44241#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,257 INFO L290 TraceCheckUtils]: 107: Hoare triple {44241#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); {44241#false} is VALID [2022-04-28 08:35:57,257 INFO L290 TraceCheckUtils]: 108: Hoare triple {44241#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {44241#false} is VALID [2022-04-28 08:35:57,257 INFO L290 TraceCheckUtils]: 109: Hoare triple {44241#false} assume !(0 == ~tmp___4~0); {44241#false} is VALID [2022-04-28 08:35:57,257 INFO L290 TraceCheckUtils]: 110: Hoare triple {44241#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); {44241#false} is VALID [2022-04-28 08:35:57,258 INFO L290 TraceCheckUtils]: 111: Hoare triple {44241#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); {44241#false} is VALID [2022-04-28 08:35:57,258 INFO L290 TraceCheckUtils]: 112: Hoare triple {44241#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44241#false} is VALID [2022-04-28 08:35:57,258 INFO L290 TraceCheckUtils]: 113: Hoare triple {44241#false} ~skip~0 := 0; {44241#false} is VALID [2022-04-28 08:35:57,258 INFO L290 TraceCheckUtils]: 114: Hoare triple {44241#false} assume !false; {44241#false} is VALID [2022-04-28 08:35:57,258 INFO L290 TraceCheckUtils]: 115: Hoare triple {44241#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); {44241#false} is VALID [2022-04-28 08:35:57,258 INFO L290 TraceCheckUtils]: 116: Hoare triple {44241#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,258 INFO L290 TraceCheckUtils]: 117: Hoare triple {44241#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,258 INFO L290 TraceCheckUtils]: 118: Hoare triple {44241#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,258 INFO L290 TraceCheckUtils]: 119: Hoare triple {44241#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,258 INFO L290 TraceCheckUtils]: 120: Hoare triple {44241#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,259 INFO L290 TraceCheckUtils]: 121: Hoare triple {44241#false} assume 4368 == #t~mem54;havoc #t~mem54; {44241#false} is VALID [2022-04-28 08:35:57,259 INFO L290 TraceCheckUtils]: 122: Hoare triple {44241#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; {44241#false} is VALID [2022-04-28 08:35:57,259 INFO L290 TraceCheckUtils]: 123: Hoare triple {44241#false} assume !(0 == ~blastFlag~0); {44241#false} is VALID [2022-04-28 08:35:57,259 INFO L290 TraceCheckUtils]: 124: Hoare triple {44241#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {44241#false} is VALID [2022-04-28 08:35:57,259 INFO L290 TraceCheckUtils]: 125: Hoare triple {44241#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); {44241#false} is VALID [2022-04-28 08:35:57,259 INFO L290 TraceCheckUtils]: 126: Hoare triple {44241#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; {44241#false} is VALID [2022-04-28 08:35:57,259 INFO L290 TraceCheckUtils]: 127: Hoare triple {44241#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); {44241#false} is VALID [2022-04-28 08:35:57,259 INFO L290 TraceCheckUtils]: 128: Hoare triple {44241#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44241#false} is VALID [2022-04-28 08:35:57,259 INFO L290 TraceCheckUtils]: 129: Hoare triple {44241#false} ~skip~0 := 0; {44241#false} is VALID [2022-04-28 08:35:57,259 INFO L290 TraceCheckUtils]: 130: Hoare triple {44241#false} assume !false; {44241#false} is VALID [2022-04-28 08:35:57,260 INFO L290 TraceCheckUtils]: 131: Hoare triple {44241#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); {44241#false} is VALID [2022-04-28 08:35:57,260 INFO L290 TraceCheckUtils]: 132: Hoare triple {44241#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,260 INFO L290 TraceCheckUtils]: 133: Hoare triple {44241#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,260 INFO L290 TraceCheckUtils]: 134: Hoare triple {44241#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,260 INFO L290 TraceCheckUtils]: 135: Hoare triple {44241#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,260 INFO L290 TraceCheckUtils]: 136: Hoare triple {44241#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,260 INFO L290 TraceCheckUtils]: 137: Hoare triple {44241#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,260 INFO L290 TraceCheckUtils]: 138: Hoare triple {44241#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,260 INFO L290 TraceCheckUtils]: 139: Hoare triple {44241#false} assume 4384 == #t~mem56;havoc #t~mem56; {44241#false} is VALID [2022-04-28 08:35:57,260 INFO L290 TraceCheckUtils]: 140: Hoare triple {44241#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {44241#false} is VALID [2022-04-28 08:35:57,261 INFO L290 TraceCheckUtils]: 141: Hoare triple {44241#false} assume !(1 == ~blastFlag~0); {44241#false} is VALID [2022-04-28 08:35:57,261 INFO L290 TraceCheckUtils]: 142: Hoare triple {44241#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,261 INFO L290 TraceCheckUtils]: 143: Hoare triple {44241#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,261 INFO L290 TraceCheckUtils]: 144: Hoare triple {44241#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,261 INFO L290 TraceCheckUtils]: 145: Hoare triple {44241#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); {44241#false} is VALID [2022-04-28 08:35:57,261 INFO L290 TraceCheckUtils]: 146: Hoare triple {44241#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44241#false} is VALID [2022-04-28 08:35:57,261 INFO L290 TraceCheckUtils]: 147: Hoare triple {44241#false} ~skip~0 := 0; {44241#false} is VALID [2022-04-28 08:35:57,261 INFO L290 TraceCheckUtils]: 148: Hoare triple {44241#false} assume !false; {44241#false} is VALID [2022-04-28 08:35:57,280 INFO L290 TraceCheckUtils]: 149: Hoare triple {44241#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); {44241#false} is VALID [2022-04-28 08:35:57,280 INFO L290 TraceCheckUtils]: 150: Hoare triple {44241#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,280 INFO L290 TraceCheckUtils]: 151: Hoare triple {44241#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,281 INFO L290 TraceCheckUtils]: 152: Hoare triple {44241#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,281 INFO L290 TraceCheckUtils]: 153: Hoare triple {44241#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,281 INFO L290 TraceCheckUtils]: 154: Hoare triple {44241#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,281 INFO L290 TraceCheckUtils]: 155: Hoare triple {44241#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,281 INFO L290 TraceCheckUtils]: 156: Hoare triple {44241#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,281 INFO L290 TraceCheckUtils]: 157: Hoare triple {44241#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,281 INFO L290 TraceCheckUtils]: 158: Hoare triple {44241#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,281 INFO L290 TraceCheckUtils]: 159: Hoare triple {44241#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,281 INFO L290 TraceCheckUtils]: 160: Hoare triple {44241#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,282 INFO L290 TraceCheckUtils]: 161: Hoare triple {44241#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,282 INFO L290 TraceCheckUtils]: 162: Hoare triple {44241#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {44241#false} is VALID [2022-04-28 08:35:57,282 INFO L290 TraceCheckUtils]: 163: Hoare triple {44241#false} assume 4432 == #t~mem62;havoc #t~mem62; {44241#false} is VALID [2022-04-28 08:35:57,282 INFO L290 TraceCheckUtils]: 164: Hoare triple {44241#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {44241#false} is VALID [2022-04-28 08:35:57,282 INFO L290 TraceCheckUtils]: 165: Hoare triple {44241#false} assume 5 == ~blastFlag~0; {44241#false} is VALID [2022-04-28 08:35:57,282 INFO L290 TraceCheckUtils]: 166: Hoare triple {44241#false} assume !false; {44241#false} is VALID [2022-04-28 08:35:57,283 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-28 08:35:57,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:35:57,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143941684] [2022-04-28 08:35:57,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143941684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:35:57,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:35:57,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:35:57,283 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:35:57,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [705167869] [2022-04-28 08:35:57,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [705167869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:35:57,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:35:57,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:35:57,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131374867] [2022-04-28 08:35:57,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:35:57,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 167 [2022-04-28 08:35:57,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:35:57,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:57,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:35:57,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:35:57,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:35:57,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:35:57,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:35:57,374 INFO L87 Difference]: Start difference. First operand 812 states and 1181 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:59,396 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:36:00,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:00,612 INFO L93 Difference]: Finished difference Result 1997 states and 2921 transitions. [2022-04-28 08:36:00,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:36:00,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 167 [2022-04-28 08:36:00,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:36:00,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-28 08:36:00,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:00,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-28 08:36:00,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-28 08:36:00,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:36:01,004 INFO L225 Difference]: With dead ends: 1997 [2022-04-28 08:36:01,004 INFO L226 Difference]: Without dead ends: 1201 [2022-04-28 08:36:01,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:36:01,006 INFO L413 NwaCegarLoop]: 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-28 08:36:01,006 INFO L414 NwaCegarLoop]: 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-28 08:36:01,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2022-04-28 08:36:01,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 817. [2022-04-28 08:36:01,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:36:01,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1201 states. Second operand has 817 states, 812 states have (on average 1.4445812807881773) internal successors, (1173), 812 states have internal predecessors, (1173), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:01,057 INFO L74 IsIncluded]: Start isIncluded. First operand 1201 states. Second operand has 817 states, 812 states have (on average 1.4445812807881773) internal successors, (1173), 812 states have internal predecessors, (1173), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:01,058 INFO L87 Difference]: Start difference. First operand 1201 states. Second operand has 817 states, 812 states have (on average 1.4445812807881773) internal successors, (1173), 812 states have internal predecessors, (1173), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:01,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:01,103 INFO L93 Difference]: Finished difference Result 1201 states and 1746 transitions. [2022-04-28 08:36:01,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1746 transitions. [2022-04-28 08:36:01,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:01,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:01,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 817 states, 812 states have (on average 1.4445812807881773) internal successors, (1173), 812 states have internal predecessors, (1173), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1201 states. [2022-04-28 08:36:01,106 INFO L87 Difference]: Start difference. First operand has 817 states, 812 states have (on average 1.4445812807881773) internal successors, (1173), 812 states have internal predecessors, (1173), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1201 states. [2022-04-28 08:36:01,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:01,147 INFO L93 Difference]: Finished difference Result 1201 states and 1746 transitions. [2022-04-28 08:36:01,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1746 transitions. [2022-04-28 08:36:01,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:01,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:01,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:36:01,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:36:01,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 812 states have (on average 1.4445812807881773) internal successors, (1173), 812 states have internal predecessors, (1173), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:01,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1177 transitions. [2022-04-28 08:36:01,195 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1177 transitions. Word has length 167 [2022-04-28 08:36:01,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:36:01,195 INFO L495 AbstractCegarLoop]: Abstraction has 817 states and 1177 transitions. [2022-04-28 08:36:01,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:01,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 817 states and 1177 transitions. [2022-04-28 08:36:02,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1177 edges. 1177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:36:02,268 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1177 transitions. [2022-04-28 08:36:02,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-04-28 08:36:02,270 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:36:02,270 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:36:02,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 08:36:02,270 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:36:02,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:36:02,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1030373157, now seen corresponding path program 1 times [2022-04-28 08:36:02,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:02,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2028541315] [2022-04-28 08:36:17,976 WARN L232 SmtUtils]: Spent 8.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-28 08:36:26,486 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:36:26,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1030373157, now seen corresponding path program 2 times [2022-04-28 08:36:26,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:36:26,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162522110] [2022-04-28 08:36:26,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:36:26,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:36:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:26,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:36:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:26,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#(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); {52282#true} is VALID [2022-04-28 08:36:26,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {52282#true} assume true; {52282#true} is VALID [2022-04-28 08:36:26,689 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52282#true} {52282#true} #593#return; {52282#true} is VALID [2022-04-28 08:36:26,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {52282#true} call ULTIMATE.init(); {52289#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:36:26,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#(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); {52282#true} is VALID [2022-04-28 08:36:26,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {52282#true} assume true; {52282#true} is VALID [2022-04-28 08:36:26,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52282#true} {52282#true} #593#return; {52282#true} is VALID [2022-04-28 08:36:26,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {52282#true} call #t~ret158 := main(); {52282#true} is VALID [2022-04-28 08:36:26,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {52282#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; {52282#true} is VALID [2022-04-28 08:36:26,690 INFO L272 TraceCheckUtils]: 6: Hoare triple {52282#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {52282#true} is VALID [2022-04-28 08:36:26,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {52282#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); {52282#true} is VALID [2022-04-28 08:36:26,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {52282#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; {52282#true} is VALID [2022-04-28 08:36:26,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {52282#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; {52282#true} is VALID [2022-04-28 08:36:26,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {52282#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {52282#true} is VALID [2022-04-28 08:36:26,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {52282#true} assume !false; {52282#true} is VALID [2022-04-28 08:36:26,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {52282#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {52282#true} assume 12292 == #t~mem49;havoc #t~mem49; {52282#true} is VALID [2022-04-28 08:36:26,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {52282#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; {52282#true} is VALID [2022-04-28 08:36:26,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {52282#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {52282#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {52282#true} is VALID [2022-04-28 08:36:26,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {52282#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {52282#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); {52282#true} is VALID [2022-04-28 08:36:26,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {52282#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {52282#true} is VALID [2022-04-28 08:36:26,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {52282#true} assume !(0 == ~tmp___4~0); {52282#true} is VALID [2022-04-28 08:36:26,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {52282#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); {52282#true} is VALID [2022-04-28 08:36:26,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {52282#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); {52282#true} is VALID [2022-04-28 08:36:26,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {52282#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52282#true} is VALID [2022-04-28 08:36:26,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {52282#true} ~skip~0 := 0; {52282#true} is VALID [2022-04-28 08:36:26,693 INFO L290 TraceCheckUtils]: 25: Hoare triple {52282#true} assume !false; {52282#true} is VALID [2022-04-28 08:36:26,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {52282#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,707 INFO L290 TraceCheckUtils]: 27: Hoare triple {52282#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,707 INFO L290 TraceCheckUtils]: 28: Hoare triple {52282#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,707 INFO L290 TraceCheckUtils]: 29: Hoare triple {52282#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,707 INFO L290 TraceCheckUtils]: 30: Hoare triple {52282#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,707 INFO L290 TraceCheckUtils]: 31: Hoare triple {52282#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,708 INFO L290 TraceCheckUtils]: 32: Hoare triple {52282#true} assume 4368 == #t~mem54;havoc #t~mem54; {52282#true} is VALID [2022-04-28 08:36:26,708 INFO L290 TraceCheckUtils]: 33: Hoare triple {52282#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; {52282#true} is VALID [2022-04-28 08:36:26,708 INFO L290 TraceCheckUtils]: 34: Hoare triple {52282#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {52282#true} is VALID [2022-04-28 08:36:26,708 INFO L290 TraceCheckUtils]: 35: Hoare triple {52282#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); {52282#true} is VALID [2022-04-28 08:36:26,708 INFO L290 TraceCheckUtils]: 36: Hoare triple {52282#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; {52282#true} is VALID [2022-04-28 08:36:26,708 INFO L290 TraceCheckUtils]: 37: Hoare triple {52282#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); {52282#true} is VALID [2022-04-28 08:36:26,708 INFO L290 TraceCheckUtils]: 38: Hoare triple {52282#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52282#true} is VALID [2022-04-28 08:36:26,708 INFO L290 TraceCheckUtils]: 39: Hoare triple {52282#true} ~skip~0 := 0; {52282#true} is VALID [2022-04-28 08:36:26,708 INFO L290 TraceCheckUtils]: 40: Hoare triple {52282#true} assume !false; {52282#true} is VALID [2022-04-28 08:36:26,708 INFO L290 TraceCheckUtils]: 41: Hoare triple {52282#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,708 INFO L290 TraceCheckUtils]: 42: Hoare triple {52282#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,708 INFO L290 TraceCheckUtils]: 43: Hoare triple {52282#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,708 INFO L290 TraceCheckUtils]: 44: Hoare triple {52282#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,708 INFO L290 TraceCheckUtils]: 45: Hoare triple {52282#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,709 INFO L290 TraceCheckUtils]: 46: Hoare triple {52282#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,709 INFO L290 TraceCheckUtils]: 47: Hoare triple {52282#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,709 INFO L290 TraceCheckUtils]: 48: Hoare triple {52282#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,709 INFO L290 TraceCheckUtils]: 49: Hoare triple {52282#true} assume 4384 == #t~mem56;havoc #t~mem56; {52282#true} is VALID [2022-04-28 08:36:26,709 INFO L290 TraceCheckUtils]: 50: Hoare triple {52282#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {52282#true} is VALID [2022-04-28 08:36:26,709 INFO L290 TraceCheckUtils]: 51: Hoare triple {52282#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {52282#true} is VALID [2022-04-28 08:36:26,709 INFO L290 TraceCheckUtils]: 52: Hoare triple {52282#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,709 INFO L290 TraceCheckUtils]: 53: Hoare triple {52282#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,709 INFO L290 TraceCheckUtils]: 54: Hoare triple {52282#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,709 INFO L290 TraceCheckUtils]: 55: Hoare triple {52282#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); {52282#true} is VALID [2022-04-28 08:36:26,709 INFO L290 TraceCheckUtils]: 56: Hoare triple {52282#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52282#true} is VALID [2022-04-28 08:36:26,709 INFO L290 TraceCheckUtils]: 57: Hoare triple {52282#true} ~skip~0 := 0; {52282#true} is VALID [2022-04-28 08:36:26,709 INFO L290 TraceCheckUtils]: 58: Hoare triple {52282#true} assume !false; {52282#true} is VALID [2022-04-28 08:36:26,709 INFO L290 TraceCheckUtils]: 59: Hoare triple {52282#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,710 INFO L290 TraceCheckUtils]: 60: Hoare triple {52282#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,710 INFO L290 TraceCheckUtils]: 61: Hoare triple {52282#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,710 INFO L290 TraceCheckUtils]: 62: Hoare triple {52282#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,710 INFO L290 TraceCheckUtils]: 63: Hoare triple {52282#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,710 INFO L290 TraceCheckUtils]: 64: Hoare triple {52282#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,710 INFO L290 TraceCheckUtils]: 65: Hoare triple {52282#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,710 INFO L290 TraceCheckUtils]: 66: Hoare triple {52282#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,710 INFO L290 TraceCheckUtils]: 67: Hoare triple {52282#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,710 INFO L290 TraceCheckUtils]: 68: Hoare triple {52282#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,710 INFO L290 TraceCheckUtils]: 69: Hoare triple {52282#true} assume 4400 == #t~mem58;havoc #t~mem58; {52282#true} is VALID [2022-04-28 08:36:26,710 INFO L290 TraceCheckUtils]: 70: Hoare triple {52282#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); {52282#true} is VALID [2022-04-28 08:36:26,710 INFO L290 TraceCheckUtils]: 71: Hoare triple {52282#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; {52282#true} is VALID [2022-04-28 08:36:26,710 INFO L290 TraceCheckUtils]: 72: Hoare triple {52282#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {52282#true} is VALID [2022-04-28 08:36:26,710 INFO L290 TraceCheckUtils]: 73: Hoare triple {52282#true} assume !(~ret~0 <= 0); {52282#true} is VALID [2022-04-28 08:36:26,711 INFO L290 TraceCheckUtils]: 74: Hoare triple {52282#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,711 INFO L290 TraceCheckUtils]: 75: Hoare triple {52282#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); {52282#true} is VALID [2022-04-28 08:36:26,711 INFO L290 TraceCheckUtils]: 76: Hoare triple {52282#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52282#true} is VALID [2022-04-28 08:36:26,711 INFO L290 TraceCheckUtils]: 77: Hoare triple {52282#true} ~skip~0 := 0; {52282#true} is VALID [2022-04-28 08:36:26,711 INFO L290 TraceCheckUtils]: 78: Hoare triple {52282#true} assume !false; {52282#true} is VALID [2022-04-28 08:36:26,711 INFO L290 TraceCheckUtils]: 79: Hoare triple {52282#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,711 INFO L290 TraceCheckUtils]: 80: Hoare triple {52282#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,711 INFO L290 TraceCheckUtils]: 81: Hoare triple {52282#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,711 INFO L290 TraceCheckUtils]: 82: Hoare triple {52282#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,711 INFO L290 TraceCheckUtils]: 83: Hoare triple {52282#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,711 INFO L290 TraceCheckUtils]: 84: Hoare triple {52282#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,712 INFO L290 TraceCheckUtils]: 85: Hoare triple {52282#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,712 INFO L290 TraceCheckUtils]: 86: Hoare triple {52282#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,712 INFO L290 TraceCheckUtils]: 87: Hoare triple {52282#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,712 INFO L290 TraceCheckUtils]: 88: Hoare triple {52282#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,712 INFO L290 TraceCheckUtils]: 89: Hoare triple {52282#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,712 INFO L290 TraceCheckUtils]: 90: Hoare triple {52282#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {52282#true} is VALID [2022-04-28 08:36:26,712 INFO L290 TraceCheckUtils]: 91: Hoare triple {52282#true} assume 4416 == #t~mem60;havoc #t~mem60; {52282#true} is VALID [2022-04-28 08:36:26,712 INFO L290 TraceCheckUtils]: 92: Hoare triple {52282#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {52282#true} is VALID [2022-04-28 08:36:26,712 INFO L290 TraceCheckUtils]: 93: Hoare triple {52282#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {52282#true} is VALID [2022-04-28 08:36:26,713 INFO L290 TraceCheckUtils]: 94: Hoare triple {52282#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); {52287#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:36:26,714 INFO L290 TraceCheckUtils]: 95: Hoare triple {52287#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {52287#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:36:26,714 INFO L290 TraceCheckUtils]: 96: Hoare triple {52287#(= 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); {52287#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:36:26,714 INFO L290 TraceCheckUtils]: 97: Hoare triple {52287#(= 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; {52287#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:36:26,715 INFO L290 TraceCheckUtils]: 98: Hoare triple {52287#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {52287#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:36:26,715 INFO L290 TraceCheckUtils]: 99: Hoare triple {52287#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {52287#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:36:26,715 INFO L290 TraceCheckUtils]: 100: Hoare triple {52287#(= 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); {52287#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:36:26,716 INFO L290 TraceCheckUtils]: 101: Hoare triple {52287#(= 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); {52287#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:36:26,716 INFO L290 TraceCheckUtils]: 102: Hoare triple {52287#(= 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); {52287#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:36:26,717 INFO L290 TraceCheckUtils]: 103: Hoare triple {52287#(= 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); {52288#(= |ssl3_connect_#t~mem52| 4432)} is VALID [2022-04-28 08:36:26,717 INFO L290 TraceCheckUtils]: 104: Hoare triple {52288#(= |ssl3_connect_#t~mem52| 4432)} assume 20480 == #t~mem52;havoc #t~mem52; {52283#false} is VALID [2022-04-28 08:36:26,717 INFO L290 TraceCheckUtils]: 105: Hoare triple {52283#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,717 INFO L290 TraceCheckUtils]: 106: Hoare triple {52283#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {52283#false} is VALID [2022-04-28 08:36:26,717 INFO L290 TraceCheckUtils]: 107: Hoare triple {52283#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,717 INFO L290 TraceCheckUtils]: 108: Hoare triple {52283#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); {52283#false} is VALID [2022-04-28 08:36:26,718 INFO L290 TraceCheckUtils]: 109: Hoare triple {52283#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {52283#false} is VALID [2022-04-28 08:36:26,718 INFO L290 TraceCheckUtils]: 110: Hoare triple {52283#false} assume !(0 == ~tmp___4~0); {52283#false} is VALID [2022-04-28 08:36:26,718 INFO L290 TraceCheckUtils]: 111: Hoare triple {52283#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); {52283#false} is VALID [2022-04-28 08:36:26,718 INFO L290 TraceCheckUtils]: 112: Hoare triple {52283#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); {52283#false} is VALID [2022-04-28 08:36:26,718 INFO L290 TraceCheckUtils]: 113: Hoare triple {52283#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52283#false} is VALID [2022-04-28 08:36:26,718 INFO L290 TraceCheckUtils]: 114: Hoare triple {52283#false} ~skip~0 := 0; {52283#false} is VALID [2022-04-28 08:36:26,718 INFO L290 TraceCheckUtils]: 115: Hoare triple {52283#false} assume !false; {52283#false} is VALID [2022-04-28 08:36:26,718 INFO L290 TraceCheckUtils]: 116: Hoare triple {52283#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); {52283#false} is VALID [2022-04-28 08:36:26,718 INFO L290 TraceCheckUtils]: 117: Hoare triple {52283#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,718 INFO L290 TraceCheckUtils]: 118: Hoare triple {52283#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,719 INFO L290 TraceCheckUtils]: 119: Hoare triple {52283#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,719 INFO L290 TraceCheckUtils]: 120: Hoare triple {52283#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,719 INFO L290 TraceCheckUtils]: 121: Hoare triple {52283#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,719 INFO L290 TraceCheckUtils]: 122: Hoare triple {52283#false} assume 4368 == #t~mem54;havoc #t~mem54; {52283#false} is VALID [2022-04-28 08:36:26,719 INFO L290 TraceCheckUtils]: 123: Hoare triple {52283#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; {52283#false} is VALID [2022-04-28 08:36:26,719 INFO L290 TraceCheckUtils]: 124: Hoare triple {52283#false} assume !(0 == ~blastFlag~0); {52283#false} is VALID [2022-04-28 08:36:26,719 INFO L290 TraceCheckUtils]: 125: Hoare triple {52283#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {52283#false} is VALID [2022-04-28 08:36:26,719 INFO L290 TraceCheckUtils]: 126: Hoare triple {52283#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); {52283#false} is VALID [2022-04-28 08:36:26,719 INFO L290 TraceCheckUtils]: 127: Hoare triple {52283#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; {52283#false} is VALID [2022-04-28 08:36:26,719 INFO L290 TraceCheckUtils]: 128: Hoare triple {52283#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); {52283#false} is VALID [2022-04-28 08:36:26,720 INFO L290 TraceCheckUtils]: 129: Hoare triple {52283#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52283#false} is VALID [2022-04-28 08:36:26,720 INFO L290 TraceCheckUtils]: 130: Hoare triple {52283#false} ~skip~0 := 0; {52283#false} is VALID [2022-04-28 08:36:26,720 INFO L290 TraceCheckUtils]: 131: Hoare triple {52283#false} assume !false; {52283#false} is VALID [2022-04-28 08:36:26,720 INFO L290 TraceCheckUtils]: 132: Hoare triple {52283#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); {52283#false} is VALID [2022-04-28 08:36:26,720 INFO L290 TraceCheckUtils]: 133: Hoare triple {52283#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,722 INFO L290 TraceCheckUtils]: 134: Hoare triple {52283#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,722 INFO L290 TraceCheckUtils]: 135: Hoare triple {52283#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,722 INFO L290 TraceCheckUtils]: 136: Hoare triple {52283#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,722 INFO L290 TraceCheckUtils]: 137: Hoare triple {52283#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,723 INFO L290 TraceCheckUtils]: 138: Hoare triple {52283#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,723 INFO L290 TraceCheckUtils]: 139: Hoare triple {52283#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,723 INFO L290 TraceCheckUtils]: 140: Hoare triple {52283#false} assume 4384 == #t~mem56;havoc #t~mem56; {52283#false} is VALID [2022-04-28 08:36:26,723 INFO L290 TraceCheckUtils]: 141: Hoare triple {52283#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {52283#false} is VALID [2022-04-28 08:36:26,723 INFO L290 TraceCheckUtils]: 142: Hoare triple {52283#false} assume !(1 == ~blastFlag~0); {52283#false} is VALID [2022-04-28 08:36:26,723 INFO L290 TraceCheckUtils]: 143: Hoare triple {52283#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,723 INFO L290 TraceCheckUtils]: 144: Hoare triple {52283#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,723 INFO L290 TraceCheckUtils]: 145: Hoare triple {52283#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,724 INFO L290 TraceCheckUtils]: 146: Hoare triple {52283#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); {52283#false} is VALID [2022-04-28 08:36:26,724 INFO L290 TraceCheckUtils]: 147: Hoare triple {52283#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52283#false} is VALID [2022-04-28 08:36:26,724 INFO L290 TraceCheckUtils]: 148: Hoare triple {52283#false} ~skip~0 := 0; {52283#false} is VALID [2022-04-28 08:36:26,724 INFO L290 TraceCheckUtils]: 149: Hoare triple {52283#false} assume !false; {52283#false} is VALID [2022-04-28 08:36:26,724 INFO L290 TraceCheckUtils]: 150: Hoare triple {52283#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); {52283#false} is VALID [2022-04-28 08:36:26,724 INFO L290 TraceCheckUtils]: 151: Hoare triple {52283#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,725 INFO L290 TraceCheckUtils]: 152: Hoare triple {52283#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,725 INFO L290 TraceCheckUtils]: 153: Hoare triple {52283#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,725 INFO L290 TraceCheckUtils]: 154: Hoare triple {52283#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,725 INFO L290 TraceCheckUtils]: 155: Hoare triple {52283#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,725 INFO L290 TraceCheckUtils]: 156: Hoare triple {52283#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,725 INFO L290 TraceCheckUtils]: 157: Hoare triple {52283#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,725 INFO L290 TraceCheckUtils]: 158: Hoare triple {52283#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,725 INFO L290 TraceCheckUtils]: 159: Hoare triple {52283#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,725 INFO L290 TraceCheckUtils]: 160: Hoare triple {52283#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,726 INFO L290 TraceCheckUtils]: 161: Hoare triple {52283#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,726 INFO L290 TraceCheckUtils]: 162: Hoare triple {52283#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,726 INFO L290 TraceCheckUtils]: 163: Hoare triple {52283#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {52283#false} is VALID [2022-04-28 08:36:26,726 INFO L290 TraceCheckUtils]: 164: Hoare triple {52283#false} assume 4432 == #t~mem62;havoc #t~mem62; {52283#false} is VALID [2022-04-28 08:36:26,726 INFO L290 TraceCheckUtils]: 165: Hoare triple {52283#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {52283#false} is VALID [2022-04-28 08:36:26,726 INFO L290 TraceCheckUtils]: 166: Hoare triple {52283#false} assume 5 == ~blastFlag~0; {52283#false} is VALID [2022-04-28 08:36:26,726 INFO L290 TraceCheckUtils]: 167: Hoare triple {52283#false} assume !false; {52283#false} is VALID [2022-04-28 08:36:26,727 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-28 08:36:26,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:36:26,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162522110] [2022-04-28 08:36:26,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162522110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:36:26,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:36:26,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:36:26,727 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:36:26,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2028541315] [2022-04-28 08:36:26,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2028541315] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:36:26,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:36:26,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:36:26,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451822740] [2022-04-28 08:36:26,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:36:26,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 168 [2022-04-28 08:36:26,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:36:26,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:26,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:36:26,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:36:26,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:26,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:36:26,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:36:26,814 INFO L87 Difference]: Start difference. First operand 817 states and 1177 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:28,837 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:36:30,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:30,272 INFO L93 Difference]: Finished difference Result 1897 states and 2744 transitions. [2022-04-28 08:36:30,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:36:30,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 168 [2022-04-28 08:36:30,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:36:30,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:30,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-28 08:36:30,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:30,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-28 08:36:30,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 463 transitions. [2022-04-28 08:36:30,591 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-28 08:36:30,646 INFO L225 Difference]: With dead ends: 1897 [2022-04-28 08:36:30,647 INFO L226 Difference]: Without dead ends: 1096 [2022-04-28 08:36:30,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:36:30,648 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 98 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 08:36:30,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 563 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 530 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 08:36:30,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2022-04-28 08:36:30,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 817. [2022-04-28 08:36:30,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:36:30,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1096 states. Second operand has 817 states, 812 states have (on average 1.4396551724137931) internal successors, (1169), 812 states have internal predecessors, (1169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:30,700 INFO L74 IsIncluded]: Start isIncluded. First operand 1096 states. Second operand has 817 states, 812 states have (on average 1.4396551724137931) internal successors, (1169), 812 states have internal predecessors, (1169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:30,700 INFO L87 Difference]: Start difference. First operand 1096 states. Second operand has 817 states, 812 states have (on average 1.4396551724137931) internal successors, (1169), 812 states have internal predecessors, (1169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:30,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:30,749 INFO L93 Difference]: Finished difference Result 1096 states and 1583 transitions. [2022-04-28 08:36:30,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1583 transitions. [2022-04-28 08:36:30,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:30,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:30,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 817 states, 812 states have (on average 1.4396551724137931) internal successors, (1169), 812 states have internal predecessors, (1169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1096 states. [2022-04-28 08:36:30,752 INFO L87 Difference]: Start difference. First operand has 817 states, 812 states have (on average 1.4396551724137931) internal successors, (1169), 812 states have internal predecessors, (1169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1096 states. [2022-04-28 08:36:30,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:30,803 INFO L93 Difference]: Finished difference Result 1096 states and 1583 transitions. [2022-04-28 08:36:30,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1583 transitions. [2022-04-28 08:36:30,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:30,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:30,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:36:30,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:36:30,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 812 states have (on average 1.4396551724137931) internal successors, (1169), 812 states have internal predecessors, (1169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:30,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1173 transitions. [2022-04-28 08:36:30,849 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1173 transitions. Word has length 168 [2022-04-28 08:36:30,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:36:30,850 INFO L495 AbstractCegarLoop]: Abstraction has 817 states and 1173 transitions. [2022-04-28 08:36:30,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:30,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 817 states and 1173 transitions. [2022-04-28 08:36:31,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1173 edges. 1173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:36:31,910 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1173 transitions. [2022-04-28 08:36:31,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-04-28 08:36:31,911 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:36:31,911 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:36:31,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 08:36:31,911 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:36:31,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:36:31,912 INFO L85 PathProgramCache]: Analyzing trace with hash -223230462, now seen corresponding path program 1 times [2022-04-28 08:36:31,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:31,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1130305008] [2022-04-28 08:36:48,052 WARN L232 SmtUtils]: Spent 9.35s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:36:55,715 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:36:55,715 INFO L85 PathProgramCache]: Analyzing trace with hash -223230462, now seen corresponding path program 2 times [2022-04-28 08:36:55,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:36:55,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288351874] [2022-04-28 08:36:55,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:36:55,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:36:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:55,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:36:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:55,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {59921#(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); {59914#true} is VALID [2022-04-28 08:36:55,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {59914#true} assume true; {59914#true} is VALID [2022-04-28 08:36:55,920 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59914#true} {59914#true} #593#return; {59914#true} is VALID [2022-04-28 08:36:55,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {59914#true} call ULTIMATE.init(); {59921#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:36:55,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {59921#(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); {59914#true} is VALID [2022-04-28 08:36:55,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {59914#true} assume true; {59914#true} is VALID [2022-04-28 08:36:55,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59914#true} {59914#true} #593#return; {59914#true} is VALID [2022-04-28 08:36:55,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {59914#true} call #t~ret158 := main(); {59914#true} is VALID [2022-04-28 08:36:55,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {59914#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; {59914#true} is VALID [2022-04-28 08:36:55,921 INFO L272 TraceCheckUtils]: 6: Hoare triple {59914#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {59914#true} is VALID [2022-04-28 08:36:55,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {59914#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); {59914#true} is VALID [2022-04-28 08:36:55,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {59914#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; {59914#true} is VALID [2022-04-28 08:36:55,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {59914#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; {59914#true} is VALID [2022-04-28 08:36:55,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {59914#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {59914#true} is VALID [2022-04-28 08:36:55,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {59914#true} assume !false; {59914#true} is VALID [2022-04-28 08:36:55,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {59914#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {59914#true} assume 12292 == #t~mem49;havoc #t~mem49; {59914#true} is VALID [2022-04-28 08:36:55,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {59914#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; {59914#true} is VALID [2022-04-28 08:36:55,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {59914#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {59914#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {59914#true} is VALID [2022-04-28 08:36:55,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {59914#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {59914#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); {59914#true} is VALID [2022-04-28 08:36:55,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {59914#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {59914#true} is VALID [2022-04-28 08:36:55,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {59914#true} assume !(0 == ~tmp___4~0); {59914#true} is VALID [2022-04-28 08:36:55,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {59914#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); {59914#true} is VALID [2022-04-28 08:36:55,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {59914#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); {59914#true} is VALID [2022-04-28 08:36:55,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {59914#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {59914#true} is VALID [2022-04-28 08:36:55,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {59914#true} ~skip~0 := 0; {59914#true} is VALID [2022-04-28 08:36:55,923 INFO L290 TraceCheckUtils]: 25: Hoare triple {59914#true} assume !false; {59914#true} is VALID [2022-04-28 08:36:55,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {59914#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,924 INFO L290 TraceCheckUtils]: 27: Hoare triple {59914#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,924 INFO L290 TraceCheckUtils]: 28: Hoare triple {59914#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,924 INFO L290 TraceCheckUtils]: 29: Hoare triple {59914#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,924 INFO L290 TraceCheckUtils]: 30: Hoare triple {59914#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,924 INFO L290 TraceCheckUtils]: 31: Hoare triple {59914#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,924 INFO L290 TraceCheckUtils]: 32: Hoare triple {59914#true} assume 4368 == #t~mem54;havoc #t~mem54; {59914#true} is VALID [2022-04-28 08:36:55,924 INFO L290 TraceCheckUtils]: 33: Hoare triple {59914#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; {59914#true} is VALID [2022-04-28 08:36:55,924 INFO L290 TraceCheckUtils]: 34: Hoare triple {59914#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {59914#true} is VALID [2022-04-28 08:36:55,924 INFO L290 TraceCheckUtils]: 35: Hoare triple {59914#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); {59914#true} is VALID [2022-04-28 08:36:55,924 INFO L290 TraceCheckUtils]: 36: Hoare triple {59914#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; {59914#true} is VALID [2022-04-28 08:36:55,924 INFO L290 TraceCheckUtils]: 37: Hoare triple {59914#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); {59914#true} is VALID [2022-04-28 08:36:55,925 INFO L290 TraceCheckUtils]: 38: Hoare triple {59914#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {59914#true} is VALID [2022-04-28 08:36:55,925 INFO L290 TraceCheckUtils]: 39: Hoare triple {59914#true} ~skip~0 := 0; {59914#true} is VALID [2022-04-28 08:36:55,925 INFO L290 TraceCheckUtils]: 40: Hoare triple {59914#true} assume !false; {59914#true} is VALID [2022-04-28 08:36:55,925 INFO L290 TraceCheckUtils]: 41: Hoare triple {59914#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,925 INFO L290 TraceCheckUtils]: 42: Hoare triple {59914#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,925 INFO L290 TraceCheckUtils]: 43: Hoare triple {59914#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,925 INFO L290 TraceCheckUtils]: 44: Hoare triple {59914#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,925 INFO L290 TraceCheckUtils]: 45: Hoare triple {59914#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,925 INFO L290 TraceCheckUtils]: 46: Hoare triple {59914#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,925 INFO L290 TraceCheckUtils]: 47: Hoare triple {59914#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,926 INFO L290 TraceCheckUtils]: 48: Hoare triple {59914#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,926 INFO L290 TraceCheckUtils]: 49: Hoare triple {59914#true} assume 4384 == #t~mem56;havoc #t~mem56; {59914#true} is VALID [2022-04-28 08:36:55,926 INFO L290 TraceCheckUtils]: 50: Hoare triple {59914#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {59914#true} is VALID [2022-04-28 08:36:55,926 INFO L290 TraceCheckUtils]: 51: Hoare triple {59914#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {59914#true} is VALID [2022-04-28 08:36:55,926 INFO L290 TraceCheckUtils]: 52: Hoare triple {59914#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,926 INFO L290 TraceCheckUtils]: 53: Hoare triple {59914#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,926 INFO L290 TraceCheckUtils]: 54: Hoare triple {59914#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,926 INFO L290 TraceCheckUtils]: 55: Hoare triple {59914#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); {59914#true} is VALID [2022-04-28 08:36:55,926 INFO L290 TraceCheckUtils]: 56: Hoare triple {59914#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {59914#true} is VALID [2022-04-28 08:36:55,926 INFO L290 TraceCheckUtils]: 57: Hoare triple {59914#true} ~skip~0 := 0; {59914#true} is VALID [2022-04-28 08:36:55,927 INFO L290 TraceCheckUtils]: 58: Hoare triple {59914#true} assume !false; {59914#true} is VALID [2022-04-28 08:36:55,927 INFO L290 TraceCheckUtils]: 59: Hoare triple {59914#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,927 INFO L290 TraceCheckUtils]: 60: Hoare triple {59914#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,927 INFO L290 TraceCheckUtils]: 61: Hoare triple {59914#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,927 INFO L290 TraceCheckUtils]: 62: Hoare triple {59914#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,927 INFO L290 TraceCheckUtils]: 63: Hoare triple {59914#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,927 INFO L290 TraceCheckUtils]: 64: Hoare triple {59914#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,927 INFO L290 TraceCheckUtils]: 65: Hoare triple {59914#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,927 INFO L290 TraceCheckUtils]: 66: Hoare triple {59914#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,927 INFO L290 TraceCheckUtils]: 67: Hoare triple {59914#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,928 INFO L290 TraceCheckUtils]: 68: Hoare triple {59914#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,928 INFO L290 TraceCheckUtils]: 69: Hoare triple {59914#true} assume 4400 == #t~mem58;havoc #t~mem58; {59914#true} is VALID [2022-04-28 08:36:55,928 INFO L290 TraceCheckUtils]: 70: Hoare triple {59914#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); {59914#true} is VALID [2022-04-28 08:36:55,928 INFO L290 TraceCheckUtils]: 71: Hoare triple {59914#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; {59914#true} is VALID [2022-04-28 08:36:55,928 INFO L290 TraceCheckUtils]: 72: Hoare triple {59914#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {59914#true} is VALID [2022-04-28 08:36:55,928 INFO L290 TraceCheckUtils]: 73: Hoare triple {59914#true} assume !(~ret~0 <= 0); {59914#true} is VALID [2022-04-28 08:36:55,928 INFO L290 TraceCheckUtils]: 74: Hoare triple {59914#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,928 INFO L290 TraceCheckUtils]: 75: Hoare triple {59914#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); {59914#true} is VALID [2022-04-28 08:36:55,928 INFO L290 TraceCheckUtils]: 76: Hoare triple {59914#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {59914#true} is VALID [2022-04-28 08:36:55,928 INFO L290 TraceCheckUtils]: 77: Hoare triple {59914#true} ~skip~0 := 0; {59914#true} is VALID [2022-04-28 08:36:55,929 INFO L290 TraceCheckUtils]: 78: Hoare triple {59914#true} assume !false; {59914#true} is VALID [2022-04-28 08:36:55,929 INFO L290 TraceCheckUtils]: 79: Hoare triple {59914#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,929 INFO L290 TraceCheckUtils]: 80: Hoare triple {59914#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,929 INFO L290 TraceCheckUtils]: 81: Hoare triple {59914#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,929 INFO L290 TraceCheckUtils]: 82: Hoare triple {59914#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,929 INFO L290 TraceCheckUtils]: 83: Hoare triple {59914#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,929 INFO L290 TraceCheckUtils]: 84: Hoare triple {59914#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,929 INFO L290 TraceCheckUtils]: 85: Hoare triple {59914#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,929 INFO L290 TraceCheckUtils]: 86: Hoare triple {59914#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,929 INFO L290 TraceCheckUtils]: 87: Hoare triple {59914#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,930 INFO L290 TraceCheckUtils]: 88: Hoare triple {59914#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,930 INFO L290 TraceCheckUtils]: 89: Hoare triple {59914#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,930 INFO L290 TraceCheckUtils]: 90: Hoare triple {59914#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {59914#true} is VALID [2022-04-28 08:36:55,930 INFO L290 TraceCheckUtils]: 91: Hoare triple {59914#true} assume 4416 == #t~mem60;havoc #t~mem60; {59914#true} is VALID [2022-04-28 08:36:55,930 INFO L290 TraceCheckUtils]: 92: Hoare triple {59914#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {59914#true} is VALID [2022-04-28 08:36:55,930 INFO L290 TraceCheckUtils]: 93: Hoare triple {59914#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {59914#true} is VALID [2022-04-28 08:36:55,931 INFO L290 TraceCheckUtils]: 94: Hoare triple {59914#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); {59919#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:36:55,931 INFO L290 TraceCheckUtils]: 95: Hoare triple {59919#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {59919#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:36:55,932 INFO L290 TraceCheckUtils]: 96: Hoare triple {59919#(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); {59919#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:36:55,932 INFO L290 TraceCheckUtils]: 97: Hoare triple {59919#(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; {59919#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:36:55,932 INFO L290 TraceCheckUtils]: 98: Hoare triple {59919#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {59919#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:36:55,933 INFO L290 TraceCheckUtils]: 99: Hoare triple {59919#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {59919#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:36:55,933 INFO L290 TraceCheckUtils]: 100: Hoare triple {59919#(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); {59919#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:36:55,933 INFO L290 TraceCheckUtils]: 101: Hoare triple {59919#(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); {59919#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:36:55,934 INFO L290 TraceCheckUtils]: 102: Hoare triple {59919#(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); {59919#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:36:55,934 INFO L290 TraceCheckUtils]: 103: Hoare triple {59919#(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); {59919#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:36:55,934 INFO L290 TraceCheckUtils]: 104: Hoare triple {59919#(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); {59920#(not (= |ssl3_connect_#t~mem53| 4099))} is VALID [2022-04-28 08:36:55,935 INFO L290 TraceCheckUtils]: 105: Hoare triple {59920#(not (= |ssl3_connect_#t~mem53| 4099))} assume 4099 == #t~mem53;havoc #t~mem53; {59915#false} is VALID [2022-04-28 08:36:55,935 INFO L290 TraceCheckUtils]: 106: Hoare triple {59915#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,935 INFO L290 TraceCheckUtils]: 107: Hoare triple {59915#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {59915#false} is VALID [2022-04-28 08:36:55,935 INFO L290 TraceCheckUtils]: 108: Hoare triple {59915#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,935 INFO L290 TraceCheckUtils]: 109: Hoare triple {59915#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); {59915#false} is VALID [2022-04-28 08:36:55,935 INFO L290 TraceCheckUtils]: 110: Hoare triple {59915#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {59915#false} is VALID [2022-04-28 08:36:55,935 INFO L290 TraceCheckUtils]: 111: Hoare triple {59915#false} assume !(0 == ~tmp___4~0); {59915#false} is VALID [2022-04-28 08:36:55,935 INFO L290 TraceCheckUtils]: 112: Hoare triple {59915#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); {59915#false} is VALID [2022-04-28 08:36:55,936 INFO L290 TraceCheckUtils]: 113: Hoare triple {59915#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); {59915#false} is VALID [2022-04-28 08:36:55,936 INFO L290 TraceCheckUtils]: 114: Hoare triple {59915#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {59915#false} is VALID [2022-04-28 08:36:55,936 INFO L290 TraceCheckUtils]: 115: Hoare triple {59915#false} ~skip~0 := 0; {59915#false} is VALID [2022-04-28 08:36:55,936 INFO L290 TraceCheckUtils]: 116: Hoare triple {59915#false} assume !false; {59915#false} is VALID [2022-04-28 08:36:55,936 INFO L290 TraceCheckUtils]: 117: Hoare triple {59915#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); {59915#false} is VALID [2022-04-28 08:36:55,936 INFO L290 TraceCheckUtils]: 118: Hoare triple {59915#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,936 INFO L290 TraceCheckUtils]: 119: Hoare triple {59915#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,936 INFO L290 TraceCheckUtils]: 120: Hoare triple {59915#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,936 INFO L290 TraceCheckUtils]: 121: Hoare triple {59915#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,936 INFO L290 TraceCheckUtils]: 122: Hoare triple {59915#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,937 INFO L290 TraceCheckUtils]: 123: Hoare triple {59915#false} assume 4368 == #t~mem54;havoc #t~mem54; {59915#false} is VALID [2022-04-28 08:36:55,937 INFO L290 TraceCheckUtils]: 124: Hoare triple {59915#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; {59915#false} is VALID [2022-04-28 08:36:55,937 INFO L290 TraceCheckUtils]: 125: Hoare triple {59915#false} assume !(0 == ~blastFlag~0); {59915#false} is VALID [2022-04-28 08:36:55,937 INFO L290 TraceCheckUtils]: 126: Hoare triple {59915#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {59915#false} is VALID [2022-04-28 08:36:55,937 INFO L290 TraceCheckUtils]: 127: Hoare triple {59915#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); {59915#false} is VALID [2022-04-28 08:36:55,937 INFO L290 TraceCheckUtils]: 128: Hoare triple {59915#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; {59915#false} is VALID [2022-04-28 08:36:55,937 INFO L290 TraceCheckUtils]: 129: Hoare triple {59915#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); {59915#false} is VALID [2022-04-28 08:36:55,937 INFO L290 TraceCheckUtils]: 130: Hoare triple {59915#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {59915#false} is VALID [2022-04-28 08:36:55,937 INFO L290 TraceCheckUtils]: 131: Hoare triple {59915#false} ~skip~0 := 0; {59915#false} is VALID [2022-04-28 08:36:55,937 INFO L290 TraceCheckUtils]: 132: Hoare triple {59915#false} assume !false; {59915#false} is VALID [2022-04-28 08:36:55,938 INFO L290 TraceCheckUtils]: 133: Hoare triple {59915#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); {59915#false} is VALID [2022-04-28 08:36:55,938 INFO L290 TraceCheckUtils]: 134: Hoare triple {59915#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,938 INFO L290 TraceCheckUtils]: 135: Hoare triple {59915#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,938 INFO L290 TraceCheckUtils]: 136: Hoare triple {59915#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,938 INFO L290 TraceCheckUtils]: 137: Hoare triple {59915#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,938 INFO L290 TraceCheckUtils]: 138: Hoare triple {59915#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,938 INFO L290 TraceCheckUtils]: 139: Hoare triple {59915#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,938 INFO L290 TraceCheckUtils]: 140: Hoare triple {59915#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,938 INFO L290 TraceCheckUtils]: 141: Hoare triple {59915#false} assume 4384 == #t~mem56;havoc #t~mem56; {59915#false} is VALID [2022-04-28 08:36:55,938 INFO L290 TraceCheckUtils]: 142: Hoare triple {59915#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {59915#false} is VALID [2022-04-28 08:36:55,939 INFO L290 TraceCheckUtils]: 143: Hoare triple {59915#false} assume !(1 == ~blastFlag~0); {59915#false} is VALID [2022-04-28 08:36:55,939 INFO L290 TraceCheckUtils]: 144: Hoare triple {59915#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,939 INFO L290 TraceCheckUtils]: 145: Hoare triple {59915#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,939 INFO L290 TraceCheckUtils]: 146: Hoare triple {59915#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,939 INFO L290 TraceCheckUtils]: 147: Hoare triple {59915#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); {59915#false} is VALID [2022-04-28 08:36:55,939 INFO L290 TraceCheckUtils]: 148: Hoare triple {59915#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {59915#false} is VALID [2022-04-28 08:36:55,939 INFO L290 TraceCheckUtils]: 149: Hoare triple {59915#false} ~skip~0 := 0; {59915#false} is VALID [2022-04-28 08:36:55,939 INFO L290 TraceCheckUtils]: 150: Hoare triple {59915#false} assume !false; {59915#false} is VALID [2022-04-28 08:36:55,939 INFO L290 TraceCheckUtils]: 151: Hoare triple {59915#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); {59915#false} is VALID [2022-04-28 08:36:55,939 INFO L290 TraceCheckUtils]: 152: Hoare triple {59915#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,940 INFO L290 TraceCheckUtils]: 153: Hoare triple {59915#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,940 INFO L290 TraceCheckUtils]: 154: Hoare triple {59915#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,940 INFO L290 TraceCheckUtils]: 155: Hoare triple {59915#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,940 INFO L290 TraceCheckUtils]: 156: Hoare triple {59915#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,940 INFO L290 TraceCheckUtils]: 157: Hoare triple {59915#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,940 INFO L290 TraceCheckUtils]: 158: Hoare triple {59915#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,940 INFO L290 TraceCheckUtils]: 159: Hoare triple {59915#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,940 INFO L290 TraceCheckUtils]: 160: Hoare triple {59915#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,940 INFO L290 TraceCheckUtils]: 161: Hoare triple {59915#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,941 INFO L290 TraceCheckUtils]: 162: Hoare triple {59915#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,941 INFO L290 TraceCheckUtils]: 163: Hoare triple {59915#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,941 INFO L290 TraceCheckUtils]: 164: Hoare triple {59915#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {59915#false} is VALID [2022-04-28 08:36:55,941 INFO L290 TraceCheckUtils]: 165: Hoare triple {59915#false} assume 4432 == #t~mem62;havoc #t~mem62; {59915#false} is VALID [2022-04-28 08:36:55,941 INFO L290 TraceCheckUtils]: 166: Hoare triple {59915#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {59915#false} is VALID [2022-04-28 08:36:55,941 INFO L290 TraceCheckUtils]: 167: Hoare triple {59915#false} assume 5 == ~blastFlag~0; {59915#false} is VALID [2022-04-28 08:36:55,941 INFO L290 TraceCheckUtils]: 168: Hoare triple {59915#false} assume !false; {59915#false} is VALID [2022-04-28 08:36:55,942 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-28 08:36:55,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:36:55,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288351874] [2022-04-28 08:36:55,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288351874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:36:55,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:36:55,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:36:55,943 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:36:55,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1130305008] [2022-04-28 08:36:55,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1130305008] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:36:55,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:36:55,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:36:55,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994151328] [2022-04-28 08:36:55,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:36:55,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 169 [2022-04-28 08:36:55,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:36:55,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:56,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:36:56,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:36:56,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:56,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:36:56,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:36:56,030 INFO L87 Difference]: Start difference. First operand 817 states and 1173 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:58,051 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:36:59,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:59,233 INFO L93 Difference]: Finished difference Result 2002 states and 2895 transitions. [2022-04-28 08:36:59,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:36:59,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 169 [2022-04-28 08:36:59,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:36:59,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:59,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-28 08:36:59,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:59,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-28 08:36:59,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-28 08:36:59,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:36:59,629 INFO L225 Difference]: With dead ends: 2002 [2022-04-28 08:36:59,629 INFO L226 Difference]: Without dead ends: 1201 [2022-04-28 08:36:59,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:36:59,631 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 114 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:36:59,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:36:59,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2022-04-28 08:36:59,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 827. [2022-04-28 08:36:59,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:36:59,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1201 states. Second operand has 827 states, 822 states have (on average 1.4294403892944039) internal successors, (1175), 822 states have internal predecessors, (1175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:59,689 INFO L74 IsIncluded]: Start isIncluded. First operand 1201 states. Second operand has 827 states, 822 states have (on average 1.4294403892944039) internal successors, (1175), 822 states have internal predecessors, (1175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:59,690 INFO L87 Difference]: Start difference. First operand 1201 states. Second operand has 827 states, 822 states have (on average 1.4294403892944039) internal successors, (1175), 822 states have internal predecessors, (1175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:59,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:59,736 INFO L93 Difference]: Finished difference Result 1201 states and 1728 transitions. [2022-04-28 08:36:59,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1728 transitions. [2022-04-28 08:36:59,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:59,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:59,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 827 states, 822 states have (on average 1.4294403892944039) internal successors, (1175), 822 states have internal predecessors, (1175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1201 states. [2022-04-28 08:36:59,741 INFO L87 Difference]: Start difference. First operand has 827 states, 822 states have (on average 1.4294403892944039) internal successors, (1175), 822 states have internal predecessors, (1175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1201 states. [2022-04-28 08:36:59,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:59,796 INFO L93 Difference]: Finished difference Result 1201 states and 1728 transitions. [2022-04-28 08:36:59,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1728 transitions. [2022-04-28 08:36:59,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:59,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:59,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:36:59,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:36:59,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 822 states have (on average 1.4294403892944039) internal successors, (1175), 822 states have internal predecessors, (1175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:59,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1179 transitions. [2022-04-28 08:36:59,835 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1179 transitions. Word has length 169 [2022-04-28 08:36:59,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:36:59,835 INFO L495 AbstractCegarLoop]: Abstraction has 827 states and 1179 transitions. [2022-04-28 08:36:59,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:59,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 827 states and 1179 transitions. [2022-04-28 08:37:00,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1179 edges. 1179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:37:00,900 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1179 transitions. [2022-04-28 08:37:00,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-28 08:37:00,902 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:37:00,902 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:37:00,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 08:37:00,902 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:37:00,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:37:00,902 INFO L85 PathProgramCache]: Analyzing trace with hash -310692014, now seen corresponding path program 3 times [2022-04-28 08:37:00,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:37:00,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2040310528] [2022-04-28 08:37:16,043 WARN L232 SmtUtils]: Spent 9.20s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:37:24,190 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:37:24,190 INFO L85 PathProgramCache]: Analyzing trace with hash -310692014, now seen corresponding path program 4 times [2022-04-28 08:37:24,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:37:24,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372988168] [2022-04-28 08:37:24,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:37:24,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:37:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:37:24,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:37:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:37:24,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {67993#(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); {67986#true} is VALID [2022-04-28 08:37:24,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {67986#true} assume true; {67986#true} is VALID [2022-04-28 08:37:24,380 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67986#true} {67986#true} #593#return; {67986#true} is VALID [2022-04-28 08:37:24,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {67986#true} call ULTIMATE.init(); {67993#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:37:24,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {67993#(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); {67986#true} is VALID [2022-04-28 08:37:24,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {67986#true} assume true; {67986#true} is VALID [2022-04-28 08:37:24,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67986#true} {67986#true} #593#return; {67986#true} is VALID [2022-04-28 08:37:24,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {67986#true} call #t~ret158 := main(); {67986#true} is VALID [2022-04-28 08:37:24,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {67986#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; {67986#true} is VALID [2022-04-28 08:37:24,381 INFO L272 TraceCheckUtils]: 6: Hoare triple {67986#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {67986#true} is VALID [2022-04-28 08:37:24,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {67986#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); {67986#true} is VALID [2022-04-28 08:37:24,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {67986#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; {67986#true} is VALID [2022-04-28 08:37:24,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {67986#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; {67986#true} is VALID [2022-04-28 08:37:24,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {67986#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {67986#true} is VALID [2022-04-28 08:37:24,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {67986#true} assume !false; {67986#true} is VALID [2022-04-28 08:37:24,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {67986#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {67986#true} assume 12292 == #t~mem49;havoc #t~mem49; {67986#true} is VALID [2022-04-28 08:37:24,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {67986#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; {67986#true} is VALID [2022-04-28 08:37:24,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {67986#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {67986#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {67986#true} is VALID [2022-04-28 08:37:24,383 INFO L290 TraceCheckUtils]: 17: Hoare triple {67986#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {67986#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); {67986#true} is VALID [2022-04-28 08:37:24,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {67986#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {67986#true} is VALID [2022-04-28 08:37:24,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {67986#true} assume !(0 == ~tmp___4~0); {67986#true} is VALID [2022-04-28 08:37:24,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {67986#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); {67986#true} is VALID [2022-04-28 08:37:24,383 INFO L290 TraceCheckUtils]: 22: Hoare triple {67986#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); {67986#true} is VALID [2022-04-28 08:37:24,383 INFO L290 TraceCheckUtils]: 23: Hoare triple {67986#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {67986#true} is VALID [2022-04-28 08:37:24,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {67986#true} ~skip~0 := 0; {67986#true} is VALID [2022-04-28 08:37:24,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {67986#true} assume !false; {67986#true} is VALID [2022-04-28 08:37:24,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {67986#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,383 INFO L290 TraceCheckUtils]: 27: Hoare triple {67986#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,384 INFO L290 TraceCheckUtils]: 28: Hoare triple {67986#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,384 INFO L290 TraceCheckUtils]: 29: Hoare triple {67986#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,384 INFO L290 TraceCheckUtils]: 30: Hoare triple {67986#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,384 INFO L290 TraceCheckUtils]: 31: Hoare triple {67986#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,384 INFO L290 TraceCheckUtils]: 32: Hoare triple {67986#true} assume 4368 == #t~mem54;havoc #t~mem54; {67986#true} is VALID [2022-04-28 08:37:24,384 INFO L290 TraceCheckUtils]: 33: Hoare triple {67986#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; {67986#true} is VALID [2022-04-28 08:37:24,384 INFO L290 TraceCheckUtils]: 34: Hoare triple {67986#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {67986#true} is VALID [2022-04-28 08:37:24,384 INFO L290 TraceCheckUtils]: 35: Hoare triple {67986#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); {67986#true} is VALID [2022-04-28 08:37:24,384 INFO L290 TraceCheckUtils]: 36: Hoare triple {67986#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; {67986#true} is VALID [2022-04-28 08:37:24,384 INFO L290 TraceCheckUtils]: 37: Hoare triple {67986#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); {67986#true} is VALID [2022-04-28 08:37:24,385 INFO L290 TraceCheckUtils]: 38: Hoare triple {67986#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {67986#true} is VALID [2022-04-28 08:37:24,385 INFO L290 TraceCheckUtils]: 39: Hoare triple {67986#true} ~skip~0 := 0; {67986#true} is VALID [2022-04-28 08:37:24,385 INFO L290 TraceCheckUtils]: 40: Hoare triple {67986#true} assume !false; {67986#true} is VALID [2022-04-28 08:37:24,385 INFO L290 TraceCheckUtils]: 41: Hoare triple {67986#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,385 INFO L290 TraceCheckUtils]: 42: Hoare triple {67986#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,385 INFO L290 TraceCheckUtils]: 43: Hoare triple {67986#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,385 INFO L290 TraceCheckUtils]: 44: Hoare triple {67986#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,385 INFO L290 TraceCheckUtils]: 45: Hoare triple {67986#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,385 INFO L290 TraceCheckUtils]: 46: Hoare triple {67986#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,385 INFO L290 TraceCheckUtils]: 47: Hoare triple {67986#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,386 INFO L290 TraceCheckUtils]: 48: Hoare triple {67986#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,386 INFO L290 TraceCheckUtils]: 49: Hoare triple {67986#true} assume 4384 == #t~mem56;havoc #t~mem56; {67986#true} is VALID [2022-04-28 08:37:24,386 INFO L290 TraceCheckUtils]: 50: Hoare triple {67986#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {67986#true} is VALID [2022-04-28 08:37:24,386 INFO L290 TraceCheckUtils]: 51: Hoare triple {67986#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {67986#true} is VALID [2022-04-28 08:37:24,386 INFO L290 TraceCheckUtils]: 52: Hoare triple {67986#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,386 INFO L290 TraceCheckUtils]: 53: Hoare triple {67986#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,386 INFO L290 TraceCheckUtils]: 54: Hoare triple {67986#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,386 INFO L290 TraceCheckUtils]: 55: Hoare triple {67986#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); {67986#true} is VALID [2022-04-28 08:37:24,386 INFO L290 TraceCheckUtils]: 56: Hoare triple {67986#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {67986#true} is VALID [2022-04-28 08:37:24,386 INFO L290 TraceCheckUtils]: 57: Hoare triple {67986#true} ~skip~0 := 0; {67986#true} is VALID [2022-04-28 08:37:24,386 INFO L290 TraceCheckUtils]: 58: Hoare triple {67986#true} assume !false; {67986#true} is VALID [2022-04-28 08:37:24,387 INFO L290 TraceCheckUtils]: 59: Hoare triple {67986#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,387 INFO L290 TraceCheckUtils]: 60: Hoare triple {67986#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,387 INFO L290 TraceCheckUtils]: 61: Hoare triple {67986#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,387 INFO L290 TraceCheckUtils]: 62: Hoare triple {67986#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,387 INFO L290 TraceCheckUtils]: 63: Hoare triple {67986#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,387 INFO L290 TraceCheckUtils]: 64: Hoare triple {67986#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,387 INFO L290 TraceCheckUtils]: 65: Hoare triple {67986#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,387 INFO L290 TraceCheckUtils]: 66: Hoare triple {67986#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,387 INFO L290 TraceCheckUtils]: 67: Hoare triple {67986#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,387 INFO L290 TraceCheckUtils]: 68: Hoare triple {67986#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,388 INFO L290 TraceCheckUtils]: 69: Hoare triple {67986#true} assume 4400 == #t~mem58;havoc #t~mem58; {67986#true} is VALID [2022-04-28 08:37:24,388 INFO L290 TraceCheckUtils]: 70: Hoare triple {67986#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); {67986#true} is VALID [2022-04-28 08:37:24,388 INFO L290 TraceCheckUtils]: 71: Hoare triple {67986#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; {67986#true} is VALID [2022-04-28 08:37:24,388 INFO L290 TraceCheckUtils]: 72: Hoare triple {67986#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {67986#true} is VALID [2022-04-28 08:37:24,388 INFO L290 TraceCheckUtils]: 73: Hoare triple {67986#true} assume !(~ret~0 <= 0); {67986#true} is VALID [2022-04-28 08:37:24,388 INFO L290 TraceCheckUtils]: 74: Hoare triple {67986#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,388 INFO L290 TraceCheckUtils]: 75: Hoare triple {67986#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); {67986#true} is VALID [2022-04-28 08:37:24,388 INFO L290 TraceCheckUtils]: 76: Hoare triple {67986#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {67986#true} is VALID [2022-04-28 08:37:24,388 INFO L290 TraceCheckUtils]: 77: Hoare triple {67986#true} ~skip~0 := 0; {67986#true} is VALID [2022-04-28 08:37:24,388 INFO L290 TraceCheckUtils]: 78: Hoare triple {67986#true} assume !false; {67986#true} is VALID [2022-04-28 08:37:24,389 INFO L290 TraceCheckUtils]: 79: Hoare triple {67986#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,389 INFO L290 TraceCheckUtils]: 80: Hoare triple {67986#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,389 INFO L290 TraceCheckUtils]: 81: Hoare triple {67986#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,389 INFO L290 TraceCheckUtils]: 82: Hoare triple {67986#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,389 INFO L290 TraceCheckUtils]: 83: Hoare triple {67986#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,389 INFO L290 TraceCheckUtils]: 84: Hoare triple {67986#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,389 INFO L290 TraceCheckUtils]: 85: Hoare triple {67986#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,389 INFO L290 TraceCheckUtils]: 86: Hoare triple {67986#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,389 INFO L290 TraceCheckUtils]: 87: Hoare triple {67986#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,389 INFO L290 TraceCheckUtils]: 88: Hoare triple {67986#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,390 INFO L290 TraceCheckUtils]: 89: Hoare triple {67986#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,390 INFO L290 TraceCheckUtils]: 90: Hoare triple {67986#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {67986#true} is VALID [2022-04-28 08:37:24,390 INFO L290 TraceCheckUtils]: 91: Hoare triple {67986#true} assume 4416 == #t~mem60;havoc #t~mem60; {67986#true} is VALID [2022-04-28 08:37:24,390 INFO L290 TraceCheckUtils]: 92: Hoare triple {67986#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {67986#true} is VALID [2022-04-28 08:37:24,390 INFO L290 TraceCheckUtils]: 93: Hoare triple {67986#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {67986#true} is VALID [2022-04-28 08:37:24,391 INFO L290 TraceCheckUtils]: 94: Hoare triple {67986#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); {67991#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:37:24,392 INFO L290 TraceCheckUtils]: 95: Hoare triple {67991#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {67991#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:37:24,392 INFO L290 TraceCheckUtils]: 96: Hoare triple {67991#(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); {67991#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:37:24,392 INFO L290 TraceCheckUtils]: 97: Hoare triple {67991#(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; {67991#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:37:24,393 INFO L290 TraceCheckUtils]: 98: Hoare triple {67991#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {67991#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:37:24,393 INFO L290 TraceCheckUtils]: 99: Hoare triple {67991#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {67991#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:37:24,394 INFO L290 TraceCheckUtils]: 100: Hoare triple {67991#(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); {67991#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:37:24,394 INFO L290 TraceCheckUtils]: 101: Hoare triple {67991#(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); {67991#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:37:24,394 INFO L290 TraceCheckUtils]: 102: Hoare triple {67991#(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); {67991#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:37:24,395 INFO L290 TraceCheckUtils]: 103: Hoare triple {67991#(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); {67991#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:37:24,395 INFO L290 TraceCheckUtils]: 104: Hoare triple {67991#(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); {67991#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:37:24,396 INFO L290 TraceCheckUtils]: 105: Hoare triple {67991#(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); {67991#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:37:24,396 INFO L290 TraceCheckUtils]: 106: Hoare triple {67991#(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); {67991#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:37:24,396 INFO L290 TraceCheckUtils]: 107: Hoare triple {67991#(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); {67992#(not (= |ssl3_connect_#t~mem56| 4384))} is VALID [2022-04-28 08:37:24,397 INFO L290 TraceCheckUtils]: 108: Hoare triple {67992#(not (= |ssl3_connect_#t~mem56| 4384))} assume 4384 == #t~mem56;havoc #t~mem56; {67987#false} is VALID [2022-04-28 08:37:24,397 INFO L290 TraceCheckUtils]: 109: Hoare triple {67987#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {67987#false} is VALID [2022-04-28 08:37:24,397 INFO L290 TraceCheckUtils]: 110: Hoare triple {67987#false} assume !(1 == ~blastFlag~0); {67987#false} is VALID [2022-04-28 08:37:24,397 INFO L290 TraceCheckUtils]: 111: Hoare triple {67987#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,397 INFO L290 TraceCheckUtils]: 112: Hoare triple {67987#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,397 INFO L290 TraceCheckUtils]: 113: Hoare triple {67987#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,397 INFO L290 TraceCheckUtils]: 114: Hoare triple {67987#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); {67987#false} is VALID [2022-04-28 08:37:24,397 INFO L290 TraceCheckUtils]: 115: Hoare triple {67987#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {67987#false} is VALID [2022-04-28 08:37:24,398 INFO L290 TraceCheckUtils]: 116: Hoare triple {67987#false} ~skip~0 := 0; {67987#false} is VALID [2022-04-28 08:37:24,398 INFO L290 TraceCheckUtils]: 117: Hoare triple {67987#false} assume !false; {67987#false} is VALID [2022-04-28 08:37:24,398 INFO L290 TraceCheckUtils]: 118: Hoare triple {67987#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); {67987#false} is VALID [2022-04-28 08:37:24,398 INFO L290 TraceCheckUtils]: 119: Hoare triple {67987#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,398 INFO L290 TraceCheckUtils]: 120: Hoare triple {67987#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,398 INFO L290 TraceCheckUtils]: 121: Hoare triple {67987#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,398 INFO L290 TraceCheckUtils]: 122: Hoare triple {67987#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,398 INFO L290 TraceCheckUtils]: 123: Hoare triple {67987#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,398 INFO L290 TraceCheckUtils]: 124: Hoare triple {67987#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,398 INFO L290 TraceCheckUtils]: 125: Hoare triple {67987#false} assume 4369 == #t~mem55;havoc #t~mem55; {67987#false} is VALID [2022-04-28 08:37:24,398 INFO L290 TraceCheckUtils]: 126: Hoare triple {67987#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; {67987#false} is VALID [2022-04-28 08:37:24,399 INFO L290 TraceCheckUtils]: 127: Hoare triple {67987#false} assume !(0 == ~blastFlag~0); {67987#false} is VALID [2022-04-28 08:37:24,399 INFO L290 TraceCheckUtils]: 128: Hoare triple {67987#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {67987#false} is VALID [2022-04-28 08:37:24,399 INFO L290 TraceCheckUtils]: 129: Hoare triple {67987#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); {67987#false} is VALID [2022-04-28 08:37:24,399 INFO L290 TraceCheckUtils]: 130: Hoare triple {67987#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; {67987#false} is VALID [2022-04-28 08:37:24,399 INFO L290 TraceCheckUtils]: 131: Hoare triple {67987#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); {67987#false} is VALID [2022-04-28 08:37:24,399 INFO L290 TraceCheckUtils]: 132: Hoare triple {67987#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {67987#false} is VALID [2022-04-28 08:37:24,399 INFO L290 TraceCheckUtils]: 133: Hoare triple {67987#false} ~skip~0 := 0; {67987#false} is VALID [2022-04-28 08:37:24,399 INFO L290 TraceCheckUtils]: 134: Hoare triple {67987#false} assume !false; {67987#false} is VALID [2022-04-28 08:37:24,399 INFO L290 TraceCheckUtils]: 135: Hoare triple {67987#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); {67987#false} is VALID [2022-04-28 08:37:24,399 INFO L290 TraceCheckUtils]: 136: Hoare triple {67987#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,400 INFO L290 TraceCheckUtils]: 137: Hoare triple {67987#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,400 INFO L290 TraceCheckUtils]: 138: Hoare triple {67987#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,400 INFO L290 TraceCheckUtils]: 139: Hoare triple {67987#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,400 INFO L290 TraceCheckUtils]: 140: Hoare triple {67987#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,400 INFO L290 TraceCheckUtils]: 141: Hoare triple {67987#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,400 INFO L290 TraceCheckUtils]: 142: Hoare triple {67987#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,400 INFO L290 TraceCheckUtils]: 143: Hoare triple {67987#false} assume 4384 == #t~mem56;havoc #t~mem56; {67987#false} is VALID [2022-04-28 08:37:24,400 INFO L290 TraceCheckUtils]: 144: Hoare triple {67987#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {67987#false} is VALID [2022-04-28 08:37:24,400 INFO L290 TraceCheckUtils]: 145: Hoare triple {67987#false} assume !(1 == ~blastFlag~0); {67987#false} is VALID [2022-04-28 08:37:24,401 INFO L290 TraceCheckUtils]: 146: Hoare triple {67987#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,401 INFO L290 TraceCheckUtils]: 147: Hoare triple {67987#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,401 INFO L290 TraceCheckUtils]: 148: Hoare triple {67987#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,401 INFO L290 TraceCheckUtils]: 149: Hoare triple {67987#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); {67987#false} is VALID [2022-04-28 08:37:24,401 INFO L290 TraceCheckUtils]: 150: Hoare triple {67987#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {67987#false} is VALID [2022-04-28 08:37:24,401 INFO L290 TraceCheckUtils]: 151: Hoare triple {67987#false} ~skip~0 := 0; {67987#false} is VALID [2022-04-28 08:37:24,401 INFO L290 TraceCheckUtils]: 152: Hoare triple {67987#false} assume !false; {67987#false} is VALID [2022-04-28 08:37:24,401 INFO L290 TraceCheckUtils]: 153: Hoare triple {67987#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); {67987#false} is VALID [2022-04-28 08:37:24,401 INFO L290 TraceCheckUtils]: 154: Hoare triple {67987#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,401 INFO L290 TraceCheckUtils]: 155: Hoare triple {67987#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,401 INFO L290 TraceCheckUtils]: 156: Hoare triple {67987#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,402 INFO L290 TraceCheckUtils]: 157: Hoare triple {67987#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,402 INFO L290 TraceCheckUtils]: 158: Hoare triple {67987#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,402 INFO L290 TraceCheckUtils]: 159: Hoare triple {67987#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,402 INFO L290 TraceCheckUtils]: 160: Hoare triple {67987#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,402 INFO L290 TraceCheckUtils]: 161: Hoare triple {67987#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,402 INFO L290 TraceCheckUtils]: 162: Hoare triple {67987#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,402 INFO L290 TraceCheckUtils]: 163: Hoare triple {67987#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,402 INFO L290 TraceCheckUtils]: 164: Hoare triple {67987#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,402 INFO L290 TraceCheckUtils]: 165: Hoare triple {67987#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,402 INFO L290 TraceCheckUtils]: 166: Hoare triple {67987#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {67987#false} is VALID [2022-04-28 08:37:24,403 INFO L290 TraceCheckUtils]: 167: Hoare triple {67987#false} assume 4432 == #t~mem62;havoc #t~mem62; {67987#false} is VALID [2022-04-28 08:37:24,403 INFO L290 TraceCheckUtils]: 168: Hoare triple {67987#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {67987#false} is VALID [2022-04-28 08:37:24,403 INFO L290 TraceCheckUtils]: 169: Hoare triple {67987#false} assume 5 == ~blastFlag~0; {67987#false} is VALID [2022-04-28 08:37:24,403 INFO L290 TraceCheckUtils]: 170: Hoare triple {67987#false} assume !false; {67987#false} is VALID [2022-04-28 08:37:24,403 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-04-28 08:37:24,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:37:24,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372988168] [2022-04-28 08:37:24,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372988168] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:37:24,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:37:24,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:37:24,404 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:37:24,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2040310528] [2022-04-28 08:37:24,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2040310528] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:37:24,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:37:24,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:37:24,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932100247] [2022-04-28 08:37:24,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:37:24,405 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 171 [2022-04-28 08:37:24,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:37:24,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:24,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:37:24,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:37:24,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:37:24,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:37:24,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:37:24,490 INFO L87 Difference]: Start difference. First operand 827 states and 1179 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:26,511 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:37:27,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:27,695 INFO L93 Difference]: Finished difference Result 2012 states and 2887 transitions. [2022-04-28 08:37:27,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:37:27,695 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 171 [2022-04-28 08:37:27,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:37:27,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:27,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-28 08:37:27,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:27,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-28 08:37:27,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-28 08:37:28,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:37:28,087 INFO L225 Difference]: With dead ends: 2012 [2022-04-28 08:37:28,087 INFO L226 Difference]: Without dead ends: 1201 [2022-04-28 08:37:28,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:37:28,089 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 108 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:37:28,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 286 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 386 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:37:28,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2022-04-28 08:37:28,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 842. [2022-04-28 08:37:28,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:37:28,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1201 states. Second operand has 842 states, 837 states have (on average 1.4336917562724014) internal successors, (1200), 837 states have internal predecessors, (1200), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:28,153 INFO L74 IsIncluded]: Start isIncluded. First operand 1201 states. Second operand has 842 states, 837 states have (on average 1.4336917562724014) internal successors, (1200), 837 states have internal predecessors, (1200), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:28,154 INFO L87 Difference]: Start difference. First operand 1201 states. Second operand has 842 states, 837 states have (on average 1.4336917562724014) internal successors, (1200), 837 states have internal predecessors, (1200), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:28,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:28,210 INFO L93 Difference]: Finished difference Result 1201 states and 1723 transitions. [2022-04-28 08:37:28,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1723 transitions. [2022-04-28 08:37:28,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:37:28,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:37:28,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 842 states, 837 states have (on average 1.4336917562724014) internal successors, (1200), 837 states have internal predecessors, (1200), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1201 states. [2022-04-28 08:37:28,214 INFO L87 Difference]: Start difference. First operand has 842 states, 837 states have (on average 1.4336917562724014) internal successors, (1200), 837 states have internal predecessors, (1200), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1201 states. [2022-04-28 08:37:28,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:37:28,273 INFO L93 Difference]: Finished difference Result 1201 states and 1723 transitions. [2022-04-28 08:37:28,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1723 transitions. [2022-04-28 08:37:28,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:37:28,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:37:28,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:37:28,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:37:28,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 837 states have (on average 1.4336917562724014) internal successors, (1200), 837 states have internal predecessors, (1200), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1204 transitions. [2022-04-28 08:37:28,321 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1204 transitions. Word has length 171 [2022-04-28 08:37:28,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:37:28,322 INFO L495 AbstractCegarLoop]: Abstraction has 842 states and 1204 transitions. [2022-04-28 08:37:28,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:37:28,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 842 states and 1204 transitions. [2022-04-28 08:37:29,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1204 edges. 1204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:37:29,478 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1204 transitions. [2022-04-28 08:37:29,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-28 08:37:29,480 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:37:29,480 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:37:29,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 08:37:29,480 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:37:29,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:37:29,480 INFO L85 PathProgramCache]: Analyzing trace with hash -228612804, now seen corresponding path program 1 times [2022-04-28 08:37:29,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:37:29,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [811131617] [2022-04-28 08:37:53,788 WARN L232 SmtUtils]: Spent 17.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-28 08:38:02,288 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:38:02,288 INFO L85 PathProgramCache]: Analyzing trace with hash -228612804, now seen corresponding path program 2 times [2022-04-28 08:38:02,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:38:02,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235913269] [2022-04-28 08:38:02,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:38:02,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:38:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:38:02,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:38:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:38:02,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {76115#(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); {76108#true} is VALID [2022-04-28 08:38:02,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {76108#true} assume true; {76108#true} is VALID [2022-04-28 08:38:02,498 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76108#true} {76108#true} #593#return; {76108#true} is VALID [2022-04-28 08:38:02,499 INFO L272 TraceCheckUtils]: 0: Hoare triple {76108#true} call ULTIMATE.init(); {76115#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:38:02,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {76115#(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); {76108#true} is VALID [2022-04-28 08:38:02,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {76108#true} assume true; {76108#true} is VALID [2022-04-28 08:38:02,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76108#true} {76108#true} #593#return; {76108#true} is VALID [2022-04-28 08:38:02,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {76108#true} call #t~ret158 := main(); {76108#true} is VALID [2022-04-28 08:38:02,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {76108#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; {76108#true} is VALID [2022-04-28 08:38:02,499 INFO L272 TraceCheckUtils]: 6: Hoare triple {76108#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {76108#true} is VALID [2022-04-28 08:38:02,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {76108#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); {76108#true} is VALID [2022-04-28 08:38:02,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {76108#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; {76108#true} is VALID [2022-04-28 08:38:02,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {76108#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; {76108#true} is VALID [2022-04-28 08:38:02,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {76108#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {76108#true} is VALID [2022-04-28 08:38:02,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {76108#true} assume !false; {76108#true} is VALID [2022-04-28 08:38:02,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {76108#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {76108#true} assume 12292 == #t~mem49;havoc #t~mem49; {76108#true} is VALID [2022-04-28 08:38:02,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {76108#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; {76108#true} is VALID [2022-04-28 08:38:02,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {76108#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {76108#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {76108#true} is VALID [2022-04-28 08:38:02,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {76108#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {76108#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); {76108#true} is VALID [2022-04-28 08:38:02,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {76108#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {76108#true} is VALID [2022-04-28 08:38:02,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {76108#true} assume !(0 == ~tmp___4~0); {76108#true} is VALID [2022-04-28 08:38:02,501 INFO L290 TraceCheckUtils]: 21: Hoare triple {76108#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); {76108#true} is VALID [2022-04-28 08:38:02,501 INFO L290 TraceCheckUtils]: 22: Hoare triple {76108#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); {76108#true} is VALID [2022-04-28 08:38:02,501 INFO L290 TraceCheckUtils]: 23: Hoare triple {76108#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76108#true} is VALID [2022-04-28 08:38:02,501 INFO L290 TraceCheckUtils]: 24: Hoare triple {76108#true} ~skip~0 := 0; {76108#true} is VALID [2022-04-28 08:38:02,501 INFO L290 TraceCheckUtils]: 25: Hoare triple {76108#true} assume !false; {76108#true} is VALID [2022-04-28 08:38:02,502 INFO L290 TraceCheckUtils]: 26: Hoare triple {76108#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,502 INFO L290 TraceCheckUtils]: 27: Hoare triple {76108#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {76108#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {76108#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,502 INFO L290 TraceCheckUtils]: 30: Hoare triple {76108#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,502 INFO L290 TraceCheckUtils]: 31: Hoare triple {76108#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,502 INFO L290 TraceCheckUtils]: 32: Hoare triple {76108#true} assume 4368 == #t~mem54;havoc #t~mem54; {76108#true} is VALID [2022-04-28 08:38:02,502 INFO L290 TraceCheckUtils]: 33: Hoare triple {76108#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; {76108#true} is VALID [2022-04-28 08:38:02,502 INFO L290 TraceCheckUtils]: 34: Hoare triple {76108#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {76108#true} is VALID [2022-04-28 08:38:02,503 INFO L290 TraceCheckUtils]: 35: Hoare triple {76108#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); {76108#true} is VALID [2022-04-28 08:38:02,503 INFO L290 TraceCheckUtils]: 36: Hoare triple {76108#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; {76108#true} is VALID [2022-04-28 08:38:02,503 INFO L290 TraceCheckUtils]: 37: Hoare triple {76108#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); {76108#true} is VALID [2022-04-28 08:38:02,503 INFO L290 TraceCheckUtils]: 38: Hoare triple {76108#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76108#true} is VALID [2022-04-28 08:38:02,503 INFO L290 TraceCheckUtils]: 39: Hoare triple {76108#true} ~skip~0 := 0; {76108#true} is VALID [2022-04-28 08:38:02,503 INFO L290 TraceCheckUtils]: 40: Hoare triple {76108#true} assume !false; {76108#true} is VALID [2022-04-28 08:38:02,503 INFO L290 TraceCheckUtils]: 41: Hoare triple {76108#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,503 INFO L290 TraceCheckUtils]: 42: Hoare triple {76108#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,503 INFO L290 TraceCheckUtils]: 43: Hoare triple {76108#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,503 INFO L290 TraceCheckUtils]: 44: Hoare triple {76108#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,504 INFO L290 TraceCheckUtils]: 45: Hoare triple {76108#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,504 INFO L290 TraceCheckUtils]: 46: Hoare triple {76108#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,504 INFO L290 TraceCheckUtils]: 47: Hoare triple {76108#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,504 INFO L290 TraceCheckUtils]: 48: Hoare triple {76108#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,504 INFO L290 TraceCheckUtils]: 49: Hoare triple {76108#true} assume 4384 == #t~mem56;havoc #t~mem56; {76108#true} is VALID [2022-04-28 08:38:02,504 INFO L290 TraceCheckUtils]: 50: Hoare triple {76108#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {76108#true} is VALID [2022-04-28 08:38:02,504 INFO L290 TraceCheckUtils]: 51: Hoare triple {76108#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {76108#true} is VALID [2022-04-28 08:38:02,504 INFO L290 TraceCheckUtils]: 52: Hoare triple {76108#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,504 INFO L290 TraceCheckUtils]: 53: Hoare triple {76108#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,504 INFO L290 TraceCheckUtils]: 54: Hoare triple {76108#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,505 INFO L290 TraceCheckUtils]: 55: Hoare triple {76108#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); {76108#true} is VALID [2022-04-28 08:38:02,505 INFO L290 TraceCheckUtils]: 56: Hoare triple {76108#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76108#true} is VALID [2022-04-28 08:38:02,505 INFO L290 TraceCheckUtils]: 57: Hoare triple {76108#true} ~skip~0 := 0; {76108#true} is VALID [2022-04-28 08:38:02,505 INFO L290 TraceCheckUtils]: 58: Hoare triple {76108#true} assume !false; {76108#true} is VALID [2022-04-28 08:38:02,505 INFO L290 TraceCheckUtils]: 59: Hoare triple {76108#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,505 INFO L290 TraceCheckUtils]: 60: Hoare triple {76108#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,505 INFO L290 TraceCheckUtils]: 61: Hoare triple {76108#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,505 INFO L290 TraceCheckUtils]: 62: Hoare triple {76108#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,505 INFO L290 TraceCheckUtils]: 63: Hoare triple {76108#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,505 INFO L290 TraceCheckUtils]: 64: Hoare triple {76108#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,506 INFO L290 TraceCheckUtils]: 65: Hoare triple {76108#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,506 INFO L290 TraceCheckUtils]: 66: Hoare triple {76108#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,506 INFO L290 TraceCheckUtils]: 67: Hoare triple {76108#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,506 INFO L290 TraceCheckUtils]: 68: Hoare triple {76108#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,506 INFO L290 TraceCheckUtils]: 69: Hoare triple {76108#true} assume 4400 == #t~mem58;havoc #t~mem58; {76108#true} is VALID [2022-04-28 08:38:02,506 INFO L290 TraceCheckUtils]: 70: Hoare triple {76108#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); {76108#true} is VALID [2022-04-28 08:38:02,506 INFO L290 TraceCheckUtils]: 71: Hoare triple {76108#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; {76108#true} is VALID [2022-04-28 08:38:02,506 INFO L290 TraceCheckUtils]: 72: Hoare triple {76108#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {76108#true} is VALID [2022-04-28 08:38:02,506 INFO L290 TraceCheckUtils]: 73: Hoare triple {76108#true} assume !(~ret~0 <= 0); {76108#true} is VALID [2022-04-28 08:38:02,506 INFO L290 TraceCheckUtils]: 74: Hoare triple {76108#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,507 INFO L290 TraceCheckUtils]: 75: Hoare triple {76108#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); {76108#true} is VALID [2022-04-28 08:38:02,507 INFO L290 TraceCheckUtils]: 76: Hoare triple {76108#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76108#true} is VALID [2022-04-28 08:38:02,507 INFO L290 TraceCheckUtils]: 77: Hoare triple {76108#true} ~skip~0 := 0; {76108#true} is VALID [2022-04-28 08:38:02,507 INFO L290 TraceCheckUtils]: 78: Hoare triple {76108#true} assume !false; {76108#true} is VALID [2022-04-28 08:38:02,507 INFO L290 TraceCheckUtils]: 79: Hoare triple {76108#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,507 INFO L290 TraceCheckUtils]: 80: Hoare triple {76108#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,507 INFO L290 TraceCheckUtils]: 81: Hoare triple {76108#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,507 INFO L290 TraceCheckUtils]: 82: Hoare triple {76108#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,507 INFO L290 TraceCheckUtils]: 83: Hoare triple {76108#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,507 INFO L290 TraceCheckUtils]: 84: Hoare triple {76108#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,508 INFO L290 TraceCheckUtils]: 85: Hoare triple {76108#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,508 INFO L290 TraceCheckUtils]: 86: Hoare triple {76108#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,508 INFO L290 TraceCheckUtils]: 87: Hoare triple {76108#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,508 INFO L290 TraceCheckUtils]: 88: Hoare triple {76108#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,508 INFO L290 TraceCheckUtils]: 89: Hoare triple {76108#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,508 INFO L290 TraceCheckUtils]: 90: Hoare triple {76108#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {76108#true} is VALID [2022-04-28 08:38:02,508 INFO L290 TraceCheckUtils]: 91: Hoare triple {76108#true} assume 4416 == #t~mem60;havoc #t~mem60; {76108#true} is VALID [2022-04-28 08:38:02,508 INFO L290 TraceCheckUtils]: 92: Hoare triple {76108#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {76108#true} is VALID [2022-04-28 08:38:02,508 INFO L290 TraceCheckUtils]: 93: Hoare triple {76108#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {76108#true} is VALID [2022-04-28 08:38:02,510 INFO L290 TraceCheckUtils]: 94: Hoare triple {76108#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); {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:02,510 INFO L290 TraceCheckUtils]: 95: Hoare triple {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:02,510 INFO L290 TraceCheckUtils]: 96: Hoare triple {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:02,511 INFO L290 TraceCheckUtils]: 97: Hoare triple {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:02,511 INFO L290 TraceCheckUtils]: 98: Hoare triple {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:02,511 INFO L290 TraceCheckUtils]: 99: Hoare triple {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:02,512 INFO L290 TraceCheckUtils]: 100: Hoare triple {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:02,512 INFO L290 TraceCheckUtils]: 101: Hoare triple {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:02,512 INFO L290 TraceCheckUtils]: 102: Hoare triple {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:02,512 INFO L290 TraceCheckUtils]: 103: Hoare triple {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:02,513 INFO L290 TraceCheckUtils]: 104: Hoare triple {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:02,513 INFO L290 TraceCheckUtils]: 105: Hoare triple {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:02,513 INFO L290 TraceCheckUtils]: 106: Hoare triple {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:02,514 INFO L290 TraceCheckUtils]: 107: Hoare triple {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:02,514 INFO L290 TraceCheckUtils]: 108: Hoare triple {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:38:02,515 INFO L290 TraceCheckUtils]: 109: Hoare triple {76113#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {76114#(not (= |ssl3_connect_#t~mem58| 4400))} is VALID [2022-04-28 08:38:02,515 INFO L290 TraceCheckUtils]: 110: Hoare triple {76114#(not (= |ssl3_connect_#t~mem58| 4400))} assume 4400 == #t~mem58;havoc #t~mem58; {76109#false} is VALID [2022-04-28 08:38:02,515 INFO L290 TraceCheckUtils]: 111: Hoare triple {76109#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); {76109#false} is VALID [2022-04-28 08:38:02,515 INFO L290 TraceCheckUtils]: 112: Hoare triple {76109#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; {76109#false} is VALID [2022-04-28 08:38:02,515 INFO L290 TraceCheckUtils]: 113: Hoare triple {76109#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,515 INFO L290 TraceCheckUtils]: 114: Hoare triple {76109#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); {76109#false} is VALID [2022-04-28 08:38:02,515 INFO L290 TraceCheckUtils]: 115: Hoare triple {76109#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76109#false} is VALID [2022-04-28 08:38:02,515 INFO L290 TraceCheckUtils]: 116: Hoare triple {76109#false} ~skip~0 := 0; {76109#false} is VALID [2022-04-28 08:38:02,515 INFO L290 TraceCheckUtils]: 117: Hoare triple {76109#false} assume !false; {76109#false} is VALID [2022-04-28 08:38:02,516 INFO L290 TraceCheckUtils]: 118: Hoare triple {76109#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); {76109#false} is VALID [2022-04-28 08:38:02,516 INFO L290 TraceCheckUtils]: 119: Hoare triple {76109#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,516 INFO L290 TraceCheckUtils]: 120: Hoare triple {76109#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,516 INFO L290 TraceCheckUtils]: 121: Hoare triple {76109#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,516 INFO L290 TraceCheckUtils]: 122: Hoare triple {76109#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,516 INFO L290 TraceCheckUtils]: 123: Hoare triple {76109#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,516 INFO L290 TraceCheckUtils]: 124: Hoare triple {76109#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,516 INFO L290 TraceCheckUtils]: 125: Hoare triple {76109#false} assume 4369 == #t~mem55;havoc #t~mem55; {76109#false} is VALID [2022-04-28 08:38:02,517 INFO L290 TraceCheckUtils]: 126: Hoare triple {76109#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; {76109#false} is VALID [2022-04-28 08:38:02,517 INFO L290 TraceCheckUtils]: 127: Hoare triple {76109#false} assume !(0 == ~blastFlag~0); {76109#false} is VALID [2022-04-28 08:38:02,517 INFO L290 TraceCheckUtils]: 128: Hoare triple {76109#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {76109#false} is VALID [2022-04-28 08:38:02,517 INFO L290 TraceCheckUtils]: 129: Hoare triple {76109#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); {76109#false} is VALID [2022-04-28 08:38:02,517 INFO L290 TraceCheckUtils]: 130: Hoare triple {76109#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; {76109#false} is VALID [2022-04-28 08:38:02,517 INFO L290 TraceCheckUtils]: 131: Hoare triple {76109#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); {76109#false} is VALID [2022-04-28 08:38:02,517 INFO L290 TraceCheckUtils]: 132: Hoare triple {76109#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76109#false} is VALID [2022-04-28 08:38:02,517 INFO L290 TraceCheckUtils]: 133: Hoare triple {76109#false} ~skip~0 := 0; {76109#false} is VALID [2022-04-28 08:38:02,517 INFO L290 TraceCheckUtils]: 134: Hoare triple {76109#false} assume !false; {76109#false} is VALID [2022-04-28 08:38:02,518 INFO L290 TraceCheckUtils]: 135: Hoare triple {76109#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); {76109#false} is VALID [2022-04-28 08:38:02,518 INFO L290 TraceCheckUtils]: 136: Hoare triple {76109#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,518 INFO L290 TraceCheckUtils]: 137: Hoare triple {76109#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,518 INFO L290 TraceCheckUtils]: 138: Hoare triple {76109#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,518 INFO L290 TraceCheckUtils]: 139: Hoare triple {76109#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,518 INFO L290 TraceCheckUtils]: 140: Hoare triple {76109#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,518 INFO L290 TraceCheckUtils]: 141: Hoare triple {76109#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,518 INFO L290 TraceCheckUtils]: 142: Hoare triple {76109#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,519 INFO L290 TraceCheckUtils]: 143: Hoare triple {76109#false} assume 4384 == #t~mem56;havoc #t~mem56; {76109#false} is VALID [2022-04-28 08:38:02,519 INFO L290 TraceCheckUtils]: 144: Hoare triple {76109#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {76109#false} is VALID [2022-04-28 08:38:02,519 INFO L290 TraceCheckUtils]: 145: Hoare triple {76109#false} assume !(1 == ~blastFlag~0); {76109#false} is VALID [2022-04-28 08:38:02,519 INFO L290 TraceCheckUtils]: 146: Hoare triple {76109#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,519 INFO L290 TraceCheckUtils]: 147: Hoare triple {76109#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,519 INFO L290 TraceCheckUtils]: 148: Hoare triple {76109#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,519 INFO L290 TraceCheckUtils]: 149: Hoare triple {76109#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); {76109#false} is VALID [2022-04-28 08:38:02,519 INFO L290 TraceCheckUtils]: 150: Hoare triple {76109#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76109#false} is VALID [2022-04-28 08:38:02,519 INFO L290 TraceCheckUtils]: 151: Hoare triple {76109#false} ~skip~0 := 0; {76109#false} is VALID [2022-04-28 08:38:02,520 INFO L290 TraceCheckUtils]: 152: Hoare triple {76109#false} assume !false; {76109#false} is VALID [2022-04-28 08:38:02,520 INFO L290 TraceCheckUtils]: 153: Hoare triple {76109#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); {76109#false} is VALID [2022-04-28 08:38:02,520 INFO L290 TraceCheckUtils]: 154: Hoare triple {76109#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,520 INFO L290 TraceCheckUtils]: 155: Hoare triple {76109#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,520 INFO L290 TraceCheckUtils]: 156: Hoare triple {76109#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,520 INFO L290 TraceCheckUtils]: 157: Hoare triple {76109#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,520 INFO L290 TraceCheckUtils]: 158: Hoare triple {76109#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,520 INFO L290 TraceCheckUtils]: 159: Hoare triple {76109#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,520 INFO L290 TraceCheckUtils]: 160: Hoare triple {76109#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,520 INFO L290 TraceCheckUtils]: 161: Hoare triple {76109#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,521 INFO L290 TraceCheckUtils]: 162: Hoare triple {76109#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,521 INFO L290 TraceCheckUtils]: 163: Hoare triple {76109#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,521 INFO L290 TraceCheckUtils]: 164: Hoare triple {76109#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,521 INFO L290 TraceCheckUtils]: 165: Hoare triple {76109#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,521 INFO L290 TraceCheckUtils]: 166: Hoare triple {76109#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {76109#false} is VALID [2022-04-28 08:38:02,521 INFO L290 TraceCheckUtils]: 167: Hoare triple {76109#false} assume 4432 == #t~mem62;havoc #t~mem62; {76109#false} is VALID [2022-04-28 08:38:02,521 INFO L290 TraceCheckUtils]: 168: Hoare triple {76109#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {76109#false} is VALID [2022-04-28 08:38:02,521 INFO L290 TraceCheckUtils]: 169: Hoare triple {76109#false} assume 5 == ~blastFlag~0; {76109#false} is VALID [2022-04-28 08:38:02,521 INFO L290 TraceCheckUtils]: 170: Hoare triple {76109#false} assume !false; {76109#false} is VALID [2022-04-28 08:38:02,522 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-04-28 08:38:02,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:38:02,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235913269] [2022-04-28 08:38:02,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235913269] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:38:02,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:38:02,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:38:02,523 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:38:02,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [811131617] [2022-04-28 08:38:02,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [811131617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:38:02,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:38:02,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:38:02,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933364505] [2022-04-28 08:38:02,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:38:02,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 171 [2022-04-28 08:38:02,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:38:02,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:02,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:38:02,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:38:02,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:38:02,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:38:02,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:38:02,630 INFO L87 Difference]: Start difference. First operand 842 states and 1204 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:04,654 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:38:05,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:38:05,887 INFO L93 Difference]: Finished difference Result 2122 states and 3037 transitions. [2022-04-28 08:38:05,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:38:05,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 171 [2022-04-28 08:38:05,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:38:05,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:05,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-28 08:38:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-28 08:38:05,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-28 08:38:06,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:38:06,379 INFO L225 Difference]: With dead ends: 2122 [2022-04-28 08:38:06,380 INFO L226 Difference]: Without dead ends: 1296 [2022-04-28 08:38:06,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:38:06,382 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 108 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:38:06,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 288 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 389 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:38:06,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2022-04-28 08:38:06,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 947. [2022-04-28 08:38:06,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:38:06,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1296 states. Second operand has 947 states, 942 states have (on average 1.4278131634819533) internal successors, (1345), 942 states have internal predecessors, (1345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:06,546 INFO L74 IsIncluded]: Start isIncluded. First operand 1296 states. Second operand has 947 states, 942 states have (on average 1.4278131634819533) internal successors, (1345), 942 states have internal predecessors, (1345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:06,547 INFO L87 Difference]: Start difference. First operand 1296 states. Second operand has 947 states, 942 states have (on average 1.4278131634819533) internal successors, (1345), 942 states have internal predecessors, (1345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:06,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:38:06,689 INFO L93 Difference]: Finished difference Result 1296 states and 1848 transitions. [2022-04-28 08:38:06,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1848 transitions. [2022-04-28 08:38:06,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:38:06,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:38:06,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 947 states, 942 states have (on average 1.4278131634819533) internal successors, (1345), 942 states have internal predecessors, (1345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1296 states. [2022-04-28 08:38:06,693 INFO L87 Difference]: Start difference. First operand has 947 states, 942 states have (on average 1.4278131634819533) internal successors, (1345), 942 states have internal predecessors, (1345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1296 states. [2022-04-28 08:38:06,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:38:06,836 INFO L93 Difference]: Finished difference Result 1296 states and 1848 transitions. [2022-04-28 08:38:06,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1848 transitions. [2022-04-28 08:38:06,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:38:06,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:38:06,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:38:06,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:38:06,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 942 states have (on average 1.4278131634819533) internal successors, (1345), 942 states have internal predecessors, (1345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:06,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1349 transitions. [2022-04-28 08:38:06,953 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1349 transitions. Word has length 171 [2022-04-28 08:38:06,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:38:06,953 INFO L495 AbstractCegarLoop]: Abstraction has 947 states and 1349 transitions. [2022-04-28 08:38:06,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:06,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 947 states and 1349 transitions. [2022-04-28 08:38:08,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1349 edges. 1349 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:38:08,362 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1349 transitions. [2022-04-28 08:38:08,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-04-28 08:38:08,363 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:38:08,365 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:38:08,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 08:38:08,365 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:38:08,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:38:08,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1837109397, now seen corresponding path program 1 times [2022-04-28 08:38:08,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:38:08,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [12440741] [2022-04-28 08:38:27,442 WARN L232 SmtUtils]: Spent 12.82s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:38:35,359 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:38:35,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1837109397, now seen corresponding path program 2 times [2022-04-28 08:38:35,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:38:35,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820731259] [2022-04-28 08:38:35,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:38:35,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:38:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:38:35,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:38:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:38:35,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {84857#(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); {84850#true} is VALID [2022-04-28 08:38:35,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {84850#true} assume true; {84850#true} is VALID [2022-04-28 08:38:35,542 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {84850#true} {84850#true} #593#return; {84850#true} is VALID [2022-04-28 08:38:35,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {84850#true} call ULTIMATE.init(); {84857#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:38:35,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {84857#(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); {84850#true} is VALID [2022-04-28 08:38:35,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {84850#true} assume true; {84850#true} is VALID [2022-04-28 08:38:35,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84850#true} {84850#true} #593#return; {84850#true} is VALID [2022-04-28 08:38:35,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {84850#true} call #t~ret158 := main(); {84850#true} is VALID [2022-04-28 08:38:35,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {84850#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; {84850#true} is VALID [2022-04-28 08:38:35,544 INFO L272 TraceCheckUtils]: 6: Hoare triple {84850#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {84850#true} is VALID [2022-04-28 08:38:35,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {84850#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); {84850#true} is VALID [2022-04-28 08:38:35,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {84850#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; {84850#true} is VALID [2022-04-28 08:38:35,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {84850#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; {84850#true} is VALID [2022-04-28 08:38:35,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {84850#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {84850#true} is VALID [2022-04-28 08:38:35,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {84850#true} assume !false; {84850#true} is VALID [2022-04-28 08:38:35,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {84850#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {84850#true} assume 12292 == #t~mem49;havoc #t~mem49; {84850#true} is VALID [2022-04-28 08:38:35,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {84850#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; {84850#true} is VALID [2022-04-28 08:38:35,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {84850#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {84850#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {84850#true} is VALID [2022-04-28 08:38:35,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {84850#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,545 INFO L290 TraceCheckUtils]: 18: Hoare triple {84850#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); {84850#true} is VALID [2022-04-28 08:38:35,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {84850#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {84850#true} is VALID [2022-04-28 08:38:35,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {84850#true} assume !(0 == ~tmp___4~0); {84850#true} is VALID [2022-04-28 08:38:35,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {84850#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); {84850#true} is VALID [2022-04-28 08:38:35,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {84850#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); {84850#true} is VALID [2022-04-28 08:38:35,546 INFO L290 TraceCheckUtils]: 23: Hoare triple {84850#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {84850#true} is VALID [2022-04-28 08:38:35,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {84850#true} ~skip~0 := 0; {84850#true} is VALID [2022-04-28 08:38:35,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {84850#true} assume !false; {84850#true} is VALID [2022-04-28 08:38:35,546 INFO L290 TraceCheckUtils]: 26: Hoare triple {84850#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,546 INFO L290 TraceCheckUtils]: 27: Hoare triple {84850#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,546 INFO L290 TraceCheckUtils]: 28: Hoare triple {84850#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {84850#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,546 INFO L290 TraceCheckUtils]: 30: Hoare triple {84850#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,546 INFO L290 TraceCheckUtils]: 31: Hoare triple {84850#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,546 INFO L290 TraceCheckUtils]: 32: Hoare triple {84850#true} assume 4368 == #t~mem54;havoc #t~mem54; {84850#true} is VALID [2022-04-28 08:38:35,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {84850#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; {84850#true} is VALID [2022-04-28 08:38:35,547 INFO L290 TraceCheckUtils]: 34: Hoare triple {84850#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {84850#true} is VALID [2022-04-28 08:38:35,547 INFO L290 TraceCheckUtils]: 35: Hoare triple {84850#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); {84850#true} is VALID [2022-04-28 08:38:35,547 INFO L290 TraceCheckUtils]: 36: Hoare triple {84850#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; {84850#true} is VALID [2022-04-28 08:38:35,547 INFO L290 TraceCheckUtils]: 37: Hoare triple {84850#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); {84850#true} is VALID [2022-04-28 08:38:35,547 INFO L290 TraceCheckUtils]: 38: Hoare triple {84850#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {84850#true} is VALID [2022-04-28 08:38:35,547 INFO L290 TraceCheckUtils]: 39: Hoare triple {84850#true} ~skip~0 := 0; {84850#true} is VALID [2022-04-28 08:38:35,547 INFO L290 TraceCheckUtils]: 40: Hoare triple {84850#true} assume !false; {84850#true} is VALID [2022-04-28 08:38:35,547 INFO L290 TraceCheckUtils]: 41: Hoare triple {84850#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,547 INFO L290 TraceCheckUtils]: 42: Hoare triple {84850#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,548 INFO L290 TraceCheckUtils]: 43: Hoare triple {84850#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,548 INFO L290 TraceCheckUtils]: 44: Hoare triple {84850#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,548 INFO L290 TraceCheckUtils]: 45: Hoare triple {84850#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,548 INFO L290 TraceCheckUtils]: 46: Hoare triple {84850#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,548 INFO L290 TraceCheckUtils]: 47: Hoare triple {84850#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,548 INFO L290 TraceCheckUtils]: 48: Hoare triple {84850#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,548 INFO L290 TraceCheckUtils]: 49: Hoare triple {84850#true} assume 4384 == #t~mem56;havoc #t~mem56; {84850#true} is VALID [2022-04-28 08:38:35,548 INFO L290 TraceCheckUtils]: 50: Hoare triple {84850#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {84850#true} is VALID [2022-04-28 08:38:35,548 INFO L290 TraceCheckUtils]: 51: Hoare triple {84850#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {84850#true} is VALID [2022-04-28 08:38:35,548 INFO L290 TraceCheckUtils]: 52: Hoare triple {84850#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,549 INFO L290 TraceCheckUtils]: 53: Hoare triple {84850#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,549 INFO L290 TraceCheckUtils]: 54: Hoare triple {84850#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,549 INFO L290 TraceCheckUtils]: 55: Hoare triple {84850#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); {84850#true} is VALID [2022-04-28 08:38:35,549 INFO L290 TraceCheckUtils]: 56: Hoare triple {84850#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {84850#true} is VALID [2022-04-28 08:38:35,549 INFO L290 TraceCheckUtils]: 57: Hoare triple {84850#true} ~skip~0 := 0; {84850#true} is VALID [2022-04-28 08:38:35,549 INFO L290 TraceCheckUtils]: 58: Hoare triple {84850#true} assume !false; {84850#true} is VALID [2022-04-28 08:38:35,549 INFO L290 TraceCheckUtils]: 59: Hoare triple {84850#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,549 INFO L290 TraceCheckUtils]: 60: Hoare triple {84850#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,549 INFO L290 TraceCheckUtils]: 61: Hoare triple {84850#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,549 INFO L290 TraceCheckUtils]: 62: Hoare triple {84850#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,550 INFO L290 TraceCheckUtils]: 63: Hoare triple {84850#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,550 INFO L290 TraceCheckUtils]: 64: Hoare triple {84850#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,550 INFO L290 TraceCheckUtils]: 65: Hoare triple {84850#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,550 INFO L290 TraceCheckUtils]: 66: Hoare triple {84850#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,550 INFO L290 TraceCheckUtils]: 67: Hoare triple {84850#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,550 INFO L290 TraceCheckUtils]: 68: Hoare triple {84850#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,550 INFO L290 TraceCheckUtils]: 69: Hoare triple {84850#true} assume 4400 == #t~mem58;havoc #t~mem58; {84850#true} is VALID [2022-04-28 08:38:35,550 INFO L290 TraceCheckUtils]: 70: Hoare triple {84850#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); {84850#true} is VALID [2022-04-28 08:38:35,550 INFO L290 TraceCheckUtils]: 71: Hoare triple {84850#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; {84850#true} is VALID [2022-04-28 08:38:35,550 INFO L290 TraceCheckUtils]: 72: Hoare triple {84850#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {84850#true} is VALID [2022-04-28 08:38:35,551 INFO L290 TraceCheckUtils]: 73: Hoare triple {84850#true} assume !(~ret~0 <= 0); {84850#true} is VALID [2022-04-28 08:38:35,551 INFO L290 TraceCheckUtils]: 74: Hoare triple {84850#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,551 INFO L290 TraceCheckUtils]: 75: Hoare triple {84850#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); {84850#true} is VALID [2022-04-28 08:38:35,551 INFO L290 TraceCheckUtils]: 76: Hoare triple {84850#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {84850#true} is VALID [2022-04-28 08:38:35,551 INFO L290 TraceCheckUtils]: 77: Hoare triple {84850#true} ~skip~0 := 0; {84850#true} is VALID [2022-04-28 08:38:35,551 INFO L290 TraceCheckUtils]: 78: Hoare triple {84850#true} assume !false; {84850#true} is VALID [2022-04-28 08:38:35,551 INFO L290 TraceCheckUtils]: 79: Hoare triple {84850#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,551 INFO L290 TraceCheckUtils]: 80: Hoare triple {84850#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,551 INFO L290 TraceCheckUtils]: 81: Hoare triple {84850#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,551 INFO L290 TraceCheckUtils]: 82: Hoare triple {84850#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,552 INFO L290 TraceCheckUtils]: 83: Hoare triple {84850#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,552 INFO L290 TraceCheckUtils]: 84: Hoare triple {84850#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,552 INFO L290 TraceCheckUtils]: 85: Hoare triple {84850#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,552 INFO L290 TraceCheckUtils]: 86: Hoare triple {84850#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,552 INFO L290 TraceCheckUtils]: 87: Hoare triple {84850#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,552 INFO L290 TraceCheckUtils]: 88: Hoare triple {84850#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,552 INFO L290 TraceCheckUtils]: 89: Hoare triple {84850#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,552 INFO L290 TraceCheckUtils]: 90: Hoare triple {84850#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {84850#true} is VALID [2022-04-28 08:38:35,552 INFO L290 TraceCheckUtils]: 91: Hoare triple {84850#true} assume 4416 == #t~mem60;havoc #t~mem60; {84850#true} is VALID [2022-04-28 08:38:35,553 INFO L290 TraceCheckUtils]: 92: Hoare triple {84850#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {84850#true} is VALID [2022-04-28 08:38:35,553 INFO L290 TraceCheckUtils]: 93: Hoare triple {84850#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {84850#true} is VALID [2022-04-28 08:38:35,557 INFO L290 TraceCheckUtils]: 94: Hoare triple {84850#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); {84855#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:38:35,558 INFO L290 TraceCheckUtils]: 95: Hoare triple {84855#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {84855#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:38:35,558 INFO L290 TraceCheckUtils]: 96: Hoare triple {84855#(= 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); {84855#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:38:35,559 INFO L290 TraceCheckUtils]: 97: Hoare triple {84855#(= 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; {84855#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:38:35,559 INFO L290 TraceCheckUtils]: 98: Hoare triple {84855#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {84855#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:38:35,559 INFO L290 TraceCheckUtils]: 99: Hoare triple {84855#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {84855#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:38:35,560 INFO L290 TraceCheckUtils]: 100: Hoare triple {84855#(= 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); {84855#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:38:35,560 INFO L290 TraceCheckUtils]: 101: Hoare triple {84855#(= 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); {84855#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:38:35,560 INFO L290 TraceCheckUtils]: 102: Hoare triple {84855#(= 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); {84855#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:38:35,560 INFO L290 TraceCheckUtils]: 103: Hoare triple {84855#(= 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); {84855#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:38:35,561 INFO L290 TraceCheckUtils]: 104: Hoare triple {84855#(= 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); {84855#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:38:35,561 INFO L290 TraceCheckUtils]: 105: Hoare triple {84855#(= 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); {84855#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:38:35,562 INFO L290 TraceCheckUtils]: 106: Hoare triple {84855#(= 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); {84855#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:38:35,562 INFO L290 TraceCheckUtils]: 107: Hoare triple {84855#(= 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); {84855#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:38:35,563 INFO L290 TraceCheckUtils]: 108: Hoare triple {84855#(= 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); {84856#(= |ssl3_connect_#t~mem57| 4432)} is VALID [2022-04-28 08:38:35,563 INFO L290 TraceCheckUtils]: 109: Hoare triple {84856#(= |ssl3_connect_#t~mem57| 4432)} assume 4385 == #t~mem57;havoc #t~mem57; {84851#false} is VALID [2022-04-28 08:38:35,564 INFO L290 TraceCheckUtils]: 110: Hoare triple {84851#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {84851#false} is VALID [2022-04-28 08:38:35,564 INFO L290 TraceCheckUtils]: 111: Hoare triple {84851#false} assume !(1 == ~blastFlag~0); {84851#false} is VALID [2022-04-28 08:38:35,564 INFO L290 TraceCheckUtils]: 112: Hoare triple {84851#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,565 INFO L290 TraceCheckUtils]: 113: Hoare triple {84851#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,565 INFO L290 TraceCheckUtils]: 114: Hoare triple {84851#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,565 INFO L290 TraceCheckUtils]: 115: Hoare triple {84851#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); {84851#false} is VALID [2022-04-28 08:38:35,566 INFO L290 TraceCheckUtils]: 116: Hoare triple {84851#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {84851#false} is VALID [2022-04-28 08:38:35,566 INFO L290 TraceCheckUtils]: 117: Hoare triple {84851#false} ~skip~0 := 0; {84851#false} is VALID [2022-04-28 08:38:35,566 INFO L290 TraceCheckUtils]: 118: Hoare triple {84851#false} assume !false; {84851#false} is VALID [2022-04-28 08:38:35,566 INFO L290 TraceCheckUtils]: 119: Hoare triple {84851#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); {84851#false} is VALID [2022-04-28 08:38:35,567 INFO L290 TraceCheckUtils]: 120: Hoare triple {84851#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,567 INFO L290 TraceCheckUtils]: 121: Hoare triple {84851#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,567 INFO L290 TraceCheckUtils]: 122: Hoare triple {84851#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,567 INFO L290 TraceCheckUtils]: 123: Hoare triple {84851#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,567 INFO L290 TraceCheckUtils]: 124: Hoare triple {84851#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,567 INFO L290 TraceCheckUtils]: 125: Hoare triple {84851#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,567 INFO L290 TraceCheckUtils]: 126: Hoare triple {84851#false} assume 4369 == #t~mem55;havoc #t~mem55; {84851#false} is VALID [2022-04-28 08:38:35,567 INFO L290 TraceCheckUtils]: 127: Hoare triple {84851#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; {84851#false} is VALID [2022-04-28 08:38:35,567 INFO L290 TraceCheckUtils]: 128: Hoare triple {84851#false} assume !(0 == ~blastFlag~0); {84851#false} is VALID [2022-04-28 08:38:35,567 INFO L290 TraceCheckUtils]: 129: Hoare triple {84851#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {84851#false} is VALID [2022-04-28 08:38:35,568 INFO L290 TraceCheckUtils]: 130: Hoare triple {84851#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); {84851#false} is VALID [2022-04-28 08:38:35,568 INFO L290 TraceCheckUtils]: 131: Hoare triple {84851#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; {84851#false} is VALID [2022-04-28 08:38:35,568 INFO L290 TraceCheckUtils]: 132: Hoare triple {84851#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); {84851#false} is VALID [2022-04-28 08:38:35,568 INFO L290 TraceCheckUtils]: 133: Hoare triple {84851#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {84851#false} is VALID [2022-04-28 08:38:35,568 INFO L290 TraceCheckUtils]: 134: Hoare triple {84851#false} ~skip~0 := 0; {84851#false} is VALID [2022-04-28 08:38:35,568 INFO L290 TraceCheckUtils]: 135: Hoare triple {84851#false} assume !false; {84851#false} is VALID [2022-04-28 08:38:35,568 INFO L290 TraceCheckUtils]: 136: Hoare triple {84851#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); {84851#false} is VALID [2022-04-28 08:38:35,568 INFO L290 TraceCheckUtils]: 137: Hoare triple {84851#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,568 INFO L290 TraceCheckUtils]: 138: Hoare triple {84851#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,568 INFO L290 TraceCheckUtils]: 139: Hoare triple {84851#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,568 INFO L290 TraceCheckUtils]: 140: Hoare triple {84851#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,568 INFO L290 TraceCheckUtils]: 141: Hoare triple {84851#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,569 INFO L290 TraceCheckUtils]: 142: Hoare triple {84851#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,569 INFO L290 TraceCheckUtils]: 143: Hoare triple {84851#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,569 INFO L290 TraceCheckUtils]: 144: Hoare triple {84851#false} assume 4384 == #t~mem56;havoc #t~mem56; {84851#false} is VALID [2022-04-28 08:38:35,569 INFO L290 TraceCheckUtils]: 145: Hoare triple {84851#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {84851#false} is VALID [2022-04-28 08:38:35,569 INFO L290 TraceCheckUtils]: 146: Hoare triple {84851#false} assume !(1 == ~blastFlag~0); {84851#false} is VALID [2022-04-28 08:38:35,569 INFO L290 TraceCheckUtils]: 147: Hoare triple {84851#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,569 INFO L290 TraceCheckUtils]: 148: Hoare triple {84851#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,569 INFO L290 TraceCheckUtils]: 149: Hoare triple {84851#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,569 INFO L290 TraceCheckUtils]: 150: Hoare triple {84851#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); {84851#false} is VALID [2022-04-28 08:38:35,569 INFO L290 TraceCheckUtils]: 151: Hoare triple {84851#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {84851#false} is VALID [2022-04-28 08:38:35,569 INFO L290 TraceCheckUtils]: 152: Hoare triple {84851#false} ~skip~0 := 0; {84851#false} is VALID [2022-04-28 08:38:35,569 INFO L290 TraceCheckUtils]: 153: Hoare triple {84851#false} assume !false; {84851#false} is VALID [2022-04-28 08:38:35,569 INFO L290 TraceCheckUtils]: 154: Hoare triple {84851#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); {84851#false} is VALID [2022-04-28 08:38:35,570 INFO L290 TraceCheckUtils]: 155: Hoare triple {84851#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,570 INFO L290 TraceCheckUtils]: 156: Hoare triple {84851#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,570 INFO L290 TraceCheckUtils]: 157: Hoare triple {84851#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,570 INFO L290 TraceCheckUtils]: 158: Hoare triple {84851#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,570 INFO L290 TraceCheckUtils]: 159: Hoare triple {84851#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,570 INFO L290 TraceCheckUtils]: 160: Hoare triple {84851#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,570 INFO L290 TraceCheckUtils]: 161: Hoare triple {84851#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,570 INFO L290 TraceCheckUtils]: 162: Hoare triple {84851#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,570 INFO L290 TraceCheckUtils]: 163: Hoare triple {84851#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,570 INFO L290 TraceCheckUtils]: 164: Hoare triple {84851#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,571 INFO L290 TraceCheckUtils]: 165: Hoare triple {84851#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,571 INFO L290 TraceCheckUtils]: 166: Hoare triple {84851#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,571 INFO L290 TraceCheckUtils]: 167: Hoare triple {84851#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {84851#false} is VALID [2022-04-28 08:38:35,571 INFO L290 TraceCheckUtils]: 168: Hoare triple {84851#false} assume 4432 == #t~mem62;havoc #t~mem62; {84851#false} is VALID [2022-04-28 08:38:35,571 INFO L290 TraceCheckUtils]: 169: Hoare triple {84851#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {84851#false} is VALID [2022-04-28 08:38:35,571 INFO L290 TraceCheckUtils]: 170: Hoare triple {84851#false} assume 5 == ~blastFlag~0; {84851#false} is VALID [2022-04-28 08:38:35,571 INFO L290 TraceCheckUtils]: 171: Hoare triple {84851#false} assume !false; {84851#false} is VALID [2022-04-28 08:38:35,572 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-04-28 08:38:35,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:38:35,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820731259] [2022-04-28 08:38:35,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820731259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:38:35,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:38:35,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:38:35,573 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:38:35,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [12440741] [2022-04-28 08:38:35,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [12440741] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:38:35,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:38:35,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:38:35,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200598392] [2022-04-28 08:38:35,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:38:35,574 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 172 [2022-04-28 08:38:35,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:38:35,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:35,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:38:35,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:38:35,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:38:35,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:38:35,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:38:35,648 INFO L87 Difference]: Start difference. First operand 947 states and 1349 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:37,671 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:38:39,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:38:39,076 INFO L93 Difference]: Finished difference Result 2105 states and 3015 transitions. [2022-04-28 08:38:39,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:38:39,076 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 172 [2022-04-28 08:38:39,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:38:39,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-28 08:38:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:39,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-28 08:38:39,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-28 08:38:39,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:38:39,431 INFO L225 Difference]: With dead ends: 2105 [2022-04-28 08:38:39,431 INFO L226 Difference]: Without dead ends: 1174 [2022-04-28 08:38:39,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:38:39,433 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 78 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 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-28 08:38:39,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 537 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 490 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:38:39,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2022-04-28 08:38:39,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 955. [2022-04-28 08:38:39,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:38:39,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1174 states. Second operand has 955 states, 950 states have (on average 1.4242105263157894) internal successors, (1353), 950 states have internal predecessors, (1353), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:39,502 INFO L74 IsIncluded]: Start isIncluded. First operand 1174 states. Second operand has 955 states, 950 states have (on average 1.4242105263157894) internal successors, (1353), 950 states have internal predecessors, (1353), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:39,503 INFO L87 Difference]: Start difference. First operand 1174 states. Second operand has 955 states, 950 states have (on average 1.4242105263157894) internal successors, (1353), 950 states have internal predecessors, (1353), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:39,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:38:39,546 INFO L93 Difference]: Finished difference Result 1174 states and 1682 transitions. [2022-04-28 08:38:39,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1682 transitions. [2022-04-28 08:38:39,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:38:39,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:38:39,549 INFO L74 IsIncluded]: Start isIncluded. First operand has 955 states, 950 states have (on average 1.4242105263157894) internal successors, (1353), 950 states have internal predecessors, (1353), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1174 states. [2022-04-28 08:38:39,549 INFO L87 Difference]: Start difference. First operand has 955 states, 950 states have (on average 1.4242105263157894) internal successors, (1353), 950 states have internal predecessors, (1353), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1174 states. [2022-04-28 08:38:39,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:38:39,605 INFO L93 Difference]: Finished difference Result 1174 states and 1682 transitions. [2022-04-28 08:38:39,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1682 transitions. [2022-04-28 08:38:39,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:38:39,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:38:39,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:38:39,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:38:39,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 950 states have (on average 1.4242105263157894) internal successors, (1353), 950 states have internal predecessors, (1353), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:39,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1357 transitions. [2022-04-28 08:38:39,648 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1357 transitions. Word has length 172 [2022-04-28 08:38:39,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:38:39,648 INFO L495 AbstractCegarLoop]: Abstraction has 955 states and 1357 transitions. [2022-04-28 08:38:39,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:39,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 955 states and 1357 transitions. [2022-04-28 08:38:40,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1357 edges. 1357 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:38:40,976 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1357 transitions. [2022-04-28 08:38:40,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-04-28 08:38:40,978 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:38:40,978 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:38:40,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 08:38:40,978 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:38:40,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:38:40,979 INFO L85 PathProgramCache]: Analyzing trace with hash -68628705, now seen corresponding path program 1 times [2022-04-28 08:38:40,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:38:40,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [203167745] [2022-04-28 08:38:55,538 WARN L232 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:39:02,756 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:39:02,756 INFO L85 PathProgramCache]: Analyzing trace with hash -68628705, now seen corresponding path program 2 times [2022-04-28 08:39:02,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:39:02,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233174397] [2022-04-28 08:39:02,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:39:02,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:39:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:02,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:39:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:02,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {93337#(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); {93330#true} is VALID [2022-04-28 08:39:02,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {93330#true} assume true; {93330#true} is VALID [2022-04-28 08:39:02,943 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {93330#true} {93330#true} #593#return; {93330#true} is VALID [2022-04-28 08:39:02,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {93330#true} call ULTIMATE.init(); {93337#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:39:02,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {93337#(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); {93330#true} is VALID [2022-04-28 08:39:02,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {93330#true} assume true; {93330#true} is VALID [2022-04-28 08:39:02,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93330#true} {93330#true} #593#return; {93330#true} is VALID [2022-04-28 08:39:02,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {93330#true} call #t~ret158 := main(); {93330#true} is VALID [2022-04-28 08:39:02,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {93330#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; {93330#true} is VALID [2022-04-28 08:39:02,945 INFO L272 TraceCheckUtils]: 6: Hoare triple {93330#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {93330#true} is VALID [2022-04-28 08:39:02,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {93330#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); {93330#true} is VALID [2022-04-28 08:39:02,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {93330#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; {93330#true} is VALID [2022-04-28 08:39:02,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {93330#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; {93330#true} is VALID [2022-04-28 08:39:02,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {93330#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {93330#true} is VALID [2022-04-28 08:39:02,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {93330#true} assume !false; {93330#true} is VALID [2022-04-28 08:39:02,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {93330#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {93330#true} assume 12292 == #t~mem49;havoc #t~mem49; {93330#true} is VALID [2022-04-28 08:39:02,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {93330#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; {93330#true} is VALID [2022-04-28 08:39:02,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {93330#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {93330#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {93330#true} is VALID [2022-04-28 08:39:02,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {93330#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {93330#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); {93330#true} is VALID [2022-04-28 08:39:02,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {93330#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {93330#true} is VALID [2022-04-28 08:39:02,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {93330#true} assume !(0 == ~tmp___4~0); {93330#true} is VALID [2022-04-28 08:39:02,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {93330#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); {93330#true} is VALID [2022-04-28 08:39:02,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {93330#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); {93330#true} is VALID [2022-04-28 08:39:02,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {93330#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {93330#true} is VALID [2022-04-28 08:39:02,947 INFO L290 TraceCheckUtils]: 24: Hoare triple {93330#true} ~skip~0 := 0; {93330#true} is VALID [2022-04-28 08:39:02,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {93330#true} assume !false; {93330#true} is VALID [2022-04-28 08:39:02,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {93330#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {93330#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {93330#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {93330#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {93330#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {93330#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {93330#true} assume 4368 == #t~mem54;havoc #t~mem54; {93330#true} is VALID [2022-04-28 08:39:02,948 INFO L290 TraceCheckUtils]: 33: Hoare triple {93330#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; {93330#true} is VALID [2022-04-28 08:39:02,948 INFO L290 TraceCheckUtils]: 34: Hoare triple {93330#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {93330#true} is VALID [2022-04-28 08:39:02,948 INFO L290 TraceCheckUtils]: 35: Hoare triple {93330#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); {93330#true} is VALID [2022-04-28 08:39:02,948 INFO L290 TraceCheckUtils]: 36: Hoare triple {93330#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; {93330#true} is VALID [2022-04-28 08:39:02,948 INFO L290 TraceCheckUtils]: 37: Hoare triple {93330#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); {93330#true} is VALID [2022-04-28 08:39:02,948 INFO L290 TraceCheckUtils]: 38: Hoare triple {93330#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {93330#true} is VALID [2022-04-28 08:39:02,948 INFO L290 TraceCheckUtils]: 39: Hoare triple {93330#true} ~skip~0 := 0; {93330#true} is VALID [2022-04-28 08:39:02,948 INFO L290 TraceCheckUtils]: 40: Hoare triple {93330#true} assume !false; {93330#true} is VALID [2022-04-28 08:39:02,948 INFO L290 TraceCheckUtils]: 41: Hoare triple {93330#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,948 INFO L290 TraceCheckUtils]: 42: Hoare triple {93330#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,949 INFO L290 TraceCheckUtils]: 43: Hoare triple {93330#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,949 INFO L290 TraceCheckUtils]: 44: Hoare triple {93330#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,949 INFO L290 TraceCheckUtils]: 45: Hoare triple {93330#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,949 INFO L290 TraceCheckUtils]: 46: Hoare triple {93330#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,949 INFO L290 TraceCheckUtils]: 47: Hoare triple {93330#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,949 INFO L290 TraceCheckUtils]: 48: Hoare triple {93330#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,949 INFO L290 TraceCheckUtils]: 49: Hoare triple {93330#true} assume 4384 == #t~mem56;havoc #t~mem56; {93330#true} is VALID [2022-04-28 08:39:02,950 INFO L290 TraceCheckUtils]: 50: Hoare triple {93330#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {93330#true} is VALID [2022-04-28 08:39:02,950 INFO L290 TraceCheckUtils]: 51: Hoare triple {93330#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {93330#true} is VALID [2022-04-28 08:39:02,951 INFO L290 TraceCheckUtils]: 52: Hoare triple {93330#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,951 INFO L290 TraceCheckUtils]: 53: Hoare triple {93330#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,951 INFO L290 TraceCheckUtils]: 54: Hoare triple {93330#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,951 INFO L290 TraceCheckUtils]: 55: Hoare triple {93330#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); {93330#true} is VALID [2022-04-28 08:39:02,951 INFO L290 TraceCheckUtils]: 56: Hoare triple {93330#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {93330#true} is VALID [2022-04-28 08:39:02,951 INFO L290 TraceCheckUtils]: 57: Hoare triple {93330#true} ~skip~0 := 0; {93330#true} is VALID [2022-04-28 08:39:02,951 INFO L290 TraceCheckUtils]: 58: Hoare triple {93330#true} assume !false; {93330#true} is VALID [2022-04-28 08:39:02,951 INFO L290 TraceCheckUtils]: 59: Hoare triple {93330#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,951 INFO L290 TraceCheckUtils]: 60: Hoare triple {93330#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,951 INFO L290 TraceCheckUtils]: 61: Hoare triple {93330#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,952 INFO L290 TraceCheckUtils]: 62: Hoare triple {93330#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,952 INFO L290 TraceCheckUtils]: 63: Hoare triple {93330#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,952 INFO L290 TraceCheckUtils]: 64: Hoare triple {93330#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,952 INFO L290 TraceCheckUtils]: 65: Hoare triple {93330#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,952 INFO L290 TraceCheckUtils]: 66: Hoare triple {93330#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,952 INFO L290 TraceCheckUtils]: 67: Hoare triple {93330#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,952 INFO L290 TraceCheckUtils]: 68: Hoare triple {93330#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,952 INFO L290 TraceCheckUtils]: 69: Hoare triple {93330#true} assume 4400 == #t~mem58;havoc #t~mem58; {93330#true} is VALID [2022-04-28 08:39:02,952 INFO L290 TraceCheckUtils]: 70: Hoare triple {93330#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); {93330#true} is VALID [2022-04-28 08:39:02,952 INFO L290 TraceCheckUtils]: 71: Hoare triple {93330#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; {93330#true} is VALID [2022-04-28 08:39:02,952 INFO L290 TraceCheckUtils]: 72: Hoare triple {93330#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {93330#true} is VALID [2022-04-28 08:39:02,953 INFO L290 TraceCheckUtils]: 73: Hoare triple {93330#true} assume !(~ret~0 <= 0); {93330#true} is VALID [2022-04-28 08:39:02,953 INFO L290 TraceCheckUtils]: 74: Hoare triple {93330#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,953 INFO L290 TraceCheckUtils]: 75: Hoare triple {93330#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); {93330#true} is VALID [2022-04-28 08:39:02,953 INFO L290 TraceCheckUtils]: 76: Hoare triple {93330#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {93330#true} is VALID [2022-04-28 08:39:02,953 INFO L290 TraceCheckUtils]: 77: Hoare triple {93330#true} ~skip~0 := 0; {93330#true} is VALID [2022-04-28 08:39:02,953 INFO L290 TraceCheckUtils]: 78: Hoare triple {93330#true} assume !false; {93330#true} is VALID [2022-04-28 08:39:02,953 INFO L290 TraceCheckUtils]: 79: Hoare triple {93330#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,953 INFO L290 TraceCheckUtils]: 80: Hoare triple {93330#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,953 INFO L290 TraceCheckUtils]: 81: Hoare triple {93330#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,953 INFO L290 TraceCheckUtils]: 82: Hoare triple {93330#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,954 INFO L290 TraceCheckUtils]: 83: Hoare triple {93330#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,954 INFO L290 TraceCheckUtils]: 84: Hoare triple {93330#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,954 INFO L290 TraceCheckUtils]: 85: Hoare triple {93330#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,954 INFO L290 TraceCheckUtils]: 86: Hoare triple {93330#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,954 INFO L290 TraceCheckUtils]: 87: Hoare triple {93330#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,954 INFO L290 TraceCheckUtils]: 88: Hoare triple {93330#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,954 INFO L290 TraceCheckUtils]: 89: Hoare triple {93330#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,954 INFO L290 TraceCheckUtils]: 90: Hoare triple {93330#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {93330#true} is VALID [2022-04-28 08:39:02,954 INFO L290 TraceCheckUtils]: 91: Hoare triple {93330#true} assume 4416 == #t~mem60;havoc #t~mem60; {93330#true} is VALID [2022-04-28 08:39:02,954 INFO L290 TraceCheckUtils]: 92: Hoare triple {93330#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {93330#true} is VALID [2022-04-28 08:39:02,955 INFO L290 TraceCheckUtils]: 93: Hoare triple {93330#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {93330#true} is VALID [2022-04-28 08:39:02,956 INFO L290 TraceCheckUtils]: 94: Hoare triple {93330#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); {93335#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:02,956 INFO L290 TraceCheckUtils]: 95: Hoare triple {93335#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {93335#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:02,957 INFO L290 TraceCheckUtils]: 96: Hoare triple {93335#(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); {93335#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:02,957 INFO L290 TraceCheckUtils]: 97: Hoare triple {93335#(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; {93335#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:02,957 INFO L290 TraceCheckUtils]: 98: Hoare triple {93335#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {93335#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:02,958 INFO L290 TraceCheckUtils]: 99: Hoare triple {93335#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {93335#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:02,958 INFO L290 TraceCheckUtils]: 100: Hoare triple {93335#(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); {93335#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:02,959 INFO L290 TraceCheckUtils]: 101: Hoare triple {93335#(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); {93335#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:02,959 INFO L290 TraceCheckUtils]: 102: Hoare triple {93335#(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); {93335#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:02,959 INFO L290 TraceCheckUtils]: 103: Hoare triple {93335#(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); {93335#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:02,960 INFO L290 TraceCheckUtils]: 104: Hoare triple {93335#(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); {93335#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:02,960 INFO L290 TraceCheckUtils]: 105: Hoare triple {93335#(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); {93335#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:02,961 INFO L290 TraceCheckUtils]: 106: Hoare triple {93335#(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); {93335#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:02,961 INFO L290 TraceCheckUtils]: 107: Hoare triple {93335#(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); {93335#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:02,961 INFO L290 TraceCheckUtils]: 108: Hoare triple {93335#(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); {93335#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:02,962 INFO L290 TraceCheckUtils]: 109: Hoare triple {93335#(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); {93335#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:02,962 INFO L290 TraceCheckUtils]: 110: Hoare triple {93335#(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); {93336#(not (= |ssl3_connect_#t~mem59| 4401))} is VALID [2022-04-28 08:39:02,962 INFO L290 TraceCheckUtils]: 111: Hoare triple {93336#(not (= |ssl3_connect_#t~mem59| 4401))} assume 4401 == #t~mem59;havoc #t~mem59; {93331#false} is VALID [2022-04-28 08:39:02,963 INFO L290 TraceCheckUtils]: 112: Hoare triple {93331#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); {93331#false} is VALID [2022-04-28 08:39:02,963 INFO L290 TraceCheckUtils]: 113: Hoare triple {93331#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; {93331#false} is VALID [2022-04-28 08:39:02,963 INFO L290 TraceCheckUtils]: 114: Hoare triple {93331#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,963 INFO L290 TraceCheckUtils]: 115: Hoare triple {93331#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); {93331#false} is VALID [2022-04-28 08:39:02,963 INFO L290 TraceCheckUtils]: 116: Hoare triple {93331#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {93331#false} is VALID [2022-04-28 08:39:02,963 INFO L290 TraceCheckUtils]: 117: Hoare triple {93331#false} ~skip~0 := 0; {93331#false} is VALID [2022-04-28 08:39:02,963 INFO L290 TraceCheckUtils]: 118: Hoare triple {93331#false} assume !false; {93331#false} is VALID [2022-04-28 08:39:02,963 INFO L290 TraceCheckUtils]: 119: Hoare triple {93331#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); {93331#false} is VALID [2022-04-28 08:39:02,963 INFO L290 TraceCheckUtils]: 120: Hoare triple {93331#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,964 INFO L290 TraceCheckUtils]: 121: Hoare triple {93331#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,964 INFO L290 TraceCheckUtils]: 122: Hoare triple {93331#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,964 INFO L290 TraceCheckUtils]: 123: Hoare triple {93331#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,964 INFO L290 TraceCheckUtils]: 124: Hoare triple {93331#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,964 INFO L290 TraceCheckUtils]: 125: Hoare triple {93331#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,964 INFO L290 TraceCheckUtils]: 126: Hoare triple {93331#false} assume 4369 == #t~mem55;havoc #t~mem55; {93331#false} is VALID [2022-04-28 08:39:02,964 INFO L290 TraceCheckUtils]: 127: Hoare triple {93331#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; {93331#false} is VALID [2022-04-28 08:39:02,964 INFO L290 TraceCheckUtils]: 128: Hoare triple {93331#false} assume !(0 == ~blastFlag~0); {93331#false} is VALID [2022-04-28 08:39:02,964 INFO L290 TraceCheckUtils]: 129: Hoare triple {93331#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {93331#false} is VALID [2022-04-28 08:39:02,964 INFO L290 TraceCheckUtils]: 130: Hoare triple {93331#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); {93331#false} is VALID [2022-04-28 08:39:02,965 INFO L290 TraceCheckUtils]: 131: Hoare triple {93331#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; {93331#false} is VALID [2022-04-28 08:39:02,965 INFO L290 TraceCheckUtils]: 132: Hoare triple {93331#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); {93331#false} is VALID [2022-04-28 08:39:02,965 INFO L290 TraceCheckUtils]: 133: Hoare triple {93331#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {93331#false} is VALID [2022-04-28 08:39:02,965 INFO L290 TraceCheckUtils]: 134: Hoare triple {93331#false} ~skip~0 := 0; {93331#false} is VALID [2022-04-28 08:39:02,965 INFO L290 TraceCheckUtils]: 135: Hoare triple {93331#false} assume !false; {93331#false} is VALID [2022-04-28 08:39:02,965 INFO L290 TraceCheckUtils]: 136: Hoare triple {93331#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); {93331#false} is VALID [2022-04-28 08:39:02,965 INFO L290 TraceCheckUtils]: 137: Hoare triple {93331#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,965 INFO L290 TraceCheckUtils]: 138: Hoare triple {93331#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,965 INFO L290 TraceCheckUtils]: 139: Hoare triple {93331#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,965 INFO L290 TraceCheckUtils]: 140: Hoare triple {93331#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,965 INFO L290 TraceCheckUtils]: 141: Hoare triple {93331#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,966 INFO L290 TraceCheckUtils]: 142: Hoare triple {93331#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,966 INFO L290 TraceCheckUtils]: 143: Hoare triple {93331#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,966 INFO L290 TraceCheckUtils]: 144: Hoare triple {93331#false} assume 4384 == #t~mem56;havoc #t~mem56; {93331#false} is VALID [2022-04-28 08:39:02,966 INFO L290 TraceCheckUtils]: 145: Hoare triple {93331#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {93331#false} is VALID [2022-04-28 08:39:02,966 INFO L290 TraceCheckUtils]: 146: Hoare triple {93331#false} assume !(1 == ~blastFlag~0); {93331#false} is VALID [2022-04-28 08:39:02,966 INFO L290 TraceCheckUtils]: 147: Hoare triple {93331#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,966 INFO L290 TraceCheckUtils]: 148: Hoare triple {93331#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,966 INFO L290 TraceCheckUtils]: 149: Hoare triple {93331#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,966 INFO L290 TraceCheckUtils]: 150: Hoare triple {93331#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); {93331#false} is VALID [2022-04-28 08:39:02,967 INFO L290 TraceCheckUtils]: 151: Hoare triple {93331#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {93331#false} is VALID [2022-04-28 08:39:02,967 INFO L290 TraceCheckUtils]: 152: Hoare triple {93331#false} ~skip~0 := 0; {93331#false} is VALID [2022-04-28 08:39:02,967 INFO L290 TraceCheckUtils]: 153: Hoare triple {93331#false} assume !false; {93331#false} is VALID [2022-04-28 08:39:02,967 INFO L290 TraceCheckUtils]: 154: Hoare triple {93331#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); {93331#false} is VALID [2022-04-28 08:39:02,967 INFO L290 TraceCheckUtils]: 155: Hoare triple {93331#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,967 INFO L290 TraceCheckUtils]: 156: Hoare triple {93331#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,967 INFO L290 TraceCheckUtils]: 157: Hoare triple {93331#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,967 INFO L290 TraceCheckUtils]: 158: Hoare triple {93331#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,967 INFO L290 TraceCheckUtils]: 159: Hoare triple {93331#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,967 INFO L290 TraceCheckUtils]: 160: Hoare triple {93331#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,968 INFO L290 TraceCheckUtils]: 161: Hoare triple {93331#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,968 INFO L290 TraceCheckUtils]: 162: Hoare triple {93331#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,968 INFO L290 TraceCheckUtils]: 163: Hoare triple {93331#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,968 INFO L290 TraceCheckUtils]: 164: Hoare triple {93331#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,968 INFO L290 TraceCheckUtils]: 165: Hoare triple {93331#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,968 INFO L290 TraceCheckUtils]: 166: Hoare triple {93331#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,968 INFO L290 TraceCheckUtils]: 167: Hoare triple {93331#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {93331#false} is VALID [2022-04-28 08:39:02,968 INFO L290 TraceCheckUtils]: 168: Hoare triple {93331#false} assume 4432 == #t~mem62;havoc #t~mem62; {93331#false} is VALID [2022-04-28 08:39:02,968 INFO L290 TraceCheckUtils]: 169: Hoare triple {93331#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {93331#false} is VALID [2022-04-28 08:39:02,968 INFO L290 TraceCheckUtils]: 170: Hoare triple {93331#false} assume 5 == ~blastFlag~0; {93331#false} is VALID [2022-04-28 08:39:02,968 INFO L290 TraceCheckUtils]: 171: Hoare triple {93331#false} assume !false; {93331#false} is VALID [2022-04-28 08:39:02,969 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-04-28 08:39:02,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:39:02,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233174397] [2022-04-28 08:39:02,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233174397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:02,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:02,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:02,970 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:39:02,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [203167745] [2022-04-28 08:39:02,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [203167745] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:02,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:02,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:02,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621045467] [2022-04-28 08:39:02,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:39:02,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 172 [2022-04-28 08:39:02,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:39:02,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:03,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:03,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:39:03,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:03,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:39:03,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:39:03,057 INFO L87 Difference]: Start difference. First operand 955 states and 1357 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:05,079 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:39:06,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:06,371 INFO L93 Difference]: Finished difference Result 2253 states and 3213 transitions. [2022-04-28 08:39:06,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:39:06,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 172 [2022-04-28 08:39:06,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:39:06,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:06,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-28 08:39:06,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:06,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-28 08:39:06,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-28 08:39:06,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:06,752 INFO L225 Difference]: With dead ends: 2253 [2022-04-28 08:39:06,752 INFO L226 Difference]: Without dead ends: 1314 [2022-04-28 08:39:06,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:39:06,754 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 107 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:39:06,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:39:06,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2022-04-28 08:39:06,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 970. [2022-04-28 08:39:06,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:39:06,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1314 states. Second operand has 970 states, 965 states have (on average 1.427979274611399) internal successors, (1378), 965 states have internal predecessors, (1378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:06,839 INFO L74 IsIncluded]: Start isIncluded. First operand 1314 states. Second operand has 970 states, 965 states have (on average 1.427979274611399) internal successors, (1378), 965 states have internal predecessors, (1378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:06,840 INFO L87 Difference]: Start difference. First operand 1314 states. Second operand has 970 states, 965 states have (on average 1.427979274611399) internal successors, (1378), 965 states have internal predecessors, (1378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:06,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:06,901 INFO L93 Difference]: Finished difference Result 1314 states and 1871 transitions. [2022-04-28 08:39:06,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1871 transitions. [2022-04-28 08:39:06,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:39:06,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:39:06,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 970 states, 965 states have (on average 1.427979274611399) internal successors, (1378), 965 states have internal predecessors, (1378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1314 states. [2022-04-28 08:39:06,905 INFO L87 Difference]: Start difference. First operand has 970 states, 965 states have (on average 1.427979274611399) internal successors, (1378), 965 states have internal predecessors, (1378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1314 states. [2022-04-28 08:39:06,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:06,968 INFO L93 Difference]: Finished difference Result 1314 states and 1871 transitions. [2022-04-28 08:39:06,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1871 transitions. [2022-04-28 08:39:06,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:39:06,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:39:06,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:39:06,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:39:06,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 965 states have (on average 1.427979274611399) internal successors, (1378), 965 states have internal predecessors, (1378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:07,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1382 transitions. [2022-04-28 08:39:07,013 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1382 transitions. Word has length 172 [2022-04-28 08:39:07,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:39:07,013 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 1382 transitions. [2022-04-28 08:39:07,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:07,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 970 states and 1382 transitions. [2022-04-28 08:39:08,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1382 edges. 1382 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:08,412 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1382 transitions. [2022-04-28 08:39:08,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-04-28 08:39:08,413 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:39:08,413 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:39:08,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 08:39:08,413 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:39:08,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:39:08,414 INFO L85 PathProgramCache]: Analyzing trace with hash 506446570, now seen corresponding path program 1 times [2022-04-28 08:39:08,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:08,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1090266493] [2022-04-28 08:39:22,095 WARN L232 SmtUtils]: Spent 7.51s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:39:29,053 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:39:29,054 INFO L85 PathProgramCache]: Analyzing trace with hash 506446570, now seen corresponding path program 2 times [2022-04-28 08:39:29,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:39:29,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626488718] [2022-04-28 08:39:29,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:39:29,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:39:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:29,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:39:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:29,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {102426#(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); {102416#true} is VALID [2022-04-28 08:39:29,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {102416#true} assume true; {102416#true} is VALID [2022-04-28 08:39:29,345 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {102416#true} {102416#true} #593#return; {102416#true} is VALID [2022-04-28 08:39:29,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {102416#true} call ULTIMATE.init(); {102426#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:39:29,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {102426#(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); {102416#true} is VALID [2022-04-28 08:39:29,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {102416#true} assume true; {102416#true} is VALID [2022-04-28 08:39:29,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {102416#true} {102416#true} #593#return; {102416#true} is VALID [2022-04-28 08:39:29,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {102416#true} call #t~ret158 := main(); {102416#true} is VALID [2022-04-28 08:39:29,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {102416#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; {102416#true} is VALID [2022-04-28 08:39:29,346 INFO L272 TraceCheckUtils]: 6: Hoare triple {102416#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {102416#true} is VALID [2022-04-28 08:39:29,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:39:29,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {102416#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; {102416#true} is VALID [2022-04-28 08:39:29,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {102416#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; {102416#true} is VALID [2022-04-28 08:39:29,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {102416#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {102416#true} is VALID [2022-04-28 08:39:29,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-28 08:39:29,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {102416#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {102416#true} assume 12292 == #t~mem49;havoc #t~mem49; {102416#true} is VALID [2022-04-28 08:39:29,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {102416#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; {102416#true} is VALID [2022-04-28 08:39:29,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {102416#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {102416#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {102416#true} is VALID [2022-04-28 08:39:29,347 INFO L290 TraceCheckUtils]: 17: Hoare triple {102416#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:39:29,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {102416#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {102416#true} is VALID [2022-04-28 08:39:29,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {102416#true} assume !(0 == ~tmp___4~0); {102416#true} is VALID [2022-04-28 08:39:29,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:39:29,348 INFO L290 TraceCheckUtils]: 22: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:39:29,348 INFO L290 TraceCheckUtils]: 23: Hoare triple {102416#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {102416#true} is VALID [2022-04-28 08:39:29,348 INFO L290 TraceCheckUtils]: 24: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-28 08:39:29,348 INFO L290 TraceCheckUtils]: 25: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-28 08:39:29,348 INFO L290 TraceCheckUtils]: 26: Hoare triple {102416#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,348 INFO L290 TraceCheckUtils]: 27: Hoare triple {102416#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,348 INFO L290 TraceCheckUtils]: 28: Hoare triple {102416#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,348 INFO L290 TraceCheckUtils]: 29: Hoare triple {102416#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,348 INFO L290 TraceCheckUtils]: 30: Hoare triple {102416#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,349 INFO L290 TraceCheckUtils]: 31: Hoare triple {102416#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,349 INFO L290 TraceCheckUtils]: 32: Hoare triple {102416#true} assume 4368 == #t~mem54;havoc #t~mem54; {102416#true} is VALID [2022-04-28 08:39:29,349 INFO L290 TraceCheckUtils]: 33: Hoare triple {102416#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; {102416#true} is VALID [2022-04-28 08:39:29,349 INFO L290 TraceCheckUtils]: 34: Hoare triple {102416#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {102416#true} is VALID [2022-04-28 08:39:29,349 INFO L290 TraceCheckUtils]: 35: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:39:29,349 INFO L290 TraceCheckUtils]: 36: Hoare triple {102416#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; {102416#true} is VALID [2022-04-28 08:39:29,349 INFO L290 TraceCheckUtils]: 37: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:39:29,349 INFO L290 TraceCheckUtils]: 38: Hoare triple {102416#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {102416#true} is VALID [2022-04-28 08:39:29,349 INFO L290 TraceCheckUtils]: 39: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-28 08:39:29,349 INFO L290 TraceCheckUtils]: 40: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-28 08:39:29,350 INFO L290 TraceCheckUtils]: 41: Hoare triple {102416#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,350 INFO L290 TraceCheckUtils]: 42: Hoare triple {102416#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,350 INFO L290 TraceCheckUtils]: 43: Hoare triple {102416#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,350 INFO L290 TraceCheckUtils]: 44: Hoare triple {102416#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,350 INFO L290 TraceCheckUtils]: 45: Hoare triple {102416#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,350 INFO L290 TraceCheckUtils]: 46: Hoare triple {102416#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,350 INFO L290 TraceCheckUtils]: 47: Hoare triple {102416#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,350 INFO L290 TraceCheckUtils]: 48: Hoare triple {102416#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,350 INFO L290 TraceCheckUtils]: 49: Hoare triple {102416#true} assume 4384 == #t~mem56;havoc #t~mem56; {102416#true} is VALID [2022-04-28 08:39:29,350 INFO L290 TraceCheckUtils]: 50: Hoare triple {102416#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {102416#true} is VALID [2022-04-28 08:39:29,350 INFO L290 TraceCheckUtils]: 51: Hoare triple {102416#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {102416#true} is VALID [2022-04-28 08:39:29,350 INFO L290 TraceCheckUtils]: 52: Hoare triple {102416#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,351 INFO L290 TraceCheckUtils]: 53: Hoare triple {102416#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,351 INFO L290 TraceCheckUtils]: 54: Hoare triple {102416#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,351 INFO L290 TraceCheckUtils]: 55: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:39:29,351 INFO L290 TraceCheckUtils]: 56: Hoare triple {102416#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {102416#true} is VALID [2022-04-28 08:39:29,351 INFO L290 TraceCheckUtils]: 57: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-28 08:39:29,351 INFO L290 TraceCheckUtils]: 58: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-28 08:39:29,351 INFO L290 TraceCheckUtils]: 59: Hoare triple {102416#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,351 INFO L290 TraceCheckUtils]: 60: Hoare triple {102416#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,351 INFO L290 TraceCheckUtils]: 61: Hoare triple {102416#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,351 INFO L290 TraceCheckUtils]: 62: Hoare triple {102416#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,352 INFO L290 TraceCheckUtils]: 63: Hoare triple {102416#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,352 INFO L290 TraceCheckUtils]: 64: Hoare triple {102416#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,352 INFO L290 TraceCheckUtils]: 65: Hoare triple {102416#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,352 INFO L290 TraceCheckUtils]: 66: Hoare triple {102416#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,352 INFO L290 TraceCheckUtils]: 67: Hoare triple {102416#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,352 INFO L290 TraceCheckUtils]: 68: Hoare triple {102416#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,352 INFO L290 TraceCheckUtils]: 69: Hoare triple {102416#true} assume 4400 == #t~mem58;havoc #t~mem58; {102416#true} is VALID [2022-04-28 08:39:29,352 INFO L290 TraceCheckUtils]: 70: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:39:29,352 INFO L290 TraceCheckUtils]: 71: Hoare triple {102416#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; {102416#true} is VALID [2022-04-28 08:39:29,352 INFO L290 TraceCheckUtils]: 72: Hoare triple {102416#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {102416#true} is VALID [2022-04-28 08:39:29,352 INFO L290 TraceCheckUtils]: 73: Hoare triple {102416#true} assume !(~ret~0 <= 0); {102416#true} is VALID [2022-04-28 08:39:29,353 INFO L290 TraceCheckUtils]: 74: Hoare triple {102416#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,353 INFO L290 TraceCheckUtils]: 75: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:39:29,353 INFO L290 TraceCheckUtils]: 76: Hoare triple {102416#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {102416#true} is VALID [2022-04-28 08:39:29,353 INFO L290 TraceCheckUtils]: 77: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-28 08:39:29,353 INFO L290 TraceCheckUtils]: 78: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-28 08:39:29,353 INFO L290 TraceCheckUtils]: 79: Hoare triple {102416#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,353 INFO L290 TraceCheckUtils]: 80: Hoare triple {102416#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,353 INFO L290 TraceCheckUtils]: 81: Hoare triple {102416#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,353 INFO L290 TraceCheckUtils]: 82: Hoare triple {102416#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,353 INFO L290 TraceCheckUtils]: 83: Hoare triple {102416#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,353 INFO L290 TraceCheckUtils]: 84: Hoare triple {102416#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,354 INFO L290 TraceCheckUtils]: 85: Hoare triple {102416#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,354 INFO L290 TraceCheckUtils]: 86: Hoare triple {102416#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,354 INFO L290 TraceCheckUtils]: 87: Hoare triple {102416#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,354 INFO L290 TraceCheckUtils]: 88: Hoare triple {102416#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,354 INFO L290 TraceCheckUtils]: 89: Hoare triple {102416#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,354 INFO L290 TraceCheckUtils]: 90: Hoare triple {102416#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,354 INFO L290 TraceCheckUtils]: 91: Hoare triple {102416#true} assume 4416 == #t~mem60;havoc #t~mem60; {102416#true} is VALID [2022-04-28 08:39:29,354 INFO L290 TraceCheckUtils]: 92: Hoare triple {102416#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {102416#true} is VALID [2022-04-28 08:39:29,354 INFO L290 TraceCheckUtils]: 93: Hoare triple {102416#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {102416#true} is VALID [2022-04-28 08:39:29,354 INFO L290 TraceCheckUtils]: 94: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:39:29,355 INFO L290 TraceCheckUtils]: 95: Hoare triple {102416#true} assume !(0 == ~tmp___6~0); {102416#true} is VALID [2022-04-28 08:39:29,355 INFO L290 TraceCheckUtils]: 96: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:39:29,355 INFO L290 TraceCheckUtils]: 97: Hoare triple {102416#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {102416#true} is VALID [2022-04-28 08:39:29,355 INFO L290 TraceCheckUtils]: 98: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-28 08:39:29,355 INFO L290 TraceCheckUtils]: 99: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-28 08:39:29,355 INFO L290 TraceCheckUtils]: 100: Hoare triple {102416#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,355 INFO L290 TraceCheckUtils]: 101: Hoare triple {102416#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,355 INFO L290 TraceCheckUtils]: 102: Hoare triple {102416#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,355 INFO L290 TraceCheckUtils]: 103: Hoare triple {102416#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,355 INFO L290 TraceCheckUtils]: 104: Hoare triple {102416#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,355 INFO L290 TraceCheckUtils]: 105: Hoare triple {102416#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,356 INFO L290 TraceCheckUtils]: 106: Hoare triple {102416#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,356 INFO L290 TraceCheckUtils]: 107: Hoare triple {102416#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,356 INFO L290 TraceCheckUtils]: 108: Hoare triple {102416#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,356 INFO L290 TraceCheckUtils]: 109: Hoare triple {102416#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {102421#(= |ssl3_connect_#t~mem58| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:29,357 INFO L290 TraceCheckUtils]: 110: Hoare triple {102421#(= |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); {102422#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:29,357 INFO L290 TraceCheckUtils]: 111: Hoare triple {102422#(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); {102422#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:29,357 INFO L290 TraceCheckUtils]: 112: Hoare triple {102422#(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); {102422#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:29,358 INFO L290 TraceCheckUtils]: 113: Hoare triple {102422#(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); {102423#(not (= |ssl3_connect_#t~mem62| 4400))} is VALID [2022-04-28 08:39:29,358 INFO L290 TraceCheckUtils]: 114: Hoare triple {102423#(not (= |ssl3_connect_#t~mem62| 4400))} assume 4432 == #t~mem62;havoc #t~mem62; {102416#true} is VALID [2022-04-28 08:39:29,358 INFO L290 TraceCheckUtils]: 115: Hoare triple {102416#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {102416#true} is VALID [2022-04-28 08:39:29,358 INFO L290 TraceCheckUtils]: 116: Hoare triple {102416#true} assume !(5 == ~blastFlag~0); {102416#true} is VALID [2022-04-28 08:39:29,358 INFO L290 TraceCheckUtils]: 117: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:39:29,358 INFO L290 TraceCheckUtils]: 118: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:39:29,358 INFO L290 TraceCheckUtils]: 119: Hoare triple {102416#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {102416#true} is VALID [2022-04-28 08:39:29,358 INFO L290 TraceCheckUtils]: 120: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-28 08:39:29,358 INFO L290 TraceCheckUtils]: 121: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-28 08:39:29,359 INFO L290 TraceCheckUtils]: 122: Hoare triple {102416#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,359 INFO L290 TraceCheckUtils]: 123: Hoare triple {102416#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,359 INFO L290 TraceCheckUtils]: 124: Hoare triple {102416#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,359 INFO L290 TraceCheckUtils]: 125: Hoare triple {102416#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,359 INFO L290 TraceCheckUtils]: 126: Hoare triple {102416#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,359 INFO L290 TraceCheckUtils]: 127: Hoare triple {102416#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,359 INFO L290 TraceCheckUtils]: 128: Hoare triple {102416#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,359 INFO L290 TraceCheckUtils]: 129: Hoare triple {102416#true} assume 4369 == #t~mem55;havoc #t~mem55; {102416#true} is VALID [2022-04-28 08:39:29,359 INFO L290 TraceCheckUtils]: 130: Hoare triple {102416#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; {102416#true} is VALID [2022-04-28 08:39:29,359 INFO L290 TraceCheckUtils]: 131: Hoare triple {102416#true} assume !(0 == ~blastFlag~0); {102416#true} is VALID [2022-04-28 08:39:29,360 INFO L290 TraceCheckUtils]: 132: Hoare triple {102416#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {102416#true} is VALID [2022-04-28 08:39:29,360 INFO L290 TraceCheckUtils]: 133: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:39:29,360 INFO L290 TraceCheckUtils]: 134: Hoare triple {102416#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; {102416#true} is VALID [2022-04-28 08:39:29,360 INFO L290 TraceCheckUtils]: 135: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:39:29,360 INFO L290 TraceCheckUtils]: 136: Hoare triple {102416#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {102416#true} is VALID [2022-04-28 08:39:29,360 INFO L290 TraceCheckUtils]: 137: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-28 08:39:29,360 INFO L290 TraceCheckUtils]: 138: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-28 08:39:29,360 INFO L290 TraceCheckUtils]: 139: Hoare triple {102416#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,360 INFO L290 TraceCheckUtils]: 140: Hoare triple {102416#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,360 INFO L290 TraceCheckUtils]: 141: Hoare triple {102416#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,361 INFO L290 TraceCheckUtils]: 142: Hoare triple {102416#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,361 INFO L290 TraceCheckUtils]: 143: Hoare triple {102416#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,361 INFO L290 TraceCheckUtils]: 144: Hoare triple {102416#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,361 INFO L290 TraceCheckUtils]: 145: Hoare triple {102416#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,361 INFO L290 TraceCheckUtils]: 146: Hoare triple {102416#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,361 INFO L290 TraceCheckUtils]: 147: Hoare triple {102416#true} assume 4384 == #t~mem56;havoc #t~mem56; {102416#true} is VALID [2022-04-28 08:39:29,361 INFO L290 TraceCheckUtils]: 148: Hoare triple {102416#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {102416#true} is VALID [2022-04-28 08:39:29,361 INFO L290 TraceCheckUtils]: 149: Hoare triple {102416#true} assume !(1 == ~blastFlag~0); {102416#true} is VALID [2022-04-28 08:39:29,361 INFO L290 TraceCheckUtils]: 150: Hoare triple {102416#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:39:29,362 INFO L290 TraceCheckUtils]: 151: Hoare triple {102416#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {102424#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:29,363 INFO L290 TraceCheckUtils]: 152: Hoare triple {102424#(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); {102424#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:29,363 INFO L290 TraceCheckUtils]: 153: Hoare triple {102424#(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); {102424#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:29,364 INFO L290 TraceCheckUtils]: 154: Hoare triple {102424#(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; {102424#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:29,364 INFO L290 TraceCheckUtils]: 155: Hoare triple {102424#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {102424#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:29,364 INFO L290 TraceCheckUtils]: 156: Hoare triple {102424#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {102424#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:29,365 INFO L290 TraceCheckUtils]: 157: Hoare triple {102424#(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); {102424#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:29,365 INFO L290 TraceCheckUtils]: 158: Hoare triple {102424#(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); {102424#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:29,365 INFO L290 TraceCheckUtils]: 159: Hoare triple {102424#(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); {102424#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:29,366 INFO L290 TraceCheckUtils]: 160: Hoare triple {102424#(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); {102424#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:29,366 INFO L290 TraceCheckUtils]: 161: Hoare triple {102424#(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); {102424#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:29,366 INFO L290 TraceCheckUtils]: 162: Hoare triple {102424#(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); {102424#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:29,366 INFO L290 TraceCheckUtils]: 163: Hoare triple {102424#(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); {102424#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:29,367 INFO L290 TraceCheckUtils]: 164: Hoare triple {102424#(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); {102424#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:29,367 INFO L290 TraceCheckUtils]: 165: Hoare triple {102424#(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); {102424#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:29,367 INFO L290 TraceCheckUtils]: 166: Hoare triple {102424#(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); {102424#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:29,368 INFO L290 TraceCheckUtils]: 167: Hoare triple {102424#(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); {102424#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:29,368 INFO L290 TraceCheckUtils]: 168: Hoare triple {102424#(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); {102424#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:29,368 INFO L290 TraceCheckUtils]: 169: Hoare triple {102424#(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); {102424#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:29,369 INFO L290 TraceCheckUtils]: 170: Hoare triple {102424#(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); {102425#(not (= |ssl3_connect_#t~mem62| 4432))} is VALID [2022-04-28 08:39:29,369 INFO L290 TraceCheckUtils]: 171: Hoare triple {102425#(not (= |ssl3_connect_#t~mem62| 4432))} assume 4432 == #t~mem62;havoc #t~mem62; {102417#false} is VALID [2022-04-28 08:39:29,369 INFO L290 TraceCheckUtils]: 172: Hoare triple {102417#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {102417#false} is VALID [2022-04-28 08:39:29,369 INFO L290 TraceCheckUtils]: 173: Hoare triple {102417#false} assume 5 == ~blastFlag~0; {102417#false} is VALID [2022-04-28 08:39:29,369 INFO L290 TraceCheckUtils]: 174: Hoare triple {102417#false} assume !false; {102417#false} is VALID [2022-04-28 08:39:29,370 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 105 proven. 5 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2022-04-28 08:39:29,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:39:29,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626488718] [2022-04-28 08:39:29,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626488718] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 08:39:29,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820587100] [2022-04-28 08:39:29,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 08:39:29,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:39:29,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:39:29,376 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 08:39:29,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 08:41:03,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 08:41:03,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 08:41:03,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 1545 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 08:41:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:03,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 08:41:03,728 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-28 08:41:03,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 143 [2022-04-28 08:41:03,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 63 [2022-04-28 08:41:03,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-28 08:41:03,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-28 08:41:03,967 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-04-28 08:41:03,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 21 [2022-04-28 08:41:03,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-04-28 08:41:03,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-04-28 08:41:04,052 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-28 08:41:04,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-04-28 08:41:04,345 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-28 08:41:04,382 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-28 08:41:04,382 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-28 08:41:04,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-04-28 08:41:04,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {102416#true} call ULTIMATE.init(); {102416#true} is VALID [2022-04-28 08:41:04,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:04,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {102416#true} assume true; {102416#true} is VALID [2022-04-28 08:41:04,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {102416#true} {102416#true} #593#return; {102416#true} is VALID [2022-04-28 08:41:04,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {102416#true} call #t~ret158 := main(); {102416#true} is VALID [2022-04-28 08:41:04,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {102416#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; {102416#true} is VALID [2022-04-28 08:41:04,527 INFO L272 TraceCheckUtils]: 6: Hoare triple {102416#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {102416#true} is VALID [2022-04-28 08:41:04,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:04,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {102416#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; {102416#true} is VALID [2022-04-28 08:41:04,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {102416#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; {102416#true} is VALID [2022-04-28 08:41:04,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {102416#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {102416#true} is VALID [2022-04-28 08:41:04,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-28 08:41:04,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {102416#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {102416#true} assume 12292 == #t~mem49;havoc #t~mem49; {102416#true} is VALID [2022-04-28 08:41:04,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {102416#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; {102416#true} is VALID [2022-04-28 08:41:04,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {102416#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {102416#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {102416#true} is VALID [2022-04-28 08:41:04,528 INFO L290 TraceCheckUtils]: 17: Hoare triple {102416#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:04,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {102416#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {102416#true} is VALID [2022-04-28 08:41:04,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {102416#true} assume !(0 == ~tmp___4~0); {102416#true} is VALID [2022-04-28 08:41:04,530 INFO L290 TraceCheckUtils]: 21: Hoare triple {102416#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); {102493#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:04,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {102493#(= 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); {102493#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:04,531 INFO L290 TraceCheckUtils]: 23: Hoare triple {102493#(= 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; {102493#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:04,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {102493#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} ~skip~0 := 0; {102493#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:04,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {102493#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !false; {102493#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:04,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {102493#(= 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); {102493#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:04,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {102493#(= 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); {102493#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:04,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {102493#(= 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); {102493#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:04,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {102493#(= 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); {102493#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:04,534 INFO L290 TraceCheckUtils]: 30: Hoare triple {102493#(= 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); {102493#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:04,535 INFO L290 TraceCheckUtils]: 31: Hoare triple {102493#(= 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); {102416#true} is VALID [2022-04-28 08:41:04,535 INFO L290 TraceCheckUtils]: 32: Hoare triple {102416#true} assume 4368 == #t~mem54;havoc #t~mem54; {102416#true} is VALID [2022-04-28 08:41:04,535 INFO L290 TraceCheckUtils]: 33: Hoare triple {102416#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; {102416#true} is VALID [2022-04-28 08:41:04,535 INFO L290 TraceCheckUtils]: 34: Hoare triple {102416#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {102416#true} is VALID [2022-04-28 08:41:04,535 INFO L290 TraceCheckUtils]: 35: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:04,535 INFO L290 TraceCheckUtils]: 36: Hoare triple {102416#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; {102416#true} is VALID [2022-04-28 08:41:04,535 INFO L290 TraceCheckUtils]: 37: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:04,535 INFO L290 TraceCheckUtils]: 38: Hoare triple {102416#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {102416#true} is VALID [2022-04-28 08:41:04,535 INFO L290 TraceCheckUtils]: 39: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-28 08:41:04,536 INFO L290 TraceCheckUtils]: 40: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-28 08:41:04,536 INFO L290 TraceCheckUtils]: 41: Hoare triple {102416#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,536 INFO L290 TraceCheckUtils]: 42: Hoare triple {102416#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,536 INFO L290 TraceCheckUtils]: 43: Hoare triple {102416#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,536 INFO L290 TraceCheckUtils]: 44: Hoare triple {102416#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,536 INFO L290 TraceCheckUtils]: 45: Hoare triple {102416#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,536 INFO L290 TraceCheckUtils]: 46: Hoare triple {102416#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,536 INFO L290 TraceCheckUtils]: 47: Hoare triple {102416#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,536 INFO L290 TraceCheckUtils]: 48: Hoare triple {102416#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,537 INFO L290 TraceCheckUtils]: 49: Hoare triple {102416#true} assume 4384 == #t~mem56;havoc #t~mem56; {102416#true} is VALID [2022-04-28 08:41:04,537 INFO L290 TraceCheckUtils]: 50: Hoare triple {102416#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {102416#true} is VALID [2022-04-28 08:41:04,537 INFO L290 TraceCheckUtils]: 51: Hoare triple {102416#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {102416#true} is VALID [2022-04-28 08:41:04,537 INFO L290 TraceCheckUtils]: 52: Hoare triple {102416#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,537 INFO L290 TraceCheckUtils]: 53: Hoare triple {102416#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,537 INFO L290 TraceCheckUtils]: 54: Hoare triple {102416#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,537 INFO L290 TraceCheckUtils]: 55: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:04,537 INFO L290 TraceCheckUtils]: 56: Hoare triple {102416#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {102416#true} is VALID [2022-04-28 08:41:04,537 INFO L290 TraceCheckUtils]: 57: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-28 08:41:04,537 INFO L290 TraceCheckUtils]: 58: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-28 08:41:04,538 INFO L290 TraceCheckUtils]: 59: Hoare triple {102416#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,538 INFO L290 TraceCheckUtils]: 60: Hoare triple {102416#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,538 INFO L290 TraceCheckUtils]: 61: Hoare triple {102416#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,538 INFO L290 TraceCheckUtils]: 62: Hoare triple {102416#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,538 INFO L290 TraceCheckUtils]: 63: Hoare triple {102416#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,538 INFO L290 TraceCheckUtils]: 64: Hoare triple {102416#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,538 INFO L290 TraceCheckUtils]: 65: Hoare triple {102416#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,538 INFO L290 TraceCheckUtils]: 66: Hoare triple {102416#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,538 INFO L290 TraceCheckUtils]: 67: Hoare triple {102416#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,539 INFO L290 TraceCheckUtils]: 68: Hoare triple {102416#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,539 INFO L290 TraceCheckUtils]: 69: Hoare triple {102416#true} assume 4400 == #t~mem58;havoc #t~mem58; {102416#true} is VALID [2022-04-28 08:41:04,539 INFO L290 TraceCheckUtils]: 70: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:04,539 INFO L290 TraceCheckUtils]: 71: Hoare triple {102416#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; {102416#true} is VALID [2022-04-28 08:41:04,539 INFO L290 TraceCheckUtils]: 72: Hoare triple {102416#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {102416#true} is VALID [2022-04-28 08:41:04,539 INFO L290 TraceCheckUtils]: 73: Hoare triple {102416#true} assume !(~ret~0 <= 0); {102416#true} is VALID [2022-04-28 08:41:04,539 INFO L290 TraceCheckUtils]: 74: Hoare triple {102416#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,539 INFO L290 TraceCheckUtils]: 75: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:04,539 INFO L290 TraceCheckUtils]: 76: Hoare triple {102416#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {102416#true} is VALID [2022-04-28 08:41:04,540 INFO L290 TraceCheckUtils]: 77: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-28 08:41:04,540 INFO L290 TraceCheckUtils]: 78: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-28 08:41:04,540 INFO L290 TraceCheckUtils]: 79: Hoare triple {102416#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,540 INFO L290 TraceCheckUtils]: 80: Hoare triple {102416#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,540 INFO L290 TraceCheckUtils]: 81: Hoare triple {102416#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,540 INFO L290 TraceCheckUtils]: 82: Hoare triple {102416#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,540 INFO L290 TraceCheckUtils]: 83: Hoare triple {102416#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,540 INFO L290 TraceCheckUtils]: 84: Hoare triple {102416#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,540 INFO L290 TraceCheckUtils]: 85: Hoare triple {102416#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,540 INFO L290 TraceCheckUtils]: 86: Hoare triple {102416#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,541 INFO L290 TraceCheckUtils]: 87: Hoare triple {102416#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,541 INFO L290 TraceCheckUtils]: 88: Hoare triple {102416#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,541 INFO L290 TraceCheckUtils]: 89: Hoare triple {102416#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,541 INFO L290 TraceCheckUtils]: 90: Hoare triple {102416#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,541 INFO L290 TraceCheckUtils]: 91: Hoare triple {102416#true} assume 4416 == #t~mem60;havoc #t~mem60; {102416#true} is VALID [2022-04-28 08:41:04,541 INFO L290 TraceCheckUtils]: 92: Hoare triple {102416#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {102416#true} is VALID [2022-04-28 08:41:04,541 INFO L290 TraceCheckUtils]: 93: Hoare triple {102416#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {102416#true} is VALID [2022-04-28 08:41:04,541 INFO L290 TraceCheckUtils]: 94: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:04,541 INFO L290 TraceCheckUtils]: 95: Hoare triple {102416#true} assume !(0 == ~tmp___6~0); {102416#true} is VALID [2022-04-28 08:41:04,542 INFO L290 TraceCheckUtils]: 96: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:04,542 INFO L290 TraceCheckUtils]: 97: Hoare triple {102416#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {102416#true} is VALID [2022-04-28 08:41:04,542 INFO L290 TraceCheckUtils]: 98: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-28 08:41:04,542 INFO L290 TraceCheckUtils]: 99: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-28 08:41:04,542 INFO L290 TraceCheckUtils]: 100: Hoare triple {102416#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,542 INFO L290 TraceCheckUtils]: 101: Hoare triple {102416#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,542 INFO L290 TraceCheckUtils]: 102: Hoare triple {102416#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,542 INFO L290 TraceCheckUtils]: 103: Hoare triple {102416#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,542 INFO L290 TraceCheckUtils]: 104: Hoare triple {102416#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,543 INFO L290 TraceCheckUtils]: 105: Hoare triple {102416#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,543 INFO L290 TraceCheckUtils]: 106: Hoare triple {102416#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,543 INFO L290 TraceCheckUtils]: 107: Hoare triple {102416#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,543 INFO L290 TraceCheckUtils]: 108: Hoare triple {102416#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,543 INFO L290 TraceCheckUtils]: 109: Hoare triple {102416#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,543 INFO L290 TraceCheckUtils]: 110: Hoare triple {102416#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,543 INFO L290 TraceCheckUtils]: 111: Hoare triple {102416#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,543 INFO L290 TraceCheckUtils]: 112: Hoare triple {102416#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,543 INFO L290 TraceCheckUtils]: 113: Hoare triple {102416#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,544 INFO L290 TraceCheckUtils]: 114: Hoare triple {102416#true} assume 4432 == #t~mem62;havoc #t~mem62; {102416#true} is VALID [2022-04-28 08:41:04,544 INFO L290 TraceCheckUtils]: 115: Hoare triple {102416#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {102416#true} is VALID [2022-04-28 08:41:04,544 INFO L290 TraceCheckUtils]: 116: Hoare triple {102416#true} assume !(5 == ~blastFlag~0); {102416#true} is VALID [2022-04-28 08:41:04,544 INFO L290 TraceCheckUtils]: 117: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:04,544 INFO L290 TraceCheckUtils]: 118: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:04,544 INFO L290 TraceCheckUtils]: 119: Hoare triple {102416#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {102416#true} is VALID [2022-04-28 08:41:04,544 INFO L290 TraceCheckUtils]: 120: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-28 08:41:04,544 INFO L290 TraceCheckUtils]: 121: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-28 08:41:04,544 INFO L290 TraceCheckUtils]: 122: Hoare triple {102416#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,544 INFO L290 TraceCheckUtils]: 123: Hoare triple {102416#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,545 INFO L290 TraceCheckUtils]: 124: Hoare triple {102416#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,545 INFO L290 TraceCheckUtils]: 125: Hoare triple {102416#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,545 INFO L290 TraceCheckUtils]: 126: Hoare triple {102416#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,545 INFO L290 TraceCheckUtils]: 127: Hoare triple {102416#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,545 INFO L290 TraceCheckUtils]: 128: Hoare triple {102416#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,545 INFO L290 TraceCheckUtils]: 129: Hoare triple {102416#true} assume 4369 == #t~mem55;havoc #t~mem55; {102416#true} is VALID [2022-04-28 08:41:04,545 INFO L290 TraceCheckUtils]: 130: Hoare triple {102416#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; {102416#true} is VALID [2022-04-28 08:41:04,545 INFO L290 TraceCheckUtils]: 131: Hoare triple {102416#true} assume !(0 == ~blastFlag~0); {102416#true} is VALID [2022-04-28 08:41:04,545 INFO L290 TraceCheckUtils]: 132: Hoare triple {102416#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {102416#true} is VALID [2022-04-28 08:41:04,546 INFO L290 TraceCheckUtils]: 133: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:04,546 INFO L290 TraceCheckUtils]: 134: Hoare triple {102416#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; {102416#true} is VALID [2022-04-28 08:41:04,546 INFO L290 TraceCheckUtils]: 135: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:04,546 INFO L290 TraceCheckUtils]: 136: Hoare triple {102416#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {102416#true} is VALID [2022-04-28 08:41:04,546 INFO L290 TraceCheckUtils]: 137: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-28 08:41:04,546 INFO L290 TraceCheckUtils]: 138: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-28 08:41:04,546 INFO L290 TraceCheckUtils]: 139: Hoare triple {102416#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,546 INFO L290 TraceCheckUtils]: 140: Hoare triple {102416#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,546 INFO L290 TraceCheckUtils]: 141: Hoare triple {102416#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,546 INFO L290 TraceCheckUtils]: 142: Hoare triple {102416#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,547 INFO L290 TraceCheckUtils]: 143: Hoare triple {102416#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,547 INFO L290 TraceCheckUtils]: 144: Hoare triple {102416#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,547 INFO L290 TraceCheckUtils]: 145: Hoare triple {102416#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,547 INFO L290 TraceCheckUtils]: 146: Hoare triple {102416#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,547 INFO L290 TraceCheckUtils]: 147: Hoare triple {102416#true} assume 4384 == #t~mem56;havoc #t~mem56; {102416#true} is VALID [2022-04-28 08:41:04,547 INFO L290 TraceCheckUtils]: 148: Hoare triple {102416#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {102416#true} is VALID [2022-04-28 08:41:04,547 INFO L290 TraceCheckUtils]: 149: Hoare triple {102416#true} assume !(1 == ~blastFlag~0); {102416#true} is VALID [2022-04-28 08:41:04,547 INFO L290 TraceCheckUtils]: 150: Hoare triple {102416#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:04,548 INFO L290 TraceCheckUtils]: 151: Hoare triple {102416#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {102884#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-28 08:41:04,549 INFO L290 TraceCheckUtils]: 152: Hoare triple {102884#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {102884#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-28 08:41:04,550 INFO L290 TraceCheckUtils]: 153: Hoare triple {102884#(<= (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); {102884#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-28 08:41:04,550 INFO L290 TraceCheckUtils]: 154: Hoare triple {102884#(<= (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; {102884#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-28 08:41:04,551 INFO L290 TraceCheckUtils]: 155: Hoare triple {102884#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} ~skip~0 := 0; {102884#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-28 08:41:04,551 INFO L290 TraceCheckUtils]: 156: Hoare triple {102884#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !false; {102884#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-28 08:41:04,551 INFO L290 TraceCheckUtils]: 157: Hoare triple {102884#(<= (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); {102884#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-28 08:41:04,552 INFO L290 TraceCheckUtils]: 158: Hoare triple {102884#(<= (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); {102884#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-28 08:41:04,552 INFO L290 TraceCheckUtils]: 159: Hoare triple {102884#(<= (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); {102884#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-28 08:41:04,552 INFO L290 TraceCheckUtils]: 160: Hoare triple {102884#(<= (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); {102884#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-28 08:41:04,553 INFO L290 TraceCheckUtils]: 161: Hoare triple {102884#(<= (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); {102884#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-28 08:41:04,553 INFO L290 TraceCheckUtils]: 162: Hoare triple {102884#(<= (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); {102884#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-28 08:41:04,554 INFO L290 TraceCheckUtils]: 163: Hoare triple {102884#(<= (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); {102884#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-28 08:41:04,554 INFO L290 TraceCheckUtils]: 164: Hoare triple {102884#(<= (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); {102884#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-28 08:41:04,554 INFO L290 TraceCheckUtils]: 165: Hoare triple {102884#(<= (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); {102884#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-28 08:41:04,555 INFO L290 TraceCheckUtils]: 166: Hoare triple {102884#(<= (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); {102884#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-28 08:41:04,559 INFO L290 TraceCheckUtils]: 167: Hoare triple {102884#(<= (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); {102884#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-28 08:41:04,560 INFO L290 TraceCheckUtils]: 168: Hoare triple {102884#(<= (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); {102884#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-28 08:41:04,560 INFO L290 TraceCheckUtils]: 169: Hoare triple {102884#(<= (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); {102884#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-28 08:41:04,561 INFO L290 TraceCheckUtils]: 170: Hoare triple {102884#(<= (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); {102942#(<= |ssl3_connect_#t~mem62| 4400)} is VALID [2022-04-28 08:41:04,561 INFO L290 TraceCheckUtils]: 171: Hoare triple {102942#(<= |ssl3_connect_#t~mem62| 4400)} assume 4432 == #t~mem62;havoc #t~mem62; {102417#false} is VALID [2022-04-28 08:41:04,561 INFO L290 TraceCheckUtils]: 172: Hoare triple {102417#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {102417#false} is VALID [2022-04-28 08:41:04,561 INFO L290 TraceCheckUtils]: 173: Hoare triple {102417#false} assume 5 == ~blastFlag~0; {102417#false} is VALID [2022-04-28 08:41:04,561 INFO L290 TraceCheckUtils]: 174: Hoare triple {102417#false} assume !false; {102417#false} is VALID [2022-04-28 08:41:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 99 proven. 70 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2022-04-28 08:41:04,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 08:41:05,029 INFO L290 TraceCheckUtils]: 174: Hoare triple {102417#false} assume !false; {102417#false} is VALID [2022-04-28 08:41:05,029 INFO L290 TraceCheckUtils]: 173: Hoare triple {102417#false} assume 5 == ~blastFlag~0; {102417#false} is VALID [2022-04-28 08:41:05,029 INFO L290 TraceCheckUtils]: 172: Hoare triple {102417#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {102417#false} is VALID [2022-04-28 08:41:05,030 INFO L290 TraceCheckUtils]: 171: Hoare triple {102964#(not (<= 4432 |ssl3_connect_#t~mem62|))} assume 4432 == #t~mem62;havoc #t~mem62; {102417#false} is VALID [2022-04-28 08:41:05,030 INFO L290 TraceCheckUtils]: 170: Hoare triple {102968#(< (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); {102964#(not (<= 4432 |ssl3_connect_#t~mem62|))} is VALID [2022-04-28 08:41:05,031 INFO L290 TraceCheckUtils]: 169: Hoare triple {102968#(< (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); {102968#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:41:05,031 INFO L290 TraceCheckUtils]: 168: Hoare triple {102968#(< (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); {102968#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:41:05,032 INFO L290 TraceCheckUtils]: 167: Hoare triple {102968#(< (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); {102968#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:41:05,032 INFO L290 TraceCheckUtils]: 166: Hoare triple {102968#(< (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); {102968#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:41:05,032 INFO L290 TraceCheckUtils]: 165: Hoare triple {102968#(< (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); {102968#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:41:05,033 INFO L290 TraceCheckUtils]: 164: Hoare triple {102968#(< (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); {102968#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:41:05,033 INFO L290 TraceCheckUtils]: 163: Hoare triple {102968#(< (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); {102968#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:41:05,034 INFO L290 TraceCheckUtils]: 162: Hoare triple {102968#(< (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); {102968#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:41:05,034 INFO L290 TraceCheckUtils]: 161: Hoare triple {102968#(< (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); {102968#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:41:05,034 INFO L290 TraceCheckUtils]: 160: Hoare triple {102968#(< (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); {102968#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:41:05,035 INFO L290 TraceCheckUtils]: 159: Hoare triple {102968#(< (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); {102968#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:41:05,035 INFO L290 TraceCheckUtils]: 158: Hoare triple {102968#(< (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); {102968#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:41:05,035 INFO L290 TraceCheckUtils]: 157: Hoare triple {102968#(< (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); {102968#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:41:05,036 INFO L290 TraceCheckUtils]: 156: Hoare triple {102968#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !false; {102968#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:41:05,036 INFO L290 TraceCheckUtils]: 155: Hoare triple {102968#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} ~skip~0 := 0; {102968#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:41:05,037 INFO L290 TraceCheckUtils]: 154: Hoare triple {102968#(< (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; {102968#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:41:05,037 INFO L290 TraceCheckUtils]: 153: Hoare triple {102968#(< (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); {102968#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:41:05,038 INFO L290 TraceCheckUtils]: 152: Hoare triple {102968#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {102968#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:41:05,039 INFO L290 TraceCheckUtils]: 151: Hoare triple {102416#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {102968#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-28 08:41:05,039 INFO L290 TraceCheckUtils]: 150: Hoare triple {102416#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,039 INFO L290 TraceCheckUtils]: 149: Hoare triple {102416#true} assume !(1 == ~blastFlag~0); {102416#true} is VALID [2022-04-28 08:41:05,039 INFO L290 TraceCheckUtils]: 148: Hoare triple {102416#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {102416#true} is VALID [2022-04-28 08:41:05,039 INFO L290 TraceCheckUtils]: 147: Hoare triple {102416#true} assume 4384 == #t~mem56;havoc #t~mem56; {102416#true} is VALID [2022-04-28 08:41:05,039 INFO L290 TraceCheckUtils]: 146: Hoare triple {102416#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,040 INFO L290 TraceCheckUtils]: 145: Hoare triple {102416#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,040 INFO L290 TraceCheckUtils]: 144: Hoare triple {102416#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,040 INFO L290 TraceCheckUtils]: 143: Hoare triple {102416#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,040 INFO L290 TraceCheckUtils]: 142: Hoare triple {102416#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,040 INFO L290 TraceCheckUtils]: 141: Hoare triple {102416#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,040 INFO L290 TraceCheckUtils]: 140: Hoare triple {102416#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,040 INFO L290 TraceCheckUtils]: 139: Hoare triple {102416#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,040 INFO L290 TraceCheckUtils]: 138: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-28 08:41:05,040 INFO L290 TraceCheckUtils]: 137: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-28 08:41:05,041 INFO L290 TraceCheckUtils]: 136: Hoare triple {102416#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {102416#true} is VALID [2022-04-28 08:41:05,041 INFO L290 TraceCheckUtils]: 135: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:05,041 INFO L290 TraceCheckUtils]: 134: Hoare triple {102416#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; {102416#true} is VALID [2022-04-28 08:41:05,041 INFO L290 TraceCheckUtils]: 133: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:05,041 INFO L290 TraceCheckUtils]: 132: Hoare triple {102416#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {102416#true} is VALID [2022-04-28 08:41:05,041 INFO L290 TraceCheckUtils]: 131: Hoare triple {102416#true} assume !(0 == ~blastFlag~0); {102416#true} is VALID [2022-04-28 08:41:05,041 INFO L290 TraceCheckUtils]: 130: Hoare triple {102416#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; {102416#true} is VALID [2022-04-28 08:41:05,041 INFO L290 TraceCheckUtils]: 129: Hoare triple {102416#true} assume 4369 == #t~mem55;havoc #t~mem55; {102416#true} is VALID [2022-04-28 08:41:05,041 INFO L290 TraceCheckUtils]: 128: Hoare triple {102416#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,042 INFO L290 TraceCheckUtils]: 127: Hoare triple {102416#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,042 INFO L290 TraceCheckUtils]: 126: Hoare triple {102416#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,042 INFO L290 TraceCheckUtils]: 125: Hoare triple {102416#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,042 INFO L290 TraceCheckUtils]: 124: Hoare triple {102416#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,042 INFO L290 TraceCheckUtils]: 123: Hoare triple {102416#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,042 INFO L290 TraceCheckUtils]: 122: Hoare triple {102416#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,042 INFO L290 TraceCheckUtils]: 121: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-28 08:41:05,042 INFO L290 TraceCheckUtils]: 120: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-28 08:41:05,042 INFO L290 TraceCheckUtils]: 119: Hoare triple {102416#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {102416#true} is VALID [2022-04-28 08:41:05,042 INFO L290 TraceCheckUtils]: 118: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:05,043 INFO L290 TraceCheckUtils]: 117: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:05,043 INFO L290 TraceCheckUtils]: 116: Hoare triple {102416#true} assume !(5 == ~blastFlag~0); {102416#true} is VALID [2022-04-28 08:41:05,043 INFO L290 TraceCheckUtils]: 115: Hoare triple {102416#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {102416#true} is VALID [2022-04-28 08:41:05,043 INFO L290 TraceCheckUtils]: 114: Hoare triple {102416#true} assume 4432 == #t~mem62;havoc #t~mem62; {102416#true} is VALID [2022-04-28 08:41:05,043 INFO L290 TraceCheckUtils]: 113: Hoare triple {102416#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,043 INFO L290 TraceCheckUtils]: 112: Hoare triple {102416#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,043 INFO L290 TraceCheckUtils]: 111: Hoare triple {102416#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,043 INFO L290 TraceCheckUtils]: 110: Hoare triple {102416#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,044 INFO L290 TraceCheckUtils]: 109: Hoare triple {102416#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,044 INFO L290 TraceCheckUtils]: 108: Hoare triple {102416#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,044 INFO L290 TraceCheckUtils]: 107: Hoare triple {102416#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,044 INFO L290 TraceCheckUtils]: 106: Hoare triple {102416#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,044 INFO L290 TraceCheckUtils]: 105: Hoare triple {102416#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,044 INFO L290 TraceCheckUtils]: 104: Hoare triple {102416#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,044 INFO L290 TraceCheckUtils]: 103: Hoare triple {102416#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,044 INFO L290 TraceCheckUtils]: 102: Hoare triple {102416#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,044 INFO L290 TraceCheckUtils]: 101: Hoare triple {102416#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,044 INFO L290 TraceCheckUtils]: 100: Hoare triple {102416#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,045 INFO L290 TraceCheckUtils]: 99: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-28 08:41:05,045 INFO L290 TraceCheckUtils]: 98: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-28 08:41:05,045 INFO L290 TraceCheckUtils]: 97: Hoare triple {102416#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {102416#true} is VALID [2022-04-28 08:41:05,045 INFO L290 TraceCheckUtils]: 96: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:05,045 INFO L290 TraceCheckUtils]: 95: Hoare triple {102416#true} assume !(0 == ~tmp___6~0); {102416#true} is VALID [2022-04-28 08:41:05,045 INFO L290 TraceCheckUtils]: 94: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:05,045 INFO L290 TraceCheckUtils]: 93: Hoare triple {102416#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {102416#true} is VALID [2022-04-28 08:41:05,045 INFO L290 TraceCheckUtils]: 92: Hoare triple {102416#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {102416#true} is VALID [2022-04-28 08:41:05,046 INFO L290 TraceCheckUtils]: 91: Hoare triple {102416#true} assume 4416 == #t~mem60;havoc #t~mem60; {102416#true} is VALID [2022-04-28 08:41:05,046 INFO L290 TraceCheckUtils]: 90: Hoare triple {102416#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,046 INFO L290 TraceCheckUtils]: 89: Hoare triple {102416#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,046 INFO L290 TraceCheckUtils]: 88: Hoare triple {102416#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,046 INFO L290 TraceCheckUtils]: 87: Hoare triple {102416#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,046 INFO L290 TraceCheckUtils]: 86: Hoare triple {102416#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,046 INFO L290 TraceCheckUtils]: 85: Hoare triple {102416#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,046 INFO L290 TraceCheckUtils]: 84: Hoare triple {102416#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,046 INFO L290 TraceCheckUtils]: 83: Hoare triple {102416#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,047 INFO L290 TraceCheckUtils]: 82: Hoare triple {102416#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,047 INFO L290 TraceCheckUtils]: 81: Hoare triple {102416#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,047 INFO L290 TraceCheckUtils]: 80: Hoare triple {102416#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,047 INFO L290 TraceCheckUtils]: 79: Hoare triple {102416#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,047 INFO L290 TraceCheckUtils]: 78: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-28 08:41:05,047 INFO L290 TraceCheckUtils]: 77: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-28 08:41:05,047 INFO L290 TraceCheckUtils]: 76: Hoare triple {102416#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {102416#true} is VALID [2022-04-28 08:41:05,048 INFO L290 TraceCheckUtils]: 75: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:05,048 INFO L290 TraceCheckUtils]: 74: Hoare triple {102416#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,048 INFO L290 TraceCheckUtils]: 73: Hoare triple {102416#true} assume !(~ret~0 <= 0); {102416#true} is VALID [2022-04-28 08:41:05,048 INFO L290 TraceCheckUtils]: 72: Hoare triple {102416#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {102416#true} is VALID [2022-04-28 08:41:05,048 INFO L290 TraceCheckUtils]: 71: Hoare triple {102416#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; {102416#true} is VALID [2022-04-28 08:41:05,048 INFO L290 TraceCheckUtils]: 70: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:05,048 INFO L290 TraceCheckUtils]: 69: Hoare triple {102416#true} assume 4400 == #t~mem58;havoc #t~mem58; {102416#true} is VALID [2022-04-28 08:41:05,048 INFO L290 TraceCheckUtils]: 68: Hoare triple {102416#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,049 INFO L290 TraceCheckUtils]: 67: Hoare triple {102416#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,049 INFO L290 TraceCheckUtils]: 66: Hoare triple {102416#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,049 INFO L290 TraceCheckUtils]: 65: Hoare triple {102416#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,049 INFO L290 TraceCheckUtils]: 64: Hoare triple {102416#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,049 INFO L290 TraceCheckUtils]: 63: Hoare triple {102416#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,049 INFO L290 TraceCheckUtils]: 62: Hoare triple {102416#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,049 INFO L290 TraceCheckUtils]: 61: Hoare triple {102416#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,049 INFO L290 TraceCheckUtils]: 60: Hoare triple {102416#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,049 INFO L290 TraceCheckUtils]: 59: Hoare triple {102416#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,050 INFO L290 TraceCheckUtils]: 58: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-28 08:41:05,050 INFO L290 TraceCheckUtils]: 57: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-28 08:41:05,050 INFO L290 TraceCheckUtils]: 56: Hoare triple {102416#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {102416#true} is VALID [2022-04-28 08:41:05,050 INFO L290 TraceCheckUtils]: 55: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:05,050 INFO L290 TraceCheckUtils]: 54: Hoare triple {102416#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,050 INFO L290 TraceCheckUtils]: 53: Hoare triple {102416#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,050 INFO L290 TraceCheckUtils]: 52: Hoare triple {102416#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,050 INFO L290 TraceCheckUtils]: 51: Hoare triple {102416#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {102416#true} is VALID [2022-04-28 08:41:05,051 INFO L290 TraceCheckUtils]: 50: Hoare triple {102416#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {102416#true} is VALID [2022-04-28 08:41:05,051 INFO L290 TraceCheckUtils]: 49: Hoare triple {102416#true} assume 4384 == #t~mem56;havoc #t~mem56; {102416#true} is VALID [2022-04-28 08:41:05,051 INFO L290 TraceCheckUtils]: 48: Hoare triple {102416#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,051 INFO L290 TraceCheckUtils]: 47: Hoare triple {102416#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,051 INFO L290 TraceCheckUtils]: 46: Hoare triple {102416#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,051 INFO L290 TraceCheckUtils]: 45: Hoare triple {102416#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,051 INFO L290 TraceCheckUtils]: 44: Hoare triple {102416#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,051 INFO L290 TraceCheckUtils]: 43: Hoare triple {102416#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,051 INFO L290 TraceCheckUtils]: 42: Hoare triple {102416#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,052 INFO L290 TraceCheckUtils]: 41: Hoare triple {102416#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,052 INFO L290 TraceCheckUtils]: 40: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-28 08:41:05,052 INFO L290 TraceCheckUtils]: 39: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-28 08:41:05,052 INFO L290 TraceCheckUtils]: 38: Hoare triple {102416#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {102416#true} is VALID [2022-04-28 08:41:05,052 INFO L290 TraceCheckUtils]: 37: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:05,052 INFO L290 TraceCheckUtils]: 36: Hoare triple {102416#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; {102416#true} is VALID [2022-04-28 08:41:05,052 INFO L290 TraceCheckUtils]: 35: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:05,052 INFO L290 TraceCheckUtils]: 34: Hoare triple {102416#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {102416#true} is VALID [2022-04-28 08:41:05,052 INFO L290 TraceCheckUtils]: 33: Hoare triple {102416#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; {102416#true} is VALID [2022-04-28 08:41:05,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {102416#true} assume 4368 == #t~mem54;havoc #t~mem54; {102416#true} is VALID [2022-04-28 08:41:05,053 INFO L290 TraceCheckUtils]: 31: Hoare triple {102416#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,053 INFO L290 TraceCheckUtils]: 30: Hoare triple {102416#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,053 INFO L290 TraceCheckUtils]: 29: Hoare triple {102416#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,053 INFO L290 TraceCheckUtils]: 28: Hoare triple {102416#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {102416#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {102416#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-28 08:41:05,053 INFO L290 TraceCheckUtils]: 24: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-28 08:41:05,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {102416#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {102416#true} is VALID [2022-04-28 08:41:05,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:05,054 INFO L290 TraceCheckUtils]: 21: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:05,054 INFO L290 TraceCheckUtils]: 20: Hoare triple {102416#true} assume !(0 == ~tmp___4~0); {102416#true} is VALID [2022-04-28 08:41:05,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {102416#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {102416#true} is VALID [2022-04-28 08:41:05,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:05,054 INFO L290 TraceCheckUtils]: 17: Hoare triple {102416#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {102416#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {102416#true} is VALID [2022-04-28 08:41:05,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {102416#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {102416#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; {102416#true} is VALID [2022-04-28 08:41:05,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {102416#true} assume 12292 == #t~mem49;havoc #t~mem49; {102416#true} is VALID [2022-04-28 08:41:05,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {102416#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102416#true} is VALID [2022-04-28 08:41:05,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-28 08:41:05,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {102416#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {102416#true} is VALID [2022-04-28 08:41:05,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {102416#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; {102416#true} is VALID [2022-04-28 08:41:05,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {102416#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; {102416#true} is VALID [2022-04-28 08:41:05,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:05,055 INFO L272 TraceCheckUtils]: 6: Hoare triple {102416#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {102416#true} is VALID [2022-04-28 08:41:05,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {102416#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; {102416#true} is VALID [2022-04-28 08:41:05,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {102416#true} call #t~ret158 := main(); {102416#true} is VALID [2022-04-28 08:41:05,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {102416#true} {102416#true} #593#return; {102416#true} is VALID [2022-04-28 08:41:05,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {102416#true} assume true; {102416#true} is VALID [2022-04-28 08:41:05,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {102416#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); {102416#true} is VALID [2022-04-28 08:41:05,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {102416#true} call ULTIMATE.init(); {102416#true} is VALID [2022-04-28 08:41:05,057 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2022-04-28 08:41:05,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820587100] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 08:41:05,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 08:41:05,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8, 5] total 13 [2022-04-28 08:41:05,058 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:41:05,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1090266493] [2022-04-28 08:41:05,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1090266493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:41:05,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:41:05,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:41:05,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854980957] [2022-04-28 08:41:05,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:41:05,059 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 175 [2022-04-28 08:41:05,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:41:05,060 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-28 08:41:05,163 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-28 08:41:05,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:41:05,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:05,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:41:05,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-04-28 08:41:05,164 INFO L87 Difference]: Start difference. First operand 970 states and 1382 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-28 08:41:11,227 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:41:12,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:12,541 INFO L93 Difference]: Finished difference Result 2377 states and 3382 transitions. [2022-04-28 08:41:12,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:41:12,541 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 175 [2022-04-28 08:41:12,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:41:12,542 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-28 08:41:12,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2022-04-28 08:41:12,543 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-28 08:41:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2022-04-28 08:41:12,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 471 transitions. [2022-04-28 08:41:12,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:12,931 INFO L225 Difference]: With dead ends: 2377 [2022-04-28 08:41:12,931 INFO L226 Difference]: Without dead ends: 1423 [2022-04-28 08:41:12,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-28 08:41:12,933 INFO L413 NwaCegarLoop]: 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-28 08:41:12,933 INFO L414 NwaCegarLoop]: 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-28 08:41:12,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2022-04-28 08:41:13,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1095. [2022-04-28 08:41:13,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:41:13,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1423 states. Second operand has 1095 states, 1090 states have (on average 1.424770642201835) internal successors, (1553), 1090 states have internal predecessors, (1553), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:13,340 INFO L74 IsIncluded]: Start isIncluded. First operand 1423 states. Second operand has 1095 states, 1090 states have (on average 1.424770642201835) internal successors, (1553), 1090 states have internal predecessors, (1553), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:13,341 INFO L87 Difference]: Start difference. First operand 1423 states. Second operand has 1095 states, 1090 states have (on average 1.424770642201835) internal successors, (1553), 1090 states have internal predecessors, (1553), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:13,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:13,391 INFO L93 Difference]: Finished difference Result 1423 states and 2015 transitions. [2022-04-28 08:41:13,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 2015 transitions. [2022-04-28 08:41:13,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:13,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:13,394 INFO L74 IsIncluded]: Start isIncluded. First operand has 1095 states, 1090 states have (on average 1.424770642201835) internal successors, (1553), 1090 states have internal predecessors, (1553), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1423 states. [2022-04-28 08:41:13,394 INFO L87 Difference]: Start difference. First operand has 1095 states, 1090 states have (on average 1.424770642201835) internal successors, (1553), 1090 states have internal predecessors, (1553), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1423 states. [2022-04-28 08:41:13,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:13,458 INFO L93 Difference]: Finished difference Result 1423 states and 2015 transitions. [2022-04-28 08:41:13,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 2015 transitions. [2022-04-28 08:41:13,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:13,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:13,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:41:13,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:41:13,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 1090 states have (on average 1.424770642201835) internal successors, (1553), 1090 states have internal predecessors, (1553), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:13,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1557 transitions. [2022-04-28 08:41:13,508 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1557 transitions. Word has length 175 [2022-04-28 08:41:13,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:41:13,509 INFO L495 AbstractCegarLoop]: Abstraction has 1095 states and 1557 transitions. [2022-04-28 08:41:13,509 INFO L496 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-28 08:41:13,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1095 states and 1557 transitions. [2022-04-28 08:41:15,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1557 edges. 1557 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:15,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1557 transitions. [2022-04-28 08:41:15,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-04-28 08:41:15,130 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:41:15,130 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 4, 4, 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, 1, 1] [2022-04-28 08:41:15,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 08:41:15,330 WARN L477 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-28 08:41:15,331 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:41:15,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:41:15,332 INFO L85 PathProgramCache]: Analyzing trace with hash 640460076, now seen corresponding path program 1 times [2022-04-28 08:41:15,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:15,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1033566954] [2022-04-28 08:41:37,030 WARN L232 SmtUtils]: Spent 15.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-28 08:41:47,228 WARN L232 SmtUtils]: Spent 5.99s on a formula simplification that was a NOOP. DAG size: 153 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:41:49,288 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:41:49,288 INFO L85 PathProgramCache]: Analyzing trace with hash 640460076, now seen corresponding path program 2 times [2022-04-28 08:41:49,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:41:49,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076268510] [2022-04-28 08:41:49,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:41:49,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:41:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:49,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:41:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:49,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {113281#(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); {113273#true} is VALID [2022-04-28 08:41:49,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {113273#true} assume true; {113273#true} is VALID [2022-04-28 08:41:49,567 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {113273#true} {113273#true} #593#return; {113273#true} is VALID [2022-04-28 08:41:49,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {113273#true} call ULTIMATE.init(); {113281#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:41:49,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {113281#(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); {113273#true} is VALID [2022-04-28 08:41:49,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {113273#true} assume true; {113273#true} is VALID [2022-04-28 08:41:49,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {113273#true} {113273#true} #593#return; {113273#true} is VALID [2022-04-28 08:41:49,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {113273#true} call #t~ret158 := main(); {113273#true} is VALID [2022-04-28 08:41:49,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {113273#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; {113273#true} is VALID [2022-04-28 08:41:49,568 INFO L272 TraceCheckUtils]: 6: Hoare triple {113273#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {113273#true} is VALID [2022-04-28 08:41:49,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:41:49,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {113273#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; {113273#true} is VALID [2022-04-28 08:41:49,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {113273#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; {113273#true} is VALID [2022-04-28 08:41:49,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {113273#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {113273#true} is VALID [2022-04-28 08:41:49,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-28 08:41:49,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {113273#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:41:49,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {113273#true} assume 12292 == #t~mem49;havoc #t~mem49; {113273#true} is VALID [2022-04-28 08:41:49,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {113273#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; {113273#true} is VALID [2022-04-28 08:41:49,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {113273#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:41:49,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {113273#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {113273#true} is VALID [2022-04-28 08:41:49,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {113273#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:41:49,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:41:49,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {113273#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {113273#true} is VALID [2022-04-28 08:41:49,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {113273#true} assume !(0 == ~tmp___4~0); {113273#true} is VALID [2022-04-28 08:41:49,570 INFO L290 TraceCheckUtils]: 21: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:41:49,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:41:49,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {113273#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {113273#true} is VALID [2022-04-28 08:41:49,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-28 08:41:49,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-28 08:41:49,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {113273#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:41:49,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {113273#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:41:49,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {113273#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:41:49,571 INFO L290 TraceCheckUtils]: 29: Hoare triple {113273#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:41:49,571 INFO L290 TraceCheckUtils]: 30: Hoare triple {113273#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:41:49,571 INFO L290 TraceCheckUtils]: 31: Hoare triple {113273#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:41:49,571 INFO L290 TraceCheckUtils]: 32: Hoare triple {113273#true} assume 4368 == #t~mem54;havoc #t~mem54; {113273#true} is VALID [2022-04-28 08:41:49,571 INFO L290 TraceCheckUtils]: 33: Hoare triple {113273#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; {113273#true} is VALID [2022-04-28 08:41:49,571 INFO L290 TraceCheckUtils]: 34: Hoare triple {113273#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {113273#true} is VALID [2022-04-28 08:41:49,571 INFO L290 TraceCheckUtils]: 35: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:41:49,571 INFO L290 TraceCheckUtils]: 36: Hoare triple {113273#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; {113273#true} is VALID [2022-04-28 08:41:49,572 INFO L290 TraceCheckUtils]: 37: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:41:49,572 INFO L290 TraceCheckUtils]: 38: Hoare triple {113273#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {113273#true} is VALID [2022-04-28 08:41:49,572 INFO L290 TraceCheckUtils]: 39: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-28 08:41:49,572 INFO L290 TraceCheckUtils]: 40: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-28 08:41:49,572 INFO L290 TraceCheckUtils]: 41: Hoare triple {113273#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:41:49,572 INFO L290 TraceCheckUtils]: 42: Hoare triple {113273#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:41:49,572 INFO L290 TraceCheckUtils]: 43: Hoare triple {113273#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:41:49,572 INFO L290 TraceCheckUtils]: 44: Hoare triple {113273#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:41:49,572 INFO L290 TraceCheckUtils]: 45: Hoare triple {113273#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:41:49,572 INFO L290 TraceCheckUtils]: 46: Hoare triple {113273#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:41:49,573 INFO L290 TraceCheckUtils]: 47: Hoare triple {113273#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:41:49,573 INFO L290 TraceCheckUtils]: 48: Hoare triple {113273#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:41:49,573 INFO L290 TraceCheckUtils]: 49: Hoare triple {113273#true} assume 4384 == #t~mem56;havoc #t~mem56; {113273#true} is VALID [2022-04-28 08:41:49,573 INFO L290 TraceCheckUtils]: 50: Hoare triple {113273#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {113273#true} is VALID [2022-04-28 08:41:49,573 INFO L290 TraceCheckUtils]: 51: Hoare triple {113273#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {113273#true} is VALID [2022-04-28 08:41:49,573 INFO L290 TraceCheckUtils]: 52: Hoare triple {113273#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {113278#(= |ssl3_connect_#t~mem93| (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:41:49,574 INFO L290 TraceCheckUtils]: 53: Hoare triple {113278#(= |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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,575 INFO L290 TraceCheckUtils]: 54: Hoare triple {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,576 INFO L290 TraceCheckUtils]: 55: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,576 INFO L290 TraceCheckUtils]: 56: Hoare triple {113279#(= (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; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,576 INFO L290 TraceCheckUtils]: 57: Hoare triple {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,577 INFO L290 TraceCheckUtils]: 58: Hoare triple {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,577 INFO L290 TraceCheckUtils]: 59: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,577 INFO L290 TraceCheckUtils]: 60: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,578 INFO L290 TraceCheckUtils]: 61: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,578 INFO L290 TraceCheckUtils]: 62: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,578 INFO L290 TraceCheckUtils]: 63: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,579 INFO L290 TraceCheckUtils]: 64: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,579 INFO L290 TraceCheckUtils]: 65: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,579 INFO L290 TraceCheckUtils]: 66: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,580 INFO L290 TraceCheckUtils]: 67: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,580 INFO L290 TraceCheckUtils]: 68: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,580 INFO L290 TraceCheckUtils]: 69: Hoare triple {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4400 == #t~mem58;havoc #t~mem58; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,581 INFO L290 TraceCheckUtils]: 70: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,581 INFO L290 TraceCheckUtils]: 71: Hoare triple {113279#(= (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; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,581 INFO L290 TraceCheckUtils]: 72: Hoare triple {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,582 INFO L290 TraceCheckUtils]: 73: Hoare triple {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,583 INFO L290 TraceCheckUtils]: 74: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,583 INFO L290 TraceCheckUtils]: 75: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,584 INFO L290 TraceCheckUtils]: 76: Hoare triple {113279#(= (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; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,584 INFO L290 TraceCheckUtils]: 77: Hoare triple {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,584 INFO L290 TraceCheckUtils]: 78: Hoare triple {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,585 INFO L290 TraceCheckUtils]: 79: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,585 INFO L290 TraceCheckUtils]: 80: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,585 INFO L290 TraceCheckUtils]: 81: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,586 INFO L290 TraceCheckUtils]: 82: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,586 INFO L290 TraceCheckUtils]: 83: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,586 INFO L290 TraceCheckUtils]: 84: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,587 INFO L290 TraceCheckUtils]: 85: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,587 INFO L290 TraceCheckUtils]: 86: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,587 INFO L290 TraceCheckUtils]: 87: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,587 INFO L290 TraceCheckUtils]: 88: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,588 INFO L290 TraceCheckUtils]: 89: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,588 INFO L290 TraceCheckUtils]: 90: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,588 INFO L290 TraceCheckUtils]: 91: Hoare triple {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4416 == #t~mem60;havoc #t~mem60; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,589 INFO L290 TraceCheckUtils]: 92: Hoare triple {113279#(= (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; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,589 INFO L290 TraceCheckUtils]: 93: Hoare triple {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,590 INFO L290 TraceCheckUtils]: 94: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,590 INFO L290 TraceCheckUtils]: 95: Hoare triple {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == ~tmp___6~0); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,591 INFO L290 TraceCheckUtils]: 96: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,591 INFO L290 TraceCheckUtils]: 97: Hoare triple {113279#(= (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; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,591 INFO L290 TraceCheckUtils]: 98: Hoare triple {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,592 INFO L290 TraceCheckUtils]: 99: Hoare triple {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,592 INFO L290 TraceCheckUtils]: 100: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,592 INFO L290 TraceCheckUtils]: 101: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,593 INFO L290 TraceCheckUtils]: 102: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,593 INFO L290 TraceCheckUtils]: 103: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,593 INFO L290 TraceCheckUtils]: 104: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,594 INFO L290 TraceCheckUtils]: 105: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,594 INFO L290 TraceCheckUtils]: 106: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,594 INFO L290 TraceCheckUtils]: 107: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,595 INFO L290 TraceCheckUtils]: 108: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,595 INFO L290 TraceCheckUtils]: 109: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,595 INFO L290 TraceCheckUtils]: 110: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,596 INFO L290 TraceCheckUtils]: 111: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,596 INFO L290 TraceCheckUtils]: 112: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,596 INFO L290 TraceCheckUtils]: 113: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,597 INFO L290 TraceCheckUtils]: 114: Hoare triple {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4432 == #t~mem62;havoc #t~mem62; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,597 INFO L290 TraceCheckUtils]: 115: Hoare triple {113279#(= (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; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,597 INFO L290 TraceCheckUtils]: 116: Hoare triple {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(5 == ~blastFlag~0); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,599 INFO L290 TraceCheckUtils]: 117: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,599 INFO L290 TraceCheckUtils]: 118: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,599 INFO L290 TraceCheckUtils]: 119: Hoare triple {113279#(= (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; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,600 INFO L290 TraceCheckUtils]: 120: Hoare triple {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,600 INFO L290 TraceCheckUtils]: 121: Hoare triple {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,600 INFO L290 TraceCheckUtils]: 122: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,601 INFO L290 TraceCheckUtils]: 123: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,601 INFO L290 TraceCheckUtils]: 124: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,601 INFO L290 TraceCheckUtils]: 125: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,602 INFO L290 TraceCheckUtils]: 126: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,602 INFO L290 TraceCheckUtils]: 127: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,602 INFO L290 TraceCheckUtils]: 128: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,603 INFO L290 TraceCheckUtils]: 129: Hoare triple {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4369 == #t~mem55;havoc #t~mem55; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,604 INFO L290 TraceCheckUtils]: 130: Hoare triple {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,604 INFO L290 TraceCheckUtils]: 131: Hoare triple {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == ~blastFlag~0); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,604 INFO L290 TraceCheckUtils]: 132: Hoare triple {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,606 INFO L290 TraceCheckUtils]: 133: Hoare triple {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} 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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,606 INFO L290 TraceCheckUtils]: 134: Hoare triple {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} 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; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,606 INFO L290 TraceCheckUtils]: 135: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,607 INFO L290 TraceCheckUtils]: 136: Hoare triple {113279#(= (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; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,607 INFO L290 TraceCheckUtils]: 137: Hoare triple {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,607 INFO L290 TraceCheckUtils]: 138: Hoare triple {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,608 INFO L290 TraceCheckUtils]: 139: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,608 INFO L290 TraceCheckUtils]: 140: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,608 INFO L290 TraceCheckUtils]: 141: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,609 INFO L290 TraceCheckUtils]: 142: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,609 INFO L290 TraceCheckUtils]: 143: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,610 INFO L290 TraceCheckUtils]: 144: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,610 INFO L290 TraceCheckUtils]: 145: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,610 INFO L290 TraceCheckUtils]: 146: Hoare triple {113279#(= (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); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,611 INFO L290 TraceCheckUtils]: 147: Hoare triple {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4384 == #t~mem56;havoc #t~mem56; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,611 INFO L290 TraceCheckUtils]: 148: Hoare triple {113279#(= (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; {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,611 INFO L290 TraceCheckUtils]: 149: Hoare triple {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(1 == ~blastFlag~0); {113279#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:41:49,612 INFO L290 TraceCheckUtils]: 150: Hoare triple {113279#(= (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); {113280#(= |ssl3_connect_#t~mem93| 0)} is VALID [2022-04-28 08:41:49,612 INFO L290 TraceCheckUtils]: 151: Hoare triple {113280#(= |ssl3_connect_#t~mem93| 0)} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {113274#false} is VALID [2022-04-28 08:41:49,612 INFO L290 TraceCheckUtils]: 152: Hoare triple {113274#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {113274#false} is VALID [2022-04-28 08:41:49,612 INFO L290 TraceCheckUtils]: 153: Hoare triple {113274#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); {113274#false} is VALID [2022-04-28 08:41:49,613 INFO L290 TraceCheckUtils]: 154: Hoare triple {113274#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {113274#false} is VALID [2022-04-28 08:41:49,613 INFO L290 TraceCheckUtils]: 155: Hoare triple {113274#false} ~skip~0 := 0; {113274#false} is VALID [2022-04-28 08:41:49,613 INFO L290 TraceCheckUtils]: 156: Hoare triple {113274#false} assume !false; {113274#false} is VALID [2022-04-28 08:41:49,613 INFO L290 TraceCheckUtils]: 157: Hoare triple {113274#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); {113274#false} is VALID [2022-04-28 08:41:49,613 INFO L290 TraceCheckUtils]: 158: Hoare triple {113274#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {113274#false} is VALID [2022-04-28 08:41:49,613 INFO L290 TraceCheckUtils]: 159: Hoare triple {113274#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {113274#false} is VALID [2022-04-28 08:41:49,613 INFO L290 TraceCheckUtils]: 160: Hoare triple {113274#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {113274#false} is VALID [2022-04-28 08:41:49,613 INFO L290 TraceCheckUtils]: 161: Hoare triple {113274#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {113274#false} is VALID [2022-04-28 08:41:49,614 INFO L290 TraceCheckUtils]: 162: Hoare triple {113274#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {113274#false} is VALID [2022-04-28 08:41:49,614 INFO L290 TraceCheckUtils]: 163: Hoare triple {113274#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {113274#false} is VALID [2022-04-28 08:41:49,614 INFO L290 TraceCheckUtils]: 164: Hoare triple {113274#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {113274#false} is VALID [2022-04-28 08:41:49,614 INFO L290 TraceCheckUtils]: 165: Hoare triple {113274#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {113274#false} is VALID [2022-04-28 08:41:49,614 INFO L290 TraceCheckUtils]: 166: Hoare triple {113274#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {113274#false} is VALID [2022-04-28 08:41:49,614 INFO L290 TraceCheckUtils]: 167: Hoare triple {113274#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {113274#false} is VALID [2022-04-28 08:41:49,614 INFO L290 TraceCheckUtils]: 168: Hoare triple {113274#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {113274#false} is VALID [2022-04-28 08:41:49,614 INFO L290 TraceCheckUtils]: 169: Hoare triple {113274#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {113274#false} is VALID [2022-04-28 08:41:49,614 INFO L290 TraceCheckUtils]: 170: Hoare triple {113274#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {113274#false} is VALID [2022-04-28 08:41:49,615 INFO L290 TraceCheckUtils]: 171: Hoare triple {113274#false} assume 4432 == #t~mem62;havoc #t~mem62; {113274#false} is VALID [2022-04-28 08:41:49,615 INFO L290 TraceCheckUtils]: 172: Hoare triple {113274#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {113274#false} is VALID [2022-04-28 08:41:49,615 INFO L290 TraceCheckUtils]: 173: Hoare triple {113274#false} assume 5 == ~blastFlag~0; {113274#false} is VALID [2022-04-28 08:41:49,615 INFO L290 TraceCheckUtils]: 174: Hoare triple {113274#false} assume !false; {113274#false} is VALID [2022-04-28 08:41:49,616 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 247 proven. 1 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-04-28 08:41:49,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:41:49,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076268510] [2022-04-28 08:41:49,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076268510] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 08:41:49,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410413099] [2022-04-28 08:41:49,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 08:41:49,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:41:49,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:41:49,618 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 08:41:49,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 08:43:23,466 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 08:43:23,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 08:43:23,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 1544 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 08:43:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:43:23,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 08:43:23,678 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-28 08:43:23,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 143 [2022-04-28 08:43:23,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 63 [2022-04-28 08:43:23,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-28 08:43:23,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-28 08:43:23,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2022-04-28 08:43:23,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-04-28 08:43:23,961 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-28 08:43:23,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-04-28 08:43:24,215 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-28 08:43:24,246 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-28 08:43:24,246 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-28 08:43:24,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-04-28 08:43:24,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {113273#true} call ULTIMATE.init(); {113273#true} is VALID [2022-04-28 08:43:24,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {113273#true} assume true; {113273#true} is VALID [2022-04-28 08:43:24,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {113273#true} {113273#true} #593#return; {113273#true} is VALID [2022-04-28 08:43:24,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {113273#true} call #t~ret158 := main(); {113273#true} is VALID [2022-04-28 08:43:24,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {113273#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; {113273#true} is VALID [2022-04-28 08:43:24,392 INFO L272 TraceCheckUtils]: 6: Hoare triple {113273#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {113273#true} is VALID [2022-04-28 08:43:24,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {113273#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; {113273#true} is VALID [2022-04-28 08:43:24,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {113273#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; {113273#true} is VALID [2022-04-28 08:43:24,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {113273#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {113273#true} is VALID [2022-04-28 08:43:24,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-28 08:43:24,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {113273#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {113273#true} assume 12292 == #t~mem49;havoc #t~mem49; {113273#true} is VALID [2022-04-28 08:43:24,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {113273#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; {113273#true} is VALID [2022-04-28 08:43:24,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {113273#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {113273#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {113273#true} is VALID [2022-04-28 08:43:24,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {113273#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {113273#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {113273#true} is VALID [2022-04-28 08:43:24,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {113273#true} assume !(0 == ~tmp___4~0); {113273#true} is VALID [2022-04-28 08:43:24,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {113273#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); {113348#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {113348#(= 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); {113348#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {113348#(= 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; {113348#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,396 INFO L290 TraceCheckUtils]: 24: Hoare triple {113348#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} ~skip~0 := 0; {113348#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {113348#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !false; {113348#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {113348#(= 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); {113348#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,397 INFO L290 TraceCheckUtils]: 27: Hoare triple {113348#(= 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); {113348#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,397 INFO L290 TraceCheckUtils]: 28: Hoare triple {113348#(= 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); {113348#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,398 INFO L290 TraceCheckUtils]: 29: Hoare triple {113348#(= 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); {113348#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,398 INFO L290 TraceCheckUtils]: 30: Hoare triple {113348#(= 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); {113348#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,398 INFO L290 TraceCheckUtils]: 31: Hoare triple {113348#(= 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); {113273#true} is VALID [2022-04-28 08:43:24,398 INFO L290 TraceCheckUtils]: 32: Hoare triple {113273#true} assume 4368 == #t~mem54;havoc #t~mem54; {113273#true} is VALID [2022-04-28 08:43:24,398 INFO L290 TraceCheckUtils]: 33: Hoare triple {113273#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; {113273#true} is VALID [2022-04-28 08:43:24,398 INFO L290 TraceCheckUtils]: 34: Hoare triple {113273#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {113273#true} is VALID [2022-04-28 08:43:24,398 INFO L290 TraceCheckUtils]: 35: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,398 INFO L290 TraceCheckUtils]: 36: Hoare triple {113273#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; {113273#true} is VALID [2022-04-28 08:43:24,399 INFO L290 TraceCheckUtils]: 37: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {113273#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {113273#true} is VALID [2022-04-28 08:43:24,399 INFO L290 TraceCheckUtils]: 39: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-28 08:43:24,399 INFO L290 TraceCheckUtils]: 40: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-28 08:43:24,399 INFO L290 TraceCheckUtils]: 41: Hoare triple {113273#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,399 INFO L290 TraceCheckUtils]: 42: Hoare triple {113273#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,399 INFO L290 TraceCheckUtils]: 43: Hoare triple {113273#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,399 INFO L290 TraceCheckUtils]: 44: Hoare triple {113273#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,399 INFO L290 TraceCheckUtils]: 45: Hoare triple {113273#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,399 INFO L290 TraceCheckUtils]: 46: Hoare triple {113273#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,399 INFO L290 TraceCheckUtils]: 47: Hoare triple {113273#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,399 INFO L290 TraceCheckUtils]: 48: Hoare triple {113273#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,399 INFO L290 TraceCheckUtils]: 49: Hoare triple {113273#true} assume 4384 == #t~mem56;havoc #t~mem56; {113273#true} is VALID [2022-04-28 08:43:24,399 INFO L290 TraceCheckUtils]: 50: Hoare triple {113273#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {113273#true} is VALID [2022-04-28 08:43:24,400 INFO L290 TraceCheckUtils]: 51: Hoare triple {113273#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {113273#true} is VALID [2022-04-28 08:43:24,400 INFO L290 TraceCheckUtils]: 52: Hoare triple {113273#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,400 INFO L290 TraceCheckUtils]: 53: Hoare triple {113273#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,400 INFO L290 TraceCheckUtils]: 54: Hoare triple {113273#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,400 INFO L290 TraceCheckUtils]: 55: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,400 INFO L290 TraceCheckUtils]: 56: Hoare triple {113273#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {113273#true} is VALID [2022-04-28 08:43:24,400 INFO L290 TraceCheckUtils]: 57: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-28 08:43:24,400 INFO L290 TraceCheckUtils]: 58: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-28 08:43:24,400 INFO L290 TraceCheckUtils]: 59: Hoare triple {113273#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,400 INFO L290 TraceCheckUtils]: 60: Hoare triple {113273#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,400 INFO L290 TraceCheckUtils]: 61: Hoare triple {113273#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,400 INFO L290 TraceCheckUtils]: 62: Hoare triple {113273#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,401 INFO L290 TraceCheckUtils]: 63: Hoare triple {113273#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,401 INFO L290 TraceCheckUtils]: 64: Hoare triple {113273#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,401 INFO L290 TraceCheckUtils]: 65: Hoare triple {113273#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,401 INFO L290 TraceCheckUtils]: 66: Hoare triple {113273#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,401 INFO L290 TraceCheckUtils]: 67: Hoare triple {113273#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,401 INFO L290 TraceCheckUtils]: 68: Hoare triple {113273#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,401 INFO L290 TraceCheckUtils]: 69: Hoare triple {113273#true} assume 4400 == #t~mem58;havoc #t~mem58; {113273#true} is VALID [2022-04-28 08:43:24,401 INFO L290 TraceCheckUtils]: 70: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,401 INFO L290 TraceCheckUtils]: 71: Hoare triple {113273#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; {113273#true} is VALID [2022-04-28 08:43:24,401 INFO L290 TraceCheckUtils]: 72: Hoare triple {113273#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {113273#true} is VALID [2022-04-28 08:43:24,401 INFO L290 TraceCheckUtils]: 73: Hoare triple {113273#true} assume !(~ret~0 <= 0); {113273#true} is VALID [2022-04-28 08:43:24,402 INFO L290 TraceCheckUtils]: 74: Hoare triple {113273#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,402 INFO L290 TraceCheckUtils]: 75: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,402 INFO L290 TraceCheckUtils]: 76: Hoare triple {113273#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {113273#true} is VALID [2022-04-28 08:43:24,402 INFO L290 TraceCheckUtils]: 77: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-28 08:43:24,402 INFO L290 TraceCheckUtils]: 78: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-28 08:43:24,402 INFO L290 TraceCheckUtils]: 79: Hoare triple {113273#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,402 INFO L290 TraceCheckUtils]: 80: Hoare triple {113273#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,402 INFO L290 TraceCheckUtils]: 81: Hoare triple {113273#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,402 INFO L290 TraceCheckUtils]: 82: Hoare triple {113273#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,402 INFO L290 TraceCheckUtils]: 83: Hoare triple {113273#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,403 INFO L290 TraceCheckUtils]: 84: Hoare triple {113273#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,403 INFO L290 TraceCheckUtils]: 85: Hoare triple {113273#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,403 INFO L290 TraceCheckUtils]: 86: Hoare triple {113273#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,403 INFO L290 TraceCheckUtils]: 87: Hoare triple {113273#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,403 INFO L290 TraceCheckUtils]: 88: Hoare triple {113273#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,403 INFO L290 TraceCheckUtils]: 89: Hoare triple {113273#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,403 INFO L290 TraceCheckUtils]: 90: Hoare triple {113273#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,403 INFO L290 TraceCheckUtils]: 91: Hoare triple {113273#true} assume 4416 == #t~mem60;havoc #t~mem60; {113273#true} is VALID [2022-04-28 08:43:24,403 INFO L290 TraceCheckUtils]: 92: Hoare triple {113273#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {113273#true} is VALID [2022-04-28 08:43:24,403 INFO L290 TraceCheckUtils]: 93: Hoare triple {113273#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {113273#true} is VALID [2022-04-28 08:43:24,404 INFO L290 TraceCheckUtils]: 94: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,404 INFO L290 TraceCheckUtils]: 95: Hoare triple {113273#true} assume !(0 == ~tmp___6~0); {113273#true} is VALID [2022-04-28 08:43:24,404 INFO L290 TraceCheckUtils]: 96: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,404 INFO L290 TraceCheckUtils]: 97: Hoare triple {113273#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {113273#true} is VALID [2022-04-28 08:43:24,404 INFO L290 TraceCheckUtils]: 98: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-28 08:43:24,404 INFO L290 TraceCheckUtils]: 99: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-28 08:43:24,404 INFO L290 TraceCheckUtils]: 100: Hoare triple {113273#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,404 INFO L290 TraceCheckUtils]: 101: Hoare triple {113273#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,404 INFO L290 TraceCheckUtils]: 102: Hoare triple {113273#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,404 INFO L290 TraceCheckUtils]: 103: Hoare triple {113273#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,405 INFO L290 TraceCheckUtils]: 104: Hoare triple {113273#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,405 INFO L290 TraceCheckUtils]: 105: Hoare triple {113273#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,405 INFO L290 TraceCheckUtils]: 106: Hoare triple {113273#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,405 INFO L290 TraceCheckUtils]: 107: Hoare triple {113273#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,405 INFO L290 TraceCheckUtils]: 108: Hoare triple {113273#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,405 INFO L290 TraceCheckUtils]: 109: Hoare triple {113273#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,405 INFO L290 TraceCheckUtils]: 110: Hoare triple {113273#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,405 INFO L290 TraceCheckUtils]: 111: Hoare triple {113273#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,405 INFO L290 TraceCheckUtils]: 112: Hoare triple {113273#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,405 INFO L290 TraceCheckUtils]: 113: Hoare triple {113273#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,406 INFO L290 TraceCheckUtils]: 114: Hoare triple {113273#true} assume 4432 == #t~mem62;havoc #t~mem62; {113273#true} is VALID [2022-04-28 08:43:24,406 INFO L290 TraceCheckUtils]: 115: Hoare triple {113273#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {113273#true} is VALID [2022-04-28 08:43:24,406 INFO L290 TraceCheckUtils]: 116: Hoare triple {113273#true} assume !(5 == ~blastFlag~0); {113273#true} is VALID [2022-04-28 08:43:24,406 INFO L290 TraceCheckUtils]: 117: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,406 INFO L290 TraceCheckUtils]: 118: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,406 INFO L290 TraceCheckUtils]: 119: Hoare triple {113273#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {113273#true} is VALID [2022-04-28 08:43:24,406 INFO L290 TraceCheckUtils]: 120: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-28 08:43:24,406 INFO L290 TraceCheckUtils]: 121: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-28 08:43:24,406 INFO L290 TraceCheckUtils]: 122: Hoare triple {113273#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,406 INFO L290 TraceCheckUtils]: 123: Hoare triple {113273#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,407 INFO L290 TraceCheckUtils]: 124: Hoare triple {113273#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,407 INFO L290 TraceCheckUtils]: 125: Hoare triple {113273#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,407 INFO L290 TraceCheckUtils]: 126: Hoare triple {113273#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,407 INFO L290 TraceCheckUtils]: 127: Hoare triple {113273#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,407 INFO L290 TraceCheckUtils]: 128: Hoare triple {113273#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,407 INFO L290 TraceCheckUtils]: 129: Hoare triple {113273#true} assume 4369 == #t~mem55;havoc #t~mem55; {113273#true} is VALID [2022-04-28 08:43:24,407 INFO L290 TraceCheckUtils]: 130: Hoare triple {113273#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; {113273#true} is VALID [2022-04-28 08:43:24,407 INFO L290 TraceCheckUtils]: 131: Hoare triple {113273#true} assume !(0 == ~blastFlag~0); {113273#true} is VALID [2022-04-28 08:43:24,407 INFO L290 TraceCheckUtils]: 132: Hoare triple {113273#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {113273#true} is VALID [2022-04-28 08:43:24,407 INFO L290 TraceCheckUtils]: 133: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,408 INFO L290 TraceCheckUtils]: 134: Hoare triple {113273#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; {113273#true} is VALID [2022-04-28 08:43:24,408 INFO L290 TraceCheckUtils]: 135: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,408 INFO L290 TraceCheckUtils]: 136: Hoare triple {113273#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {113273#true} is VALID [2022-04-28 08:43:24,408 INFO L290 TraceCheckUtils]: 137: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-28 08:43:24,408 INFO L290 TraceCheckUtils]: 138: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-28 08:43:24,408 INFO L290 TraceCheckUtils]: 139: Hoare triple {113273#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,408 INFO L290 TraceCheckUtils]: 140: Hoare triple {113273#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,408 INFO L290 TraceCheckUtils]: 141: Hoare triple {113273#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,408 INFO L290 TraceCheckUtils]: 142: Hoare triple {113273#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,408 INFO L290 TraceCheckUtils]: 143: Hoare triple {113273#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,408 INFO L290 TraceCheckUtils]: 144: Hoare triple {113273#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,409 INFO L290 TraceCheckUtils]: 145: Hoare triple {113273#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,409 INFO L290 TraceCheckUtils]: 146: Hoare triple {113273#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,409 INFO L290 TraceCheckUtils]: 147: Hoare triple {113273#true} assume 4384 == #t~mem56;havoc #t~mem56; {113273#true} is VALID [2022-04-28 08:43:24,409 INFO L290 TraceCheckUtils]: 148: Hoare triple {113273#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {113273#true} is VALID [2022-04-28 08:43:24,409 INFO L290 TraceCheckUtils]: 149: Hoare triple {113273#true} assume !(1 == ~blastFlag~0); {113273#true} is VALID [2022-04-28 08:43:24,409 INFO L290 TraceCheckUtils]: 150: Hoare triple {113273#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,412 INFO L290 TraceCheckUtils]: 151: Hoare triple {113273#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {113739#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,413 INFO L290 TraceCheckUtils]: 152: Hoare triple {113739#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {113739#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,414 INFO L290 TraceCheckUtils]: 153: Hoare triple {113739#(<= 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); {113739#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,414 INFO L290 TraceCheckUtils]: 154: Hoare triple {113739#(<= 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; {113739#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,414 INFO L290 TraceCheckUtils]: 155: Hoare triple {113739#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {113739#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,415 INFO L290 TraceCheckUtils]: 156: Hoare triple {113739#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {113739#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,415 INFO L290 TraceCheckUtils]: 157: Hoare triple {113739#(<= 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); {113739#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,415 INFO L290 TraceCheckUtils]: 158: Hoare triple {113739#(<= 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); {113739#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,416 INFO L290 TraceCheckUtils]: 159: Hoare triple {113739#(<= 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); {113739#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,416 INFO L290 TraceCheckUtils]: 160: Hoare triple {113739#(<= 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); {113739#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,416 INFO L290 TraceCheckUtils]: 161: Hoare triple {113739#(<= 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); {113739#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,417 INFO L290 TraceCheckUtils]: 162: Hoare triple {113739#(<= 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); {113739#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,417 INFO L290 TraceCheckUtils]: 163: Hoare triple {113739#(<= 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); {113739#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,417 INFO L290 TraceCheckUtils]: 164: Hoare triple {113739#(<= 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); {113739#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,418 INFO L290 TraceCheckUtils]: 165: Hoare triple {113739#(<= 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); {113739#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,418 INFO L290 TraceCheckUtils]: 166: Hoare triple {113739#(<= 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); {113739#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,419 INFO L290 TraceCheckUtils]: 167: Hoare triple {113739#(<= 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); {113739#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,419 INFO L290 TraceCheckUtils]: 168: Hoare triple {113739#(<= 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); {113739#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,419 INFO L290 TraceCheckUtils]: 169: Hoare triple {113739#(<= 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); {113739#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,420 INFO L290 TraceCheckUtils]: 170: Hoare triple {113739#(<= 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); {113797#(<= 4560 |ssl3_connect_#t~mem62|)} is VALID [2022-04-28 08:43:24,420 INFO L290 TraceCheckUtils]: 171: Hoare triple {113797#(<= 4560 |ssl3_connect_#t~mem62|)} assume 4432 == #t~mem62;havoc #t~mem62; {113274#false} is VALID [2022-04-28 08:43:24,420 INFO L290 TraceCheckUtils]: 172: Hoare triple {113274#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {113274#false} is VALID [2022-04-28 08:43:24,420 INFO L290 TraceCheckUtils]: 173: Hoare triple {113274#false} assume 5 == ~blastFlag~0; {113274#false} is VALID [2022-04-28 08:43:24,420 INFO L290 TraceCheckUtils]: 174: Hoare triple {113274#false} assume !false; {113274#false} is VALID [2022-04-28 08:43:24,421 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 99 proven. 70 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2022-04-28 08:43:24,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 08:43:24,803 INFO L290 TraceCheckUtils]: 174: Hoare triple {113274#false} assume !false; {113274#false} is VALID [2022-04-28 08:43:24,803 INFO L290 TraceCheckUtils]: 173: Hoare triple {113274#false} assume 5 == ~blastFlag~0; {113274#false} is VALID [2022-04-28 08:43:24,804 INFO L290 TraceCheckUtils]: 172: Hoare triple {113274#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {113274#false} is VALID [2022-04-28 08:43:24,804 INFO L290 TraceCheckUtils]: 171: Hoare triple {113819#(not (<= |ssl3_connect_#t~mem62| 4432))} assume 4432 == #t~mem62;havoc #t~mem62; {113274#false} is VALID [2022-04-28 08:43:24,804 INFO L290 TraceCheckUtils]: 170: Hoare triple {113823#(< 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); {113819#(not (<= |ssl3_connect_#t~mem62| 4432))} is VALID [2022-04-28 08:43:24,805 INFO L290 TraceCheckUtils]: 169: Hoare triple {113823#(< 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); {113823#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,805 INFO L290 TraceCheckUtils]: 168: Hoare triple {113823#(< 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); {113823#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,805 INFO L290 TraceCheckUtils]: 167: Hoare triple {113823#(< 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); {113823#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,806 INFO L290 TraceCheckUtils]: 166: Hoare triple {113823#(< 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); {113823#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,806 INFO L290 TraceCheckUtils]: 165: Hoare triple {113823#(< 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); {113823#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,806 INFO L290 TraceCheckUtils]: 164: Hoare triple {113823#(< 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); {113823#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,807 INFO L290 TraceCheckUtils]: 163: Hoare triple {113823#(< 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); {113823#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,807 INFO L290 TraceCheckUtils]: 162: Hoare triple {113823#(< 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); {113823#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,807 INFO L290 TraceCheckUtils]: 161: Hoare triple {113823#(< 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); {113823#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,807 INFO L290 TraceCheckUtils]: 160: Hoare triple {113823#(< 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); {113823#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,808 INFO L290 TraceCheckUtils]: 159: Hoare triple {113823#(< 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); {113823#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,808 INFO L290 TraceCheckUtils]: 158: Hoare triple {113823#(< 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); {113823#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,808 INFO L290 TraceCheckUtils]: 157: Hoare triple {113823#(< 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); {113823#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,809 INFO L290 TraceCheckUtils]: 156: Hoare triple {113823#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {113823#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,809 INFO L290 TraceCheckUtils]: 155: Hoare triple {113823#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {113823#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,815 INFO L290 TraceCheckUtils]: 154: Hoare triple {113823#(< 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; {113823#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,816 INFO L290 TraceCheckUtils]: 153: Hoare triple {113823#(< 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); {113823#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,817 INFO L290 TraceCheckUtils]: 152: Hoare triple {113823#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {113823#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,818 INFO L290 TraceCheckUtils]: 151: Hoare triple {113273#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {113823#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:43:24,818 INFO L290 TraceCheckUtils]: 150: Hoare triple {113273#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,818 INFO L290 TraceCheckUtils]: 149: Hoare triple {113273#true} assume !(1 == ~blastFlag~0); {113273#true} is VALID [2022-04-28 08:43:24,818 INFO L290 TraceCheckUtils]: 148: Hoare triple {113273#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {113273#true} is VALID [2022-04-28 08:43:24,818 INFO L290 TraceCheckUtils]: 147: Hoare triple {113273#true} assume 4384 == #t~mem56;havoc #t~mem56; {113273#true} is VALID [2022-04-28 08:43:24,818 INFO L290 TraceCheckUtils]: 146: Hoare triple {113273#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,818 INFO L290 TraceCheckUtils]: 145: Hoare triple {113273#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,818 INFO L290 TraceCheckUtils]: 144: Hoare triple {113273#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,819 INFO L290 TraceCheckUtils]: 143: Hoare triple {113273#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,819 INFO L290 TraceCheckUtils]: 142: Hoare triple {113273#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,819 INFO L290 TraceCheckUtils]: 141: Hoare triple {113273#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,819 INFO L290 TraceCheckUtils]: 140: Hoare triple {113273#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,819 INFO L290 TraceCheckUtils]: 139: Hoare triple {113273#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,819 INFO L290 TraceCheckUtils]: 138: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-28 08:43:24,819 INFO L290 TraceCheckUtils]: 137: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-28 08:43:24,819 INFO L290 TraceCheckUtils]: 136: Hoare triple {113273#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {113273#true} is VALID [2022-04-28 08:43:24,819 INFO L290 TraceCheckUtils]: 135: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,819 INFO L290 TraceCheckUtils]: 134: Hoare triple {113273#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; {113273#true} is VALID [2022-04-28 08:43:24,820 INFO L290 TraceCheckUtils]: 133: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,820 INFO L290 TraceCheckUtils]: 132: Hoare triple {113273#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {113273#true} is VALID [2022-04-28 08:43:24,820 INFO L290 TraceCheckUtils]: 131: Hoare triple {113273#true} assume !(0 == ~blastFlag~0); {113273#true} is VALID [2022-04-28 08:43:24,820 INFO L290 TraceCheckUtils]: 130: Hoare triple {113273#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; {113273#true} is VALID [2022-04-28 08:43:24,820 INFO L290 TraceCheckUtils]: 129: Hoare triple {113273#true} assume 4369 == #t~mem55;havoc #t~mem55; {113273#true} is VALID [2022-04-28 08:43:24,820 INFO L290 TraceCheckUtils]: 128: Hoare triple {113273#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,820 INFO L290 TraceCheckUtils]: 127: Hoare triple {113273#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,820 INFO L290 TraceCheckUtils]: 126: Hoare triple {113273#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,820 INFO L290 TraceCheckUtils]: 125: Hoare triple {113273#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,820 INFO L290 TraceCheckUtils]: 124: Hoare triple {113273#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,821 INFO L290 TraceCheckUtils]: 123: Hoare triple {113273#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,821 INFO L290 TraceCheckUtils]: 122: Hoare triple {113273#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,821 INFO L290 TraceCheckUtils]: 121: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-28 08:43:24,821 INFO L290 TraceCheckUtils]: 120: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-28 08:43:24,821 INFO L290 TraceCheckUtils]: 119: Hoare triple {113273#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {113273#true} is VALID [2022-04-28 08:43:24,821 INFO L290 TraceCheckUtils]: 118: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,821 INFO L290 TraceCheckUtils]: 117: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,821 INFO L290 TraceCheckUtils]: 116: Hoare triple {113273#true} assume !(5 == ~blastFlag~0); {113273#true} is VALID [2022-04-28 08:43:24,821 INFO L290 TraceCheckUtils]: 115: Hoare triple {113273#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {113273#true} is VALID [2022-04-28 08:43:24,823 INFO L290 TraceCheckUtils]: 114: Hoare triple {113273#true} assume 4432 == #t~mem62;havoc #t~mem62; {113273#true} is VALID [2022-04-28 08:43:24,823 INFO L290 TraceCheckUtils]: 113: Hoare triple {113273#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,823 INFO L290 TraceCheckUtils]: 112: Hoare triple {113273#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,823 INFO L290 TraceCheckUtils]: 111: Hoare triple {113273#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,823 INFO L290 TraceCheckUtils]: 110: Hoare triple {113273#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,823 INFO L290 TraceCheckUtils]: 109: Hoare triple {113273#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,823 INFO L290 TraceCheckUtils]: 108: Hoare triple {113273#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,823 INFO L290 TraceCheckUtils]: 107: Hoare triple {113273#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,823 INFO L290 TraceCheckUtils]: 106: Hoare triple {113273#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,824 INFO L290 TraceCheckUtils]: 105: Hoare triple {113273#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,824 INFO L290 TraceCheckUtils]: 104: Hoare triple {113273#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,824 INFO L290 TraceCheckUtils]: 103: Hoare triple {113273#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,824 INFO L290 TraceCheckUtils]: 102: Hoare triple {113273#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,824 INFO L290 TraceCheckUtils]: 101: Hoare triple {113273#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,824 INFO L290 TraceCheckUtils]: 100: Hoare triple {113273#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,824 INFO L290 TraceCheckUtils]: 99: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-28 08:43:24,824 INFO L290 TraceCheckUtils]: 98: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-28 08:43:24,824 INFO L290 TraceCheckUtils]: 97: Hoare triple {113273#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {113273#true} is VALID [2022-04-28 08:43:24,824 INFO L290 TraceCheckUtils]: 96: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,825 INFO L290 TraceCheckUtils]: 95: Hoare triple {113273#true} assume !(0 == ~tmp___6~0); {113273#true} is VALID [2022-04-28 08:43:24,825 INFO L290 TraceCheckUtils]: 94: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,825 INFO L290 TraceCheckUtils]: 93: Hoare triple {113273#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {113273#true} is VALID [2022-04-28 08:43:24,825 INFO L290 TraceCheckUtils]: 92: Hoare triple {113273#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {113273#true} is VALID [2022-04-28 08:43:24,825 INFO L290 TraceCheckUtils]: 91: Hoare triple {113273#true} assume 4416 == #t~mem60;havoc #t~mem60; {113273#true} is VALID [2022-04-28 08:43:24,825 INFO L290 TraceCheckUtils]: 90: Hoare triple {113273#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,825 INFO L290 TraceCheckUtils]: 89: Hoare triple {113273#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,825 INFO L290 TraceCheckUtils]: 88: Hoare triple {113273#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,825 INFO L290 TraceCheckUtils]: 87: Hoare triple {113273#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,825 INFO L290 TraceCheckUtils]: 86: Hoare triple {113273#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,825 INFO L290 TraceCheckUtils]: 85: Hoare triple {113273#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,826 INFO L290 TraceCheckUtils]: 84: Hoare triple {113273#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,826 INFO L290 TraceCheckUtils]: 83: Hoare triple {113273#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,826 INFO L290 TraceCheckUtils]: 82: Hoare triple {113273#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,826 INFO L290 TraceCheckUtils]: 81: Hoare triple {113273#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,826 INFO L290 TraceCheckUtils]: 80: Hoare triple {113273#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,826 INFO L290 TraceCheckUtils]: 79: Hoare triple {113273#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,826 INFO L290 TraceCheckUtils]: 78: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-28 08:43:24,826 INFO L290 TraceCheckUtils]: 77: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-28 08:43:24,826 INFO L290 TraceCheckUtils]: 76: Hoare triple {113273#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {113273#true} is VALID [2022-04-28 08:43:24,826 INFO L290 TraceCheckUtils]: 75: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,827 INFO L290 TraceCheckUtils]: 74: Hoare triple {113273#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,827 INFO L290 TraceCheckUtils]: 73: Hoare triple {113273#true} assume !(~ret~0 <= 0); {113273#true} is VALID [2022-04-28 08:43:24,827 INFO L290 TraceCheckUtils]: 72: Hoare triple {113273#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {113273#true} is VALID [2022-04-28 08:43:24,827 INFO L290 TraceCheckUtils]: 71: Hoare triple {113273#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; {113273#true} is VALID [2022-04-28 08:43:24,827 INFO L290 TraceCheckUtils]: 70: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,827 INFO L290 TraceCheckUtils]: 69: Hoare triple {113273#true} assume 4400 == #t~mem58;havoc #t~mem58; {113273#true} is VALID [2022-04-28 08:43:24,827 INFO L290 TraceCheckUtils]: 68: Hoare triple {113273#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,827 INFO L290 TraceCheckUtils]: 67: Hoare triple {113273#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,827 INFO L290 TraceCheckUtils]: 66: Hoare triple {113273#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,827 INFO L290 TraceCheckUtils]: 65: Hoare triple {113273#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,828 INFO L290 TraceCheckUtils]: 64: Hoare triple {113273#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,828 INFO L290 TraceCheckUtils]: 63: Hoare triple {113273#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,828 INFO L290 TraceCheckUtils]: 62: Hoare triple {113273#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,828 INFO L290 TraceCheckUtils]: 61: Hoare triple {113273#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,828 INFO L290 TraceCheckUtils]: 60: Hoare triple {113273#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,828 INFO L290 TraceCheckUtils]: 59: Hoare triple {113273#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,828 INFO L290 TraceCheckUtils]: 58: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-28 08:43:24,828 INFO L290 TraceCheckUtils]: 57: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-28 08:43:24,828 INFO L290 TraceCheckUtils]: 56: Hoare triple {113273#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {113273#true} is VALID [2022-04-28 08:43:24,828 INFO L290 TraceCheckUtils]: 55: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,828 INFO L290 TraceCheckUtils]: 54: Hoare triple {113273#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,829 INFO L290 TraceCheckUtils]: 53: Hoare triple {113273#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,829 INFO L290 TraceCheckUtils]: 52: Hoare triple {113273#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,829 INFO L290 TraceCheckUtils]: 51: Hoare triple {113273#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {113273#true} is VALID [2022-04-28 08:43:24,829 INFO L290 TraceCheckUtils]: 50: Hoare triple {113273#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {113273#true} is VALID [2022-04-28 08:43:24,829 INFO L290 TraceCheckUtils]: 49: Hoare triple {113273#true} assume 4384 == #t~mem56;havoc #t~mem56; {113273#true} is VALID [2022-04-28 08:43:24,829 INFO L290 TraceCheckUtils]: 48: Hoare triple {113273#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,829 INFO L290 TraceCheckUtils]: 47: Hoare triple {113273#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,829 INFO L290 TraceCheckUtils]: 46: Hoare triple {113273#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,829 INFO L290 TraceCheckUtils]: 45: Hoare triple {113273#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,829 INFO L290 TraceCheckUtils]: 44: Hoare triple {113273#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,830 INFO L290 TraceCheckUtils]: 43: Hoare triple {113273#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,830 INFO L290 TraceCheckUtils]: 42: Hoare triple {113273#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,830 INFO L290 TraceCheckUtils]: 41: Hoare triple {113273#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,830 INFO L290 TraceCheckUtils]: 40: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-28 08:43:24,830 INFO L290 TraceCheckUtils]: 39: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-28 08:43:24,830 INFO L290 TraceCheckUtils]: 38: Hoare triple {113273#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {113273#true} is VALID [2022-04-28 08:43:24,830 INFO L290 TraceCheckUtils]: 37: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,830 INFO L290 TraceCheckUtils]: 36: Hoare triple {113273#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; {113273#true} is VALID [2022-04-28 08:43:24,830 INFO L290 TraceCheckUtils]: 35: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,830 INFO L290 TraceCheckUtils]: 34: Hoare triple {113273#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {113273#true} is VALID [2022-04-28 08:43:24,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {113273#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; {113273#true} is VALID [2022-04-28 08:43:24,831 INFO L290 TraceCheckUtils]: 32: Hoare triple {113273#true} assume 4368 == #t~mem54;havoc #t~mem54; {113273#true} is VALID [2022-04-28 08:43:24,831 INFO L290 TraceCheckUtils]: 31: Hoare triple {113273#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,831 INFO L290 TraceCheckUtils]: 30: Hoare triple {113273#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,831 INFO L290 TraceCheckUtils]: 29: Hoare triple {113273#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {113273#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,831 INFO L290 TraceCheckUtils]: 27: Hoare triple {113273#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {113273#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-28 08:43:24,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-28 08:43:24,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {113273#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {113273#true} is VALID [2022-04-28 08:43:24,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {113273#true} assume !(0 == ~tmp___4~0); {113273#true} is VALID [2022-04-28 08:43:24,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {113273#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {113273#true} is VALID [2022-04-28 08:43:24,832 INFO L290 TraceCheckUtils]: 18: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {113273#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {113273#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {113273#true} is VALID [2022-04-28 08:43:24,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {113273#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {113273#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; {113273#true} is VALID [2022-04-28 08:43:24,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {113273#true} assume 12292 == #t~mem49;havoc #t~mem49; {113273#true} is VALID [2022-04-28 08:43:24,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {113273#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {113273#true} is VALID [2022-04-28 08:43:24,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-28 08:43:24,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {113273#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {113273#true} is VALID [2022-04-28 08:43:24,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {113273#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; {113273#true} is VALID [2022-04-28 08:43:24,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {113273#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; {113273#true} is VALID [2022-04-28 08:43:24,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,833 INFO L272 TraceCheckUtils]: 6: Hoare triple {113273#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {113273#true} is VALID [2022-04-28 08:43:24,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {113273#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; {113273#true} is VALID [2022-04-28 08:43:24,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {113273#true} call #t~ret158 := main(); {113273#true} is VALID [2022-04-28 08:43:24,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {113273#true} {113273#true} #593#return; {113273#true} is VALID [2022-04-28 08:43:24,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {113273#true} assume true; {113273#true} is VALID [2022-04-28 08:43:24,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {113273#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); {113273#true} is VALID [2022-04-28 08:43:24,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {113273#true} call ULTIMATE.init(); {113273#true} is VALID [2022-04-28 08:43:24,834 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2022-04-28 08:43:24,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410413099] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 08:43:24,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 08:43:24,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 11 [2022-04-28 08:43:24,835 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:43:24,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1033566954] [2022-04-28 08:43:24,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1033566954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:43:24,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:43:24,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:43:24,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374905973] [2022-04-28 08:43:24,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:43:24,836 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 175 [2022-04-28 08:43:24,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:43:24,836 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-28 08:43:24,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:43:24,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:43:24,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:43:24,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:43:24,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-04-28 08:43:24,907 INFO L87 Difference]: Start difference. First operand 1095 states and 1557 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-28 08:43:28,947 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:43:32,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:43:32,947 INFO L93 Difference]: Finished difference Result 2604 states and 3703 transitions. [2022-04-28 08:43:32,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:43:32,948 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 175 [2022-04-28 08:43:32,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:43:32,948 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-28 08:43:32,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 464 transitions. [2022-04-28 08:43:32,950 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-28 08:43:32,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 464 transitions. [2022-04-28 08:43:32,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 464 transitions. [2022-04-28 08:43:33,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 464 edges. 464 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:43:33,382 INFO L225 Difference]: With dead ends: 2604 [2022-04-28 08:43:33,382 INFO L226 Difference]: Without dead ends: 1525 [2022-04-28 08:43:33,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 353 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-28 08:43:33,384 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 92 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:43:33,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 533 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 228 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:43:33,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2022-04-28 08:43:34,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1095. [2022-04-28 08:43:34,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:43:34,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1525 states. Second operand has 1095 states, 1090 states have (on average 1.424770642201835) internal successors, (1553), 1090 states have internal predecessors, (1553), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:34,017 INFO L74 IsIncluded]: Start isIncluded. First operand 1525 states. Second operand has 1095 states, 1090 states have (on average 1.424770642201835) internal successors, (1553), 1090 states have internal predecessors, (1553), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:34,018 INFO L87 Difference]: Start difference. First operand 1525 states. Second operand has 1095 states, 1090 states have (on average 1.424770642201835) internal successors, (1553), 1090 states have internal predecessors, (1553), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:34,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:43:34,072 INFO L93 Difference]: Finished difference Result 1525 states and 2161 transitions. [2022-04-28 08:43:34,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2161 transitions. [2022-04-28 08:43:34,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:43:34,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:43:34,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 1095 states, 1090 states have (on average 1.424770642201835) internal successors, (1553), 1090 states have internal predecessors, (1553), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1525 states. [2022-04-28 08:43:34,075 INFO L87 Difference]: Start difference. First operand has 1095 states, 1090 states have (on average 1.424770642201835) internal successors, (1553), 1090 states have internal predecessors, (1553), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1525 states. [2022-04-28 08:43:34,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:43:34,129 INFO L93 Difference]: Finished difference Result 1525 states and 2161 transitions. [2022-04-28 08:43:34,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2161 transitions. [2022-04-28 08:43:34,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:43:34,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:43:34,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:43:34,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:43:34,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 1090 states have (on average 1.424770642201835) internal successors, (1553), 1090 states have internal predecessors, (1553), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:34,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1557 transitions. [2022-04-28 08:43:34,177 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1557 transitions. Word has length 175 [2022-04-28 08:43:34,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:43:34,177 INFO L495 AbstractCegarLoop]: Abstraction has 1095 states and 1557 transitions. [2022-04-28 08:43:34,177 INFO L496 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-28 08:43:34,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1095 states and 1557 transitions. [2022-04-28 08:43:36,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1557 edges. 1557 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:43:36,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1557 transitions. [2022-04-28 08:43:36,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-04-28 08:43:36,003 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:43:36,003 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 4, 4, 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, 1, 1, 1] [2022-04-28 08:43:36,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 08:43:36,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-28 08:43:36,207 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:43:36,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:43:36,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1484711279, now seen corresponding path program 1 times [2022-04-28 08:43:36,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:43:36,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [523257079] [2022-04-28 08:43:53,025 WARN L232 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:44:01,894 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:44:01,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1484711279, now seen corresponding path program 2 times [2022-04-28 08:44:01,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:44:01,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739914373] [2022-04-28 08:44:01,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:44:01,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:44:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:44:02,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:44:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:44:02,135 INFO L290 TraceCheckUtils]: 0: Hoare triple {124793#(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); {124786#true} is VALID [2022-04-28 08:44:02,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {124786#true} assume true; {124786#true} is VALID [2022-04-28 08:44:02,135 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {124786#true} {124786#true} #593#return; {124786#true} is VALID [2022-04-28 08:44:02,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {124786#true} call ULTIMATE.init(); {124793#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:44:02,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {124793#(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); {124786#true} is VALID [2022-04-28 08:44:02,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {124786#true} assume true; {124786#true} is VALID [2022-04-28 08:44:02,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {124786#true} {124786#true} #593#return; {124786#true} is VALID [2022-04-28 08:44:02,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {124786#true} call #t~ret158 := main(); {124786#true} is VALID [2022-04-28 08:44:02,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {124786#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; {124786#true} is VALID [2022-04-28 08:44:02,137 INFO L272 TraceCheckUtils]: 6: Hoare triple {124786#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {124786#true} is VALID [2022-04-28 08:44:02,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {124786#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); {124786#true} is VALID [2022-04-28 08:44:02,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {124786#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; {124786#true} is VALID [2022-04-28 08:44:02,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {124786#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; {124786#true} is VALID [2022-04-28 08:44:02,137 INFO L290 TraceCheckUtils]: 10: Hoare triple {124786#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {124786#true} is VALID [2022-04-28 08:44:02,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {124786#true} assume !false; {124786#true} is VALID [2022-04-28 08:44:02,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {124786#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {124786#true} assume 12292 == #t~mem49;havoc #t~mem49; {124786#true} is VALID [2022-04-28 08:44:02,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {124786#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; {124786#true} is VALID [2022-04-28 08:44:02,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {124786#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {124786#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {124786#true} is VALID [2022-04-28 08:44:02,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {124786#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {124786#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); {124786#true} is VALID [2022-04-28 08:44:02,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {124786#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {124786#true} is VALID [2022-04-28 08:44:02,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {124786#true} assume !(0 == ~tmp___4~0); {124786#true} is VALID [2022-04-28 08:44:02,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {124786#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); {124786#true} is VALID [2022-04-28 08:44:02,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {124786#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); {124786#true} is VALID [2022-04-28 08:44:02,138 INFO L290 TraceCheckUtils]: 23: Hoare triple {124786#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {124786#true} is VALID [2022-04-28 08:44:02,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {124786#true} ~skip~0 := 0; {124786#true} is VALID [2022-04-28 08:44:02,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {124786#true} assume !false; {124786#true} is VALID [2022-04-28 08:44:02,138 INFO L290 TraceCheckUtils]: 26: Hoare triple {124786#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,138 INFO L290 TraceCheckUtils]: 27: Hoare triple {124786#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,139 INFO L290 TraceCheckUtils]: 28: Hoare triple {124786#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,139 INFO L290 TraceCheckUtils]: 29: Hoare triple {124786#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,139 INFO L290 TraceCheckUtils]: 30: Hoare triple {124786#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,139 INFO L290 TraceCheckUtils]: 31: Hoare triple {124786#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,139 INFO L290 TraceCheckUtils]: 32: Hoare triple {124786#true} assume 4368 == #t~mem54;havoc #t~mem54; {124786#true} is VALID [2022-04-28 08:44:02,139 INFO L290 TraceCheckUtils]: 33: Hoare triple {124786#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; {124786#true} is VALID [2022-04-28 08:44:02,139 INFO L290 TraceCheckUtils]: 34: Hoare triple {124786#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {124786#true} is VALID [2022-04-28 08:44:02,139 INFO L290 TraceCheckUtils]: 35: Hoare triple {124786#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); {124786#true} is VALID [2022-04-28 08:44:02,139 INFO L290 TraceCheckUtils]: 36: Hoare triple {124786#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; {124786#true} is VALID [2022-04-28 08:44:02,139 INFO L290 TraceCheckUtils]: 37: Hoare triple {124786#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); {124786#true} is VALID [2022-04-28 08:44:02,139 INFO L290 TraceCheckUtils]: 38: Hoare triple {124786#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {124786#true} is VALID [2022-04-28 08:44:02,140 INFO L290 TraceCheckUtils]: 39: Hoare triple {124786#true} ~skip~0 := 0; {124786#true} is VALID [2022-04-28 08:44:02,140 INFO L290 TraceCheckUtils]: 40: Hoare triple {124786#true} assume !false; {124786#true} is VALID [2022-04-28 08:44:02,140 INFO L290 TraceCheckUtils]: 41: Hoare triple {124786#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,140 INFO L290 TraceCheckUtils]: 42: Hoare triple {124786#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,140 INFO L290 TraceCheckUtils]: 43: Hoare triple {124786#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,140 INFO L290 TraceCheckUtils]: 44: Hoare triple {124786#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,140 INFO L290 TraceCheckUtils]: 45: Hoare triple {124786#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,140 INFO L290 TraceCheckUtils]: 46: Hoare triple {124786#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,140 INFO L290 TraceCheckUtils]: 47: Hoare triple {124786#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,140 INFO L290 TraceCheckUtils]: 48: Hoare triple {124786#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,140 INFO L290 TraceCheckUtils]: 49: Hoare triple {124786#true} assume 4384 == #t~mem56;havoc #t~mem56; {124786#true} is VALID [2022-04-28 08:44:02,141 INFO L290 TraceCheckUtils]: 50: Hoare triple {124786#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {124786#true} is VALID [2022-04-28 08:44:02,141 INFO L290 TraceCheckUtils]: 51: Hoare triple {124786#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {124786#true} is VALID [2022-04-28 08:44:02,141 INFO L290 TraceCheckUtils]: 52: Hoare triple {124786#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,141 INFO L290 TraceCheckUtils]: 53: Hoare triple {124786#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,141 INFO L290 TraceCheckUtils]: 54: Hoare triple {124786#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,141 INFO L290 TraceCheckUtils]: 55: Hoare triple {124786#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); {124786#true} is VALID [2022-04-28 08:44:02,141 INFO L290 TraceCheckUtils]: 56: Hoare triple {124786#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {124786#true} is VALID [2022-04-28 08:44:02,141 INFO L290 TraceCheckUtils]: 57: Hoare triple {124786#true} ~skip~0 := 0; {124786#true} is VALID [2022-04-28 08:44:02,141 INFO L290 TraceCheckUtils]: 58: Hoare triple {124786#true} assume !false; {124786#true} is VALID [2022-04-28 08:44:02,141 INFO L290 TraceCheckUtils]: 59: Hoare triple {124786#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,142 INFO L290 TraceCheckUtils]: 60: Hoare triple {124786#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,142 INFO L290 TraceCheckUtils]: 61: Hoare triple {124786#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,142 INFO L290 TraceCheckUtils]: 62: Hoare triple {124786#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,142 INFO L290 TraceCheckUtils]: 63: Hoare triple {124786#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,142 INFO L290 TraceCheckUtils]: 64: Hoare triple {124786#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,142 INFO L290 TraceCheckUtils]: 65: Hoare triple {124786#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,142 INFO L290 TraceCheckUtils]: 66: Hoare triple {124786#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,142 INFO L290 TraceCheckUtils]: 67: Hoare triple {124786#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,142 INFO L290 TraceCheckUtils]: 68: Hoare triple {124786#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,142 INFO L290 TraceCheckUtils]: 69: Hoare triple {124786#true} assume 4400 == #t~mem58;havoc #t~mem58; {124786#true} is VALID [2022-04-28 08:44:02,142 INFO L290 TraceCheckUtils]: 70: Hoare triple {124786#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); {124786#true} is VALID [2022-04-28 08:44:02,143 INFO L290 TraceCheckUtils]: 71: Hoare triple {124786#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; {124786#true} is VALID [2022-04-28 08:44:02,143 INFO L290 TraceCheckUtils]: 72: Hoare triple {124786#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {124786#true} is VALID [2022-04-28 08:44:02,143 INFO L290 TraceCheckUtils]: 73: Hoare triple {124786#true} assume !(~ret~0 <= 0); {124786#true} is VALID [2022-04-28 08:44:02,143 INFO L290 TraceCheckUtils]: 74: Hoare triple {124786#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,143 INFO L290 TraceCheckUtils]: 75: Hoare triple {124786#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); {124786#true} is VALID [2022-04-28 08:44:02,143 INFO L290 TraceCheckUtils]: 76: Hoare triple {124786#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {124786#true} is VALID [2022-04-28 08:44:02,143 INFO L290 TraceCheckUtils]: 77: Hoare triple {124786#true} ~skip~0 := 0; {124786#true} is VALID [2022-04-28 08:44:02,143 INFO L290 TraceCheckUtils]: 78: Hoare triple {124786#true} assume !false; {124786#true} is VALID [2022-04-28 08:44:02,143 INFO L290 TraceCheckUtils]: 79: Hoare triple {124786#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,143 INFO L290 TraceCheckUtils]: 80: Hoare triple {124786#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,143 INFO L290 TraceCheckUtils]: 81: Hoare triple {124786#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,144 INFO L290 TraceCheckUtils]: 82: Hoare triple {124786#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,144 INFO L290 TraceCheckUtils]: 83: Hoare triple {124786#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,144 INFO L290 TraceCheckUtils]: 84: Hoare triple {124786#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,144 INFO L290 TraceCheckUtils]: 85: Hoare triple {124786#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,144 INFO L290 TraceCheckUtils]: 86: Hoare triple {124786#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,144 INFO L290 TraceCheckUtils]: 87: Hoare triple {124786#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,144 INFO L290 TraceCheckUtils]: 88: Hoare triple {124786#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,144 INFO L290 TraceCheckUtils]: 89: Hoare triple {124786#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,144 INFO L290 TraceCheckUtils]: 90: Hoare triple {124786#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,144 INFO L290 TraceCheckUtils]: 91: Hoare triple {124786#true} assume 4416 == #t~mem60;havoc #t~mem60; {124786#true} is VALID [2022-04-28 08:44:02,144 INFO L290 TraceCheckUtils]: 92: Hoare triple {124786#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {124786#true} is VALID [2022-04-28 08:44:02,145 INFO L290 TraceCheckUtils]: 93: Hoare triple {124786#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {124786#true} is VALID [2022-04-28 08:44:02,145 INFO L290 TraceCheckUtils]: 94: Hoare triple {124786#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); {124786#true} is VALID [2022-04-28 08:44:02,145 INFO L290 TraceCheckUtils]: 95: Hoare triple {124786#true} assume !(0 == ~tmp___6~0); {124786#true} is VALID [2022-04-28 08:44:02,145 INFO L290 TraceCheckUtils]: 96: Hoare triple {124786#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); {124786#true} is VALID [2022-04-28 08:44:02,145 INFO L290 TraceCheckUtils]: 97: Hoare triple {124786#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {124786#true} is VALID [2022-04-28 08:44:02,145 INFO L290 TraceCheckUtils]: 98: Hoare triple {124786#true} ~skip~0 := 0; {124786#true} is VALID [2022-04-28 08:44:02,145 INFO L290 TraceCheckUtils]: 99: Hoare triple {124786#true} assume !false; {124786#true} is VALID [2022-04-28 08:44:02,145 INFO L290 TraceCheckUtils]: 100: Hoare triple {124786#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,145 INFO L290 TraceCheckUtils]: 101: Hoare triple {124786#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,145 INFO L290 TraceCheckUtils]: 102: Hoare triple {124786#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,146 INFO L290 TraceCheckUtils]: 103: Hoare triple {124786#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,146 INFO L290 TraceCheckUtils]: 104: Hoare triple {124786#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,146 INFO L290 TraceCheckUtils]: 105: Hoare triple {124786#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,146 INFO L290 TraceCheckUtils]: 106: Hoare triple {124786#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,146 INFO L290 TraceCheckUtils]: 107: Hoare triple {124786#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,146 INFO L290 TraceCheckUtils]: 108: Hoare triple {124786#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,146 INFO L290 TraceCheckUtils]: 109: Hoare triple {124786#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,146 INFO L290 TraceCheckUtils]: 110: Hoare triple {124786#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,146 INFO L290 TraceCheckUtils]: 111: Hoare triple {124786#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,146 INFO L290 TraceCheckUtils]: 112: Hoare triple {124786#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,146 INFO L290 TraceCheckUtils]: 113: Hoare triple {124786#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,147 INFO L290 TraceCheckUtils]: 114: Hoare triple {124786#true} assume 4432 == #t~mem62;havoc #t~mem62; {124786#true} is VALID [2022-04-28 08:44:02,147 INFO L290 TraceCheckUtils]: 115: Hoare triple {124786#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {124786#true} is VALID [2022-04-28 08:44:02,147 INFO L290 TraceCheckUtils]: 116: Hoare triple {124786#true} assume !(5 == ~blastFlag~0); {124786#true} is VALID [2022-04-28 08:44:02,147 INFO L290 TraceCheckUtils]: 117: Hoare triple {124786#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); {124786#true} is VALID [2022-04-28 08:44:02,147 INFO L290 TraceCheckUtils]: 118: Hoare triple {124786#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); {124786#true} is VALID [2022-04-28 08:44:02,147 INFO L290 TraceCheckUtils]: 119: Hoare triple {124786#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {124786#true} is VALID [2022-04-28 08:44:02,147 INFO L290 TraceCheckUtils]: 120: Hoare triple {124786#true} ~skip~0 := 0; {124786#true} is VALID [2022-04-28 08:44:02,147 INFO L290 TraceCheckUtils]: 121: Hoare triple {124786#true} assume !false; {124786#true} is VALID [2022-04-28 08:44:02,147 INFO L290 TraceCheckUtils]: 122: Hoare triple {124786#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,147 INFO L290 TraceCheckUtils]: 123: Hoare triple {124786#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,147 INFO L290 TraceCheckUtils]: 124: Hoare triple {124786#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,148 INFO L290 TraceCheckUtils]: 125: Hoare triple {124786#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,148 INFO L290 TraceCheckUtils]: 126: Hoare triple {124786#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,148 INFO L290 TraceCheckUtils]: 127: Hoare triple {124786#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,148 INFO L290 TraceCheckUtils]: 128: Hoare triple {124786#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,148 INFO L290 TraceCheckUtils]: 129: Hoare triple {124786#true} assume 4369 == #t~mem55;havoc #t~mem55; {124786#true} is VALID [2022-04-28 08:44:02,148 INFO L290 TraceCheckUtils]: 130: Hoare triple {124786#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; {124786#true} is VALID [2022-04-28 08:44:02,148 INFO L290 TraceCheckUtils]: 131: Hoare triple {124786#true} assume !(0 == ~blastFlag~0); {124786#true} is VALID [2022-04-28 08:44:02,148 INFO L290 TraceCheckUtils]: 132: Hoare triple {124786#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {124786#true} is VALID [2022-04-28 08:44:02,148 INFO L290 TraceCheckUtils]: 133: Hoare triple {124786#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); {124786#true} is VALID [2022-04-28 08:44:02,148 INFO L290 TraceCheckUtils]: 134: Hoare triple {124786#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; {124786#true} is VALID [2022-04-28 08:44:02,149 INFO L290 TraceCheckUtils]: 135: Hoare triple {124786#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); {124786#true} is VALID [2022-04-28 08:44:02,149 INFO L290 TraceCheckUtils]: 136: Hoare triple {124786#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {124786#true} is VALID [2022-04-28 08:44:02,149 INFO L290 TraceCheckUtils]: 137: Hoare triple {124786#true} ~skip~0 := 0; {124786#true} is VALID [2022-04-28 08:44:02,149 INFO L290 TraceCheckUtils]: 138: Hoare triple {124786#true} assume !false; {124786#true} is VALID [2022-04-28 08:44:02,149 INFO L290 TraceCheckUtils]: 139: Hoare triple {124786#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,149 INFO L290 TraceCheckUtils]: 140: Hoare triple {124786#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,149 INFO L290 TraceCheckUtils]: 141: Hoare triple {124786#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,149 INFO L290 TraceCheckUtils]: 142: Hoare triple {124786#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,149 INFO L290 TraceCheckUtils]: 143: Hoare triple {124786#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,149 INFO L290 TraceCheckUtils]: 144: Hoare triple {124786#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,149 INFO L290 TraceCheckUtils]: 145: Hoare triple {124786#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,150 INFO L290 TraceCheckUtils]: 146: Hoare triple {124786#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,150 INFO L290 TraceCheckUtils]: 147: Hoare triple {124786#true} assume 4384 == #t~mem56;havoc #t~mem56; {124786#true} is VALID [2022-04-28 08:44:02,150 INFO L290 TraceCheckUtils]: 148: Hoare triple {124786#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {124786#true} is VALID [2022-04-28 08:44:02,150 INFO L290 TraceCheckUtils]: 149: Hoare triple {124786#true} assume !(1 == ~blastFlag~0); {124786#true} is VALID [2022-04-28 08:44:02,150 INFO L290 TraceCheckUtils]: 150: Hoare triple {124786#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {124786#true} is VALID [2022-04-28 08:44:02,151 INFO L290 TraceCheckUtils]: 151: Hoare triple {124786#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {124791#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:02,152 INFO L290 TraceCheckUtils]: 152: Hoare triple {124791#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {124791#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:02,152 INFO L290 TraceCheckUtils]: 153: Hoare triple {124791#(= 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); {124791#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:02,152 INFO L290 TraceCheckUtils]: 154: Hoare triple {124791#(= 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; {124791#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:02,153 INFO L290 TraceCheckUtils]: 155: Hoare triple {124791#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {124791#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:02,153 INFO L290 TraceCheckUtils]: 156: Hoare triple {124791#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {124791#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:02,153 INFO L290 TraceCheckUtils]: 157: Hoare triple {124791#(= 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); {124791#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:02,154 INFO L290 TraceCheckUtils]: 158: Hoare triple {124791#(= 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); {124791#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:02,154 INFO L290 TraceCheckUtils]: 159: Hoare triple {124791#(= 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); {124791#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:02,154 INFO L290 TraceCheckUtils]: 160: Hoare triple {124791#(= 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); {124791#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:02,155 INFO L290 TraceCheckUtils]: 161: Hoare triple {124791#(= 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); {124791#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:02,155 INFO L290 TraceCheckUtils]: 162: Hoare triple {124791#(= 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); {124791#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:02,155 INFO L290 TraceCheckUtils]: 163: Hoare triple {124791#(= 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); {124791#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:02,156 INFO L290 TraceCheckUtils]: 164: Hoare triple {124791#(= 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); {124791#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:02,156 INFO L290 TraceCheckUtils]: 165: Hoare triple {124791#(= 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); {124791#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:02,157 INFO L290 TraceCheckUtils]: 166: Hoare triple {124791#(= 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); {124792#(= |ssl3_connect_#t~mem58| 4400)} is VALID [2022-04-28 08:44:02,157 INFO L290 TraceCheckUtils]: 167: Hoare triple {124792#(= |ssl3_connect_#t~mem58| 4400)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {124787#false} is VALID [2022-04-28 08:44:02,157 INFO L290 TraceCheckUtils]: 168: Hoare triple {124787#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {124787#false} is VALID [2022-04-28 08:44:02,157 INFO L290 TraceCheckUtils]: 169: Hoare triple {124787#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {124787#false} is VALID [2022-04-28 08:44:02,157 INFO L290 TraceCheckUtils]: 170: Hoare triple {124787#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {124787#false} is VALID [2022-04-28 08:44:02,157 INFO L290 TraceCheckUtils]: 171: Hoare triple {124787#false} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {124787#false} is VALID [2022-04-28 08:44:02,158 INFO L290 TraceCheckUtils]: 172: Hoare triple {124787#false} assume 4433 == #t~mem63;havoc #t~mem63; {124787#false} is VALID [2022-04-28 08:44:02,158 INFO L290 TraceCheckUtils]: 173: Hoare triple {124787#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {124787#false} is VALID [2022-04-28 08:44:02,158 INFO L290 TraceCheckUtils]: 174: Hoare triple {124787#false} assume 5 == ~blastFlag~0; {124787#false} is VALID [2022-04-28 08:44:02,158 INFO L290 TraceCheckUtils]: 175: Hoare triple {124787#false} assume !false; {124787#false} is VALID [2022-04-28 08:44:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2022-04-28 08:44:02,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:44:02,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739914373] [2022-04-28 08:44:02,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739914373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:44:02,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:44:02,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:44:02,159 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:44:02,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [523257079] [2022-04-28 08:44:02,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [523257079] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:44:02,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:44:02,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:44:02,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490749196] [2022-04-28 08:44:02,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:44:02,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 176 [2022-04-28 08:44:02,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:44:02,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:44:02,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:44:02,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:44:02,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:44:02,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:44:02,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:44:02,250 INFO L87 Difference]: Start difference. First operand 1095 states and 1557 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:44:04,278 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:44:06,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:44:06,236 INFO L93 Difference]: Finished difference Result 2281 states and 3225 transitions. [2022-04-28 08:44:06,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:44:06,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 176 [2022-04-28 08:44:06,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:44:06,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:44:06,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 393 transitions. [2022-04-28 08:44:06,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:44:06,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 393 transitions. [2022-04-28 08:44:06,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 393 transitions. [2022-04-28 08:44:06,541 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-28 08:44:06,595 INFO L225 Difference]: With dead ends: 2281 [2022-04-28 08:44:06,595 INFO L226 Difference]: Without dead ends: 1202 [2022-04-28 08:44:06,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:44:06,597 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 34 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:44:06,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 479 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 365 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:44:06,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2022-04-28 08:44:07,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1095. [2022-04-28 08:44:07,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:44:07,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1202 states. Second operand has 1095 states, 1090 states have (on average 1.420183486238532) internal successors, (1548), 1090 states have internal predecessors, (1548), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:44:07,238 INFO L74 IsIncluded]: Start isIncluded. First operand 1202 states. Second operand has 1095 states, 1090 states have (on average 1.420183486238532) internal successors, (1548), 1090 states have internal predecessors, (1548), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:44:07,238 INFO L87 Difference]: Start difference. First operand 1202 states. Second operand has 1095 states, 1090 states have (on average 1.420183486238532) internal successors, (1548), 1090 states have internal predecessors, (1548), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:44:07,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:44:07,274 INFO L93 Difference]: Finished difference Result 1202 states and 1683 transitions. [2022-04-28 08:44:07,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1683 transitions. [2022-04-28 08:44:07,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:44:07,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:44:07,276 INFO L74 IsIncluded]: Start isIncluded. First operand has 1095 states, 1090 states have (on average 1.420183486238532) internal successors, (1548), 1090 states have internal predecessors, (1548), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1202 states. [2022-04-28 08:44:07,277 INFO L87 Difference]: Start difference. First operand has 1095 states, 1090 states have (on average 1.420183486238532) internal successors, (1548), 1090 states have internal predecessors, (1548), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1202 states. [2022-04-28 08:44:07,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:44:07,313 INFO L93 Difference]: Finished difference Result 1202 states and 1683 transitions. [2022-04-28 08:44:07,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1683 transitions. [2022-04-28 08:44:07,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:44:07,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:44:07,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:44:07,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:44:07,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 1090 states have (on average 1.420183486238532) internal successors, (1548), 1090 states have internal predecessors, (1548), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:44:07,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1552 transitions. [2022-04-28 08:44:07,360 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1552 transitions. Word has length 176 [2022-04-28 08:44:07,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:44:07,360 INFO L495 AbstractCegarLoop]: Abstraction has 1095 states and 1552 transitions. [2022-04-28 08:44:07,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:44:07,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1095 states and 1552 transitions. [2022-04-28 08:44:09,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1552 edges. 1552 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:44:09,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1552 transitions. [2022-04-28 08:44:09,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-04-28 08:44:09,145 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:44:09,145 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:44:09,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 08:44:09,145 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:44:09,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:44:09,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1625259889, now seen corresponding path program 1 times [2022-04-28 08:44:09,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:44:09,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [590873884] [2022-04-28 08:44:23,906 WARN L232 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:44:33,893 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:44:33,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1625259889, now seen corresponding path program 2 times [2022-04-28 08:44:33,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:44:33,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47680199] [2022-04-28 08:44:33,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:44:33,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:44:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:44:34,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:44:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:44:34,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {133962#(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); {133954#true} is VALID [2022-04-28 08:44:34,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {133954#true} assume true; {133954#true} is VALID [2022-04-28 08:44:34,179 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {133954#true} {133954#true} #593#return; {133954#true} is VALID [2022-04-28 08:44:34,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {133954#true} call ULTIMATE.init(); {133962#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:44:34,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {133962#(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); {133954#true} is VALID [2022-04-28 08:44:34,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {133954#true} assume true; {133954#true} is VALID [2022-04-28 08:44:34,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {133954#true} {133954#true} #593#return; {133954#true} is VALID [2022-04-28 08:44:34,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {133954#true} call #t~ret158 := main(); {133954#true} is VALID [2022-04-28 08:44:34,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {133954#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; {133954#true} is VALID [2022-04-28 08:44:34,181 INFO L272 TraceCheckUtils]: 6: Hoare triple {133954#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {133954#true} is VALID [2022-04-28 08:44:34,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {133954#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); {133954#true} is VALID [2022-04-28 08:44:34,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {133954#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; {133954#true} is VALID [2022-04-28 08:44:34,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {133954#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; {133954#true} is VALID [2022-04-28 08:44:34,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {133954#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {133954#true} is VALID [2022-04-28 08:44:34,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {133954#true} assume !false; {133954#true} is VALID [2022-04-28 08:44:34,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {133954#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-28 08:44:34,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {133954#true} assume 12292 == #t~mem49;havoc #t~mem49; {133954#true} is VALID [2022-04-28 08:44:34,182 INFO L290 TraceCheckUtils]: 14: Hoare triple {133954#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; {133954#true} is VALID [2022-04-28 08:44:34,182 INFO L290 TraceCheckUtils]: 15: Hoare triple {133954#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {133954#true} is VALID [2022-04-28 08:44:34,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {133954#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {133954#true} is VALID [2022-04-28 08:44:34,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {133954#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {133954#true} is VALID [2022-04-28 08:44:34,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {133954#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); {133954#true} is VALID [2022-04-28 08:44:34,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {133954#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {133954#true} is VALID [2022-04-28 08:44:34,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {133954#true} assume !(0 == ~tmp___4~0); {133954#true} is VALID [2022-04-28 08:44:34,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {133954#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); {133954#true} is VALID [2022-04-28 08:44:34,182 INFO L290 TraceCheckUtils]: 22: Hoare triple {133954#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); {133954#true} is VALID [2022-04-28 08:44:34,183 INFO L290 TraceCheckUtils]: 23: Hoare triple {133954#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {133954#true} is VALID [2022-04-28 08:44:34,183 INFO L290 TraceCheckUtils]: 24: Hoare triple {133954#true} ~skip~0 := 0; {133954#true} is VALID [2022-04-28 08:44:34,183 INFO L290 TraceCheckUtils]: 25: Hoare triple {133954#true} assume !false; {133954#true} is VALID [2022-04-28 08:44:34,183 INFO L290 TraceCheckUtils]: 26: Hoare triple {133954#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-28 08:44:34,183 INFO L290 TraceCheckUtils]: 27: Hoare triple {133954#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-28 08:44:34,183 INFO L290 TraceCheckUtils]: 28: Hoare triple {133954#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-28 08:44:34,183 INFO L290 TraceCheckUtils]: 29: Hoare triple {133954#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-28 08:44:34,183 INFO L290 TraceCheckUtils]: 30: Hoare triple {133954#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-28 08:44:34,183 INFO L290 TraceCheckUtils]: 31: Hoare triple {133954#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-28 08:44:34,183 INFO L290 TraceCheckUtils]: 32: Hoare triple {133954#true} assume 4368 == #t~mem54;havoc #t~mem54; {133954#true} is VALID [2022-04-28 08:44:34,183 INFO L290 TraceCheckUtils]: 33: Hoare triple {133954#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; {133954#true} is VALID [2022-04-28 08:44:34,184 INFO L290 TraceCheckUtils]: 34: Hoare triple {133954#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {133954#true} is VALID [2022-04-28 08:44:34,184 INFO L290 TraceCheckUtils]: 35: Hoare triple {133954#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); {133954#true} is VALID [2022-04-28 08:44:34,184 INFO L290 TraceCheckUtils]: 36: Hoare triple {133954#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; {133954#true} is VALID [2022-04-28 08:44:34,184 INFO L290 TraceCheckUtils]: 37: Hoare triple {133954#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); {133954#true} is VALID [2022-04-28 08:44:34,184 INFO L290 TraceCheckUtils]: 38: Hoare triple {133954#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {133954#true} is VALID [2022-04-28 08:44:34,184 INFO L290 TraceCheckUtils]: 39: Hoare triple {133954#true} ~skip~0 := 0; {133954#true} is VALID [2022-04-28 08:44:34,184 INFO L290 TraceCheckUtils]: 40: Hoare triple {133954#true} assume !false; {133954#true} is VALID [2022-04-28 08:44:34,184 INFO L290 TraceCheckUtils]: 41: Hoare triple {133954#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-28 08:44:34,184 INFO L290 TraceCheckUtils]: 42: Hoare triple {133954#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-28 08:44:34,184 INFO L290 TraceCheckUtils]: 43: Hoare triple {133954#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-28 08:44:34,184 INFO L290 TraceCheckUtils]: 44: Hoare triple {133954#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-28 08:44:34,185 INFO L290 TraceCheckUtils]: 45: Hoare triple {133954#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-28 08:44:34,185 INFO L290 TraceCheckUtils]: 46: Hoare triple {133954#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-28 08:44:34,185 INFO L290 TraceCheckUtils]: 47: Hoare triple {133954#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-28 08:44:34,185 INFO L290 TraceCheckUtils]: 48: Hoare triple {133954#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-28 08:44:34,185 INFO L290 TraceCheckUtils]: 49: Hoare triple {133954#true} assume 4384 == #t~mem56;havoc #t~mem56; {133954#true} is VALID [2022-04-28 08:44:34,185 INFO L290 TraceCheckUtils]: 50: Hoare triple {133954#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {133954#true} is VALID [2022-04-28 08:44:34,185 INFO L290 TraceCheckUtils]: 51: Hoare triple {133954#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {133954#true} is VALID [2022-04-28 08:44:34,186 INFO L290 TraceCheckUtils]: 52: Hoare triple {133954#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {133959#(= |ssl3_connect_#t~mem93| (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:44:34,186 INFO L290 TraceCheckUtils]: 53: Hoare triple {133959#(= |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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,187 INFO L290 TraceCheckUtils]: 54: Hoare triple {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,188 INFO L290 TraceCheckUtils]: 55: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,188 INFO L290 TraceCheckUtils]: 56: Hoare triple {133960#(= (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; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,188 INFO L290 TraceCheckUtils]: 57: Hoare triple {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,189 INFO L290 TraceCheckUtils]: 58: Hoare triple {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,189 INFO L290 TraceCheckUtils]: 59: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,189 INFO L290 TraceCheckUtils]: 60: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,189 INFO L290 TraceCheckUtils]: 61: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,190 INFO L290 TraceCheckUtils]: 62: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,190 INFO L290 TraceCheckUtils]: 63: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,190 INFO L290 TraceCheckUtils]: 64: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,191 INFO L290 TraceCheckUtils]: 65: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,191 INFO L290 TraceCheckUtils]: 66: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,191 INFO L290 TraceCheckUtils]: 67: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,192 INFO L290 TraceCheckUtils]: 68: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,192 INFO L290 TraceCheckUtils]: 69: Hoare triple {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4400 == #t~mem58;havoc #t~mem58; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,192 INFO L290 TraceCheckUtils]: 70: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,193 INFO L290 TraceCheckUtils]: 71: Hoare triple {133960#(= (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; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,193 INFO L290 TraceCheckUtils]: 72: Hoare triple {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,193 INFO L290 TraceCheckUtils]: 73: Hoare triple {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,194 INFO L290 TraceCheckUtils]: 74: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,195 INFO L290 TraceCheckUtils]: 75: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,195 INFO L290 TraceCheckUtils]: 76: Hoare triple {133960#(= (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; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,195 INFO L290 TraceCheckUtils]: 77: Hoare triple {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,196 INFO L290 TraceCheckUtils]: 78: Hoare triple {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,196 INFO L290 TraceCheckUtils]: 79: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,196 INFO L290 TraceCheckUtils]: 80: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,196 INFO L290 TraceCheckUtils]: 81: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,197 INFO L290 TraceCheckUtils]: 82: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,197 INFO L290 TraceCheckUtils]: 83: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,197 INFO L290 TraceCheckUtils]: 84: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,198 INFO L290 TraceCheckUtils]: 85: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,198 INFO L290 TraceCheckUtils]: 86: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,198 INFO L290 TraceCheckUtils]: 87: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,199 INFO L290 TraceCheckUtils]: 88: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,199 INFO L290 TraceCheckUtils]: 89: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,199 INFO L290 TraceCheckUtils]: 90: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,200 INFO L290 TraceCheckUtils]: 91: Hoare triple {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4416 == #t~mem60;havoc #t~mem60; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,200 INFO L290 TraceCheckUtils]: 92: Hoare triple {133960#(= (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; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,200 INFO L290 TraceCheckUtils]: 93: Hoare triple {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,201 INFO L290 TraceCheckUtils]: 94: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,202 INFO L290 TraceCheckUtils]: 95: Hoare triple {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == ~tmp___6~0); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,202 INFO L290 TraceCheckUtils]: 96: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,202 INFO L290 TraceCheckUtils]: 97: Hoare triple {133960#(= (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; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,203 INFO L290 TraceCheckUtils]: 98: Hoare triple {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,203 INFO L290 TraceCheckUtils]: 99: Hoare triple {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,203 INFO L290 TraceCheckUtils]: 100: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,203 INFO L290 TraceCheckUtils]: 101: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,204 INFO L290 TraceCheckUtils]: 102: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,204 INFO L290 TraceCheckUtils]: 103: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,204 INFO L290 TraceCheckUtils]: 104: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,205 INFO L290 TraceCheckUtils]: 105: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,205 INFO L290 TraceCheckUtils]: 106: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,205 INFO L290 TraceCheckUtils]: 107: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,206 INFO L290 TraceCheckUtils]: 108: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,206 INFO L290 TraceCheckUtils]: 109: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,206 INFO L290 TraceCheckUtils]: 110: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,207 INFO L290 TraceCheckUtils]: 111: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,207 INFO L290 TraceCheckUtils]: 112: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,207 INFO L290 TraceCheckUtils]: 113: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,207 INFO L290 TraceCheckUtils]: 114: Hoare triple {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4432 == #t~mem62;havoc #t~mem62; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,208 INFO L290 TraceCheckUtils]: 115: Hoare triple {133960#(= (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; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,208 INFO L290 TraceCheckUtils]: 116: Hoare triple {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(5 == ~blastFlag~0); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,209 INFO L290 TraceCheckUtils]: 117: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,209 INFO L290 TraceCheckUtils]: 118: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,210 INFO L290 TraceCheckUtils]: 119: Hoare triple {133960#(= (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; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,210 INFO L290 TraceCheckUtils]: 120: Hoare triple {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,210 INFO L290 TraceCheckUtils]: 121: Hoare triple {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,211 INFO L290 TraceCheckUtils]: 122: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,211 INFO L290 TraceCheckUtils]: 123: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,211 INFO L290 TraceCheckUtils]: 124: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,212 INFO L290 TraceCheckUtils]: 125: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,212 INFO L290 TraceCheckUtils]: 126: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,212 INFO L290 TraceCheckUtils]: 127: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,213 INFO L290 TraceCheckUtils]: 128: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,213 INFO L290 TraceCheckUtils]: 129: Hoare triple {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4369 == #t~mem55;havoc #t~mem55; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,214 INFO L290 TraceCheckUtils]: 130: Hoare triple {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,214 INFO L290 TraceCheckUtils]: 131: Hoare triple {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == ~blastFlag~0); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,214 INFO L290 TraceCheckUtils]: 132: Hoare triple {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,216 INFO L290 TraceCheckUtils]: 133: Hoare triple {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} 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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,216 INFO L290 TraceCheckUtils]: 134: Hoare triple {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} 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; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,216 INFO L290 TraceCheckUtils]: 135: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,217 INFO L290 TraceCheckUtils]: 136: Hoare triple {133960#(= (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; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,217 INFO L290 TraceCheckUtils]: 137: Hoare triple {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,217 INFO L290 TraceCheckUtils]: 138: Hoare triple {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,217 INFO L290 TraceCheckUtils]: 139: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,218 INFO L290 TraceCheckUtils]: 140: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,218 INFO L290 TraceCheckUtils]: 141: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,218 INFO L290 TraceCheckUtils]: 142: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,219 INFO L290 TraceCheckUtils]: 143: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,219 INFO L290 TraceCheckUtils]: 144: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,219 INFO L290 TraceCheckUtils]: 145: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,219 INFO L290 TraceCheckUtils]: 146: Hoare triple {133960#(= (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); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,220 INFO L290 TraceCheckUtils]: 147: Hoare triple {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4384 == #t~mem56;havoc #t~mem56; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,220 INFO L290 TraceCheckUtils]: 148: Hoare triple {133960#(= (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; {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,220 INFO L290 TraceCheckUtils]: 149: Hoare triple {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(1 == ~blastFlag~0); {133960#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:44:34,221 INFO L290 TraceCheckUtils]: 150: Hoare triple {133960#(= (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); {133961#(= |ssl3_connect_#t~mem93| 0)} is VALID [2022-04-28 08:44:34,221 INFO L290 TraceCheckUtils]: 151: Hoare triple {133961#(= |ssl3_connect_#t~mem93| 0)} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {133955#false} is VALID [2022-04-28 08:44:34,221 INFO L290 TraceCheckUtils]: 152: Hoare triple {133955#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {133955#false} is VALID [2022-04-28 08:44:34,221 INFO L290 TraceCheckUtils]: 153: Hoare triple {133955#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); {133955#false} is VALID [2022-04-28 08:44:34,221 INFO L290 TraceCheckUtils]: 154: Hoare triple {133955#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {133955#false} is VALID [2022-04-28 08:44:34,221 INFO L290 TraceCheckUtils]: 155: Hoare triple {133955#false} ~skip~0 := 0; {133955#false} is VALID [2022-04-28 08:44:34,221 INFO L290 TraceCheckUtils]: 156: Hoare triple {133955#false} assume !false; {133955#false} is VALID [2022-04-28 08:44:34,221 INFO L290 TraceCheckUtils]: 157: Hoare triple {133955#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); {133955#false} is VALID [2022-04-28 08:44:34,221 INFO L290 TraceCheckUtils]: 158: Hoare triple {133955#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {133955#false} is VALID [2022-04-28 08:44:34,222 INFO L290 TraceCheckUtils]: 159: Hoare triple {133955#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {133955#false} is VALID [2022-04-28 08:44:34,222 INFO L290 TraceCheckUtils]: 160: Hoare triple {133955#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {133955#false} is VALID [2022-04-28 08:44:34,222 INFO L290 TraceCheckUtils]: 161: Hoare triple {133955#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {133955#false} is VALID [2022-04-28 08:44:34,222 INFO L290 TraceCheckUtils]: 162: Hoare triple {133955#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {133955#false} is VALID [2022-04-28 08:44:34,222 INFO L290 TraceCheckUtils]: 163: Hoare triple {133955#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {133955#false} is VALID [2022-04-28 08:44:34,222 INFO L290 TraceCheckUtils]: 164: Hoare triple {133955#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {133955#false} is VALID [2022-04-28 08:44:34,222 INFO L290 TraceCheckUtils]: 165: Hoare triple {133955#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {133955#false} is VALID [2022-04-28 08:44:34,222 INFO L290 TraceCheckUtils]: 166: Hoare triple {133955#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {133955#false} is VALID [2022-04-28 08:44:34,222 INFO L290 TraceCheckUtils]: 167: Hoare triple {133955#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {133955#false} is VALID [2022-04-28 08:44:34,222 INFO L290 TraceCheckUtils]: 168: Hoare triple {133955#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {133955#false} is VALID [2022-04-28 08:44:34,222 INFO L290 TraceCheckUtils]: 169: Hoare triple {133955#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {133955#false} is VALID [2022-04-28 08:44:34,222 INFO L290 TraceCheckUtils]: 170: Hoare triple {133955#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {133955#false} is VALID [2022-04-28 08:44:34,222 INFO L290 TraceCheckUtils]: 171: Hoare triple {133955#false} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {133955#false} is VALID [2022-04-28 08:44:34,222 INFO L290 TraceCheckUtils]: 172: Hoare triple {133955#false} assume 4433 == #t~mem63;havoc #t~mem63; {133955#false} is VALID [2022-04-28 08:44:34,223 INFO L290 TraceCheckUtils]: 173: Hoare triple {133955#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {133955#false} is VALID [2022-04-28 08:44:34,223 INFO L290 TraceCheckUtils]: 174: Hoare triple {133955#false} assume 5 == ~blastFlag~0; {133955#false} is VALID [2022-04-28 08:44:34,223 INFO L290 TraceCheckUtils]: 175: Hoare triple {133955#false} assume !false; {133955#false} is VALID [2022-04-28 08:44:34,223 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 247 proven. 1 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-04-28 08:44:34,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:44:34,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47680199] [2022-04-28 08:44:34,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47680199] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 08:44:34,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645592553] [2022-04-28 08:44:34,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 08:44:34,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:44:34,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:44:34,225 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 08:44:34,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process