/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-e106359-m [2022-04-15 11:31:42,643 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:31:42,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:31:42,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:31:42,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:31:42,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:31:42,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:31:42,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:31:42,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:31:42,704 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:31:42,705 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:31:42,706 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:31:42,706 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:31:42,708 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:31:42,709 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:31:42,711 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:31:42,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:31:42,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:31:42,714 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:31:42,717 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:31:42,719 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:31:42,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:31:42,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:31:42,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:31:42,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:31:42,726 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:31:42,726 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:31:42,727 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:31:42,727 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:31:42,727 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:31:42,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:31:42,729 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:31:42,730 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:31:42,730 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:31:42,731 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:31:42,731 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:31:42,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:31:42,732 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:31:42,732 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:31:42,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:31:42,733 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:31:42,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:31:42,735 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 11:31:42,743 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:31:42,743 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:31:42,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:31:42,744 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:31:42,744 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:31:42,744 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:31:42,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:31:42,745 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:31:42,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:31:42,745 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:31:42,746 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:31:42,746 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:31:42,746 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:31:42,746 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:31:42,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:31:42,746 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:31:42,746 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:31:42,746 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:31:42,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:31:42,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:31:42,747 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:31:42,747 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:31:42,747 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:31:42,747 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:31:42,747 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:31:42,747 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 11:31:42,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:31:42,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:31:42,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:31:42,974 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:31:42,974 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:31:42,975 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-15 11:31:43,047 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/700bcbf69/85d98a425c354298a739321a2298c6af/FLAGe0e51bd31 [2022-04-15 11:31:43,498 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:31:43,498 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.02.i.cil-2.c [2022-04-15 11:31:43,512 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/700bcbf69/85d98a425c354298a739321a2298c6af/FLAGe0e51bd31 [2022-04-15 11:31:43,997 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/700bcbf69/85d98a425c354298a739321a2298c6af [2022-04-15 11:31:43,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:31:43,999 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:31:44,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:31:44,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:31:44,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:31:44,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:31:43" (1/1) ... [2022-04-15 11:31:44,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ae8245a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:44, skipping insertion in model container [2022-04-15 11:31:44,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:31:43" (1/1) ... [2022-04-15 11:31:44,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:31:44,119 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:31:44,398 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-15 11:31:44,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:31:44,416 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:31:44,532 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-15 11:31:44,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:31:44,548 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:31:44,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:44 WrapperNode [2022-04-15 11:31:44,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:31:44,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:31:44,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:31:44,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:31:44,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:44" (1/1) ... [2022-04-15 11:31:44,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:44" (1/1) ... [2022-04-15 11:31:44,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:44" (1/1) ... [2022-04-15 11:31:44,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:44" (1/1) ... [2022-04-15 11:31:44,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:44" (1/1) ... [2022-04-15 11:31:44,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:44" (1/1) ... [2022-04-15 11:31:44,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:44" (1/1) ... [2022-04-15 11:31:44,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:31:44,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:31:44,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:31:44,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:31:44,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:44" (1/1) ... [2022-04-15 11:31:44,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:31:44,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:31:44,698 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 11:31:44,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 11:31:44,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:31:44,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:31:44,728 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:31:44,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-15 11:31:44,729 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-15 11:31:44,729 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:31:44,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-15 11:31:44,729 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-15 11:31:44,729 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 11:31:44,729 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-15 11:31:44,729 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:31:44,729 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:31:44,729 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:31:44,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:31:44,729 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 11:31:44,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 11:31:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:31:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 11:31:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 11:31:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 11:31:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-15 11:31:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-15 11:31:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-15 11:31:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-15 11:31:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-15 11:31:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 11:31:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:31:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 11:31:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:31:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 11:31:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:31:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 11:31:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 11:31:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:31:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:31:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:31:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 11:31:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 11:31:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 11:31:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 11:31:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:31:44,854 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:31:44,855 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:31:46,150 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:31:46,548 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-15 11:31:46,548 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-15 11:31:46,558 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:31:46,564 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:31:46,564 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:31:46,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:31:46 BoogieIcfgContainer [2022-04-15 11:31:46,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:31:46,567 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:31:46,567 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:31:46,569 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:31:46,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:31:43" (1/3) ... [2022-04-15 11:31:46,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6602a3df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:31:46, skipping insertion in model container [2022-04-15 11:31:46,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:44" (2/3) ... [2022-04-15 11:31:46,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6602a3df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:31:46, skipping insertion in model container [2022-04-15 11:31:46,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:31:46" (3/3) ... [2022-04-15 11:31:46,571 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-2.c [2022-04-15 11:31:46,575 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:31:46,575 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:31:46,629 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:31:46,647 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 11:31:46,648 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:31:46,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 11:31:46,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 11:31:46,679 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:31:46,680 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:31:46,680 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:31:46,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:31:46,688 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 1 times [2022-04-15 11:31:46,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:46,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1910110035] [2022-04-15 11:31:46,706 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:31:46,707 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 2 times [2022-04-15 11:31:46,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:31:46,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688321379] [2022-04-15 11:31:46,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:31:46,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:31:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:47,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:31:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:47,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {141#true} is VALID [2022-04-15 11:31:47,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-15 11:31:47,239 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-15 11:31:47,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:31:47,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {141#true} is VALID [2022-04-15 11:31:47,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-15 11:31:47,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-15 11:31:47,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {141#true} call #t~ret158 := main(); {141#true} is VALID [2022-04-15 11:31:47,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {141#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {141#true} is VALID [2022-04-15 11:31:47,246 INFO L272 TraceCheckUtils]: 6: Hoare triple {141#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {141#true} is VALID [2022-04-15 11:31:47,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:31:47,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:31:47,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:31:47,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:31:47,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:31:47,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {147#(= 12292 |ssl3_connect_#t~mem49|)} is VALID [2022-04-15 11:31:47,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {147#(= 12292 |ssl3_connect_#t~mem49|)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:31:47,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {142#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:31:47,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {142#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:31:47,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {142#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:31:47,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {142#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:31:47,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {142#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:31:47,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {142#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:31:47,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {142#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:31:47,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {142#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:31:47,255 INFO L290 TraceCheckUtils]: 22: Hoare triple {142#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:31:47,255 INFO L290 TraceCheckUtils]: 23: Hoare triple {142#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:31:47,255 INFO L290 TraceCheckUtils]: 24: Hoare triple {142#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:31:47,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {142#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:31:47,256 INFO L290 TraceCheckUtils]: 26: Hoare triple {142#false} assume 4432 == #t~mem62;havoc #t~mem62; {142#false} is VALID [2022-04-15 11:31:47,256 INFO L290 TraceCheckUtils]: 27: Hoare triple {142#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {142#false} is VALID [2022-04-15 11:31:47,256 INFO L290 TraceCheckUtils]: 28: Hoare triple {142#false} assume 5 == ~blastFlag~0; {142#false} is VALID [2022-04-15 11:31:47,256 INFO L290 TraceCheckUtils]: 29: Hoare triple {142#false} assume !false; {142#false} is VALID [2022-04-15 11:31:47,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:31:47,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:31:47,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688321379] [2022-04-15 11:31:47,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688321379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:47,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:47,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:31:47,262 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:31:47,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1910110035] [2022-04-15 11:31:47,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1910110035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:47,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:47,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:31:47,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649556698] [2022-04-15 11:31:47,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:31:47,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 11:31:47,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:31:47,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:47,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:47,301 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:31:47,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:47,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:31:47,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:31:47,316 INFO L87 Difference]: Start difference. First operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:49,367 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:50,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:50,318 INFO L93 Difference]: Finished difference Result 267 states and 442 transitions. [2022-04-15 11:31:50,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:31:50,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 11:31:50,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:31:50,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:50,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-15 11:31:50,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:50,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-15 11:31:50,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-15 11:31:50,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:50,631 INFO L225 Difference]: With dead ends: 267 [2022-04-15 11:31:50,631 INFO L226 Difference]: Without dead ends: 122 [2022-04-15 11:31:50,634 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:31:50,641 INFO L913 BasicCegarLoop]: 213 mSDtfsCounter, 7 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:31:50,642 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 555 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 320 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:31:50,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-15 11:31:50,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-04-15 11:31:50,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:31:50,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:50,679 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:50,680 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:50,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:50,688 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-15 11:31:50,688 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-15 11:31:50,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:50,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:50,690 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-15 11:31:50,690 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-15 11:31:50,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:50,697 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-15 11:31:50,697 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-15 11:31:50,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:50,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:50,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:31:50,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:31:50,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:50,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2022-04-15 11:31:50,709 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 30 [2022-04-15 11:31:50,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:31:50,709 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2022-04-15 11:31:50,709 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:50,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 178 transitions. [2022-04-15 11:31:50,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:50,826 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2022-04-15 11:31:50,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 11:31:50,828 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:31:50,828 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:31:50,829 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:31:50,829 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:31:50,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:31:50,829 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 1 times [2022-04-15 11:31:50,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:50,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [675107336] [2022-04-15 11:31:50,831 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:31:50,832 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 2 times [2022-04-15 11:31:50,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:31:50,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949761298] [2022-04-15 11:31:50,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:31:50,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:31:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:51,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:31:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:51,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {1179#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1173#true} is VALID [2022-04-15 11:31:51,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-15 11:31:51,066 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-15 11:31:51,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} call ULTIMATE.init(); {1179#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:31:51,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {1179#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1173#true} is VALID [2022-04-15 11:31:51,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-15 11:31:51,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-15 11:31:51,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} call #t~ret158 := main(); {1173#true} is VALID [2022-04-15 11:31:51,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {1173#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {1173#true} is VALID [2022-04-15 11:31:51,068 INFO L272 TraceCheckUtils]: 6: Hoare triple {1173#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {1173#true} is VALID [2022-04-15 11:31:51,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {1173#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 12292 == #t~mem49;havoc #t~mem49; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,075 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call write~int(0, ~s.base, 36 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,076 INFO L290 TraceCheckUtils]: 18: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___4~0); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,077 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,077 INFO L290 TraceCheckUtils]: 22: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} ~skip~0 := 0; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,079 INFO L290 TraceCheckUtils]: 28: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,080 INFO L290 TraceCheckUtils]: 30: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,080 INFO L290 TraceCheckUtils]: 31: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,081 INFO L290 TraceCheckUtils]: 32: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,081 INFO L290 TraceCheckUtils]: 33: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,081 INFO L290 TraceCheckUtils]: 34: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,082 INFO L290 TraceCheckUtils]: 35: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,082 INFO L290 TraceCheckUtils]: 36: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,082 INFO L290 TraceCheckUtils]: 37: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,083 INFO L290 TraceCheckUtils]: 38: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,083 INFO L290 TraceCheckUtils]: 39: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,083 INFO L290 TraceCheckUtils]: 40: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 4432 == #t~mem62;havoc #t~mem62; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,084 INFO L290 TraceCheckUtils]: 41: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:51,084 INFO L290 TraceCheckUtils]: 42: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 5 == ~blastFlag~0; {1174#false} is VALID [2022-04-15 11:31:51,084 INFO L290 TraceCheckUtils]: 43: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-15 11:31:51,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:31:51,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:31:51,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949761298] [2022-04-15 11:31:51,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949761298] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:51,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:51,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:31:51,086 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:31:51,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [675107336] [2022-04-15 11:31:51,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [675107336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:51,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:51,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:31:51,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91646609] [2022-04-15 11:31:51,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:31:51,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 11:31:51,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:31:51,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:51,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:51,121 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:31:51,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:51,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:31:51,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:31:51,126 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:53,141 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:53,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:53,740 INFO L93 Difference]: Finished difference Result 326 states and 488 transitions. [2022-04-15 11:31:53,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:31:53,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 11:31:53,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:31:53,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:53,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2022-04-15 11:31:53,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2022-04-15 11:31:53,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 485 transitions. [2022-04-15 11:31:54,090 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-15 11:31:54,095 INFO L225 Difference]: With dead ends: 326 [2022-04-15 11:31:54,095 INFO L226 Difference]: Without dead ends: 221 [2022-04-15 11:31:54,096 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:31:54,097 INFO L913 BasicCegarLoop]: 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-15 11:31:54,097 INFO L914 BasicCegarLoop]: 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-15 11:31:54,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-04-15 11:31:54,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2022-04-15 11:31:54,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:31:54,109 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-15 11:31:54,109 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-15 11:31:54,110 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-15 11:31:54,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:54,115 INFO L93 Difference]: Finished difference Result 221 states and 325 transitions. [2022-04-15 11:31:54,116 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 325 transitions. [2022-04-15 11:31:54,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:54,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:54,116 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-15 11:31:54,117 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-15 11:31:54,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:54,123 INFO L93 Difference]: Finished difference Result 221 states and 325 transitions. [2022-04-15 11:31:54,123 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 325 transitions. [2022-04-15 11:31:54,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:54,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:54,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:31:54,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:31:54,124 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-15 11:31:54,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 325 transitions. [2022-04-15 11:31:54,130 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 325 transitions. Word has length 44 [2022-04-15 11:31:54,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:31:54,130 INFO L478 AbstractCegarLoop]: Abstraction has 221 states and 325 transitions. [2022-04-15 11:31:54,130 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:54,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 221 states and 325 transitions. [2022-04-15 11:31:54,353 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-15 11:31:54,353 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 325 transitions. [2022-04-15 11:31:54,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 11:31:54,354 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:31:54,355 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:31:54,355 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:31:54,355 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:31:54,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:31:54,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1147706284, now seen corresponding path program 1 times [2022-04-15 11:31:54,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:54,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1302514259] [2022-04-15 11:31:54,356 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:31:54,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1147706284, now seen corresponding path program 2 times [2022-04-15 11:31:54,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:31:54,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339201173] [2022-04-15 11:31:54,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:31:54,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:31:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:54,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:31:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:54,512 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-15 11:31:54,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {2718#true} assume true; {2718#true} is VALID [2022-04-15 11:31:54,513 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2718#true} {2718#true} #593#return; {2718#true} is VALID [2022-04-15 11:31:54,513 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-15 11:31:54,514 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-15 11:31:54,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {2718#true} assume true; {2718#true} is VALID [2022-04-15 11:31:54,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2718#true} {2718#true} #593#return; {2718#true} is VALID [2022-04-15 11:31:54,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {2718#true} call #t~ret158 := main(); {2718#true} is VALID [2022-04-15 11:31:54,514 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-15 11:31:54,514 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-15 11:31:54,514 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-15 11:31:54,514 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-15 11:31:54,515 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-15 11:31:54,515 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-15 11:31:54,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {2718#true} assume !false; {2718#true} is VALID [2022-04-15 11:31:54,515 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-15 11:31:54,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {2718#true} assume 12292 == #t~mem49;havoc #t~mem49; {2718#true} is VALID [2022-04-15 11:31:54,515 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-15 11:31:54,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {2718#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {2718#true} is VALID [2022-04-15 11:31:54,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {2718#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {2718#true} is VALID [2022-04-15 11:31:54,516 INFO L290 TraceCheckUtils]: 17: Hoare triple {2718#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {2718#true} is VALID [2022-04-15 11:31:54,516 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-15 11:31:54,516 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-15 11:31:54,516 INFO L290 TraceCheckUtils]: 20: Hoare triple {2718#true} assume !(0 == ~tmp___4~0); {2718#true} is VALID [2022-04-15 11:31:54,516 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-15 11:31:54,516 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-15 11:31:54,516 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-15 11:31:54,516 INFO L290 TraceCheckUtils]: 24: Hoare triple {2718#true} ~skip~0 := 0; {2718#true} is VALID [2022-04-15 11:31:54,517 INFO L290 TraceCheckUtils]: 25: Hoare triple {2718#true} assume !false; {2718#true} is VALID [2022-04-15 11:31:54,517 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-15 11:31:54,517 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-15 11:31:54,517 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-15 11:31:54,517 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-15 11:31:54,517 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-15 11:31:54,517 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-15 11:31:54,517 INFO L290 TraceCheckUtils]: 32: Hoare triple {2718#true} assume 4368 == #t~mem54;havoc #t~mem54; {2718#true} is VALID [2022-04-15 11:31:54,518 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-15 11:31:54,518 INFO L290 TraceCheckUtils]: 34: Hoare triple {2718#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2718#true} is VALID [2022-04-15 11:31:54,519 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-15 11:31:54,520 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-15 11:31:54,520 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-15 11:31:54,520 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-15 11:31:54,521 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-15 11:31:54,521 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-15 11:31:54,522 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-15 11:31:54,522 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-15 11:31:54,522 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-15 11:31:54,523 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-15 11:31:54,523 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-15 11:31:54,524 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-15 11:31:54,524 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-15 11:31:54,524 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-15 11:31:54,525 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-15 11:31:54,525 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-15 11:31:54,525 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-15 11:31:54,525 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-15 11:31:54,525 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-15 11:31:54,525 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-15 11:31:54,526 INFO L290 TraceCheckUtils]: 55: Hoare triple {2719#false} assume 4432 == #t~mem62;havoc #t~mem62; {2719#false} is VALID [2022-04-15 11:31:54,526 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-15 11:31:54,526 INFO L290 TraceCheckUtils]: 57: Hoare triple {2719#false} assume 5 == ~blastFlag~0; {2719#false} is VALID [2022-04-15 11:31:54,526 INFO L290 TraceCheckUtils]: 58: Hoare triple {2719#false} assume !false; {2719#false} is VALID [2022-04-15 11:31:54,526 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:31:54,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:31:54,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339201173] [2022-04-15 11:31:54,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339201173] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:54,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:54,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:31:54,527 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:31:54,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1302514259] [2022-04-15 11:31:54,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1302514259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:54,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:54,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:31:54,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377334058] [2022-04-15 11:31:54,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:31:54,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-15 11:31:54,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:31:54,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:54,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:54,574 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:31:54,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:54,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:31:54,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:31:54,574 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-15 11:31:56,597 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:57,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:57,582 INFO L93 Difference]: Finished difference Result 362 states and 538 transitions. [2022-04-15 11:31:57,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:31:57,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-15 11:31:57,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:31:57,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:57,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-15 11:31:57,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:57,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-15 11:31:57,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 388 transitions. [2022-04-15 11:31:57,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:57,824 INFO L225 Difference]: With dead ends: 362 [2022-04-15 11:31:57,824 INFO L226 Difference]: Without dead ends: 257 [2022-04-15 11:31:57,827 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:31:57,831 INFO L913 BasicCegarLoop]: 198 mSDtfsCounter, 33 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:31:57,832 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 484 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 359 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:31:57,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-15 11:31:57,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 239. [2022-04-15 11:31:57,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:31:57,843 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-15 11:31:57,844 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-15 11:31:57,849 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-15 11:31:57,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:57,856 INFO L93 Difference]: Finished difference Result 257 states and 379 transitions. [2022-04-15 11:31:57,856 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 379 transitions. [2022-04-15 11:31:57,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:57,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:57,857 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-15 11:31:57,857 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-15 11:31:57,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:57,863 INFO L93 Difference]: Finished difference Result 257 states and 379 transitions. [2022-04-15 11:31:57,863 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 379 transitions. [2022-04-15 11:31:57,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:57,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:57,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:31:57,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:31:57,864 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-15 11:31:57,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 355 transitions. [2022-04-15 11:31:57,869 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 355 transitions. Word has length 59 [2022-04-15 11:31:57,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:31:57,869 INFO L478 AbstractCegarLoop]: Abstraction has 239 states and 355 transitions. [2022-04-15 11:31:57,869 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:57,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 239 states and 355 transitions. [2022-04-15 11:31:58,079 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-15 11:31:58,080 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 355 transitions. [2022-04-15 11:31:58,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 11:31:58,081 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:31:58,081 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:31:58,081 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:31:58,081 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:31:58,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:31:58,082 INFO L85 PathProgramCache]: Analyzing trace with hash -861449916, now seen corresponding path program 3 times [2022-04-15 11:31:58,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:58,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [248957600] [2022-04-15 11:32:11,733 WARN L232 SmtUtils]: Spent 12.81s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 11:32:19,832 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:32:19,833 INFO L85 PathProgramCache]: Analyzing trace with hash -861449916, now seen corresponding path program 4 times [2022-04-15 11:32:19,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:32:19,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49787080] [2022-04-15 11:32:19,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:32:19,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:32:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:20,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:32:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:20,121 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-15 11:32:20,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {4446#true} assume true; {4446#true} is VALID [2022-04-15 11:32:20,121 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4446#true} {4446#true} #593#return; {4446#true} is VALID [2022-04-15 11:32:20,122 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-15 11:32:20,122 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-15 11:32:20,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {4446#true} assume true; {4446#true} is VALID [2022-04-15 11:32:20,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4446#true} {4446#true} #593#return; {4446#true} is VALID [2022-04-15 11:32:20,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {4446#true} call #t~ret158 := main(); {4446#true} is VALID [2022-04-15 11:32:20,123 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-15 11:32:20,123 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-15 11:32:20,123 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-15 11:32:20,123 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-15 11:32:20,123 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-15 11:32:20,123 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-15 11:32:20,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {4446#true} assume !false; {4446#true} is VALID [2022-04-15 11:32:20,123 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-15 11:32:20,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {4446#true} assume 12292 == #t~mem49;havoc #t~mem49; {4446#true} is VALID [2022-04-15 11:32:20,123 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-15 11:32:20,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {4446#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4446#true} is VALID [2022-04-15 11:32:20,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {4446#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4446#true} is VALID [2022-04-15 11:32:20,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {4446#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4446#true} is VALID [2022-04-15 11:32:20,124 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-15 11:32:20,124 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-15 11:32:20,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {4446#true} assume !(0 == ~tmp___4~0); {4446#true} is VALID [2022-04-15 11:32:20,125 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-15 11:32:20,125 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-15 11:32:20,125 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-15 11:32:20,125 INFO L290 TraceCheckUtils]: 24: Hoare triple {4446#true} ~skip~0 := 0; {4446#true} is VALID [2022-04-15 11:32:20,125 INFO L290 TraceCheckUtils]: 25: Hoare triple {4446#true} assume !false; {4446#true} is VALID [2022-04-15 11:32:20,125 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-15 11:32:20,126 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-15 11:32:20,126 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-15 11:32:20,126 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-15 11:32:20,127 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-15 11:32:20,127 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-15 11:32:20,127 INFO L290 TraceCheckUtils]: 32: Hoare triple {4446#true} assume 4368 == #t~mem54;havoc #t~mem54; {4446#true} is VALID [2022-04-15 11:32:20,129 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-15 11:32:20,129 INFO L290 TraceCheckUtils]: 34: Hoare triple {4446#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4446#true} is VALID [2022-04-15 11:32:20,130 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-15 11:32:20,131 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-15 11:32:20,131 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-15 11:32:20,131 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-15 11:32:20,132 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-15 11:32:20,132 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-15 11:32:20,132 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-15 11:32:20,133 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-15 11:32:20,162 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-15 11:32:20,162 INFO L290 TraceCheckUtils]: 44: Hoare triple {4447#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4447#false} is VALID [2022-04-15 11:32:20,162 INFO L290 TraceCheckUtils]: 45: Hoare triple {4447#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4447#false} is VALID [2022-04-15 11:32:20,162 INFO L290 TraceCheckUtils]: 46: Hoare triple {4447#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4447#false} is VALID [2022-04-15 11:32:20,162 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-15 11:32:20,163 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-15 11:32:20,163 INFO L290 TraceCheckUtils]: 49: Hoare triple {4447#false} assume !(0 == ~tmp___4~0); {4447#false} is VALID [2022-04-15 11:32:20,163 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-15 11:32:20,163 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-15 11:32:20,163 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-15 11:32:20,163 INFO L290 TraceCheckUtils]: 53: Hoare triple {4447#false} ~skip~0 := 0; {4447#false} is VALID [2022-04-15 11:32:20,163 INFO L290 TraceCheckUtils]: 54: Hoare triple {4447#false} assume !false; {4447#false} is VALID [2022-04-15 11:32:20,163 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-15 11:32:20,163 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-15 11:32:20,163 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-15 11:32:20,164 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-15 11:32:20,164 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-15 11:32:20,164 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-15 11:32:20,164 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-15 11:32:20,164 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-15 11:32:20,164 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-15 11:32:20,164 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-15 11:32:20,164 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-15 11:32:20,164 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-15 11:32:20,164 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-15 11:32:20,164 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-15 11:32:20,165 INFO L290 TraceCheckUtils]: 69: Hoare triple {4447#false} assume 4432 == #t~mem62;havoc #t~mem62; {4447#false} is VALID [2022-04-15 11:32:20,165 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-15 11:32:20,165 INFO L290 TraceCheckUtils]: 71: Hoare triple {4447#false} assume 5 == ~blastFlag~0; {4447#false} is VALID [2022-04-15 11:32:20,165 INFO L290 TraceCheckUtils]: 72: Hoare triple {4447#false} assume !false; {4447#false} is VALID [2022-04-15 11:32:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:32:20,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:32:20,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49787080] [2022-04-15 11:32:20,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49787080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:20,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:20,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:32:20,166 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:32:20,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [248957600] [2022-04-15 11:32:20,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [248957600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:20,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:20,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:32:20,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493585933] [2022-04-15 11:32:20,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:32:20,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-15 11:32:20,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:32:20,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:20,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:20,246 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:32:20,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:20,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:32:20,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:32:20,247 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-15 11:32:22,267 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:32:23,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:23,203 INFO L93 Difference]: Finished difference Result 642 states and 963 transitions. [2022-04-15 11:32:23,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:32:23,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-15 11:32:23,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:32:23,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 11:32:23,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:23,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 11:32:23,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-15 11:32:23,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:23,530 INFO L225 Difference]: With dead ends: 642 [2022-04-15 11:32:23,530 INFO L226 Difference]: Without dead ends: 419 [2022-04-15 11:32:23,531 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:32:23,532 INFO L913 BasicCegarLoop]: 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-15 11:32:23,532 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 296 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 379 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:32:23,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-04-15 11:32:23,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 261. [2022-04-15 11:32:23,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:32:23,547 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-15 11:32:23,547 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-15 11:32:23,548 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-15 11:32:23,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:23,556 INFO L93 Difference]: Finished difference Result 419 states and 625 transitions. [2022-04-15 11:32:23,556 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 625 transitions. [2022-04-15 11:32:23,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:23,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:23,558 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-15 11:32:23,558 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-15 11:32:23,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:23,566 INFO L93 Difference]: Finished difference Result 419 states and 625 transitions. [2022-04-15 11:32:23,566 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 625 transitions. [2022-04-15 11:32:23,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:23,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:23,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:32:23,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:32:23,568 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-15 11:32:23,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 386 transitions. [2022-04-15 11:32:23,572 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 386 transitions. Word has length 73 [2022-04-15 11:32:23,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:32:23,572 INFO L478 AbstractCegarLoop]: Abstraction has 261 states and 386 transitions. [2022-04-15 11:32:23,572 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:23,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 261 states and 386 transitions. [2022-04-15 11:32:23,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 386 edges. 386 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:23,851 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 386 transitions. [2022-04-15 11:32:23,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 11:32:23,851 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:32:23,852 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:32:23,852 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:32:23,852 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:32:23,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:32:23,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1970430362, now seen corresponding path program 1 times [2022-04-15 11:32:23,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:23,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [718486229] [2022-04-15 11:32:39,348 WARN L232 SmtUtils]: Spent 9.97s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 11:32:46,591 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:32:46,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1970430362, now seen corresponding path program 2 times [2022-04-15 11:32:46,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:32:46,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738187386] [2022-04-15 11:32:46,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:32:46,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:32:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:46,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:32:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:46,738 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-15 11:32:46,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {7102#true} assume true; {7102#true} is VALID [2022-04-15 11:32:46,738 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7102#true} {7102#true} #593#return; {7102#true} is VALID [2022-04-15 11:32:46,739 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-15 11:32:46,739 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-15 11:32:46,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {7102#true} assume true; {7102#true} is VALID [2022-04-15 11:32:46,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7102#true} {7102#true} #593#return; {7102#true} is VALID [2022-04-15 11:32:46,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {7102#true} call #t~ret158 := main(); {7102#true} is VALID [2022-04-15 11:32:46,739 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-15 11:32:46,739 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-15 11:32:46,739 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-15 11:32:46,739 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-15 11:32:46,739 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-15 11:32:46,740 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-15 11:32:46,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {7102#true} assume !false; {7102#true} is VALID [2022-04-15 11:32:46,740 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-15 11:32:46,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {7102#true} assume 12292 == #t~mem49;havoc #t~mem49; {7102#true} is VALID [2022-04-15 11:32:46,740 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-15 11:32:46,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {7102#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7102#true} is VALID [2022-04-15 11:32:46,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {7102#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7102#true} is VALID [2022-04-15 11:32:46,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {7102#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7102#true} is VALID [2022-04-15 11:32:46,740 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-15 11:32:46,740 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-15 11:32:46,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {7102#true} assume !(0 == ~tmp___4~0); {7102#true} is VALID [2022-04-15 11:32:46,741 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-15 11:32:46,741 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-15 11:32:46,741 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-15 11:32:46,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {7102#true} ~skip~0 := 0; {7102#true} is VALID [2022-04-15 11:32:46,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {7102#true} assume !false; {7102#true} is VALID [2022-04-15 11:32:46,741 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-15 11:32:46,741 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-15 11:32:46,741 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-15 11:32:46,741 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-15 11:32:46,741 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-15 11:32:46,741 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-15 11:32:46,742 INFO L290 TraceCheckUtils]: 32: Hoare triple {7102#true} assume 4368 == #t~mem54;havoc #t~mem54; {7102#true} is VALID [2022-04-15 11:32:46,742 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-15 11:32:46,742 INFO L290 TraceCheckUtils]: 34: Hoare triple {7102#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7102#true} is VALID [2022-04-15 11:32:46,743 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-15 11:32:46,743 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-15 11:32:46,744 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-15 11:32:46,744 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-15 11:32:46,744 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-15 11:32:46,745 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-15 11:32:46,745 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-15 11:32:46,745 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-15 11:32:46,746 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-15 11:32:46,746 INFO L290 TraceCheckUtils]: 44: Hoare triple {7103#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7103#false} is VALID [2022-04-15 11:32:46,746 INFO L290 TraceCheckUtils]: 45: Hoare triple {7103#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7103#false} is VALID [2022-04-15 11:32:46,746 INFO L290 TraceCheckUtils]: 46: Hoare triple {7103#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7103#false} is VALID [2022-04-15 11:32:46,746 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-15 11:32:46,746 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-15 11:32:46,746 INFO L290 TraceCheckUtils]: 49: Hoare triple {7103#false} assume !(0 == ~tmp___4~0); {7103#false} is VALID [2022-04-15 11:32:46,746 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-15 11:32:46,746 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-15 11:32:46,746 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-15 11:32:46,746 INFO L290 TraceCheckUtils]: 53: Hoare triple {7103#false} ~skip~0 := 0; {7103#false} is VALID [2022-04-15 11:32:46,747 INFO L290 TraceCheckUtils]: 54: Hoare triple {7103#false} assume !false; {7103#false} is VALID [2022-04-15 11:32:46,747 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-15 11:32:46,747 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-15 11:32:46,747 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-15 11:32:46,747 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-15 11:32:46,747 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-15 11:32:46,747 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-15 11:32:46,747 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-15 11:32:46,747 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-15 11:32:46,747 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-15 11:32:46,747 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-15 11:32:46,747 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-15 11:32:46,748 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-15 11:32:46,748 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-15 11:32:46,748 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-15 11:32:46,748 INFO L290 TraceCheckUtils]: 69: Hoare triple {7103#false} assume 4432 == #t~mem62;havoc #t~mem62; {7103#false} is VALID [2022-04-15 11:32:46,748 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-15 11:32:46,748 INFO L290 TraceCheckUtils]: 71: Hoare triple {7103#false} assume 5 == ~blastFlag~0; {7103#false} is VALID [2022-04-15 11:32:46,748 INFO L290 TraceCheckUtils]: 72: Hoare triple {7103#false} assume !false; {7103#false} is VALID [2022-04-15 11:32:46,748 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:32:46,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:32:46,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738187386] [2022-04-15 11:32:46,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738187386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:46,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:46,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:32:46,749 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:32:46,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [718486229] [2022-04-15 11:32:46,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [718486229] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:46,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:46,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:32:46,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500090887] [2022-04-15 11:32:46,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:32:46,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-15 11:32:46,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:32:46,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:46,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:46,803 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:32:46,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:46,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:32:46,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:32:46,804 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-15 11:32:48,824 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:32:49,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:49,775 INFO L93 Difference]: Finished difference Result 665 states and 992 transitions. [2022-04-15 11:32:49,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:32:49,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-15 11:32:49,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:32:49,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:49,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 11:32:49,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:49,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 11:32:49,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-15 11:32:50,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:50,148 INFO L225 Difference]: With dead ends: 665 [2022-04-15 11:32:50,148 INFO L226 Difference]: Without dead ends: 420 [2022-04-15 11:32:50,148 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:32:50,151 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 119 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:32:50,151 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:32:50,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-04-15 11:32:50,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 263. [2022-04-15 11:32:50,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:32:50,164 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-15 11:32:50,164 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-15 11:32:50,165 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-15 11:32:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:50,172 INFO L93 Difference]: Finished difference Result 420 states and 623 transitions. [2022-04-15 11:32:50,172 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 623 transitions. [2022-04-15 11:32:50,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:50,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:50,173 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-15 11:32:50,174 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-15 11:32:50,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:50,181 INFO L93 Difference]: Finished difference Result 420 states and 623 transitions. [2022-04-15 11:32:50,181 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 623 transitions. [2022-04-15 11:32:50,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:50,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:50,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:32:50,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:32:50,182 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-15 11:32:50,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 387 transitions. [2022-04-15 11:32:50,186 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 387 transitions. Word has length 73 [2022-04-15 11:32:50,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:32:50,187 INFO L478 AbstractCegarLoop]: Abstraction has 263 states and 387 transitions. [2022-04-15 11:32:50,187 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:50,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 263 states and 387 transitions. [2022-04-15 11:32:50,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:50,503 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 387 transitions. [2022-04-15 11:32:50,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 11:32:50,504 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:32:50,504 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:32:50,504 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:32:50,504 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:32:50,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:32:50,504 INFO L85 PathProgramCache]: Analyzing trace with hash -899406007, now seen corresponding path program 1 times [2022-04-15 11:32:50,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:50,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1707751365] [2022-04-15 11:33:02,103 WARN L232 SmtUtils]: Spent 10.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-15 11:33:13,750 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:33:13,750 INFO L85 PathProgramCache]: Analyzing trace with hash -899406007, now seen corresponding path program 2 times [2022-04-15 11:33:13,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:33:13,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100759741] [2022-04-15 11:33:13,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:33:13,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:33:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:13,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:33:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:13,973 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-15 11:33:13,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {9810#true} assume true; {9810#true} is VALID [2022-04-15 11:33:13,973 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9810#true} {9810#true} #593#return; {9810#true} is VALID [2022-04-15 11:33:13,974 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-15 11:33:13,974 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-15 11:33:13,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {9810#true} assume true; {9810#true} is VALID [2022-04-15 11:33:13,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9810#true} {9810#true} #593#return; {9810#true} is VALID [2022-04-15 11:33:13,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {9810#true} call #t~ret158 := main(); {9810#true} is VALID [2022-04-15 11:33:13,975 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-15 11:33:13,976 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-15 11:33:13,976 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-15 11:33:13,976 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-15 11:33:13,976 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-15 11:33:13,976 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-15 11:33:13,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {9810#true} assume !false; {9810#true} is VALID [2022-04-15 11:33:13,976 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-15 11:33:13,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {9810#true} assume 12292 == #t~mem49;havoc #t~mem49; {9810#true} is VALID [2022-04-15 11:33:13,976 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-15 11:33:13,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {9810#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9810#true} is VALID [2022-04-15 11:33:13,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {9810#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9810#true} is VALID [2022-04-15 11:33:13,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {9810#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9810#true} is VALID [2022-04-15 11:33:13,977 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-15 11:33:13,977 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-15 11:33:13,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {9810#true} assume !(0 == ~tmp___4~0); {9810#true} is VALID [2022-04-15 11:33:13,977 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-15 11:33:13,977 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-15 11:33:13,977 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-15 11:33:13,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {9810#true} ~skip~0 := 0; {9810#true} is VALID [2022-04-15 11:33:13,977 INFO L290 TraceCheckUtils]: 25: Hoare triple {9810#true} assume !false; {9810#true} is VALID [2022-04-15 11:33:13,977 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-15 11:33:13,977 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-15 11:33:13,977 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-15 11:33:13,977 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-15 11:33:13,978 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-15 11:33:13,978 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-15 11:33:13,978 INFO L290 TraceCheckUtils]: 32: Hoare triple {9810#true} assume 4368 == #t~mem54;havoc #t~mem54; {9810#true} is VALID [2022-04-15 11:33:13,978 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-15 11:33:13,978 INFO L290 TraceCheckUtils]: 34: Hoare triple {9810#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9810#true} is VALID [2022-04-15 11:33:13,979 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-15 11:33:13,979 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-15 11:33:13,980 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-15 11:33:13,980 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-15 11:33:13,980 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-15 11:33:13,981 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-15 11:33:13,981 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-15 11:33:13,981 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-15 11:33:13,982 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-15 11:33:13,982 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-15 11:33:13,982 INFO L290 TraceCheckUtils]: 45: Hoare triple {9811#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9811#false} is VALID [2022-04-15 11:33:13,982 INFO L290 TraceCheckUtils]: 46: Hoare triple {9811#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9811#false} is VALID [2022-04-15 11:33:13,982 INFO L290 TraceCheckUtils]: 47: Hoare triple {9811#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9811#false} is VALID [2022-04-15 11:33:13,982 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-15 11:33:13,982 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-15 11:33:13,983 INFO L290 TraceCheckUtils]: 50: Hoare triple {9811#false} assume !(0 == ~tmp___4~0); {9811#false} is VALID [2022-04-15 11:33:13,983 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-15 11:33:13,983 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-15 11:33:13,983 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-15 11:33:13,983 INFO L290 TraceCheckUtils]: 54: Hoare triple {9811#false} ~skip~0 := 0; {9811#false} is VALID [2022-04-15 11:33:13,983 INFO L290 TraceCheckUtils]: 55: Hoare triple {9811#false} assume !false; {9811#false} is VALID [2022-04-15 11:33:13,983 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-15 11:33:13,983 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-15 11:33:13,983 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-15 11:33:13,983 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-15 11:33:13,983 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-15 11:33:13,983 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-15 11:33:13,984 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-15 11:33:13,984 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-15 11:33:13,984 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-15 11:33:13,984 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-15 11:33:13,984 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-15 11:33:13,984 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-15 11:33:13,984 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-15 11:33:13,984 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-15 11:33:13,985 INFO L290 TraceCheckUtils]: 70: Hoare triple {9811#false} assume 4432 == #t~mem62;havoc #t~mem62; {9811#false} is VALID [2022-04-15 11:33:13,987 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-15 11:33:13,987 INFO L290 TraceCheckUtils]: 72: Hoare triple {9811#false} assume 5 == ~blastFlag~0; {9811#false} is VALID [2022-04-15 11:33:13,988 INFO L290 TraceCheckUtils]: 73: Hoare triple {9811#false} assume !false; {9811#false} is VALID [2022-04-15 11:33:13,988 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:33:13,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:33:13,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100759741] [2022-04-15 11:33:13,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100759741] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:13,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:13,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:33:13,989 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:33:13,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1707751365] [2022-04-15 11:33:13,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1707751365] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:13,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:13,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:33:13,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89109169] [2022-04-15 11:33:13,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:33:13,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-15 11:33:13,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:33:13,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:14,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:14,042 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:33:14,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:14,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:33:14,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:33:14,043 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-15 11:33:16,070 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:17,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:17,067 INFO L93 Difference]: Finished difference Result 415 states and 613 transitions. [2022-04-15 11:33:17,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:33:17,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-15 11:33:17,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:33:17,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:17,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-15 11:33:17,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:17,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-15 11:33:17,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 384 transitions. [2022-04-15 11:33:17,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 384 edges. 384 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:17,341 INFO L225 Difference]: With dead ends: 415 [2022-04-15 11:33:17,341 INFO L226 Difference]: Without dead ends: 280 [2022-04-15 11:33:17,341 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:33:17,342 INFO L913 BasicCegarLoop]: 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-15 11:33:17,342 INFO L914 BasicCegarLoop]: 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-15 11:33:17,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-15 11:33:17,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 263. [2022-04-15 11:33:17,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:33:17,350 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-15 11:33:17,350 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-15 11:33:17,351 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-15 11:33:17,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:17,355 INFO L93 Difference]: Finished difference Result 280 states and 409 transitions. [2022-04-15 11:33:17,355 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 409 transitions. [2022-04-15 11:33:17,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:17,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:17,356 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-15 11:33:17,356 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-15 11:33:17,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:17,361 INFO L93 Difference]: Finished difference Result 280 states and 409 transitions. [2022-04-15 11:33:17,361 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 409 transitions. [2022-04-15 11:33:17,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:17,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:17,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:33:17,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:33:17,362 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-15 11:33:17,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 386 transitions. [2022-04-15 11:33:17,366 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 386 transitions. Word has length 74 [2022-04-15 11:33:17,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:33:17,366 INFO L478 AbstractCegarLoop]: Abstraction has 263 states and 386 transitions. [2022-04-15 11:33:17,366 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:17,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 263 states and 386 transitions. [2022-04-15 11:33:17,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 386 edges. 386 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:17,649 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 386 transitions. [2022-04-15 11:33:17,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 11:33:17,650 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:33:17,650 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:33:17,650 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:33:17,651 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:33:17,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:33:17,651 INFO L85 PathProgramCache]: Analyzing trace with hash -2000808735, now seen corresponding path program 1 times [2022-04-15 11:33:17,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:17,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1396628082] [2022-04-15 11:33:35,406 WARN L232 SmtUtils]: Spent 12.68s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 11:33:41,557 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:33:41,558 INFO L85 PathProgramCache]: Analyzing trace with hash -2000808735, now seen corresponding path program 2 times [2022-04-15 11:33:41,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:33:41,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522082512] [2022-04-15 11:33:41,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:33:41,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:33:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:41,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:33:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:41,701 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-15 11:33:41,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {11738#true} assume true; {11738#true} is VALID [2022-04-15 11:33:41,702 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11738#true} {11738#true} #593#return; {11738#true} is VALID [2022-04-15 11:33:41,702 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-15 11:33:41,703 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-15 11:33:41,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {11738#true} assume true; {11738#true} is VALID [2022-04-15 11:33:41,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11738#true} {11738#true} #593#return; {11738#true} is VALID [2022-04-15 11:33:41,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {11738#true} call #t~ret158 := main(); {11738#true} is VALID [2022-04-15 11:33:41,703 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-15 11:33:41,703 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-15 11:33:41,703 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-15 11:33:41,703 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-15 11:33:41,703 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-15 11:33:41,703 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-15 11:33:41,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {11738#true} assume !false; {11738#true} is VALID [2022-04-15 11:33:41,703 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-15 11:33:41,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {11738#true} assume 12292 == #t~mem49;havoc #t~mem49; {11738#true} is VALID [2022-04-15 11:33:41,704 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-15 11:33:41,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {11738#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11738#true} is VALID [2022-04-15 11:33:41,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {11738#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11738#true} is VALID [2022-04-15 11:33:41,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {11738#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11738#true} is VALID [2022-04-15 11:33:41,704 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-15 11:33:41,704 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-15 11:33:41,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {11738#true} assume !(0 == ~tmp___4~0); {11738#true} is VALID [2022-04-15 11:33:41,704 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-15 11:33:41,704 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-15 11:33:41,704 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-15 11:33:41,704 INFO L290 TraceCheckUtils]: 24: Hoare triple {11738#true} ~skip~0 := 0; {11738#true} is VALID [2022-04-15 11:33:41,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {11738#true} assume !false; {11738#true} is VALID [2022-04-15 11:33:41,705 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-15 11:33:41,705 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-15 11:33:41,705 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-15 11:33:41,705 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-15 11:33:41,705 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-15 11:33:41,705 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-15 11:33:41,705 INFO L290 TraceCheckUtils]: 32: Hoare triple {11738#true} assume 4368 == #t~mem54;havoc #t~mem54; {11738#true} is VALID [2022-04-15 11:33:41,705 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-15 11:33:41,705 INFO L290 TraceCheckUtils]: 34: Hoare triple {11738#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11738#true} is VALID [2022-04-15 11:33:41,706 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-15 11:33:41,707 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-15 11:33:41,707 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-15 11:33:41,707 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-15 11:33:41,708 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-15 11:33:41,708 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-15 11:33:41,708 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-15 11:33:41,709 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-15 11:33:41,709 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-15 11:33:41,709 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-15 11:33:41,710 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-15 11:33:41,710 INFO L290 TraceCheckUtils]: 46: Hoare triple {11739#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11739#false} is VALID [2022-04-15 11:33:41,711 INFO L290 TraceCheckUtils]: 47: Hoare triple {11739#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11739#false} is VALID [2022-04-15 11:33:41,711 INFO L290 TraceCheckUtils]: 48: Hoare triple {11739#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11739#false} is VALID [2022-04-15 11:33:41,711 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-15 11:33:41,711 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-15 11:33:41,711 INFO L290 TraceCheckUtils]: 51: Hoare triple {11739#false} assume !(0 == ~tmp___4~0); {11739#false} is VALID [2022-04-15 11:33:41,711 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-15 11:33:41,711 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-15 11:33:41,711 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-15 11:33:41,711 INFO L290 TraceCheckUtils]: 55: Hoare triple {11739#false} ~skip~0 := 0; {11739#false} is VALID [2022-04-15 11:33:41,712 INFO L290 TraceCheckUtils]: 56: Hoare triple {11739#false} assume !false; {11739#false} is VALID [2022-04-15 11:33:41,712 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-15 11:33:41,712 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-15 11:33:41,712 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-15 11:33:41,712 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-15 11:33:41,712 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-15 11:33:41,712 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-15 11:33:41,712 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-15 11:33:41,712 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-15 11:33:41,712 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-15 11:33:41,712 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-15 11:33:41,713 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-15 11:33:41,713 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-15 11:33:41,713 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-15 11:33:41,713 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-15 11:33:41,713 INFO L290 TraceCheckUtils]: 71: Hoare triple {11739#false} assume 4432 == #t~mem62;havoc #t~mem62; {11739#false} is VALID [2022-04-15 11:33:41,713 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-15 11:33:41,713 INFO L290 TraceCheckUtils]: 73: Hoare triple {11739#false} assume 5 == ~blastFlag~0; {11739#false} is VALID [2022-04-15 11:33:41,713 INFO L290 TraceCheckUtils]: 74: Hoare triple {11739#false} assume !false; {11739#false} is VALID [2022-04-15 11:33:41,714 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:33:41,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:33:41,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522082512] [2022-04-15 11:33:41,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522082512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:41,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:41,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:33:41,714 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:33:41,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1396628082] [2022-04-15 11:33:41,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1396628082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:41,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:41,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:33:41,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735799933] [2022-04-15 11:33:41,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:33:41,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-15 11:33:41,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:33:41,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:41,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:41,769 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:33:41,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:41,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:33:41,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:33:41,770 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-15 11:33:43,791 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:44,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:44,656 INFO L93 Difference]: Finished difference Result 415 states and 611 transitions. [2022-04-15 11:33:44,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:33:44,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-15 11:33:44,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:33:44,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:44,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2022-04-15 11:33:44,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:44,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2022-04-15 11:33:44,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 383 transitions. [2022-04-15 11:33:44,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 383 edges. 383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:44,930 INFO L225 Difference]: With dead ends: 415 [2022-04-15 11:33:44,930 INFO L226 Difference]: Without dead ends: 280 [2022-04-15 11:33:44,930 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:33:44,931 INFO L913 BasicCegarLoop]: 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-15 11:33:44,931 INFO L914 BasicCegarLoop]: 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-15 11:33:44,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-15 11:33:44,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 263. [2022-04-15 11:33:44,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:33:44,939 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-15 11:33:44,940 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-15 11:33:44,940 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-15 11:33:44,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:44,944 INFO L93 Difference]: Finished difference Result 280 states and 408 transitions. [2022-04-15 11:33:44,944 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 408 transitions. [2022-04-15 11:33:44,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:44,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:44,945 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-15 11:33:44,946 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-15 11:33:44,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:44,963 INFO L93 Difference]: Finished difference Result 280 states and 408 transitions. [2022-04-15 11:33:44,963 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 408 transitions. [2022-04-15 11:33:44,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:44,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:44,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:33:44,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:33:44,964 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-15 11:33:44,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 385 transitions. [2022-04-15 11:33:44,968 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 385 transitions. Word has length 75 [2022-04-15 11:33:44,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:33:44,969 INFO L478 AbstractCegarLoop]: Abstraction has 263 states and 385 transitions. [2022-04-15 11:33:44,969 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:44,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 263 states and 385 transitions. [2022-04-15 11:33:45,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 385 edges. 385 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:45,265 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 385 transitions. [2022-04-15 11:33:45,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-15 11:33:45,265 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:33:45,265 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:33:45,265 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:33:45,266 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:33:45,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:33:45,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1727974300, now seen corresponding path program 1 times [2022-04-15 11:33:45,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:45,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [642893388] [2022-04-15 11:34:02,939 WARN L232 SmtUtils]: Spent 12.04s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 11:34:11,393 WARN L232 SmtUtils]: Spent 5.15s 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-15 11:34:11,398 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:11,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1727974300, now seen corresponding path program 2 times [2022-04-15 11:34:11,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:11,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637034883] [2022-04-15 11:34:11,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:11,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:11,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:11,637 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-15 11:34:11,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {13666#true} assume true; {13666#true} is VALID [2022-04-15 11:34:11,637 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13666#true} {13666#true} #593#return; {13666#true} is VALID [2022-04-15 11:34:11,638 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-15 11:34:11,638 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-15 11:34:11,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {13666#true} assume true; {13666#true} is VALID [2022-04-15 11:34:11,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13666#true} {13666#true} #593#return; {13666#true} is VALID [2022-04-15 11:34:11,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {13666#true} call #t~ret158 := main(); {13666#true} is VALID [2022-04-15 11:34:11,638 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-15 11:34:11,638 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-15 11:34:11,638 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-15 11:34:11,638 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-15 11:34:11,638 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-15 11:34:11,638 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-15 11:34:11,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {13666#true} assume !false; {13666#true} is VALID [2022-04-15 11:34:11,639 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-15 11:34:11,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {13666#true} assume 12292 == #t~mem49;havoc #t~mem49; {13666#true} is VALID [2022-04-15 11:34:11,639 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-15 11:34:11,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {13666#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13666#true} is VALID [2022-04-15 11:34:11,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {13666#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13666#true} is VALID [2022-04-15 11:34:11,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {13666#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {13666#true} is VALID [2022-04-15 11:34:11,639 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-15 11:34:11,639 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-15 11:34:11,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {13666#true} assume !(0 == ~tmp___4~0); {13666#true} is VALID [2022-04-15 11:34:11,639 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-15 11:34:11,639 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-15 11:34:11,639 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-15 11:34:11,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {13666#true} ~skip~0 := 0; {13666#true} is VALID [2022-04-15 11:34:11,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {13666#true} assume !false; {13666#true} is VALID [2022-04-15 11:34:11,640 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-15 11:34:11,640 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-15 11:34:11,640 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-15 11:34:11,640 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-15 11:34:11,640 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-15 11:34:11,640 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-15 11:34:11,640 INFO L290 TraceCheckUtils]: 32: Hoare triple {13666#true} assume 4368 == #t~mem54;havoc #t~mem54; {13666#true} is VALID [2022-04-15 11:34:11,640 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-15 11:34:11,640 INFO L290 TraceCheckUtils]: 34: Hoare triple {13666#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {13666#true} is VALID [2022-04-15 11:34:11,641 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-15 11:34:11,642 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-15 11:34:11,642 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-15 11:34:11,642 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-15 11:34:11,643 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-15 11:34:11,643 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-15 11:34:11,643 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-15 11:34:11,644 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-15 11:34:11,644 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-15 11:34:11,645 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-15 11:34:11,645 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-15 11:34:11,645 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-15 11:34:11,645 INFO L290 TraceCheckUtils]: 47: Hoare triple {13667#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13667#false} is VALID [2022-04-15 11:34:11,645 INFO L290 TraceCheckUtils]: 48: Hoare triple {13667#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13667#false} is VALID [2022-04-15 11:34:11,645 INFO L290 TraceCheckUtils]: 49: Hoare triple {13667#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {13667#false} is VALID [2022-04-15 11:34:11,646 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-15 11:34:11,646 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-15 11:34:11,646 INFO L290 TraceCheckUtils]: 52: Hoare triple {13667#false} assume !(0 == ~tmp___4~0); {13667#false} is VALID [2022-04-15 11:34:11,646 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-15 11:34:11,646 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-15 11:34:11,646 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-15 11:34:11,646 INFO L290 TraceCheckUtils]: 56: Hoare triple {13667#false} ~skip~0 := 0; {13667#false} is VALID [2022-04-15 11:34:11,646 INFO L290 TraceCheckUtils]: 57: Hoare triple {13667#false} assume !false; {13667#false} is VALID [2022-04-15 11:34:11,646 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-15 11:34:11,646 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-15 11:34:11,646 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-15 11:34:11,646 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-15 11:34:11,646 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-15 11:34:11,647 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-15 11:34:11,647 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-15 11:34:11,647 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-15 11:34:11,647 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-15 11:34:11,647 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-15 11:34:11,647 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-15 11:34:11,647 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-15 11:34:11,647 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-15 11:34:11,647 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-15 11:34:11,647 INFO L290 TraceCheckUtils]: 72: Hoare triple {13667#false} assume 4432 == #t~mem62;havoc #t~mem62; {13667#false} is VALID [2022-04-15 11:34:11,647 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-15 11:34:11,647 INFO L290 TraceCheckUtils]: 74: Hoare triple {13667#false} assume 5 == ~blastFlag~0; {13667#false} is VALID [2022-04-15 11:34:11,647 INFO L290 TraceCheckUtils]: 75: Hoare triple {13667#false} assume !false; {13667#false} is VALID [2022-04-15 11:34:11,648 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:34:11,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:11,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637034883] [2022-04-15 11:34:11,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637034883] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:11,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:11,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:11,648 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:11,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [642893388] [2022-04-15 11:34:11,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [642893388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:11,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:11,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:11,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596173521] [2022-04-15 11:34:11,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:11,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-15 11:34:11,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:11,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:11,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:11,703 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:34:11,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:11,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:34:11,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:34:11,704 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-15 11:34:13,724 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:14,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:14,542 INFO L93 Difference]: Finished difference Result 406 states and 598 transitions. [2022-04-15 11:34:14,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:34:14,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-15 11:34:14,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:14,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:14,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 371 transitions. [2022-04-15 11:34:14,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:14,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 371 transitions. [2022-04-15 11:34:14,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 371 transitions. [2022-04-15 11:34:14,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 371 edges. 371 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:14,805 INFO L225 Difference]: With dead ends: 406 [2022-04-15 11:34:14,805 INFO L226 Difference]: Without dead ends: 271 [2022-04-15 11:34:14,805 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:34:14,805 INFO L913 BasicCegarLoop]: 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-15 11:34:14,806 INFO L914 BasicCegarLoop]: 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-15 11:34:14,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-04-15 11:34:14,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 263. [2022-04-15 11:34:14,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:14,813 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-15 11:34:14,819 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-15 11:34:14,821 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-15 11:34:14,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:14,825 INFO L93 Difference]: Finished difference Result 271 states and 396 transitions. [2022-04-15 11:34:14,825 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 396 transitions. [2022-04-15 11:34:14,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:14,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:14,826 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-15 11:34:14,826 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-15 11:34:14,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:14,830 INFO L93 Difference]: Finished difference Result 271 states and 396 transitions. [2022-04-15 11:34:14,830 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 396 transitions. [2022-04-15 11:34:14,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:14,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:14,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:14,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:14,831 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-15 11:34:14,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 384 transitions. [2022-04-15 11:34:14,835 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 384 transitions. Word has length 76 [2022-04-15 11:34:14,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:14,835 INFO L478 AbstractCegarLoop]: Abstraction has 263 states and 384 transitions. [2022-04-15 11:34:14,835 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:14,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 263 states and 384 transitions. [2022-04-15 11:34:15,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 384 edges. 384 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:15,129 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 384 transitions. [2022-04-15 11:34:15,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 11:34:15,130 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:15,130 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:34:15,130 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:34:15,130 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:15,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:15,131 INFO L85 PathProgramCache]: Analyzing trace with hash -988156823, now seen corresponding path program 1 times [2022-04-15 11:34:15,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:15,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1909248678] [2022-04-15 11:34:15,133 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:15,133 INFO L85 PathProgramCache]: Analyzing trace with hash -988156823, now seen corresponding path program 2 times [2022-04-15 11:34:15,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:15,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742617024] [2022-04-15 11:34:15,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:15,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:15,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:15,316 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-15 11:34:15,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {15558#true} assume true; {15558#true} is VALID [2022-04-15 11:34:15,317 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15558#true} {15558#true} #593#return; {15558#true} is VALID [2022-04-15 11:34:15,317 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-15 11:34:15,317 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-15 11:34:15,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {15558#true} assume true; {15558#true} is VALID [2022-04-15 11:34:15,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15558#true} {15558#true} #593#return; {15558#true} is VALID [2022-04-15 11:34:15,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {15558#true} call #t~ret158 := main(); {15558#true} is VALID [2022-04-15 11:34:15,318 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-15 11:34:15,318 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-15 11:34:15,318 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-15 11:34:15,318 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-15 11:34:15,318 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-15 11:34:15,318 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-15 11:34:15,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {15558#true} assume !false; {15558#true} is VALID [2022-04-15 11:34:15,318 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-15 11:34:15,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {15558#true} assume 12292 == #t~mem49;havoc #t~mem49; {15558#true} is VALID [2022-04-15 11:34:15,318 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-15 11:34:15,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {15558#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {15558#true} is VALID [2022-04-15 11:34:15,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {15558#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15558#true} is VALID [2022-04-15 11:34:15,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {15558#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {15558#true} is VALID [2022-04-15 11:34:15,319 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-15 11:34:15,319 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-15 11:34:15,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {15558#true} assume !(0 == ~tmp___4~0); {15558#true} is VALID [2022-04-15 11:34:15,319 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-15 11:34:15,319 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-15 11:34:15,319 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-15 11:34:15,319 INFO L290 TraceCheckUtils]: 24: Hoare triple {15558#true} ~skip~0 := 0; {15558#true} is VALID [2022-04-15 11:34:15,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {15558#true} assume !false; {15558#true} is VALID [2022-04-15 11:34:15,319 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-15 11:34:15,319 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-15 11:34:15,319 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-15 11:34:15,319 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-15 11:34:15,319 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-15 11:34:15,319 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-15 11:34:15,320 INFO L290 TraceCheckUtils]: 32: Hoare triple {15558#true} assume 4368 == #t~mem54;havoc #t~mem54; {15558#true} is VALID [2022-04-15 11:34:15,320 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-15 11:34:15,320 INFO L290 TraceCheckUtils]: 34: Hoare triple {15558#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15558#true} is VALID [2022-04-15 11:34:15,320 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-15 11:34:15,320 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-15 11:34:15,320 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-15 11:34:15,320 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-15 11:34:15,320 INFO L290 TraceCheckUtils]: 39: Hoare triple {15558#true} ~skip~0 := 0; {15558#true} is VALID [2022-04-15 11:34:15,320 INFO L290 TraceCheckUtils]: 40: Hoare triple {15558#true} assume !false; {15558#true} is VALID [2022-04-15 11:34:15,320 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-15 11:34:15,320 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-15 11:34:15,320 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-15 11:34:15,320 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-15 11:34:15,320 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-15 11:34:15,320 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-15 11:34:15,321 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-15 11:34:15,321 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-15 11:34:15,321 INFO L290 TraceCheckUtils]: 49: Hoare triple {15558#true} assume 4384 == #t~mem56;havoc #t~mem56; {15558#true} is VALID [2022-04-15 11:34:15,321 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-15 11:34:15,321 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-15 11:34:15,321 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-15 11:34:15,322 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-15 11:34:15,322 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-15 11:34:15,322 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-15 11:34:15,322 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-15 11:34:15,322 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-15 11:34:15,323 INFO L290 TraceCheckUtils]: 58: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:15,323 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-15 11:34:15,323 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-15 11:34:15,323 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-15 11:34:15,324 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-15 11:34:15,324 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-15 11:34:15,324 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-15 11:34:15,324 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-15 11:34:15,325 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-15 11:34:15,326 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-15 11:34:15,326 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-15 11:34:15,326 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-15 11:34:15,326 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-15 11:34:15,326 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-15 11:34:15,327 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-15 11:34:15,327 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-15 11:34:15,327 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-15 11:34:15,327 INFO L290 TraceCheckUtils]: 75: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {15559#false} is VALID [2022-04-15 11:34:15,327 INFO L290 TraceCheckUtils]: 76: Hoare triple {15559#false} assume !false; {15559#false} is VALID [2022-04-15 11:34:15,328 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-15 11:34:15,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:15,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742617024] [2022-04-15 11:34:15,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742617024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:15,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:15,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:15,328 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:15,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1909248678] [2022-04-15 11:34:15,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1909248678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:15,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:15,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:15,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869244827] [2022-04-15 11:34:15,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:15,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-15 11:34:15,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:15,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:15,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:15,378 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:34:15,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:15,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:34:15,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:15,378 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-15 11:34:17,393 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:18,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:18,289 INFO L93 Difference]: Finished difference Result 530 states and 782 transitions. [2022-04-15 11:34:18,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:34:18,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-15 11:34:18,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:18,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:18,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-15 11:34:18,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:18,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-15 11:34:18,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 489 transitions. [2022-04-15 11:34:18,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:18,615 INFO L225 Difference]: With dead ends: 530 [2022-04-15 11:34:18,615 INFO L226 Difference]: Without dead ends: 395 [2022-04-15 11:34:18,615 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:18,615 INFO L913 BasicCegarLoop]: 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-15 11:34:18,616 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 477 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 339 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:34:18,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-04-15 11:34:18,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2022-04-15 11:34:18,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:18,625 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-15 11:34:18,626 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-15 11:34:18,626 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-15 11:34:18,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:18,633 INFO L93 Difference]: Finished difference Result 395 states and 576 transitions. [2022-04-15 11:34:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 576 transitions. [2022-04-15 11:34:18,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:18,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:18,634 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-15 11:34:18,634 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-15 11:34:18,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:18,641 INFO L93 Difference]: Finished difference Result 395 states and 576 transitions. [2022-04-15 11:34:18,641 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 576 transitions. [2022-04-15 11:34:18,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:18,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:18,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:18,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:18,642 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-15 11:34:18,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 576 transitions. [2022-04-15 11:34:18,650 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 576 transitions. Word has length 77 [2022-04-15 11:34:18,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:18,650 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 576 transitions. [2022-04-15 11:34:18,650 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:18,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 395 states and 576 transitions. [2022-04-15 11:34:19,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 576 edges. 576 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:19,081 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 576 transitions. [2022-04-15 11:34:19,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 11:34:19,082 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:19,082 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:34:19,082 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:34:19,082 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:19,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:19,083 INFO L85 PathProgramCache]: Analyzing trace with hash -926117209, now seen corresponding path program 1 times [2022-04-15 11:34:19,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:19,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2132949838] [2022-04-15 11:34:19,083 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:19,083 INFO L85 PathProgramCache]: Analyzing trace with hash -926117209, now seen corresponding path program 2 times [2022-04-15 11:34:19,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:19,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878585035] [2022-04-15 11:34:19,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:19,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:19,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:19,277 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-15 11:34:19,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {18207#true} assume true; {18207#true} is VALID [2022-04-15 11:34:19,277 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18207#true} {18207#true} #593#return; {18207#true} is VALID [2022-04-15 11:34:19,278 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-15 11:34:19,278 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-15 11:34:19,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {18207#true} assume true; {18207#true} is VALID [2022-04-15 11:34:19,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18207#true} {18207#true} #593#return; {18207#true} is VALID [2022-04-15 11:34:19,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {18207#true} call #t~ret158 := main(); {18207#true} is VALID [2022-04-15 11:34:19,278 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-15 11:34:19,278 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-15 11:34:19,278 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-15 11:34:19,278 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-15 11:34:19,278 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-15 11:34:19,278 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-15 11:34:19,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {18207#true} assume !false; {18207#true} is VALID [2022-04-15 11:34:19,279 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-15 11:34:19,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {18207#true} assume 12292 == #t~mem49;havoc #t~mem49; {18207#true} is VALID [2022-04-15 11:34:19,279 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-15 11:34:19,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {18207#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {18207#true} is VALID [2022-04-15 11:34:19,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {18207#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {18207#true} is VALID [2022-04-15 11:34:19,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {18207#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {18207#true} is VALID [2022-04-15 11:34:19,279 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-15 11:34:19,279 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-15 11:34:19,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {18207#true} assume !(0 == ~tmp___4~0); {18207#true} is VALID [2022-04-15 11:34:19,279 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-15 11:34:19,279 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-15 11:34:19,279 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-15 11:34:19,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {18207#true} ~skip~0 := 0; {18207#true} is VALID [2022-04-15 11:34:19,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {18207#true} assume !false; {18207#true} is VALID [2022-04-15 11:34:19,280 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-15 11:34:19,280 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-15 11:34:19,280 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-15 11:34:19,280 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-15 11:34:19,280 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-15 11:34:19,280 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-15 11:34:19,280 INFO L290 TraceCheckUtils]: 32: Hoare triple {18207#true} assume 4368 == #t~mem54;havoc #t~mem54; {18207#true} is VALID [2022-04-15 11:34:19,280 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-15 11:34:19,280 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-15 11:34:19,281 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-15 11:34:19,281 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-15 11:34:19,281 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-15 11:34:19,281 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-15 11:34:19,282 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-15 11:34:19,282 INFO L290 TraceCheckUtils]: 40: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} assume !false; {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:34:19,282 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-15 11:34:19,282 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-15 11:34:19,283 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-15 11:34:19,283 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-15 11:34:19,283 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-15 11:34:19,283 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-15 11:34:19,284 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-15 11:34:19,284 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-15 11:34:19,284 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-15 11:34:19,284 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-15 11:34:19,285 INFO L290 TraceCheckUtils]: 51: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {18208#false} is VALID [2022-04-15 11:34:19,285 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-15 11:34:19,285 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-15 11:34:19,285 INFO L290 TraceCheckUtils]: 54: Hoare triple {18208#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {18208#false} is VALID [2022-04-15 11:34:19,285 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-15 11:34:19,285 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-15 11:34:19,285 INFO L290 TraceCheckUtils]: 57: Hoare triple {18208#false} ~skip~0 := 0; {18208#false} is VALID [2022-04-15 11:34:19,285 INFO L290 TraceCheckUtils]: 58: Hoare triple {18208#false} assume !false; {18208#false} is VALID [2022-04-15 11:34:19,285 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-15 11:34:19,285 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-15 11:34:19,285 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-15 11:34:19,285 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-15 11:34:19,285 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-15 11:34:19,285 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-15 11:34:19,285 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-15 11:34:19,286 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-15 11:34:19,286 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-15 11:34:19,286 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-15 11:34:19,286 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-15 11:34:19,286 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-15 11:34:19,286 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-15 11:34:19,286 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-15 11:34:19,286 INFO L290 TraceCheckUtils]: 73: Hoare triple {18208#false} assume 4432 == #t~mem62;havoc #t~mem62; {18208#false} is VALID [2022-04-15 11:34:19,286 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-15 11:34:19,286 INFO L290 TraceCheckUtils]: 75: Hoare triple {18208#false} assume 5 == ~blastFlag~0; {18208#false} is VALID [2022-04-15 11:34:19,286 INFO L290 TraceCheckUtils]: 76: Hoare triple {18208#false} assume !false; {18208#false} is VALID [2022-04-15 11:34:19,286 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:34:19,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:19,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878585035] [2022-04-15 11:34:19,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878585035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:19,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:19,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:19,287 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:19,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2132949838] [2022-04-15 11:34:19,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2132949838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:19,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:19,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:19,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769743098] [2022-04-15 11:34:19,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:19,288 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-15 11:34:19,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:19,288 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-15 11:34:19,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:19,356 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:34:19,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:19,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:34:19,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:19,356 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-15 11:34:21,378 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:21,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:21,920 INFO L93 Difference]: Finished difference Result 687 states and 1004 transitions. [2022-04-15 11:34:21,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:34:21,920 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-15 11:34:21,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:21,921 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-15 11:34:21,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2022-04-15 11:34:21,923 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-15 11:34:21,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2022-04-15 11:34:21,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 369 transitions. [2022-04-15 11:34:22,163 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-15 11:34:22,171 INFO L225 Difference]: With dead ends: 687 [2022-04-15 11:34:22,171 INFO L226 Difference]: Without dead ends: 420 [2022-04-15 11:34:22,172 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:22,172 INFO L913 BasicCegarLoop]: 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-15 11:34:22,173 INFO L914 BasicCegarLoop]: 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-15 11:34:22,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-04-15 11:34:22,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2022-04-15 11:34:22,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:22,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 420 states. Second operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:22,184 INFO L74 IsIncluded]: Start isIncluded. First operand 420 states. Second operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:22,184 INFO L87 Difference]: Start difference. First operand 420 states. Second operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:22,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:22,191 INFO L93 Difference]: Finished difference Result 420 states and 609 transitions. [2022-04-15 11:34:22,191 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 609 transitions. [2022-04-15 11:34:22,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:22,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:22,192 INFO L74 IsIncluded]: Start isIncluded. First operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 420 states. [2022-04-15 11:34:22,192 INFO L87 Difference]: Start difference. First operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 420 states. [2022-04-15 11:34:22,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:22,199 INFO L93 Difference]: Finished difference Result 420 states and 609 transitions. [2022-04-15 11:34:22,199 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 609 transitions. [2022-04-15 11:34:22,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:22,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:22,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:22,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:22,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:22,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 609 transitions. [2022-04-15 11:34:22,208 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 609 transitions. Word has length 77 [2022-04-15 11:34:22,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:22,208 INFO L478 AbstractCegarLoop]: Abstraction has 420 states and 609 transitions. [2022-04-15 11:34:22,208 INFO L479 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-15 11:34:22,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 420 states and 609 transitions. [2022-04-15 11:34:22,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 609 edges. 609 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 609 transitions. [2022-04-15 11:34:22,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-15 11:34:22,688 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:22,688 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:34:22,688 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:34:22,689 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:22,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:22,689 INFO L85 PathProgramCache]: Analyzing trace with hash 140608816, now seen corresponding path program 1 times [2022-04-15 11:34:22,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:22,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1248774346] [2022-04-15 11:34:22,689 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:22,690 INFO L85 PathProgramCache]: Analyzing trace with hash 140608816, now seen corresponding path program 2 times [2022-04-15 11:34:22,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:22,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277140496] [2022-04-15 11:34:22,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:22,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:22,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:22,819 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-15 11:34:22,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {21270#true} assume true; {21270#true} is VALID [2022-04-15 11:34:22,819 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21270#true} {21270#true} #593#return; {21270#true} is VALID [2022-04-15 11:34:22,820 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-15 11:34:22,820 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-15 11:34:22,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {21270#true} assume true; {21270#true} is VALID [2022-04-15 11:34:22,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21270#true} {21270#true} #593#return; {21270#true} is VALID [2022-04-15 11:34:22,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {21270#true} call #t~ret158 := main(); {21270#true} is VALID [2022-04-15 11:34:22,820 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-15 11:34:22,820 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-15 11:34:22,820 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-15 11:34:22,820 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-15 11:34:22,820 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-15 11:34:22,821 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-15 11:34:22,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {21270#true} assume !false; {21270#true} is VALID [2022-04-15 11:34:22,821 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-15 11:34:22,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {21270#true} assume 12292 == #t~mem49;havoc #t~mem49; {21270#true} is VALID [2022-04-15 11:34:22,821 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-15 11:34:22,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {21270#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:34:22,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {21270#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {21270#true} is VALID [2022-04-15 11:34:22,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {21270#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:34:22,821 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-15 11:34:22,821 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-15 11:34:22,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {21270#true} assume !(0 == ~tmp___4~0); {21270#true} is VALID [2022-04-15 11:34:22,821 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-15 11:34:22,821 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-15 11:34:22,821 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-15 11:34:22,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {21270#true} ~skip~0 := 0; {21270#true} is VALID [2022-04-15 11:34:22,822 INFO L290 TraceCheckUtils]: 25: Hoare triple {21270#true} assume !false; {21270#true} is VALID [2022-04-15 11:34:22,822 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-15 11:34:22,822 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-15 11:34:22,822 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-15 11:34:22,822 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-15 11:34:22,822 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-15 11:34:22,822 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-15 11:34:22,822 INFO L290 TraceCheckUtils]: 32: Hoare triple {21270#true} assume 4368 == #t~mem54;havoc #t~mem54; {21270#true} is VALID [2022-04-15 11:34:22,822 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-15 11:34:22,822 INFO L290 TraceCheckUtils]: 34: Hoare triple {21270#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21270#true} is VALID [2022-04-15 11:34:22,822 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-15 11:34:22,822 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-15 11:34:22,822 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-15 11:34:22,823 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-15 11:34:22,823 INFO L290 TraceCheckUtils]: 39: Hoare triple {21270#true} ~skip~0 := 0; {21270#true} is VALID [2022-04-15 11:34:22,823 INFO L290 TraceCheckUtils]: 40: Hoare triple {21270#true} assume !false; {21270#true} is VALID [2022-04-15 11:34:22,823 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-15 11:34:22,823 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-15 11:34:22,823 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-15 11:34:22,823 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-15 11:34:22,823 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-15 11:34:22,823 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-15 11:34:22,823 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-15 11:34:22,823 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-15 11:34:22,823 INFO L290 TraceCheckUtils]: 49: Hoare triple {21270#true} assume 4384 == #t~mem56;havoc #t~mem56; {21270#true} is VALID [2022-04-15 11:34:22,823 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-15 11:34:22,824 INFO L290 TraceCheckUtils]: 51: Hoare triple {21270#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {21270#true} is VALID [2022-04-15 11:34:22,824 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-15 11:34:22,824 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-15 11:34:22,824 INFO L290 TraceCheckUtils]: 54: Hoare triple {21270#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:34:22,824 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-15 11:34:22,824 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-15 11:34:22,824 INFO L290 TraceCheckUtils]: 57: Hoare triple {21270#true} ~skip~0 := 0; {21270#true} is VALID [2022-04-15 11:34:22,824 INFO L290 TraceCheckUtils]: 58: Hoare triple {21270#true} assume !false; {21270#true} is VALID [2022-04-15 11:34:22,824 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-15 11:34:22,824 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-15 11:34:22,824 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-15 11:34:22,824 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-15 11:34:22,824 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-15 11:34:22,824 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-15 11:34:22,824 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-15 11:34:22,825 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-15 11:34:22,825 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-15 11:34:22,825 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-15 11:34:22,825 INFO L290 TraceCheckUtils]: 69: Hoare triple {21270#true} assume 4400 == #t~mem58;havoc #t~mem58; {21270#true} is VALID [2022-04-15 11:34:22,825 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-15 11:34:22,825 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-15 11:34:22,825 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-15 11:34:22,826 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-15 11:34:22,826 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-15 11:34:22,826 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-15 11:34:22,826 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-15 11:34:22,827 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-15 11:34:22,827 INFO L290 TraceCheckUtils]: 78: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:22,827 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-15 11:34:22,827 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-15 11:34:22,828 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-15 11:34:22,828 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-15 11:34:22,828 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-15 11:34:22,828 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-15 11:34:22,829 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-15 11:34:22,829 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-15 11:34:22,829 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-15 11:34:22,829 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-15 11:34:22,830 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-15 11:34:22,830 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-15 11:34:22,830 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-15 11:34:22,831 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-15 11:34:22,831 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-15 11:34:22,831 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-15 11:34:22,831 INFO L290 TraceCheckUtils]: 95: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {21271#false} is VALID [2022-04-15 11:34:22,831 INFO L290 TraceCheckUtils]: 96: Hoare triple {21271#false} assume !false; {21271#false} is VALID [2022-04-15 11:34:22,832 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-15 11:34:22,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:22,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277140496] [2022-04-15 11:34:22,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277140496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:22,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:22,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:22,832 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:22,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1248774346] [2022-04-15 11:34:22,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1248774346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:22,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:22,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:22,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293989691] [2022-04-15 11:34:22,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:22,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2022-04-15 11:34:22,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:22,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:22,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:22,886 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:34:22,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:22,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:34:22,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:22,887 INFO L87 Difference]: Start difference. First operand 420 states and 609 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:24,902 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:25,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:25,759 INFO L93 Difference]: Finished difference Result 843 states and 1231 transitions. [2022-04-15 11:34:25,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:34:25,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2022-04-15 11:34:25,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:25,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:25,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-15 11:34:25,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:25,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-15 11:34:25,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 488 transitions. [2022-04-15 11:34:26,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:26,079 INFO L225 Difference]: With dead ends: 843 [2022-04-15 11:34:26,083 INFO L226 Difference]: Without dead ends: 551 [2022-04-15 11:34:26,085 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:26,085 INFO L913 BasicCegarLoop]: 314 mSDtfsCounter, 126 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:34:26,086 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 476 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 338 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:34:26,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-04-15 11:34:26,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2022-04-15 11:34:26,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:26,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 551 states. Second operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:26,134 INFO L74 IsIncluded]: Start isIncluded. First operand 551 states. Second operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:26,134 INFO L87 Difference]: Start difference. First operand 551 states. Second operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:26,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:26,143 INFO L93 Difference]: Finished difference Result 551 states and 800 transitions. [2022-04-15 11:34:26,143 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 800 transitions. [2022-04-15 11:34:26,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:26,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:26,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 551 states. [2022-04-15 11:34:26,145 INFO L87 Difference]: Start difference. First operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 551 states. [2022-04-15 11:34:26,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:26,154 INFO L93 Difference]: Finished difference Result 551 states and 800 transitions. [2022-04-15 11:34:26,154 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 800 transitions. [2022-04-15 11:34:26,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:26,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:26,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:26,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:26,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:26,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 800 transitions. [2022-04-15 11:34:26,167 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 800 transitions. Word has length 97 [2022-04-15 11:34:26,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:26,167 INFO L478 AbstractCegarLoop]: Abstraction has 551 states and 800 transitions. [2022-04-15 11:34:26,167 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:26,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 551 states and 800 transitions. [2022-04-15 11:34:26,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 800 edges. 800 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:26,746 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 800 transitions. [2022-04-15 11:34:26,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-15 11:34:26,747 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:26,747 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:34:26,747 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:34:26,747 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:26,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:26,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2136926065, now seen corresponding path program 1 times [2022-04-15 11:34:26,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:26,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [986356628] [2022-04-15 11:34:26,748 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:26,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2136926065, now seen corresponding path program 2 times [2022-04-15 11:34:26,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:26,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691071950] [2022-04-15 11:34:26,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:26,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:26,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:26,889 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-15 11:34:26,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {25169#true} assume true; {25169#true} is VALID [2022-04-15 11:34:26,890 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25169#true} {25169#true} #593#return; {25169#true} is VALID [2022-04-15 11:34:26,890 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-15 11:34:26,890 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-15 11:34:26,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {25169#true} assume true; {25169#true} is VALID [2022-04-15 11:34:26,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25169#true} {25169#true} #593#return; {25169#true} is VALID [2022-04-15 11:34:26,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {25169#true} call #t~ret158 := main(); {25169#true} is VALID [2022-04-15 11:34:26,891 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-15 11:34:26,891 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-15 11:34:26,891 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-15 11:34:26,891 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-15 11:34:26,891 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-15 11:34:26,891 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-15 11:34:26,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {25169#true} assume !false; {25169#true} is VALID [2022-04-15 11:34:26,891 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-15 11:34:26,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {25169#true} assume 12292 == #t~mem49;havoc #t~mem49; {25169#true} is VALID [2022-04-15 11:34:26,891 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-15 11:34:26,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {25169#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {25169#true} is VALID [2022-04-15 11:34:26,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {25169#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {25169#true} is VALID [2022-04-15 11:34:26,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {25169#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {25169#true} is VALID [2022-04-15 11:34:26,892 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-15 11:34:26,892 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-15 11:34:26,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {25169#true} assume !(0 == ~tmp___4~0); {25169#true} is VALID [2022-04-15 11:34:26,897 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-15 11:34:26,897 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-15 11:34:26,898 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-15 11:34:26,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {25169#true} ~skip~0 := 0; {25169#true} is VALID [2022-04-15 11:34:26,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {25169#true} assume !false; {25169#true} is VALID [2022-04-15 11:34:26,898 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-15 11:34:26,898 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-15 11:34:26,898 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-15 11:34:26,898 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-15 11:34:26,898 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-15 11:34:26,898 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-15 11:34:26,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {25169#true} assume 4368 == #t~mem54;havoc #t~mem54; {25169#true} is VALID [2022-04-15 11:34:26,898 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-15 11:34:26,898 INFO L290 TraceCheckUtils]: 34: Hoare triple {25169#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25169#true} is VALID [2022-04-15 11:34:26,898 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-15 11:34:26,898 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-15 11:34:26,899 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-15 11:34:26,899 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-15 11:34:26,899 INFO L290 TraceCheckUtils]: 39: Hoare triple {25169#true} ~skip~0 := 0; {25169#true} is VALID [2022-04-15 11:34:26,899 INFO L290 TraceCheckUtils]: 40: Hoare triple {25169#true} assume !false; {25169#true} is VALID [2022-04-15 11:34:26,899 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-15 11:34:26,899 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-15 11:34:26,899 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-15 11:34:26,899 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-15 11:34:26,899 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-15 11:34:26,899 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-15 11:34:26,899 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-15 11:34:26,899 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-15 11:34:26,899 INFO L290 TraceCheckUtils]: 49: Hoare triple {25169#true} assume 4384 == #t~mem56;havoc #t~mem56; {25169#true} is VALID [2022-04-15 11:34:26,899 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-15 11:34:26,900 INFO L290 TraceCheckUtils]: 51: Hoare triple {25169#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {25169#true} is VALID [2022-04-15 11:34:26,900 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-15 11:34:26,900 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-15 11:34:26,900 INFO L290 TraceCheckUtils]: 54: Hoare triple {25169#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {25169#true} is VALID [2022-04-15 11:34:26,900 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-15 11:34:26,900 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-15 11:34:26,900 INFO L290 TraceCheckUtils]: 57: Hoare triple {25169#true} ~skip~0 := 0; {25169#true} is VALID [2022-04-15 11:34:26,900 INFO L290 TraceCheckUtils]: 58: Hoare triple {25169#true} assume !false; {25169#true} is VALID [2022-04-15 11:34:26,900 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-15 11:34:26,900 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-15 11:34:26,900 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-15 11:34:26,900 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-15 11:34:26,900 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-15 11:34:26,900 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-15 11:34:26,900 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-15 11:34:26,901 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-15 11:34:26,901 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-15 11:34:26,901 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-15 11:34:26,901 INFO L290 TraceCheckUtils]: 69: Hoare triple {25169#true} assume 4400 == #t~mem58;havoc #t~mem58; {25169#true} is VALID [2022-04-15 11:34:26,901 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-15 11:34:26,901 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-15 11:34:26,901 INFO L290 TraceCheckUtils]: 72: Hoare triple {25169#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {25169#true} is VALID [2022-04-15 11:34:26,901 INFO L290 TraceCheckUtils]: 73: Hoare triple {25169#true} assume !(~ret~0 <= 0); {25169#true} is VALID [2022-04-15 11:34:26,901 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-15 11:34:26,901 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-15 11:34:26,901 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-15 11:34:26,901 INFO L290 TraceCheckUtils]: 77: Hoare triple {25169#true} ~skip~0 := 0; {25169#true} is VALID [2022-04-15 11:34:26,901 INFO L290 TraceCheckUtils]: 78: Hoare triple {25169#true} assume !false; {25169#true} is VALID [2022-04-15 11:34:26,901 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-15 11:34:26,902 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-15 11:34:26,902 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-15 11:34:26,902 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-15 11:34:26,902 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-15 11:34:26,902 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-15 11:34:26,902 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-15 11:34:26,902 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-15 11:34:26,902 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-15 11:34:26,902 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-15 11:34:26,902 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-15 11:34:26,902 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-15 11:34:26,902 INFO L290 TraceCheckUtils]: 91: Hoare triple {25169#true} assume 4416 == #t~mem60;havoc #t~mem60; {25169#true} is VALID [2022-04-15 11:34:26,902 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-15 11:34:26,903 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-15 11:34:26,903 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-15 11:34:26,903 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-15 11:34:26,903 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-15 11:34:26,904 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-15 11:34:26,904 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-15 11:34:26,904 INFO L290 TraceCheckUtils]: 99: Hoare triple {25174#(= ssl3_connect_~blastFlag~0 4)} assume !false; {25174#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:34:26,905 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-15 11:34:26,905 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-15 11:34:26,905 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-15 11:34:26,905 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-15 11:34:26,906 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-15 11:34:26,906 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-15 11:34:26,906 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-15 11:34:26,906 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-15 11:34:26,907 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-15 11:34:26,907 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-15 11:34:26,907 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-15 11:34:26,907 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-15 11:34:26,908 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-15 11:34:26,908 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-15 11:34:26,908 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-15 11:34:26,908 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-15 11:34:26,909 INFO L290 TraceCheckUtils]: 116: Hoare triple {25174#(= ssl3_connect_~blastFlag~0 4)} assume 5 == ~blastFlag~0; {25170#false} is VALID [2022-04-15 11:34:26,909 INFO L290 TraceCheckUtils]: 117: Hoare triple {25170#false} assume !false; {25170#false} is VALID [2022-04-15 11:34:26,909 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-15 11:34:26,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:26,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691071950] [2022-04-15 11:34:26,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691071950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:26,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:26,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:26,910 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:26,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [986356628] [2022-04-15 11:34:26,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [986356628] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:26,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:26,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:26,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295582929] [2022-04-15 11:34:26,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:26,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-15 11:34:26,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:26,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:26,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:26,991 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:34:26,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:26,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:34:26,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:26,992 INFO L87 Difference]: Start difference. First operand 551 states and 800 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:29,008 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:29,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:29,866 INFO L93 Difference]: Finished difference Result 1087 states and 1587 transitions. [2022-04-15 11:34:29,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:34:29,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-15 11:34:29,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:29,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:29,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-15 11:34:29,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:29,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-15 11:34:29,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-15 11:34:30,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:30,208 INFO L225 Difference]: With dead ends: 1087 [2022-04-15 11:34:30,208 INFO L226 Difference]: Without dead ends: 664 [2022-04-15 11:34:30,209 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:30,210 INFO L913 BasicCegarLoop]: 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-15 11:34:30,210 INFO L914 BasicCegarLoop]: 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-15 11:34:30,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2022-04-15 11:34:30,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 664. [2022-04-15 11:34:30,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:30,227 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-15 11:34:30,227 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-15 11:34:30,228 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-15 11:34:30,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:30,241 INFO L93 Difference]: Finished difference Result 664 states and 965 transitions. [2022-04-15 11:34:30,241 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 965 transitions. [2022-04-15 11:34:30,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:30,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:30,242 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-15 11:34:30,244 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-15 11:34:30,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:30,257 INFO L93 Difference]: Finished difference Result 664 states and 965 transitions. [2022-04-15 11:34:30,257 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 965 transitions. [2022-04-15 11:34:30,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:30,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:30,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:30,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:30,259 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-15 11:34:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 965 transitions. [2022-04-15 11:34:30,301 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 965 transitions. Word has length 118 [2022-04-15 11:34:30,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:30,301 INFO L478 AbstractCegarLoop]: Abstraction has 664 states and 965 transitions. [2022-04-15 11:34:30,301 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:30,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 664 states and 965 transitions. [2022-04-15 11:34:30,871 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-15 11:34:30,872 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 965 transitions. [2022-04-15 11:34:30,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-04-15 11:34:30,873 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:30,873 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:34:30,873 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:34:30,873 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:30,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:30,874 INFO L85 PathProgramCache]: Analyzing trace with hash -383649488, now seen corresponding path program 1 times [2022-04-15 11:34:30,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:30,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [880594079] [2022-04-15 11:34:49,200 WARN L232 SmtUtils]: Spent 13.08s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 11:34:57,781 WARN L232 SmtUtils]: Spent 5.18s 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-15 11:34:59,392 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:59,392 INFO L85 PathProgramCache]: Analyzing trace with hash -383649488, now seen corresponding path program 2 times [2022-04-15 11:34:59,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:59,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609044265] [2022-04-15 11:34:59,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:59,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:59,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:59,578 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-15 11:34:59,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {30008#true} assume true; {30008#true} is VALID [2022-04-15 11:34:59,579 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30008#true} {30008#true} #593#return; {30008#true} is VALID [2022-04-15 11:34:59,579 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-15 11:34:59,579 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-15 11:34:59,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {30008#true} assume true; {30008#true} is VALID [2022-04-15 11:34:59,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30008#true} {30008#true} #593#return; {30008#true} is VALID [2022-04-15 11:34:59,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {30008#true} call #t~ret158 := main(); {30008#true} is VALID [2022-04-15 11:34:59,580 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-15 11:34:59,580 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-15 11:34:59,580 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-15 11:34:59,580 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-15 11:34:59,580 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-15 11:34:59,580 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-15 11:34:59,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {30008#true} assume !false; {30008#true} is VALID [2022-04-15 11:34:59,580 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-15 11:34:59,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {30008#true} assume 12292 == #t~mem49;havoc #t~mem49; {30008#true} is VALID [2022-04-15 11:34:59,580 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-15 11:34:59,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {30008#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {30008#true} is VALID [2022-04-15 11:34:59,581 INFO L290 TraceCheckUtils]: 16: Hoare triple {30008#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {30008#true} is VALID [2022-04-15 11:34:59,581 INFO L290 TraceCheckUtils]: 17: Hoare triple {30008#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {30008#true} is VALID [2022-04-15 11:34:59,581 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-15 11:34:59,581 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-15 11:34:59,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {30008#true} assume !(0 == ~tmp___4~0); {30008#true} is VALID [2022-04-15 11:34:59,581 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-15 11:34:59,581 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-15 11:34:59,581 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-15 11:34:59,581 INFO L290 TraceCheckUtils]: 24: Hoare triple {30008#true} ~skip~0 := 0; {30008#true} is VALID [2022-04-15 11:34:59,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {30008#true} assume !false; {30008#true} is VALID [2022-04-15 11:34:59,581 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-15 11:34:59,581 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-15 11:34:59,581 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-15 11:34:59,581 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-15 11:34:59,582 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-15 11:34:59,582 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-15 11:34:59,582 INFO L290 TraceCheckUtils]: 32: Hoare triple {30008#true} assume 4368 == #t~mem54;havoc #t~mem54; {30008#true} is VALID [2022-04-15 11:34:59,582 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-15 11:34:59,582 INFO L290 TraceCheckUtils]: 34: Hoare triple {30008#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30008#true} is VALID [2022-04-15 11:34:59,582 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-15 11:34:59,582 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-15 11:34:59,582 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-15 11:34:59,582 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-15 11:34:59,582 INFO L290 TraceCheckUtils]: 39: Hoare triple {30008#true} ~skip~0 := 0; {30008#true} is VALID [2022-04-15 11:34:59,582 INFO L290 TraceCheckUtils]: 40: Hoare triple {30008#true} assume !false; {30008#true} is VALID [2022-04-15 11:34:59,582 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-15 11:34:59,582 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-15 11:34:59,582 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-15 11:34:59,582 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-15 11:34:59,583 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-15 11:34:59,583 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-15 11:34:59,583 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-15 11:34:59,583 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-15 11:34:59,583 INFO L290 TraceCheckUtils]: 49: Hoare triple {30008#true} assume 4384 == #t~mem56;havoc #t~mem56; {30008#true} is VALID [2022-04-15 11:34:59,583 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-15 11:34:59,583 INFO L290 TraceCheckUtils]: 51: Hoare triple {30008#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {30008#true} is VALID [2022-04-15 11:34:59,583 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-15 11:34:59,583 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-15 11:34:59,583 INFO L290 TraceCheckUtils]: 54: Hoare triple {30008#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {30008#true} is VALID [2022-04-15 11:34:59,583 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-15 11:34:59,583 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-15 11:34:59,583 INFO L290 TraceCheckUtils]: 57: Hoare triple {30008#true} ~skip~0 := 0; {30008#true} is VALID [2022-04-15 11:34:59,583 INFO L290 TraceCheckUtils]: 58: Hoare triple {30008#true} assume !false; {30008#true} is VALID [2022-04-15 11:34:59,584 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-15 11:34:59,584 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-15 11:34:59,584 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-15 11:34:59,584 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-15 11:34:59,584 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-15 11:34:59,584 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-15 11:34:59,584 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-15 11:34:59,584 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-15 11:34:59,584 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-15 11:34:59,584 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-15 11:34:59,584 INFO L290 TraceCheckUtils]: 69: Hoare triple {30008#true} assume 4400 == #t~mem58;havoc #t~mem58; {30008#true} is VALID [2022-04-15 11:34:59,584 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-15 11:34:59,584 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-15 11:34:59,584 INFO L290 TraceCheckUtils]: 72: Hoare triple {30008#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {30008#true} is VALID [2022-04-15 11:34:59,585 INFO L290 TraceCheckUtils]: 73: Hoare triple {30008#true} assume !(~ret~0 <= 0); {30008#true} is VALID [2022-04-15 11:34:59,585 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-15 11:34:59,585 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-15 11:34:59,585 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-15 11:34:59,585 INFO L290 TraceCheckUtils]: 77: Hoare triple {30008#true} ~skip~0 := 0; {30008#true} is VALID [2022-04-15 11:34:59,585 INFO L290 TraceCheckUtils]: 78: Hoare triple {30008#true} assume !false; {30008#true} is VALID [2022-04-15 11:34:59,585 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-15 11:34:59,585 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-15 11:34:59,585 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-15 11:34:59,585 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-15 11:34:59,585 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-15 11:34:59,585 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-15 11:34:59,585 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-15 11:34:59,585 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-15 11:34:59,585 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-15 11:34:59,586 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-15 11:34:59,586 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-15 11:34:59,586 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-15 11:34:59,586 INFO L290 TraceCheckUtils]: 91: Hoare triple {30008#true} assume 4416 == #t~mem60;havoc #t~mem60; {30008#true} is VALID [2022-04-15 11:34:59,594 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-15 11:34:59,594 INFO L290 TraceCheckUtils]: 93: Hoare triple {30008#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {30008#true} is VALID [2022-04-15 11:34:59,595 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-15 11:34:59,597 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-15 11:34:59,597 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-15 11:34:59,597 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-15 11:34:59,598 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-15 11:34:59,598 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-15 11:34:59,598 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-15 11:34:59,599 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-15 11:34:59,599 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-15 11:34:59,599 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-15 11:34:59,600 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-15 11:34:59,600 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-15 11:34:59,600 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-15 11:34:59,600 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-15 11:34:59,600 INFO L290 TraceCheckUtils]: 108: Hoare triple {30009#false} assume !(0 == ~blastFlag~0); {30009#false} is VALID [2022-04-15 11:34:59,601 INFO L290 TraceCheckUtils]: 109: Hoare triple {30009#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {30009#false} is VALID [2022-04-15 11:34:59,601 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-15 11:34:59,601 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-15 11:34:59,601 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-15 11:34:59,601 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-15 11:34:59,601 INFO L290 TraceCheckUtils]: 114: Hoare triple {30009#false} ~skip~0 := 0; {30009#false} is VALID [2022-04-15 11:34:59,601 INFO L290 TraceCheckUtils]: 115: Hoare triple {30009#false} assume !false; {30009#false} is VALID [2022-04-15 11:34:59,601 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-15 11:34:59,601 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-15 11:34:59,601 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-15 11:34:59,601 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-15 11:34:59,601 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-15 11:34:59,601 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-15 11:34:59,601 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-15 11:34:59,602 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-15 11:34:59,602 INFO L290 TraceCheckUtils]: 124: Hoare triple {30009#false} assume 4384 == #t~mem56;havoc #t~mem56; {30009#false} is VALID [2022-04-15 11:34:59,602 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-15 11:34:59,602 INFO L290 TraceCheckUtils]: 126: Hoare triple {30009#false} assume !(1 == ~blastFlag~0); {30009#false} is VALID [2022-04-15 11:34:59,602 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-15 11:34:59,602 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-15 11:34:59,602 INFO L290 TraceCheckUtils]: 129: Hoare triple {30009#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {30009#false} is VALID [2022-04-15 11:34:59,602 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-15 11:34:59,602 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-15 11:34:59,602 INFO L290 TraceCheckUtils]: 132: Hoare triple {30009#false} ~skip~0 := 0; {30009#false} is VALID [2022-04-15 11:34:59,602 INFO L290 TraceCheckUtils]: 133: Hoare triple {30009#false} assume !false; {30009#false} is VALID [2022-04-15 11:34:59,602 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-15 11:34:59,602 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-15 11:34:59,602 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-15 11:34:59,603 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-15 11:34:59,603 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-15 11:34:59,603 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-15 11:34:59,603 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-15 11:34:59,603 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-15 11:34:59,603 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-15 11:34:59,603 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-15 11:34:59,603 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-15 11:34:59,603 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-15 11:34:59,603 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-15 11:34:59,603 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-15 11:34:59,603 INFO L290 TraceCheckUtils]: 148: Hoare triple {30009#false} assume 4432 == #t~mem62;havoc #t~mem62; {30009#false} is VALID [2022-04-15 11:34:59,603 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-15 11:34:59,603 INFO L290 TraceCheckUtils]: 150: Hoare triple {30009#false} assume 5 == ~blastFlag~0; {30009#false} is VALID [2022-04-15 11:34:59,604 INFO L290 TraceCheckUtils]: 151: Hoare triple {30009#false} assume !false; {30009#false} is VALID [2022-04-15 11:34:59,604 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-04-15 11:34:59,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:59,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609044265] [2022-04-15 11:34:59,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609044265] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:59,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:59,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:59,605 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:59,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [880594079] [2022-04-15 11:34:59,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [880594079] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:59,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:59,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:59,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802164063] [2022-04-15 11:34:59,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:59,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 152 [2022-04-15 11:34:59,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:59,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:59,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:59,676 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:34:59,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:59,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:34:59,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:34:59,677 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-15 11:35:01,696 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:35:02,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:02,964 INFO L93 Difference]: Finished difference Result 1651 states and 2412 transitions. [2022-04-15 11:35:02,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:35:02,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 152 [2022-04-15 11:35:02,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:35:02,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:35:02,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 11:35:02,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:35:02,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 11:35:02,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-15 11:35:03,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:35:03,334 INFO L225 Difference]: With dead ends: 1651 [2022-04-15 11:35:03,335 INFO L226 Difference]: Without dead ends: 1113 [2022-04-15 11:35:03,336 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:35:03,336 INFO L913 BasicCegarLoop]: 214 mSDtfsCounter, 114 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 31 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:35:03,336 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 510 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 504 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:35:03,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2022-04-15 11:35:03,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 744. [2022-04-15 11:35:03,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:35:03,376 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-15 11:35:03,377 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-15 11:35:03,378 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-15 11:35:03,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:03,409 INFO L93 Difference]: Finished difference Result 1113 states and 1620 transitions. [2022-04-15 11:35:03,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1620 transitions. [2022-04-15 11:35:03,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:03,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:03,411 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-15 11:35:03,411 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-15 11:35:03,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:03,443 INFO L93 Difference]: Finished difference Result 1113 states and 1620 transitions. [2022-04-15 11:35:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1620 transitions. [2022-04-15 11:35:03,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:03,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:03,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:35:03,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:35:03,445 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-15 11:35:03,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1081 transitions. [2022-04-15 11:35:03,465 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1081 transitions. Word has length 152 [2022-04-15 11:35:03,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:35:03,466 INFO L478 AbstractCegarLoop]: Abstraction has 744 states and 1081 transitions. [2022-04-15 11:35:03,466 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:35:03,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 744 states and 1081 transitions. [2022-04-15 11:35:04,288 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-15 11:35:04,289 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1081 transitions. [2022-04-15 11:35:04,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-15 11:35:04,290 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:35:04,290 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:35:04,290 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 11:35:04,290 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:35:04,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:35:04,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1211981165, now seen corresponding path program 1 times [2022-04-15 11:35:04,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:04,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1562798139] [2022-04-15 11:35:18,860 WARN L232 SmtUtils]: Spent 9.36s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 11:35:27,382 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:35:27,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1211981165, now seen corresponding path program 2 times [2022-04-15 11:35:27,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:35:27,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081651803] [2022-04-15 11:35:27,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:35:27,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:35:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:27,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:35:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:27,532 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-15 11:35:27,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {37036#true} assume true; {37036#true} is VALID [2022-04-15 11:35:27,532 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37036#true} {37036#true} #593#return; {37036#true} is VALID [2022-04-15 11:35:27,533 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-15 11:35:27,533 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-15 11:35:27,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {37036#true} assume true; {37036#true} is VALID [2022-04-15 11:35:27,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37036#true} {37036#true} #593#return; {37036#true} is VALID [2022-04-15 11:35:27,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {37036#true} call #t~ret158 := main(); {37036#true} is VALID [2022-04-15 11:35:27,533 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-15 11:35:27,533 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-15 11:35:27,534 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-15 11:35:27,534 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-15 11:35:27,534 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-15 11:35:27,534 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-15 11:35:27,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {37036#true} assume !false; {37036#true} is VALID [2022-04-15 11:35:27,534 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-15 11:35:27,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {37036#true} assume 12292 == #t~mem49;havoc #t~mem49; {37036#true} is VALID [2022-04-15 11:35:27,534 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-15 11:35:27,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {37036#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {37036#true} is VALID [2022-04-15 11:35:27,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {37036#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {37036#true} is VALID [2022-04-15 11:35:27,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {37036#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {37036#true} is VALID [2022-04-15 11:35:27,534 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-15 11:35:27,534 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-15 11:35:27,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {37036#true} assume !(0 == ~tmp___4~0); {37036#true} is VALID [2022-04-15 11:35:27,534 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-15 11:35:27,535 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-15 11:35:27,535 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-15 11:35:27,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {37036#true} ~skip~0 := 0; {37036#true} is VALID [2022-04-15 11:35:27,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {37036#true} assume !false; {37036#true} is VALID [2022-04-15 11:35:27,535 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-15 11:35:27,535 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-15 11:35:27,535 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-15 11:35:27,535 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-15 11:35:27,535 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-15 11:35:27,535 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-15 11:35:27,535 INFO L290 TraceCheckUtils]: 32: Hoare triple {37036#true} assume 4368 == #t~mem54;havoc #t~mem54; {37036#true} is VALID [2022-04-15 11:35:27,535 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-15 11:35:27,535 INFO L290 TraceCheckUtils]: 34: Hoare triple {37036#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37036#true} is VALID [2022-04-15 11:35:27,535 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-15 11:35:27,536 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-15 11:35:27,536 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-15 11:35:27,536 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-15 11:35:27,536 INFO L290 TraceCheckUtils]: 39: Hoare triple {37036#true} ~skip~0 := 0; {37036#true} is VALID [2022-04-15 11:35:27,536 INFO L290 TraceCheckUtils]: 40: Hoare triple {37036#true} assume !false; {37036#true} is VALID [2022-04-15 11:35:27,536 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-15 11:35:27,536 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-15 11:35:27,536 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-15 11:35:27,536 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-15 11:35:27,536 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-15 11:35:27,536 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-15 11:35:27,536 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-15 11:35:27,536 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-15 11:35:27,536 INFO L290 TraceCheckUtils]: 49: Hoare triple {37036#true} assume 4384 == #t~mem56;havoc #t~mem56; {37036#true} is VALID [2022-04-15 11:35:27,536 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-15 11:35:27,537 INFO L290 TraceCheckUtils]: 51: Hoare triple {37036#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {37036#true} is VALID [2022-04-15 11:35:27,537 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-15 11:35:27,537 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-15 11:35:27,537 INFO L290 TraceCheckUtils]: 54: Hoare triple {37036#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {37036#true} is VALID [2022-04-15 11:35:27,537 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-15 11:35:27,537 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-15 11:35:27,537 INFO L290 TraceCheckUtils]: 57: Hoare triple {37036#true} ~skip~0 := 0; {37036#true} is VALID [2022-04-15 11:35:27,537 INFO L290 TraceCheckUtils]: 58: Hoare triple {37036#true} assume !false; {37036#true} is VALID [2022-04-15 11:35:27,537 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-15 11:35:27,537 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-15 11:35:27,537 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-15 11:35:27,537 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-15 11:35:27,537 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-15 11:35:27,537 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-15 11:35:27,538 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-15 11:35:27,538 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-15 11:35:27,538 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-15 11:35:27,538 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-15 11:35:27,538 INFO L290 TraceCheckUtils]: 69: Hoare triple {37036#true} assume 4400 == #t~mem58;havoc #t~mem58; {37036#true} is VALID [2022-04-15 11:35:27,538 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-15 11:35:27,538 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-15 11:35:27,538 INFO L290 TraceCheckUtils]: 72: Hoare triple {37036#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {37036#true} is VALID [2022-04-15 11:35:27,538 INFO L290 TraceCheckUtils]: 73: Hoare triple {37036#true} assume !(~ret~0 <= 0); {37036#true} is VALID [2022-04-15 11:35:27,538 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-15 11:35:27,538 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-15 11:35:27,538 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-15 11:35:27,538 INFO L290 TraceCheckUtils]: 77: Hoare triple {37036#true} ~skip~0 := 0; {37036#true} is VALID [2022-04-15 11:35:27,538 INFO L290 TraceCheckUtils]: 78: Hoare triple {37036#true} assume !false; {37036#true} is VALID [2022-04-15 11:35:27,539 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-15 11:35:27,539 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-15 11:35:27,539 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-15 11:35:27,539 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-15 11:35:27,539 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-15 11:35:27,539 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-15 11:35:27,539 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-15 11:35:27,539 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-15 11:35:27,539 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-15 11:35:27,539 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-15 11:35:27,539 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-15 11:35:27,539 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-15 11:35:27,539 INFO L290 TraceCheckUtils]: 91: Hoare triple {37036#true} assume 4416 == #t~mem60;havoc #t~mem60; {37036#true} is VALID [2022-04-15 11:35:27,539 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-15 11:35:27,539 INFO L290 TraceCheckUtils]: 93: Hoare triple {37036#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {37036#true} is VALID [2022-04-15 11:35:27,540 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-15 11:35:27,541 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-15 11:35:27,541 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-15 11:35:27,541 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-15 11:35:27,541 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-15 11:35:27,542 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-15 11:35:27,542 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-15 11:35:27,542 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-15 11:35:27,542 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-15 11:35:27,543 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-15 11:35:27,543 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-15 11:35:27,543 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-15 11:35:27,543 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-15 11:35:27,544 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-15 11:35:27,544 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-15 11:35:27,544 INFO L290 TraceCheckUtils]: 109: Hoare triple {37037#false} assume !(0 == ~blastFlag~0); {37037#false} is VALID [2022-04-15 11:35:27,544 INFO L290 TraceCheckUtils]: 110: Hoare triple {37037#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {37037#false} is VALID [2022-04-15 11:35:27,544 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-15 11:35:27,544 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-15 11:35:27,544 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-15 11:35:27,544 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-15 11:35:27,544 INFO L290 TraceCheckUtils]: 115: Hoare triple {37037#false} ~skip~0 := 0; {37037#false} is VALID [2022-04-15 11:35:27,544 INFO L290 TraceCheckUtils]: 116: Hoare triple {37037#false} assume !false; {37037#false} is VALID [2022-04-15 11:35:27,544 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-15 11:35:27,545 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-15 11:35:27,545 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-15 11:35:27,545 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-15 11:35:27,545 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-15 11:35:27,545 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-15 11:35:27,545 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-15 11:35:27,545 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-15 11:35:27,545 INFO L290 TraceCheckUtils]: 125: Hoare triple {37037#false} assume 4384 == #t~mem56;havoc #t~mem56; {37037#false} is VALID [2022-04-15 11:35:27,545 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-15 11:35:27,545 INFO L290 TraceCheckUtils]: 127: Hoare triple {37037#false} assume !(1 == ~blastFlag~0); {37037#false} is VALID [2022-04-15 11:35:27,545 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-15 11:35:27,545 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-15 11:35:27,545 INFO L290 TraceCheckUtils]: 130: Hoare triple {37037#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {37037#false} is VALID [2022-04-15 11:35:27,545 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-15 11:35:27,545 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-15 11:35:27,546 INFO L290 TraceCheckUtils]: 133: Hoare triple {37037#false} ~skip~0 := 0; {37037#false} is VALID [2022-04-15 11:35:27,546 INFO L290 TraceCheckUtils]: 134: Hoare triple {37037#false} assume !false; {37037#false} is VALID [2022-04-15 11:35:27,546 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-15 11:35:27,546 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-15 11:35:27,546 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-15 11:35:27,546 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-15 11:35:27,546 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-15 11:35:27,546 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-15 11:35:27,546 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-15 11:35:27,546 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-15 11:35:27,546 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-15 11:35:27,546 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-15 11:35:27,546 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-15 11:35:27,546 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-15 11:35:27,546 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-15 11:35:27,547 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-15 11:35:27,547 INFO L290 TraceCheckUtils]: 149: Hoare triple {37037#false} assume 4432 == #t~mem62;havoc #t~mem62; {37037#false} is VALID [2022-04-15 11:35:27,547 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-15 11:35:27,547 INFO L290 TraceCheckUtils]: 151: Hoare triple {37037#false} assume 5 == ~blastFlag~0; {37037#false} is VALID [2022-04-15 11:35:27,547 INFO L290 TraceCheckUtils]: 152: Hoare triple {37037#false} assume !false; {37037#false} is VALID [2022-04-15 11:35:27,547 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-04-15 11:35:27,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:35:27,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081651803] [2022-04-15 11:35:27,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081651803] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:27,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:27,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:35:27,548 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:35:27,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1562798139] [2022-04-15 11:35:27,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1562798139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:27,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:27,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:35:27,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673464511] [2022-04-15 11:35:27,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:35:27,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 153 [2022-04-15 11:35:27,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:35:27,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:35:27,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:35:27,618 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:35:27,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:27,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:35:27,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:35:27,619 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-15 11:35:29,638 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:35:31,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:31,014 INFO L93 Difference]: Finished difference Result 1693 states and 2470 transitions. [2022-04-15 11:35:31,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:35:31,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 153 [2022-04-15 11:35:31,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:35:31,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:35:31,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2022-04-15 11:35:31,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:35:31,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2022-04-15 11:35:31,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 465 transitions. [2022-04-15 11:35:31,350 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-15 11:35:31,395 INFO L225 Difference]: With dead ends: 1693 [2022-04-15 11:35:31,395 INFO L226 Difference]: Without dead ends: 1091 [2022-04-15 11:35:31,396 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:35:31,396 INFO L913 BasicCegarLoop]: 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-15 11:35:31,396 INFO L914 BasicCegarLoop]: 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-15 11:35:31,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2022-04-15 11:35:31,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 812. [2022-04-15 11:35:31,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:35:31,422 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-15 11:35:31,422 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-15 11:35:31,423 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-15 11:35:31,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:31,454 INFO L93 Difference]: Finished difference Result 1091 states and 1591 transitions. [2022-04-15 11:35:31,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1591 transitions. [2022-04-15 11:35:31,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:31,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:31,456 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-15 11:35:31,456 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-15 11:35:31,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:31,487 INFO L93 Difference]: Finished difference Result 1091 states and 1591 transitions. [2022-04-15 11:35:31,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1591 transitions. [2022-04-15 11:35:31,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:31,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:31,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:35:31,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:35:31,489 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-15 11:35:31,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1181 transitions. [2022-04-15 11:35:31,514 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1181 transitions. Word has length 153 [2022-04-15 11:35:31,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:35:31,514 INFO L478 AbstractCegarLoop]: Abstraction has 812 states and 1181 transitions. [2022-04-15 11:35:31,515 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:35:31,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 812 states and 1181 transitions. [2022-04-15 11:35:32,467 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-15 11:35:32,467 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1181 transitions. [2022-04-15 11:35:32,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-04-15 11:35:32,468 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:35:32,469 INFO L499 BasicCegarLoop]: 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-15 11:35:32,469 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 11:35:32,469 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:35:32,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:35:32,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1496700185, now seen corresponding path program 1 times [2022-04-15 11:35:32,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:32,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1887369624] [2022-04-15 11:35:43,930 WARN L232 SmtUtils]: Spent 9.90s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 11:35:56,065 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:35:56,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1496700185, now seen corresponding path program 2 times [2022-04-15 11:35:56,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:35:56,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557425585] [2022-04-15 11:35:56,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:35:56,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:35:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:56,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:35:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:56,225 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-15 11:35:56,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {44240#true} assume true; {44240#true} is VALID [2022-04-15 11:35:56,225 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44240#true} {44240#true} #593#return; {44240#true} is VALID [2022-04-15 11:35:56,226 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-15 11:35:56,226 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-15 11:35:56,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {44240#true} assume true; {44240#true} is VALID [2022-04-15 11:35:56,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44240#true} {44240#true} #593#return; {44240#true} is VALID [2022-04-15 11:35:56,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {44240#true} call #t~ret158 := main(); {44240#true} is VALID [2022-04-15 11:35:56,227 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-15 11:35:56,227 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-15 11:35:56,227 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-15 11:35:56,227 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-15 11:35:56,227 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-15 11:35:56,227 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-15 11:35:56,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {44240#true} assume !false; {44240#true} is VALID [2022-04-15 11:35:56,227 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-15 11:35:56,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {44240#true} assume 12292 == #t~mem49;havoc #t~mem49; {44240#true} is VALID [2022-04-15 11:35:56,227 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-15 11:35:56,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {44240#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {44240#true} is VALID [2022-04-15 11:35:56,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {44240#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {44240#true} is VALID [2022-04-15 11:35:56,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {44240#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {44240#true} is VALID [2022-04-15 11:35:56,227 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-15 11:35:56,228 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-15 11:35:56,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {44240#true} assume !(0 == ~tmp___4~0); {44240#true} is VALID [2022-04-15 11:35:56,228 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-15 11:35:56,228 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-15 11:35:56,228 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-15 11:35:56,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {44240#true} ~skip~0 := 0; {44240#true} is VALID [2022-04-15 11:35:56,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {44240#true} assume !false; {44240#true} is VALID [2022-04-15 11:35:56,228 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-15 11:35:56,228 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-15 11:35:56,228 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-15 11:35:56,228 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-15 11:35:56,228 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-15 11:35:56,228 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-15 11:35:56,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {44240#true} assume 4368 == #t~mem54;havoc #t~mem54; {44240#true} is VALID [2022-04-15 11:35:56,228 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-15 11:35:56,229 INFO L290 TraceCheckUtils]: 34: Hoare triple {44240#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {44240#true} is VALID [2022-04-15 11:35:56,229 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-15 11:35:56,229 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-15 11:35:56,229 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-15 11:35:56,229 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-15 11:35:56,229 INFO L290 TraceCheckUtils]: 39: Hoare triple {44240#true} ~skip~0 := 0; {44240#true} is VALID [2022-04-15 11:35:56,229 INFO L290 TraceCheckUtils]: 40: Hoare triple {44240#true} assume !false; {44240#true} is VALID [2022-04-15 11:35:56,229 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-15 11:35:56,229 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-15 11:35:56,229 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-15 11:35:56,229 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-15 11:35:56,229 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-15 11:35:56,229 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-15 11:35:56,229 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-15 11:35:56,230 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-15 11:35:56,230 INFO L290 TraceCheckUtils]: 49: Hoare triple {44240#true} assume 4384 == #t~mem56;havoc #t~mem56; {44240#true} is VALID [2022-04-15 11:35:56,230 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-15 11:35:56,230 INFO L290 TraceCheckUtils]: 51: Hoare triple {44240#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {44240#true} is VALID [2022-04-15 11:35:56,230 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-15 11:35:56,230 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-15 11:35:56,230 INFO L290 TraceCheckUtils]: 54: Hoare triple {44240#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {44240#true} is VALID [2022-04-15 11:35:56,230 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-15 11:35:56,230 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-15 11:35:56,230 INFO L290 TraceCheckUtils]: 57: Hoare triple {44240#true} ~skip~0 := 0; {44240#true} is VALID [2022-04-15 11:35:56,230 INFO L290 TraceCheckUtils]: 58: Hoare triple {44240#true} assume !false; {44240#true} is VALID [2022-04-15 11:35:56,230 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-15 11:35:56,230 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-15 11:35:56,230 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-15 11:35:56,231 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-15 11:35:56,231 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-15 11:35:56,231 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-15 11:35:56,231 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-15 11:35:56,231 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-15 11:35:56,231 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-15 11:35:56,231 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-15 11:35:56,231 INFO L290 TraceCheckUtils]: 69: Hoare triple {44240#true} assume 4400 == #t~mem58;havoc #t~mem58; {44240#true} is VALID [2022-04-15 11:35:56,231 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-15 11:35:56,231 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-15 11:35:56,231 INFO L290 TraceCheckUtils]: 72: Hoare triple {44240#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {44240#true} is VALID [2022-04-15 11:35:56,231 INFO L290 TraceCheckUtils]: 73: Hoare triple {44240#true} assume !(~ret~0 <= 0); {44240#true} is VALID [2022-04-15 11:35:56,231 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-15 11:35:56,231 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-15 11:35:56,232 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-15 11:35:56,232 INFO L290 TraceCheckUtils]: 77: Hoare triple {44240#true} ~skip~0 := 0; {44240#true} is VALID [2022-04-15 11:35:56,232 INFO L290 TraceCheckUtils]: 78: Hoare triple {44240#true} assume !false; {44240#true} is VALID [2022-04-15 11:35:56,232 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-15 11:35:56,232 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-15 11:35:56,232 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-15 11:35:56,232 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-15 11:35:56,232 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-15 11:35:56,232 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-15 11:35:56,232 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-15 11:35:56,232 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-15 11:35:56,232 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-15 11:35:56,232 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-15 11:35:56,232 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-15 11:35:56,233 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-15 11:35:56,233 INFO L290 TraceCheckUtils]: 91: Hoare triple {44240#true} assume 4416 == #t~mem60;havoc #t~mem60; {44240#true} is VALID [2022-04-15 11:35:56,233 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-15 11:35:56,233 INFO L290 TraceCheckUtils]: 93: Hoare triple {44240#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {44240#true} is VALID [2022-04-15 11:35:56,234 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-15 11:35:56,234 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-15 11:35:56,234 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-15 11:35:56,235 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-15 11:35:56,235 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-15 11:35:56,235 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-15 11:35:56,235 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-15 11:35:56,236 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-15 11:35:56,236 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-15 11:35:56,236 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-15 11:35:56,236 INFO L290 TraceCheckUtils]: 104: Hoare triple {44241#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {44241#false} is VALID [2022-04-15 11:35:56,237 INFO L290 TraceCheckUtils]: 105: Hoare triple {44241#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {44241#false} is VALID [2022-04-15 11:35:56,237 INFO L290 TraceCheckUtils]: 106: Hoare triple {44241#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {44241#false} is VALID [2022-04-15 11:35:56,237 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-15 11:35:56,237 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-15 11:35:56,237 INFO L290 TraceCheckUtils]: 109: Hoare triple {44241#false} assume !(0 == ~tmp___4~0); {44241#false} is VALID [2022-04-15 11:35:56,237 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-15 11:35:56,237 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-15 11:35:56,237 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-15 11:35:56,237 INFO L290 TraceCheckUtils]: 113: Hoare triple {44241#false} ~skip~0 := 0; {44241#false} is VALID [2022-04-15 11:35:56,237 INFO L290 TraceCheckUtils]: 114: Hoare triple {44241#false} assume !false; {44241#false} is VALID [2022-04-15 11:35:56,237 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-15 11:35:56,237 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-15 11:35:56,237 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-15 11:35:56,237 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-15 11:35:56,238 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-15 11:35:56,238 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-15 11:35:56,238 INFO L290 TraceCheckUtils]: 121: Hoare triple {44241#false} assume 4368 == #t~mem54;havoc #t~mem54; {44241#false} is VALID [2022-04-15 11:35:56,238 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-15 11:35:56,238 INFO L290 TraceCheckUtils]: 123: Hoare triple {44241#false} assume !(0 == ~blastFlag~0); {44241#false} is VALID [2022-04-15 11:35:56,238 INFO L290 TraceCheckUtils]: 124: Hoare triple {44241#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {44241#false} is VALID [2022-04-15 11:35:56,238 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-15 11:35:56,238 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-15 11:35:56,238 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-15 11:35:56,238 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-15 11:35:56,238 INFO L290 TraceCheckUtils]: 129: Hoare triple {44241#false} ~skip~0 := 0; {44241#false} is VALID [2022-04-15 11:35:56,238 INFO L290 TraceCheckUtils]: 130: Hoare triple {44241#false} assume !false; {44241#false} is VALID [2022-04-15 11:35:56,238 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-15 11:35:56,238 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-15 11:35:56,238 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-15 11:35:56,239 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-15 11:35:56,239 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-15 11:35:56,239 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-15 11:35:56,239 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-15 11:35:56,239 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-15 11:35:56,239 INFO L290 TraceCheckUtils]: 139: Hoare triple {44241#false} assume 4384 == #t~mem56;havoc #t~mem56; {44241#false} is VALID [2022-04-15 11:35:56,239 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-15 11:35:56,239 INFO L290 TraceCheckUtils]: 141: Hoare triple {44241#false} assume !(1 == ~blastFlag~0); {44241#false} is VALID [2022-04-15 11:35:56,239 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-15 11:35:56,239 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-15 11:35:56,239 INFO L290 TraceCheckUtils]: 144: Hoare triple {44241#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {44241#false} is VALID [2022-04-15 11:35:56,239 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-15 11:35:56,239 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-15 11:35:56,239 INFO L290 TraceCheckUtils]: 147: Hoare triple {44241#false} ~skip~0 := 0; {44241#false} is VALID [2022-04-15 11:35:56,240 INFO L290 TraceCheckUtils]: 148: Hoare triple {44241#false} assume !false; {44241#false} is VALID [2022-04-15 11:35:56,240 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-15 11:35:56,240 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-15 11:35:56,240 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-15 11:35:56,240 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-15 11:35:56,240 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-15 11:35:56,240 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-15 11:35:56,240 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-15 11:35:56,240 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-15 11:35:56,240 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-15 11:35:56,240 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-15 11:35:56,240 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-15 11:35:56,240 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-15 11:35:56,240 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-15 11:35:56,241 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-15 11:35:56,241 INFO L290 TraceCheckUtils]: 163: Hoare triple {44241#false} assume 4432 == #t~mem62;havoc #t~mem62; {44241#false} is VALID [2022-04-15 11:35:56,241 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-15 11:35:56,241 INFO L290 TraceCheckUtils]: 165: Hoare triple {44241#false} assume 5 == ~blastFlag~0; {44241#false} is VALID [2022-04-15 11:35:56,241 INFO L290 TraceCheckUtils]: 166: Hoare triple {44241#false} assume !false; {44241#false} is VALID [2022-04-15 11:35:56,241 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-15 11:35:56,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:35:56,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557425585] [2022-04-15 11:35:56,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557425585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:56,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:56,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:35:56,242 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:35:56,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1887369624] [2022-04-15 11:35:56,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1887369624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:56,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:56,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:35:56,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542367005] [2022-04-15 11:35:56,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:35:56,242 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-15 11:35:56,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:35:56,243 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-15 11:35:56,317 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-15 11:35:56,318 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:35:56,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:56,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:35:56,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:35:56,318 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-15 11:35:58,338 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:35:59,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:59,486 INFO L93 Difference]: Finished difference Result 1997 states and 2921 transitions. [2022-04-15 11:35:59,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:35:59,486 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-15 11:35:59,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:35:59,486 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-15 11:35:59,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 11:35:59,488 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-15 11:35:59,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 11:35:59,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-15 11:35:59,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:35:59,832 INFO L225 Difference]: With dead ends: 1997 [2022-04-15 11:35:59,832 INFO L226 Difference]: Without dead ends: 1201 [2022-04-15 11:35:59,834 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:35:59,834 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 117 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:35:59,834 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 300 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 394 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:35:59,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2022-04-15 11:35:59,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 817. [2022-04-15 11:35:59,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:35:59,865 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-15 11:35:59,866 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-15 11:35:59,867 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-15 11:35:59,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:59,905 INFO L93 Difference]: Finished difference Result 1201 states and 1746 transitions. [2022-04-15 11:35:59,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1746 transitions. [2022-04-15 11:35:59,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:59,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:59,908 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-15 11:35:59,909 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-15 11:35:59,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:59,945 INFO L93 Difference]: Finished difference Result 1201 states and 1746 transitions. [2022-04-15 11:35:59,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1746 transitions. [2022-04-15 11:35:59,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:59,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:59,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:35:59,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:35:59,947 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-15 11:35:59,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1177 transitions. [2022-04-15 11:35:59,973 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1177 transitions. Word has length 167 [2022-04-15 11:35:59,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:35:59,973 INFO L478 AbstractCegarLoop]: Abstraction has 817 states and 1177 transitions. [2022-04-15 11:35:59,974 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:35:59,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 817 states and 1177 transitions. [2022-04-15 11:36:00,969 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-15 11:36:00,969 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1177 transitions. [2022-04-15 11:36:00,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-04-15 11:36:00,970 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:36:00,970 INFO L499 BasicCegarLoop]: 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-15 11:36:00,970 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 11:36:00,970 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:36:00,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:36:00,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1030373157, now seen corresponding path program 1 times [2022-04-15 11:36:00,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:00,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [45188642] [2022-04-15 11:36:14,166 WARN L232 SmtUtils]: Spent 7.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-15 11:36:21,584 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:36:21,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1030373157, now seen corresponding path program 2 times [2022-04-15 11:36:21,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:36:21,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187823628] [2022-04-15 11:36:21,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:36:21,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:36:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:21,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:36:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:21,750 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-15 11:36:21,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {52282#true} assume true; {52282#true} is VALID [2022-04-15 11:36:21,750 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52282#true} {52282#true} #593#return; {52282#true} is VALID [2022-04-15 11:36:21,750 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-15 11:36:21,751 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-15 11:36:21,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {52282#true} assume true; {52282#true} is VALID [2022-04-15 11:36:21,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52282#true} {52282#true} #593#return; {52282#true} is VALID [2022-04-15 11:36:21,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {52282#true} call #t~ret158 := main(); {52282#true} is VALID [2022-04-15 11:36:21,751 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-15 11:36:21,751 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-15 11:36:21,751 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-15 11:36:21,751 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-15 11:36:21,751 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-15 11:36:21,751 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-15 11:36:21,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {52282#true} assume !false; {52282#true} is VALID [2022-04-15 11:36:21,751 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-15 11:36:21,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {52282#true} assume 12292 == #t~mem49;havoc #t~mem49; {52282#true} is VALID [2022-04-15 11:36:21,751 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-15 11:36:21,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {52282#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {52282#true} is VALID [2022-04-15 11:36:21,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {52282#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {52282#true} is VALID [2022-04-15 11:36:21,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {52282#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {52282#true} is VALID [2022-04-15 11:36:21,752 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-15 11:36:21,752 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-15 11:36:21,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {52282#true} assume !(0 == ~tmp___4~0); {52282#true} is VALID [2022-04-15 11:36:21,752 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-15 11:36:21,752 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-15 11:36:21,752 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-15 11:36:21,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {52282#true} ~skip~0 := 0; {52282#true} is VALID [2022-04-15 11:36:21,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {52282#true} assume !false; {52282#true} is VALID [2022-04-15 11:36:21,752 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-15 11:36:21,752 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-15 11:36:21,753 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-15 11:36:21,753 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-15 11:36:21,753 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-15 11:36:21,753 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-15 11:36:21,753 INFO L290 TraceCheckUtils]: 32: Hoare triple {52282#true} assume 4368 == #t~mem54;havoc #t~mem54; {52282#true} is VALID [2022-04-15 11:36:21,753 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-15 11:36:21,753 INFO L290 TraceCheckUtils]: 34: Hoare triple {52282#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {52282#true} is VALID [2022-04-15 11:36:21,753 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-15 11:36:21,753 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-15 11:36:21,753 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-15 11:36:21,753 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-15 11:36:21,753 INFO L290 TraceCheckUtils]: 39: Hoare triple {52282#true} ~skip~0 := 0; {52282#true} is VALID [2022-04-15 11:36:21,753 INFO L290 TraceCheckUtils]: 40: Hoare triple {52282#true} assume !false; {52282#true} is VALID [2022-04-15 11:36:21,753 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-15 11:36:21,754 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-15 11:36:21,754 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-15 11:36:21,754 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-15 11:36:21,754 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-15 11:36:21,754 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-15 11:36:21,754 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-15 11:36:21,754 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-15 11:36:21,754 INFO L290 TraceCheckUtils]: 49: Hoare triple {52282#true} assume 4384 == #t~mem56;havoc #t~mem56; {52282#true} is VALID [2022-04-15 11:36:21,754 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-15 11:36:21,754 INFO L290 TraceCheckUtils]: 51: Hoare triple {52282#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {52282#true} is VALID [2022-04-15 11:36:21,754 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-15 11:36:21,754 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-15 11:36:21,754 INFO L290 TraceCheckUtils]: 54: Hoare triple {52282#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {52282#true} is VALID [2022-04-15 11:36:21,754 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-15 11:36:21,755 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-15 11:36:21,755 INFO L290 TraceCheckUtils]: 57: Hoare triple {52282#true} ~skip~0 := 0; {52282#true} is VALID [2022-04-15 11:36:21,755 INFO L290 TraceCheckUtils]: 58: Hoare triple {52282#true} assume !false; {52282#true} is VALID [2022-04-15 11:36:21,755 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-15 11:36:21,755 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-15 11:36:21,755 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-15 11:36:21,755 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-15 11:36:21,755 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-15 11:36:21,755 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-15 11:36:21,755 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-15 11:36:21,755 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-15 11:36:21,755 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-15 11:36:21,755 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-15 11:36:21,755 INFO L290 TraceCheckUtils]: 69: Hoare triple {52282#true} assume 4400 == #t~mem58;havoc #t~mem58; {52282#true} is VALID [2022-04-15 11:36:21,756 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-15 11:36:21,756 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-15 11:36:21,756 INFO L290 TraceCheckUtils]: 72: Hoare triple {52282#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {52282#true} is VALID [2022-04-15 11:36:21,756 INFO L290 TraceCheckUtils]: 73: Hoare triple {52282#true} assume !(~ret~0 <= 0); {52282#true} is VALID [2022-04-15 11:36:21,756 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-15 11:36:21,756 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-15 11:36:21,756 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-15 11:36:21,756 INFO L290 TraceCheckUtils]: 77: Hoare triple {52282#true} ~skip~0 := 0; {52282#true} is VALID [2022-04-15 11:36:21,756 INFO L290 TraceCheckUtils]: 78: Hoare triple {52282#true} assume !false; {52282#true} is VALID [2022-04-15 11:36:21,756 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-15 11:36:21,756 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-15 11:36:21,756 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-15 11:36:21,756 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-15 11:36:21,756 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-15 11:36:21,757 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-15 11:36:21,757 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-15 11:36:21,757 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-15 11:36:21,757 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-15 11:36:21,757 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-15 11:36:21,757 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-15 11:36:21,757 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-15 11:36:21,757 INFO L290 TraceCheckUtils]: 91: Hoare triple {52282#true} assume 4416 == #t~mem60;havoc #t~mem60; {52282#true} is VALID [2022-04-15 11:36:21,757 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-15 11:36:21,757 INFO L290 TraceCheckUtils]: 93: Hoare triple {52282#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {52282#true} is VALID [2022-04-15 11:36:21,758 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-15 11:36:21,758 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-15 11:36:21,759 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-15 11:36:21,759 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-15 11:36:21,759 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-15 11:36:21,759 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-15 11:36:21,760 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-15 11:36:21,760 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-15 11:36:21,760 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-15 11:36:21,760 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-15 11:36:21,761 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-15 11:36:21,761 INFO L290 TraceCheckUtils]: 105: Hoare triple {52283#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {52283#false} is VALID [2022-04-15 11:36:21,761 INFO L290 TraceCheckUtils]: 106: Hoare triple {52283#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {52283#false} is VALID [2022-04-15 11:36:21,761 INFO L290 TraceCheckUtils]: 107: Hoare triple {52283#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {52283#false} is VALID [2022-04-15 11:36:21,761 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-15 11:36:21,761 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-15 11:36:21,761 INFO L290 TraceCheckUtils]: 110: Hoare triple {52283#false} assume !(0 == ~tmp___4~0); {52283#false} is VALID [2022-04-15 11:36:21,761 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-15 11:36:21,761 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-15 11:36:21,761 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-15 11:36:21,762 INFO L290 TraceCheckUtils]: 114: Hoare triple {52283#false} ~skip~0 := 0; {52283#false} is VALID [2022-04-15 11:36:21,762 INFO L290 TraceCheckUtils]: 115: Hoare triple {52283#false} assume !false; {52283#false} is VALID [2022-04-15 11:36:21,762 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-15 11:36:21,762 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-15 11:36:21,762 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-15 11:36:21,762 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-15 11:36:21,762 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-15 11:36:21,762 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-15 11:36:21,762 INFO L290 TraceCheckUtils]: 122: Hoare triple {52283#false} assume 4368 == #t~mem54;havoc #t~mem54; {52283#false} is VALID [2022-04-15 11:36:21,762 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-15 11:36:21,762 INFO L290 TraceCheckUtils]: 124: Hoare triple {52283#false} assume !(0 == ~blastFlag~0); {52283#false} is VALID [2022-04-15 11:36:21,762 INFO L290 TraceCheckUtils]: 125: Hoare triple {52283#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {52283#false} is VALID [2022-04-15 11:36:21,762 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-15 11:36:21,763 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-15 11:36:21,763 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-15 11:36:21,763 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-15 11:36:21,763 INFO L290 TraceCheckUtils]: 130: Hoare triple {52283#false} ~skip~0 := 0; {52283#false} is VALID [2022-04-15 11:36:21,763 INFO L290 TraceCheckUtils]: 131: Hoare triple {52283#false} assume !false; {52283#false} is VALID [2022-04-15 11:36:21,763 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-15 11:36:21,763 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-15 11:36:21,763 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-15 11:36:21,763 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-15 11:36:21,763 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-15 11:36:21,763 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-15 11:36:21,763 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-15 11:36:21,763 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-15 11:36:21,763 INFO L290 TraceCheckUtils]: 140: Hoare triple {52283#false} assume 4384 == #t~mem56;havoc #t~mem56; {52283#false} is VALID [2022-04-15 11:36:21,764 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-15 11:36:21,764 INFO L290 TraceCheckUtils]: 142: Hoare triple {52283#false} assume !(1 == ~blastFlag~0); {52283#false} is VALID [2022-04-15 11:36:21,764 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-15 11:36:21,764 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-15 11:36:21,764 INFO L290 TraceCheckUtils]: 145: Hoare triple {52283#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {52283#false} is VALID [2022-04-15 11:36:21,764 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-15 11:36:21,764 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-15 11:36:21,764 INFO L290 TraceCheckUtils]: 148: Hoare triple {52283#false} ~skip~0 := 0; {52283#false} is VALID [2022-04-15 11:36:21,764 INFO L290 TraceCheckUtils]: 149: Hoare triple {52283#false} assume !false; {52283#false} is VALID [2022-04-15 11:36:21,764 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-15 11:36:21,764 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-15 11:36:21,764 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-15 11:36:21,764 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-15 11:36:21,764 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-15 11:36:21,764 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-15 11:36:21,765 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-15 11:36:21,765 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-15 11:36:21,765 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-15 11:36:21,765 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-15 11:36:21,765 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-15 11:36:21,765 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-15 11:36:21,765 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-15 11:36:21,765 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-15 11:36:21,765 INFO L290 TraceCheckUtils]: 164: Hoare triple {52283#false} assume 4432 == #t~mem62;havoc #t~mem62; {52283#false} is VALID [2022-04-15 11:36:21,765 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-15 11:36:21,765 INFO L290 TraceCheckUtils]: 166: Hoare triple {52283#false} assume 5 == ~blastFlag~0; {52283#false} is VALID [2022-04-15 11:36:21,765 INFO L290 TraceCheckUtils]: 167: Hoare triple {52283#false} assume !false; {52283#false} is VALID [2022-04-15 11:36:21,766 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-15 11:36:21,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:36:21,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187823628] [2022-04-15 11:36:21,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187823628] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:21,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:21,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:36:21,766 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:36:21,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [45188642] [2022-04-15 11:36:21,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [45188642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:21,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:21,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:36:21,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226448795] [2022-04-15 11:36:21,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:36:21,767 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-15 11:36:21,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:36:21,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:21,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:21,841 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:36:21,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:21,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:36:21,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:36:21,842 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-15 11:36:23,861 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:36:25,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:25,249 INFO L93 Difference]: Finished difference Result 1897 states and 2744 transitions. [2022-04-15 11:36:25,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:36:25,249 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-15 11:36:25,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:36:25,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:25,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-15 11:36:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:25,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-15 11:36:25,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 463 transitions. [2022-04-15 11:36:25,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 463 edges. 463 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:25,532 INFO L225 Difference]: With dead ends: 1897 [2022-04-15 11:36:25,532 INFO L226 Difference]: Without dead ends: 1096 [2022-04-15 11:36:25,533 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:36:25,534 INFO L913 BasicCegarLoop]: 237 mSDtfsCounter, 98 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:36:25,534 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 563 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 530 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:36:25,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2022-04-15 11:36:25,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 817. [2022-04-15 11:36:25,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:36:25,565 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-15 11:36:25,565 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-15 11:36:25,566 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-15 11:36:25,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:25,596 INFO L93 Difference]: Finished difference Result 1096 states and 1583 transitions. [2022-04-15 11:36:25,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1583 transitions. [2022-04-15 11:36:25,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:25,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:25,598 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-15 11:36:25,598 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-15 11:36:25,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:25,629 INFO L93 Difference]: Finished difference Result 1096 states and 1583 transitions. [2022-04-15 11:36:25,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1583 transitions. [2022-04-15 11:36:25,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:25,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:25,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:36:25,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:36:25,631 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-15 11:36:25,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1173 transitions. [2022-04-15 11:36:25,656 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1173 transitions. Word has length 168 [2022-04-15 11:36:25,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:36:25,656 INFO L478 AbstractCegarLoop]: Abstraction has 817 states and 1173 transitions. [2022-04-15 11:36:25,656 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:25,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 817 states and 1173 transitions. [2022-04-15 11:36:26,643 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-15 11:36:26,643 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1173 transitions. [2022-04-15 11:36:26,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-04-15 11:36:26,644 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:36:26,644 INFO L499 BasicCegarLoop]: 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-15 11:36:26,644 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 11:36:26,644 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:36:26,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:36:26,645 INFO L85 PathProgramCache]: Analyzing trace with hash -223230462, now seen corresponding path program 1 times [2022-04-15 11:36:26,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:26,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [920946507] [2022-04-15 11:36:41,006 WARN L232 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 11:36:47,781 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:36:47,781 INFO L85 PathProgramCache]: Analyzing trace with hash -223230462, now seen corresponding path program 2 times [2022-04-15 11:36:47,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:36:47,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825000096] [2022-04-15 11:36:47,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:36:47,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:36:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:48,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:36:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:48,057 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-15 11:36:48,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {59914#true} assume true; {59914#true} is VALID [2022-04-15 11:36:48,057 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59914#true} {59914#true} #593#return; {59914#true} is VALID [2022-04-15 11:36:48,058 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-15 11:36:48,058 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-15 11:36:48,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {59914#true} assume true; {59914#true} is VALID [2022-04-15 11:36:48,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59914#true} {59914#true} #593#return; {59914#true} is VALID [2022-04-15 11:36:48,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {59914#true} call #t~ret158 := main(); {59914#true} is VALID [2022-04-15 11:36:48,058 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-15 11:36:48,058 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-15 11:36:48,059 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-15 11:36:48,059 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-15 11:36:48,059 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-15 11:36:48,059 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-15 11:36:48,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {59914#true} assume !false; {59914#true} is VALID [2022-04-15 11:36:48,059 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-15 11:36:48,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {59914#true} assume 12292 == #t~mem49;havoc #t~mem49; {59914#true} is VALID [2022-04-15 11:36:48,059 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-15 11:36:48,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {59914#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {59914#true} is VALID [2022-04-15 11:36:48,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {59914#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {59914#true} is VALID [2022-04-15 11:36:48,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {59914#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {59914#true} is VALID [2022-04-15 11:36:48,059 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-15 11:36:48,059 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-15 11:36:48,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {59914#true} assume !(0 == ~tmp___4~0); {59914#true} is VALID [2022-04-15 11:36:48,060 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-15 11:36:48,060 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-15 11:36:48,060 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-15 11:36:48,060 INFO L290 TraceCheckUtils]: 24: Hoare triple {59914#true} ~skip~0 := 0; {59914#true} is VALID [2022-04-15 11:36:48,060 INFO L290 TraceCheckUtils]: 25: Hoare triple {59914#true} assume !false; {59914#true} is VALID [2022-04-15 11:36:48,060 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-15 11:36:48,060 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-15 11:36:48,060 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-15 11:36:48,060 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-15 11:36:48,060 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-15 11:36:48,060 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-15 11:36:48,060 INFO L290 TraceCheckUtils]: 32: Hoare triple {59914#true} assume 4368 == #t~mem54;havoc #t~mem54; {59914#true} is VALID [2022-04-15 11:36:48,060 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-15 11:36:48,060 INFO L290 TraceCheckUtils]: 34: Hoare triple {59914#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {59914#true} is VALID [2022-04-15 11:36:48,061 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-15 11:36:48,061 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-15 11:36:48,061 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-15 11:36:48,061 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-15 11:36:48,061 INFO L290 TraceCheckUtils]: 39: Hoare triple {59914#true} ~skip~0 := 0; {59914#true} is VALID [2022-04-15 11:36:48,061 INFO L290 TraceCheckUtils]: 40: Hoare triple {59914#true} assume !false; {59914#true} is VALID [2022-04-15 11:36:48,061 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-15 11:36:48,061 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-15 11:36:48,061 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-15 11:36:48,061 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-15 11:36:48,061 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-15 11:36:48,061 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-15 11:36:48,061 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-15 11:36:48,061 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-15 11:36:48,062 INFO L290 TraceCheckUtils]: 49: Hoare triple {59914#true} assume 4384 == #t~mem56;havoc #t~mem56; {59914#true} is VALID [2022-04-15 11:36:48,062 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-15 11:36:48,062 INFO L290 TraceCheckUtils]: 51: Hoare triple {59914#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {59914#true} is VALID [2022-04-15 11:36:48,062 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-15 11:36:48,062 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-15 11:36:48,062 INFO L290 TraceCheckUtils]: 54: Hoare triple {59914#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {59914#true} is VALID [2022-04-15 11:36:48,062 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-15 11:36:48,062 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-15 11:36:48,062 INFO L290 TraceCheckUtils]: 57: Hoare triple {59914#true} ~skip~0 := 0; {59914#true} is VALID [2022-04-15 11:36:48,062 INFO L290 TraceCheckUtils]: 58: Hoare triple {59914#true} assume !false; {59914#true} is VALID [2022-04-15 11:36:48,062 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-15 11:36:48,062 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-15 11:36:48,062 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-15 11:36:48,062 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-15 11:36:48,063 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-15 11:36:48,063 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-15 11:36:48,063 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-15 11:36:48,063 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-15 11:36:48,063 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-15 11:36:48,063 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-15 11:36:48,063 INFO L290 TraceCheckUtils]: 69: Hoare triple {59914#true} assume 4400 == #t~mem58;havoc #t~mem58; {59914#true} is VALID [2022-04-15 11:36:48,063 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-15 11:36:48,063 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-15 11:36:48,063 INFO L290 TraceCheckUtils]: 72: Hoare triple {59914#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {59914#true} is VALID [2022-04-15 11:36:48,063 INFO L290 TraceCheckUtils]: 73: Hoare triple {59914#true} assume !(~ret~0 <= 0); {59914#true} is VALID [2022-04-15 11:36:48,063 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-15 11:36:48,063 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-15 11:36:48,063 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-15 11:36:48,063 INFO L290 TraceCheckUtils]: 77: Hoare triple {59914#true} ~skip~0 := 0; {59914#true} is VALID [2022-04-15 11:36:48,064 INFO L290 TraceCheckUtils]: 78: Hoare triple {59914#true} assume !false; {59914#true} is VALID [2022-04-15 11:36:48,064 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-15 11:36:48,064 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-15 11:36:48,064 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-15 11:36:48,064 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-15 11:36:48,064 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-15 11:36:48,064 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-15 11:36:48,064 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-15 11:36:48,064 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-15 11:36:48,064 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-15 11:36:48,064 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-15 11:36:48,064 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-15 11:36:48,064 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-15 11:36:48,064 INFO L290 TraceCheckUtils]: 91: Hoare triple {59914#true} assume 4416 == #t~mem60;havoc #t~mem60; {59914#true} is VALID [2022-04-15 11:36:48,065 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-15 11:36:48,065 INFO L290 TraceCheckUtils]: 93: Hoare triple {59914#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {59914#true} is VALID [2022-04-15 11:36:48,065 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-15 11:36:48,066 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-15 11:36:48,066 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-15 11:36:48,066 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-15 11:36:48,067 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-15 11:36:48,067 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-15 11:36:48,067 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-15 11:36:48,067 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-15 11:36:48,068 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-15 11:36:48,068 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-15 11:36:48,068 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-15 11:36:48,068 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-15 11:36:48,069 INFO L290 TraceCheckUtils]: 106: Hoare triple {59915#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {59915#false} is VALID [2022-04-15 11:36:48,069 INFO L290 TraceCheckUtils]: 107: Hoare triple {59915#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {59915#false} is VALID [2022-04-15 11:36:48,069 INFO L290 TraceCheckUtils]: 108: Hoare triple {59915#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {59915#false} is VALID [2022-04-15 11:36:48,069 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-15 11:36:48,069 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-15 11:36:48,069 INFO L290 TraceCheckUtils]: 111: Hoare triple {59915#false} assume !(0 == ~tmp___4~0); {59915#false} is VALID [2022-04-15 11:36:48,069 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-15 11:36:48,069 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-15 11:36:48,069 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-15 11:36:48,069 INFO L290 TraceCheckUtils]: 115: Hoare triple {59915#false} ~skip~0 := 0; {59915#false} is VALID [2022-04-15 11:36:48,069 INFO L290 TraceCheckUtils]: 116: Hoare triple {59915#false} assume !false; {59915#false} is VALID [2022-04-15 11:36:48,069 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-15 11:36:48,069 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-15 11:36:48,069 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-15 11:36:48,070 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-15 11:36:48,070 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-15 11:36:48,070 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-15 11:36:48,070 INFO L290 TraceCheckUtils]: 123: Hoare triple {59915#false} assume 4368 == #t~mem54;havoc #t~mem54; {59915#false} is VALID [2022-04-15 11:36:48,070 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-15 11:36:48,070 INFO L290 TraceCheckUtils]: 125: Hoare triple {59915#false} assume !(0 == ~blastFlag~0); {59915#false} is VALID [2022-04-15 11:36:48,070 INFO L290 TraceCheckUtils]: 126: Hoare triple {59915#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {59915#false} is VALID [2022-04-15 11:36:48,072 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-15 11:36:48,072 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-15 11:36:48,072 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-15 11:36:48,073 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-15 11:36:48,073 INFO L290 TraceCheckUtils]: 131: Hoare triple {59915#false} ~skip~0 := 0; {59915#false} is VALID [2022-04-15 11:36:48,073 INFO L290 TraceCheckUtils]: 132: Hoare triple {59915#false} assume !false; {59915#false} is VALID [2022-04-15 11:36:48,073 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-15 11:36:48,073 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-15 11:36:48,073 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-15 11:36:48,073 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-15 11:36:48,073 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-15 11:36:48,073 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-15 11:36:48,073 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-15 11:36:48,073 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-15 11:36:48,073 INFO L290 TraceCheckUtils]: 141: Hoare triple {59915#false} assume 4384 == #t~mem56;havoc #t~mem56; {59915#false} is VALID [2022-04-15 11:36:48,073 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-15 11:36:48,073 INFO L290 TraceCheckUtils]: 143: Hoare triple {59915#false} assume !(1 == ~blastFlag~0); {59915#false} is VALID [2022-04-15 11:36:48,074 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-15 11:36:48,074 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-15 11:36:48,074 INFO L290 TraceCheckUtils]: 146: Hoare triple {59915#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {59915#false} is VALID [2022-04-15 11:36:48,074 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-15 11:36:48,074 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-15 11:36:48,074 INFO L290 TraceCheckUtils]: 149: Hoare triple {59915#false} ~skip~0 := 0; {59915#false} is VALID [2022-04-15 11:36:48,074 INFO L290 TraceCheckUtils]: 150: Hoare triple {59915#false} assume !false; {59915#false} is VALID [2022-04-15 11:36:48,074 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-15 11:36:48,074 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-15 11:36:48,074 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-15 11:36:48,074 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-15 11:36:48,074 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-15 11:36:48,074 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-15 11:36:48,074 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-15 11:36:48,075 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-15 11:36:48,075 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-15 11:36:48,075 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-15 11:36:48,075 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-15 11:36:48,075 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-15 11:36:48,075 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-15 11:36:48,075 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-15 11:36:48,075 INFO L290 TraceCheckUtils]: 165: Hoare triple {59915#false} assume 4432 == #t~mem62;havoc #t~mem62; {59915#false} is VALID [2022-04-15 11:36:48,075 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-15 11:36:48,075 INFO L290 TraceCheckUtils]: 167: Hoare triple {59915#false} assume 5 == ~blastFlag~0; {59915#false} is VALID [2022-04-15 11:36:48,075 INFO L290 TraceCheckUtils]: 168: Hoare triple {59915#false} assume !false; {59915#false} is VALID [2022-04-15 11:36:48,076 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-15 11:36:48,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:36:48,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825000096] [2022-04-15 11:36:48,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825000096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:48,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:48,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:36:48,076 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:36:48,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [920946507] [2022-04-15 11:36:48,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [920946507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:48,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:48,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:36:48,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407409143] [2022-04-15 11:36:48,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:36:48,077 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-15 11:36:48,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:36:48,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:48,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:48,155 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:36:48,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:48,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:36:48,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:36:48,155 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-15 11:36:50,175 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:36:51,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:51,284 INFO L93 Difference]: Finished difference Result 2002 states and 2895 transitions. [2022-04-15 11:36:51,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:36:51,284 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-15 11:36:51,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:36:51,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:51,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-15 11:36:51,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:51,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-15 11:36:51,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-15 11:36:51,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:51,675 INFO L225 Difference]: With dead ends: 2002 [2022-04-15 11:36:51,675 INFO L226 Difference]: Without dead ends: 1201 [2022-04-15 11:36:51,676 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:36:51,677 INFO L913 BasicCegarLoop]: 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-15 11:36:51,677 INFO L914 BasicCegarLoop]: 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-15 11:36:51,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2022-04-15 11:36:51,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 827. [2022-04-15 11:36:51,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:36:51,711 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-15 11:36:51,712 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-15 11:36:51,712 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-15 11:36:51,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:51,748 INFO L93 Difference]: Finished difference Result 1201 states and 1728 transitions. [2022-04-15 11:36:51,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1728 transitions. [2022-04-15 11:36:51,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:51,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:51,749 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-15 11:36:51,750 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-15 11:36:51,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:51,786 INFO L93 Difference]: Finished difference Result 1201 states and 1728 transitions. [2022-04-15 11:36:51,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1728 transitions. [2022-04-15 11:36:51,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:51,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:51,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:36:51,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:36:51,788 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-15 11:36:51,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1179 transitions. [2022-04-15 11:36:51,815 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1179 transitions. Word has length 169 [2022-04-15 11:36:51,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:36:51,815 INFO L478 AbstractCegarLoop]: Abstraction has 827 states and 1179 transitions. [2022-04-15 11:36:51,815 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:51,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 827 states and 1179 transitions. [2022-04-15 11:36:52,768 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-15 11:36:52,768 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1179 transitions. [2022-04-15 11:36:52,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-15 11:36:52,770 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:36:52,770 INFO L499 BasicCegarLoop]: 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-15 11:36:52,770 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 11:36:52,770 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:36:52,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:36:52,770 INFO L85 PathProgramCache]: Analyzing trace with hash -310692014, now seen corresponding path program 3 times [2022-04-15 11:36:52,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:52,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1272846682] [2022-04-15 11:37:11,871 WARN L232 SmtUtils]: Spent 13.75s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 11:37:19,863 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:37:19,863 INFO L85 PathProgramCache]: Analyzing trace with hash -310692014, now seen corresponding path program 4 times [2022-04-15 11:37:19,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:37:19,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059384533] [2022-04-15 11:37:19,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:37:19,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:37:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:20,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:37:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:20,024 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-15 11:37:20,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {67986#true} assume true; {67986#true} is VALID [2022-04-15 11:37:20,024 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67986#true} {67986#true} #593#return; {67986#true} is VALID [2022-04-15 11:37:20,025 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-15 11:37:20,025 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-15 11:37:20,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {67986#true} assume true; {67986#true} is VALID [2022-04-15 11:37:20,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67986#true} {67986#true} #593#return; {67986#true} is VALID [2022-04-15 11:37:20,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {67986#true} call #t~ret158 := main(); {67986#true} is VALID [2022-04-15 11:37:20,025 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-15 11:37:20,025 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-15 11:37:20,025 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-15 11:37:20,025 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-15 11:37:20,025 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-15 11:37:20,025 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-15 11:37:20,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {67986#true} assume !false; {67986#true} is VALID [2022-04-15 11:37:20,026 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-15 11:37:20,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {67986#true} assume 12292 == #t~mem49;havoc #t~mem49; {67986#true} is VALID [2022-04-15 11:37:20,026 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-15 11:37:20,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {67986#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {67986#true} is VALID [2022-04-15 11:37:20,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {67986#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {67986#true} is VALID [2022-04-15 11:37:20,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {67986#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {67986#true} is VALID [2022-04-15 11:37:20,026 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-15 11:37:20,026 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-15 11:37:20,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {67986#true} assume !(0 == ~tmp___4~0); {67986#true} is VALID [2022-04-15 11:37:20,026 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-15 11:37:20,026 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-15 11:37:20,026 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-15 11:37:20,026 INFO L290 TraceCheckUtils]: 24: Hoare triple {67986#true} ~skip~0 := 0; {67986#true} is VALID [2022-04-15 11:37:20,026 INFO L290 TraceCheckUtils]: 25: Hoare triple {67986#true} assume !false; {67986#true} is VALID [2022-04-15 11:37:20,027 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-15 11:37:20,027 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-15 11:37:20,027 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-15 11:37:20,027 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-15 11:37:20,027 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-15 11:37:20,027 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-15 11:37:20,027 INFO L290 TraceCheckUtils]: 32: Hoare triple {67986#true} assume 4368 == #t~mem54;havoc #t~mem54; {67986#true} is VALID [2022-04-15 11:37:20,027 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-15 11:37:20,027 INFO L290 TraceCheckUtils]: 34: Hoare triple {67986#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {67986#true} is VALID [2022-04-15 11:37:20,027 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-15 11:37:20,027 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-15 11:37:20,027 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-15 11:37:20,027 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-15 11:37:20,027 INFO L290 TraceCheckUtils]: 39: Hoare triple {67986#true} ~skip~0 := 0; {67986#true} is VALID [2022-04-15 11:37:20,027 INFO L290 TraceCheckUtils]: 40: Hoare triple {67986#true} assume !false; {67986#true} is VALID [2022-04-15 11:37:20,028 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-15 11:37:20,028 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-15 11:37:20,028 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-15 11:37:20,028 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-15 11:37:20,028 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-15 11:37:20,028 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-15 11:37:20,028 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-15 11:37:20,028 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-15 11:37:20,028 INFO L290 TraceCheckUtils]: 49: Hoare triple {67986#true} assume 4384 == #t~mem56;havoc #t~mem56; {67986#true} is VALID [2022-04-15 11:37:20,028 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-15 11:37:20,028 INFO L290 TraceCheckUtils]: 51: Hoare triple {67986#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {67986#true} is VALID [2022-04-15 11:37:20,028 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-15 11:37:20,028 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-15 11:37:20,028 INFO L290 TraceCheckUtils]: 54: Hoare triple {67986#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {67986#true} is VALID [2022-04-15 11:37:20,029 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-15 11:37:20,029 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-15 11:37:20,029 INFO L290 TraceCheckUtils]: 57: Hoare triple {67986#true} ~skip~0 := 0; {67986#true} is VALID [2022-04-15 11:37:20,029 INFO L290 TraceCheckUtils]: 58: Hoare triple {67986#true} assume !false; {67986#true} is VALID [2022-04-15 11:37:20,029 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-15 11:37:20,029 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-15 11:37:20,029 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-15 11:37:20,029 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-15 11:37:20,029 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-15 11:37:20,029 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-15 11:37:20,029 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-15 11:37:20,029 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-15 11:37:20,029 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-15 11:37:20,029 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-15 11:37:20,030 INFO L290 TraceCheckUtils]: 69: Hoare triple {67986#true} assume 4400 == #t~mem58;havoc #t~mem58; {67986#true} is VALID [2022-04-15 11:37:20,030 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-15 11:37:20,030 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-15 11:37:20,030 INFO L290 TraceCheckUtils]: 72: Hoare triple {67986#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {67986#true} is VALID [2022-04-15 11:37:20,030 INFO L290 TraceCheckUtils]: 73: Hoare triple {67986#true} assume !(~ret~0 <= 0); {67986#true} is VALID [2022-04-15 11:37:20,030 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-15 11:37:20,030 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-15 11:37:20,030 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-15 11:37:20,030 INFO L290 TraceCheckUtils]: 77: Hoare triple {67986#true} ~skip~0 := 0; {67986#true} is VALID [2022-04-15 11:37:20,030 INFO L290 TraceCheckUtils]: 78: Hoare triple {67986#true} assume !false; {67986#true} is VALID [2022-04-15 11:37:20,030 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-15 11:37:20,030 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-15 11:37:20,030 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-15 11:37:20,030 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-15 11:37:20,031 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-15 11:37:20,031 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-15 11:37:20,031 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-15 11:37:20,031 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-15 11:37:20,031 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-15 11:37:20,031 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-15 11:37:20,031 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-15 11:37:20,031 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-15 11:37:20,031 INFO L290 TraceCheckUtils]: 91: Hoare triple {67986#true} assume 4416 == #t~mem60;havoc #t~mem60; {67986#true} is VALID [2022-04-15 11:37:20,031 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-15 11:37:20,031 INFO L290 TraceCheckUtils]: 93: Hoare triple {67986#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {67986#true} is VALID [2022-04-15 11:37:20,032 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-15 11:37:20,033 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-15 11:37:20,033 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-15 11:37:20,033 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-15 11:37:20,034 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-15 11:37:20,034 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-15 11:37:20,034 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-15 11:37:20,035 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-15 11:37:20,035 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-15 11:37:20,035 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-15 11:37:20,036 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-15 11:37:20,036 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-15 11:37:20,036 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-15 11:37:20,037 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-15 11:37:20,037 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-15 11:37:20,037 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-15 11:37:20,037 INFO L290 TraceCheckUtils]: 110: Hoare triple {67987#false} assume !(1 == ~blastFlag~0); {67987#false} is VALID [2022-04-15 11:37:20,037 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-15 11:37:20,037 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-15 11:37:20,037 INFO L290 TraceCheckUtils]: 113: Hoare triple {67987#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {67987#false} is VALID [2022-04-15 11:37:20,037 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-15 11:37:20,037 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-15 11:37:20,037 INFO L290 TraceCheckUtils]: 116: Hoare triple {67987#false} ~skip~0 := 0; {67987#false} is VALID [2022-04-15 11:37:20,038 INFO L290 TraceCheckUtils]: 117: Hoare triple {67987#false} assume !false; {67987#false} is VALID [2022-04-15 11:37:20,038 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-15 11:37:20,038 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-15 11:37:20,038 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-15 11:37:20,038 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-15 11:37:20,038 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-15 11:37:20,038 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-15 11:37:20,038 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-15 11:37:20,038 INFO L290 TraceCheckUtils]: 125: Hoare triple {67987#false} assume 4369 == #t~mem55;havoc #t~mem55; {67987#false} is VALID [2022-04-15 11:37:20,038 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-15 11:37:20,038 INFO L290 TraceCheckUtils]: 127: Hoare triple {67987#false} assume !(0 == ~blastFlag~0); {67987#false} is VALID [2022-04-15 11:37:20,038 INFO L290 TraceCheckUtils]: 128: Hoare triple {67987#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {67987#false} is VALID [2022-04-15 11:37:20,038 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-15 11:37:20,038 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-15 11:37:20,039 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-15 11:37:20,039 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-15 11:37:20,039 INFO L290 TraceCheckUtils]: 133: Hoare triple {67987#false} ~skip~0 := 0; {67987#false} is VALID [2022-04-15 11:37:20,039 INFO L290 TraceCheckUtils]: 134: Hoare triple {67987#false} assume !false; {67987#false} is VALID [2022-04-15 11:37:20,039 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-15 11:37:20,039 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-15 11:37:20,039 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-15 11:37:20,039 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-15 11:37:20,039 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-15 11:37:20,039 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-15 11:37:20,039 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-15 11:37:20,039 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-15 11:37:20,039 INFO L290 TraceCheckUtils]: 143: Hoare triple {67987#false} assume 4384 == #t~mem56;havoc #t~mem56; {67987#false} is VALID [2022-04-15 11:37:20,039 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-15 11:37:20,040 INFO L290 TraceCheckUtils]: 145: Hoare triple {67987#false} assume !(1 == ~blastFlag~0); {67987#false} is VALID [2022-04-15 11:37:20,040 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-15 11:37:20,040 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-15 11:37:20,040 INFO L290 TraceCheckUtils]: 148: Hoare triple {67987#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {67987#false} is VALID [2022-04-15 11:37:20,040 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-15 11:37:20,040 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-15 11:37:20,040 INFO L290 TraceCheckUtils]: 151: Hoare triple {67987#false} ~skip~0 := 0; {67987#false} is VALID [2022-04-15 11:37:20,040 INFO L290 TraceCheckUtils]: 152: Hoare triple {67987#false} assume !false; {67987#false} is VALID [2022-04-15 11:37:20,040 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-15 11:37:20,040 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-15 11:37:20,040 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-15 11:37:20,040 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-15 11:37:20,040 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-15 11:37:20,040 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-15 11:37:20,041 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-15 11:37:20,041 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-15 11:37:20,041 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-15 11:37:20,041 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-15 11:37:20,041 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-15 11:37:20,041 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-15 11:37:20,041 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-15 11:37:20,041 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-15 11:37:20,041 INFO L290 TraceCheckUtils]: 167: Hoare triple {67987#false} assume 4432 == #t~mem62;havoc #t~mem62; {67987#false} is VALID [2022-04-15 11:37:20,041 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-15 11:37:20,041 INFO L290 TraceCheckUtils]: 169: Hoare triple {67987#false} assume 5 == ~blastFlag~0; {67987#false} is VALID [2022-04-15 11:37:20,041 INFO L290 TraceCheckUtils]: 170: Hoare triple {67987#false} assume !false; {67987#false} is VALID [2022-04-15 11:37:20,042 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-15 11:37:20,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:37:20,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059384533] [2022-04-15 11:37:20,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059384533] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:20,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:20,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:37:20,042 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:37:20,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1272846682] [2022-04-15 11:37:20,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1272846682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:20,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:20,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:37:20,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000642168] [2022-04-15 11:37:20,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:37:20,043 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-15 11:37:20,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:37:20,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:20,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:20,118 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:37:20,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:20,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:37:20,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:37:20,119 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-15 11:37:22,139 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:37:23,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:23,173 INFO L93 Difference]: Finished difference Result 2012 states and 2887 transitions. [2022-04-15 11:37:23,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:37:23,173 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-15 11:37:23,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:37:23,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:23,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-15 11:37:23,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:23,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-15 11:37:23,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-15 11:37:23,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:23,487 INFO L225 Difference]: With dead ends: 2012 [2022-04-15 11:37:23,487 INFO L226 Difference]: Without dead ends: 1201 [2022-04-15 11:37:23,489 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:37:23,489 INFO L913 BasicCegarLoop]: 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-15 11:37:23,489 INFO L914 BasicCegarLoop]: 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-15 11:37:23,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2022-04-15 11:37:23,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 842. [2022-04-15 11:37:23,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:37:23,529 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-15 11:37:23,530 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-15 11:37:23,530 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-15 11:37:23,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:23,566 INFO L93 Difference]: Finished difference Result 1201 states and 1723 transitions. [2022-04-15 11:37:23,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1723 transitions. [2022-04-15 11:37:23,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:23,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:23,569 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-15 11:37:23,569 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-15 11:37:23,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:23,606 INFO L93 Difference]: Finished difference Result 1201 states and 1723 transitions. [2022-04-15 11:37:23,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1723 transitions. [2022-04-15 11:37:23,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:23,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:23,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:37:23,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:37:23,608 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-15 11:37:23,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1204 transitions. [2022-04-15 11:37:23,635 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1204 transitions. Word has length 171 [2022-04-15 11:37:23,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:37:23,635 INFO L478 AbstractCegarLoop]: Abstraction has 842 states and 1204 transitions. [2022-04-15 11:37:23,636 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:23,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 842 states and 1204 transitions. [2022-04-15 11:37:24,421 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-15 11:37:24,421 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1204 transitions. [2022-04-15 11:37:24,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-15 11:37:24,422 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:37:24,423 INFO L499 BasicCegarLoop]: 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-15 11:37:24,423 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 11:37:24,423 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:37:24,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:37:24,423 INFO L85 PathProgramCache]: Analyzing trace with hash -228612804, now seen corresponding path program 1 times [2022-04-15 11:37:24,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:24,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1446411223] [2022-04-15 11:37:37,222 WARN L232 SmtUtils]: Spent 6.65s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 11:37:43,659 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:37:43,660 INFO L85 PathProgramCache]: Analyzing trace with hash -228612804, now seen corresponding path program 2 times [2022-04-15 11:37:43,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:37:43,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786980050] [2022-04-15 11:37:43,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:37:43,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:37:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:43,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:37:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:43,811 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-15 11:37:43,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {76108#true} assume true; {76108#true} is VALID [2022-04-15 11:37:43,812 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76108#true} {76108#true} #593#return; {76108#true} is VALID [2022-04-15 11:37:43,812 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-15 11:37:43,812 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-15 11:37:43,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {76108#true} assume true; {76108#true} is VALID [2022-04-15 11:37:43,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76108#true} {76108#true} #593#return; {76108#true} is VALID [2022-04-15 11:37:43,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {76108#true} call #t~ret158 := main(); {76108#true} is VALID [2022-04-15 11:37:43,813 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-15 11:37:43,813 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-15 11:37:43,813 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-15 11:37:43,813 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-15 11:37:43,813 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-15 11:37:43,813 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-15 11:37:43,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {76108#true} assume !false; {76108#true} is VALID [2022-04-15 11:37:43,813 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-15 11:37:43,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {76108#true} assume 12292 == #t~mem49;havoc #t~mem49; {76108#true} is VALID [2022-04-15 11:37:43,813 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-15 11:37:43,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {76108#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {76108#true} is VALID [2022-04-15 11:37:43,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {76108#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {76108#true} is VALID [2022-04-15 11:37:43,814 INFO L290 TraceCheckUtils]: 17: Hoare triple {76108#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {76108#true} is VALID [2022-04-15 11:37:43,814 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-15 11:37:43,814 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-15 11:37:43,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {76108#true} assume !(0 == ~tmp___4~0); {76108#true} is VALID [2022-04-15 11:37:43,814 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-15 11:37:43,814 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-15 11:37:43,814 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-15 11:37:43,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {76108#true} ~skip~0 := 0; {76108#true} is VALID [2022-04-15 11:37:43,814 INFO L290 TraceCheckUtils]: 25: Hoare triple {76108#true} assume !false; {76108#true} is VALID [2022-04-15 11:37:43,814 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-15 11:37:43,814 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-15 11:37:43,814 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-15 11:37:43,814 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-15 11:37:43,815 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-15 11:37:43,815 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-15 11:37:43,815 INFO L290 TraceCheckUtils]: 32: Hoare triple {76108#true} assume 4368 == #t~mem54;havoc #t~mem54; {76108#true} is VALID [2022-04-15 11:37:43,815 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-15 11:37:43,815 INFO L290 TraceCheckUtils]: 34: Hoare triple {76108#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {76108#true} is VALID [2022-04-15 11:37:43,815 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-15 11:37:43,815 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-15 11:37:43,815 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-15 11:37:43,815 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-15 11:37:43,815 INFO L290 TraceCheckUtils]: 39: Hoare triple {76108#true} ~skip~0 := 0; {76108#true} is VALID [2022-04-15 11:37:43,815 INFO L290 TraceCheckUtils]: 40: Hoare triple {76108#true} assume !false; {76108#true} is VALID [2022-04-15 11:37:43,815 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-15 11:37:43,815 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-15 11:37:43,815 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-15 11:37:43,816 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-15 11:37:43,816 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-15 11:37:43,816 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-15 11:37:43,816 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-15 11:37:43,816 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-15 11:37:43,816 INFO L290 TraceCheckUtils]: 49: Hoare triple {76108#true} assume 4384 == #t~mem56;havoc #t~mem56; {76108#true} is VALID [2022-04-15 11:37:43,816 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-15 11:37:43,816 INFO L290 TraceCheckUtils]: 51: Hoare triple {76108#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {76108#true} is VALID [2022-04-15 11:37:43,816 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-15 11:37:43,816 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-15 11:37:43,816 INFO L290 TraceCheckUtils]: 54: Hoare triple {76108#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {76108#true} is VALID [2022-04-15 11:37:43,816 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-15 11:37:43,816 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-15 11:37:43,816 INFO L290 TraceCheckUtils]: 57: Hoare triple {76108#true} ~skip~0 := 0; {76108#true} is VALID [2022-04-15 11:37:43,817 INFO L290 TraceCheckUtils]: 58: Hoare triple {76108#true} assume !false; {76108#true} is VALID [2022-04-15 11:37:43,817 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-15 11:37:43,817 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-15 11:37:43,817 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-15 11:37:43,817 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-15 11:37:43,817 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-15 11:37:43,817 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-15 11:37:43,817 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-15 11:37:43,817 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-15 11:37:43,817 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-15 11:37:43,817 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-15 11:37:43,817 INFO L290 TraceCheckUtils]: 69: Hoare triple {76108#true} assume 4400 == #t~mem58;havoc #t~mem58; {76108#true} is VALID [2022-04-15 11:37:43,817 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-15 11:37:43,817 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-15 11:37:43,818 INFO L290 TraceCheckUtils]: 72: Hoare triple {76108#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {76108#true} is VALID [2022-04-15 11:37:43,818 INFO L290 TraceCheckUtils]: 73: Hoare triple {76108#true} assume !(~ret~0 <= 0); {76108#true} is VALID [2022-04-15 11:37:43,818 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-15 11:37:43,818 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-15 11:37:43,818 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-15 11:37:43,818 INFO L290 TraceCheckUtils]: 77: Hoare triple {76108#true} ~skip~0 := 0; {76108#true} is VALID [2022-04-15 11:37:43,818 INFO L290 TraceCheckUtils]: 78: Hoare triple {76108#true} assume !false; {76108#true} is VALID [2022-04-15 11:37:43,818 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-15 11:37:43,818 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-15 11:37:43,818 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-15 11:37:43,818 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-15 11:37:43,818 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-15 11:37:43,818 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-15 11:37:43,818 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-15 11:37:43,819 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-15 11:37:43,819 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-15 11:37:43,819 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-15 11:37:43,819 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-15 11:37:43,819 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-15 11:37:43,819 INFO L290 TraceCheckUtils]: 91: Hoare triple {76108#true} assume 4416 == #t~mem60;havoc #t~mem60; {76108#true} is VALID [2022-04-15 11:37:43,819 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-15 11:37:43,819 INFO L290 TraceCheckUtils]: 93: Hoare triple {76108#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {76108#true} is VALID [2022-04-15 11:37:43,820 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-15 11:37:43,820 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-15 11:37:43,820 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-15 11:37:43,821 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-15 11:37:43,821 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-15 11:37:43,821 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-15 11:37:43,821 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-15 11:37:43,822 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-15 11:37:43,822 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-15 11:37:43,822 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-15 11:37:43,822 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-15 11:37:43,823 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-15 11:37:43,823 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-15 11:37:43,823 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-15 11:37:43,823 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-15 11:37:43,824 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-15 11:37:43,824 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-15 11:37:43,824 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-15 11:37:43,824 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-15 11:37:43,824 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-15 11:37:43,824 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-15 11:37:43,824 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-15 11:37:43,824 INFO L290 TraceCheckUtils]: 116: Hoare triple {76109#false} ~skip~0 := 0; {76109#false} is VALID [2022-04-15 11:37:43,824 INFO L290 TraceCheckUtils]: 117: Hoare triple {76109#false} assume !false; {76109#false} is VALID [2022-04-15 11:37:43,825 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-15 11:37:43,825 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-15 11:37:43,825 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-15 11:37:43,825 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-15 11:37:43,825 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-15 11:37:43,825 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-15 11:37:43,825 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-15 11:37:43,825 INFO L290 TraceCheckUtils]: 125: Hoare triple {76109#false} assume 4369 == #t~mem55;havoc #t~mem55; {76109#false} is VALID [2022-04-15 11:37:43,825 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-15 11:37:43,825 INFO L290 TraceCheckUtils]: 127: Hoare triple {76109#false} assume !(0 == ~blastFlag~0); {76109#false} is VALID [2022-04-15 11:37:43,825 INFO L290 TraceCheckUtils]: 128: Hoare triple {76109#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {76109#false} is VALID [2022-04-15 11:37:43,825 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-15 11:37:43,825 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-15 11:37:43,826 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-15 11:37:43,826 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-15 11:37:43,826 INFO L290 TraceCheckUtils]: 133: Hoare triple {76109#false} ~skip~0 := 0; {76109#false} is VALID [2022-04-15 11:37:43,826 INFO L290 TraceCheckUtils]: 134: Hoare triple {76109#false} assume !false; {76109#false} is VALID [2022-04-15 11:37:43,826 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-15 11:37:43,826 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-15 11:37:43,826 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-15 11:37:43,826 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-15 11:37:43,826 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-15 11:37:43,826 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-15 11:37:43,826 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-15 11:37:43,826 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-15 11:37:43,826 INFO L290 TraceCheckUtils]: 143: Hoare triple {76109#false} assume 4384 == #t~mem56;havoc #t~mem56; {76109#false} is VALID [2022-04-15 11:37:43,826 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-15 11:37:43,827 INFO L290 TraceCheckUtils]: 145: Hoare triple {76109#false} assume !(1 == ~blastFlag~0); {76109#false} is VALID [2022-04-15 11:37:43,827 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-15 11:37:43,827 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-15 11:37:43,827 INFO L290 TraceCheckUtils]: 148: Hoare triple {76109#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {76109#false} is VALID [2022-04-15 11:37:43,827 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-15 11:37:43,827 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-15 11:37:43,827 INFO L290 TraceCheckUtils]: 151: Hoare triple {76109#false} ~skip~0 := 0; {76109#false} is VALID [2022-04-15 11:37:43,827 INFO L290 TraceCheckUtils]: 152: Hoare triple {76109#false} assume !false; {76109#false} is VALID [2022-04-15 11:37:43,827 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-15 11:37:43,827 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-15 11:37:43,827 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-15 11:37:43,827 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-15 11:37:43,827 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-15 11:37:43,827 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-15 11:37:43,828 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-15 11:37:43,828 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-15 11:37:43,828 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-15 11:37:43,828 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-15 11:37:43,828 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-15 11:37:43,828 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-15 11:37:43,828 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-15 11:37:43,828 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-15 11:37:43,828 INFO L290 TraceCheckUtils]: 167: Hoare triple {76109#false} assume 4432 == #t~mem62;havoc #t~mem62; {76109#false} is VALID [2022-04-15 11:37:43,828 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-15 11:37:43,828 INFO L290 TraceCheckUtils]: 169: Hoare triple {76109#false} assume 5 == ~blastFlag~0; {76109#false} is VALID [2022-04-15 11:37:43,828 INFO L290 TraceCheckUtils]: 170: Hoare triple {76109#false} assume !false; {76109#false} is VALID [2022-04-15 11:37:43,829 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-15 11:37:43,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:37:43,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786980050] [2022-04-15 11:37:43,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786980050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:43,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:43,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:37:43,829 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:37:43,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1446411223] [2022-04-15 11:37:43,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1446411223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:43,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:43,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:37:43,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801809211] [2022-04-15 11:37:43,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:37:43,830 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-15 11:37:43,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:37:43,830 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-15 11:37:43,924 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-15 11:37:43,924 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:37:43,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:43,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:37:43,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:37:43,925 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-15 11:37:47,912 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:37:49,917 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:37:51,945 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:37:53,966 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:37:55,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:55,141 INFO L93 Difference]: Finished difference Result 2122 states and 3037 transitions. [2022-04-15 11:37:55,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:37:55,142 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-15 11:37:55,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:37:55,142 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-15 11:37:55,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-15 11:37:55,144 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-15 11:37:55,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-15 11:37:55,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-15 11:37:55,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:55,482 INFO L225 Difference]: With dead ends: 2122 [2022-04-15 11:37:55,482 INFO L226 Difference]: Without dead ends: 1296 [2022-04-15 11:37:55,496 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:37:55,497 INFO L913 BasicCegarLoop]: 102 mSDtfsCounter, 108 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 44 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:37:55,497 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 288 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 390 Invalid, 3 Unknown, 0 Unchecked, 8.3s Time] [2022-04-15 11:37:55,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2022-04-15 11:37:55,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 947. [2022-04-15 11:37:55,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:37:55,559 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-15 11:37:55,560 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-15 11:37:55,561 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-15 11:37:55,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:55,601 INFO L93 Difference]: Finished difference Result 1296 states and 1848 transitions. [2022-04-15 11:37:55,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1848 transitions. [2022-04-15 11:37:55,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:55,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:55,604 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-15 11:37:55,604 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-15 11:37:55,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:55,646 INFO L93 Difference]: Finished difference Result 1296 states and 1848 transitions. [2022-04-15 11:37:55,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1848 transitions. [2022-04-15 11:37:55,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:55,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:55,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:37:55,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:37:55,649 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-15 11:37:55,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1349 transitions. [2022-04-15 11:37:55,693 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1349 transitions. Word has length 171 [2022-04-15 11:37:55,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:37:55,693 INFO L478 AbstractCegarLoop]: Abstraction has 947 states and 1349 transitions. [2022-04-15 11:37:55,693 INFO L479 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-15 11:37:55,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 947 states and 1349 transitions. [2022-04-15 11:37:56,940 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-15 11:37:56,940 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1349 transitions. [2022-04-15 11:37:56,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-04-15 11:37:56,942 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:37:56,942 INFO L499 BasicCegarLoop]: 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-15 11:37:56,942 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 11:37:56,942 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:37:56,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:37:56,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1837109397, now seen corresponding path program 1 times [2022-04-15 11:37:56,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:56,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [362958053] [2022-04-15 11:38:15,112 WARN L232 SmtUtils]: Spent 12.29s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 11:38:23,865 WARN L232 SmtUtils]: Spent 5.44s 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-15 11:38:25,858 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:38:25,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1837109397, now seen corresponding path program 2 times [2022-04-15 11:38:25,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:38:25,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693437379] [2022-04-15 11:38:25,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:38:25,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:38:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:26,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:38:26,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:26,010 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-15 11:38:26,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {84850#true} assume true; {84850#true} is VALID [2022-04-15 11:38:26,010 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {84850#true} {84850#true} #593#return; {84850#true} is VALID [2022-04-15 11:38:26,011 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-15 11:38:26,011 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-15 11:38:26,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {84850#true} assume true; {84850#true} is VALID [2022-04-15 11:38:26,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84850#true} {84850#true} #593#return; {84850#true} is VALID [2022-04-15 11:38:26,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {84850#true} call #t~ret158 := main(); {84850#true} is VALID [2022-04-15 11:38:26,011 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-15 11:38:26,011 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-15 11:38:26,012 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-15 11:38:26,012 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-15 11:38:26,012 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-15 11:38:26,012 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-15 11:38:26,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {84850#true} assume !false; {84850#true} is VALID [2022-04-15 11:38:26,012 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-15 11:38:26,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {84850#true} assume 12292 == #t~mem49;havoc #t~mem49; {84850#true} is VALID [2022-04-15 11:38:26,012 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-15 11:38:26,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {84850#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {84850#true} is VALID [2022-04-15 11:38:26,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {84850#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {84850#true} is VALID [2022-04-15 11:38:26,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {84850#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {84850#true} is VALID [2022-04-15 11:38:26,012 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-15 11:38:26,012 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-15 11:38:26,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {84850#true} assume !(0 == ~tmp___4~0); {84850#true} is VALID [2022-04-15 11:38:26,013 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-15 11:38:26,013 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-15 11:38:26,013 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-15 11:38:26,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {84850#true} ~skip~0 := 0; {84850#true} is VALID [2022-04-15 11:38:26,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {84850#true} assume !false; {84850#true} is VALID [2022-04-15 11:38:26,013 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-15 11:38:26,013 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-15 11:38:26,013 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-15 11:38:26,013 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-15 11:38:26,013 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-15 11:38:26,013 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-15 11:38:26,013 INFO L290 TraceCheckUtils]: 32: Hoare triple {84850#true} assume 4368 == #t~mem54;havoc #t~mem54; {84850#true} is VALID [2022-04-15 11:38:26,013 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-15 11:38:26,013 INFO L290 TraceCheckUtils]: 34: Hoare triple {84850#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {84850#true} is VALID [2022-04-15 11:38:26,013 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-15 11:38:26,014 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-15 11:38:26,014 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-15 11:38:26,014 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-15 11:38:26,014 INFO L290 TraceCheckUtils]: 39: Hoare triple {84850#true} ~skip~0 := 0; {84850#true} is VALID [2022-04-15 11:38:26,014 INFO L290 TraceCheckUtils]: 40: Hoare triple {84850#true} assume !false; {84850#true} is VALID [2022-04-15 11:38:26,014 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-15 11:38:26,014 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-15 11:38:26,014 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-15 11:38:26,014 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-15 11:38:26,014 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-15 11:38:26,014 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-15 11:38:26,014 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-15 11:38:26,014 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-15 11:38:26,014 INFO L290 TraceCheckUtils]: 49: Hoare triple {84850#true} assume 4384 == #t~mem56;havoc #t~mem56; {84850#true} is VALID [2022-04-15 11:38:26,015 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-15 11:38:26,015 INFO L290 TraceCheckUtils]: 51: Hoare triple {84850#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {84850#true} is VALID [2022-04-15 11:38:26,015 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-15 11:38:26,015 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-15 11:38:26,015 INFO L290 TraceCheckUtils]: 54: Hoare triple {84850#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {84850#true} is VALID [2022-04-15 11:38:26,015 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-15 11:38:26,015 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-15 11:38:26,015 INFO L290 TraceCheckUtils]: 57: Hoare triple {84850#true} ~skip~0 := 0; {84850#true} is VALID [2022-04-15 11:38:26,015 INFO L290 TraceCheckUtils]: 58: Hoare triple {84850#true} assume !false; {84850#true} is VALID [2022-04-15 11:38:26,015 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-15 11:38:26,015 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-15 11:38:26,015 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-15 11:38:26,015 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-15 11:38:26,015 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-15 11:38:26,016 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-15 11:38:26,016 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-15 11:38:26,016 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-15 11:38:26,016 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-15 11:38:26,016 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-15 11:38:26,016 INFO L290 TraceCheckUtils]: 69: Hoare triple {84850#true} assume 4400 == #t~mem58;havoc #t~mem58; {84850#true} is VALID [2022-04-15 11:38:26,016 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-15 11:38:26,016 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-15 11:38:26,016 INFO L290 TraceCheckUtils]: 72: Hoare triple {84850#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {84850#true} is VALID [2022-04-15 11:38:26,016 INFO L290 TraceCheckUtils]: 73: Hoare triple {84850#true} assume !(~ret~0 <= 0); {84850#true} is VALID [2022-04-15 11:38:26,016 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-15 11:38:26,016 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-15 11:38:26,016 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-15 11:38:26,016 INFO L290 TraceCheckUtils]: 77: Hoare triple {84850#true} ~skip~0 := 0; {84850#true} is VALID [2022-04-15 11:38:26,017 INFO L290 TraceCheckUtils]: 78: Hoare triple {84850#true} assume !false; {84850#true} is VALID [2022-04-15 11:38:26,017 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-15 11:38:26,017 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-15 11:38:26,017 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-15 11:38:26,017 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-15 11:38:26,017 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-15 11:38:26,017 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-15 11:38:26,017 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-15 11:38:26,017 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-15 11:38:26,017 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-15 11:38:26,017 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-15 11:38:26,017 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-15 11:38:26,017 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-15 11:38:26,017 INFO L290 TraceCheckUtils]: 91: Hoare triple {84850#true} assume 4416 == #t~mem60;havoc #t~mem60; {84850#true} is VALID [2022-04-15 11:38:26,018 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-15 11:38:26,018 INFO L290 TraceCheckUtils]: 93: Hoare triple {84850#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {84850#true} is VALID [2022-04-15 11:38:26,018 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-15 11:38:26,019 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-15 11:38:26,019 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-15 11:38:26,019 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-15 11:38:26,019 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-15 11:38:26,020 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-15 11:38:26,020 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-15 11:38:26,020 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-15 11:38:26,020 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-15 11:38:26,021 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-15 11:38:26,021 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-15 11:38:26,021 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-15 11:38:26,021 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-15 11:38:26,022 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-15 11:38:26,022 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-15 11:38:26,022 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-15 11:38:26,022 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-15 11:38:26,023 INFO L290 TraceCheckUtils]: 111: Hoare triple {84851#false} assume !(1 == ~blastFlag~0); {84851#false} is VALID [2022-04-15 11:38:26,023 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-15 11:38:26,023 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-15 11:38:26,023 INFO L290 TraceCheckUtils]: 114: Hoare triple {84851#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {84851#false} is VALID [2022-04-15 11:38:26,023 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-15 11:38:26,023 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-15 11:38:26,023 INFO L290 TraceCheckUtils]: 117: Hoare triple {84851#false} ~skip~0 := 0; {84851#false} is VALID [2022-04-15 11:38:26,023 INFO L290 TraceCheckUtils]: 118: Hoare triple {84851#false} assume !false; {84851#false} is VALID [2022-04-15 11:38:26,023 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-15 11:38:26,023 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-15 11:38:26,023 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-15 11:38:26,023 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-15 11:38:26,023 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-15 11:38:26,023 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-15 11:38:26,024 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-15 11:38:26,024 INFO L290 TraceCheckUtils]: 126: Hoare triple {84851#false} assume 4369 == #t~mem55;havoc #t~mem55; {84851#false} is VALID [2022-04-15 11:38:26,024 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-15 11:38:26,024 INFO L290 TraceCheckUtils]: 128: Hoare triple {84851#false} assume !(0 == ~blastFlag~0); {84851#false} is VALID [2022-04-15 11:38:26,024 INFO L290 TraceCheckUtils]: 129: Hoare triple {84851#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {84851#false} is VALID [2022-04-15 11:38:26,024 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-15 11:38:26,024 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-15 11:38:26,024 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-15 11:38:26,024 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-15 11:38:26,024 INFO L290 TraceCheckUtils]: 134: Hoare triple {84851#false} ~skip~0 := 0; {84851#false} is VALID [2022-04-15 11:38:26,024 INFO L290 TraceCheckUtils]: 135: Hoare triple {84851#false} assume !false; {84851#false} is VALID [2022-04-15 11:38:26,024 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-15 11:38:26,024 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-15 11:38:26,024 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-15 11:38:26,025 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-15 11:38:26,025 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-15 11:38:26,025 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-15 11:38:26,025 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-15 11:38:26,025 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-15 11:38:26,025 INFO L290 TraceCheckUtils]: 144: Hoare triple {84851#false} assume 4384 == #t~mem56;havoc #t~mem56; {84851#false} is VALID [2022-04-15 11:38:26,025 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-15 11:38:26,025 INFO L290 TraceCheckUtils]: 146: Hoare triple {84851#false} assume !(1 == ~blastFlag~0); {84851#false} is VALID [2022-04-15 11:38:26,025 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-15 11:38:26,025 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-15 11:38:26,025 INFO L290 TraceCheckUtils]: 149: Hoare triple {84851#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {84851#false} is VALID [2022-04-15 11:38:26,025 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-15 11:38:26,025 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-15 11:38:26,025 INFO L290 TraceCheckUtils]: 152: Hoare triple {84851#false} ~skip~0 := 0; {84851#false} is VALID [2022-04-15 11:38:26,026 INFO L290 TraceCheckUtils]: 153: Hoare triple {84851#false} assume !false; {84851#false} is VALID [2022-04-15 11:38:26,026 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-15 11:38:26,026 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-15 11:38:26,026 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-15 11:38:26,026 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-15 11:38:26,026 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-15 11:38:26,026 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-15 11:38:26,026 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-15 11:38:26,026 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-15 11:38:26,026 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-15 11:38:26,026 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-15 11:38:26,026 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-15 11:38:26,026 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-15 11:38:26,026 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-15 11:38:26,026 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-15 11:38:26,027 INFO L290 TraceCheckUtils]: 168: Hoare triple {84851#false} assume 4432 == #t~mem62;havoc #t~mem62; {84851#false} is VALID [2022-04-15 11:38:26,027 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-15 11:38:26,027 INFO L290 TraceCheckUtils]: 170: Hoare triple {84851#false} assume 5 == ~blastFlag~0; {84851#false} is VALID [2022-04-15 11:38:26,027 INFO L290 TraceCheckUtils]: 171: Hoare triple {84851#false} assume !false; {84851#false} is VALID [2022-04-15 11:38:26,027 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-15 11:38:26,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:38:26,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693437379] [2022-04-15 11:38:26,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693437379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:26,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:26,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:38:26,028 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:38:26,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [362958053] [2022-04-15 11:38:26,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [362958053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:26,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:26,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:38:26,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305894564] [2022-04-15 11:38:26,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:38:26,028 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-15 11:38:26,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:38:26,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:26,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:26,099 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:38:26,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:26,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:38:26,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:38:26,100 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-15 11:38:28,119 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:38:29,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:29,448 INFO L93 Difference]: Finished difference Result 2105 states and 3015 transitions. [2022-04-15 11:38:29,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:38:29,449 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-15 11:38:29,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:38:29,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:29,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-15 11:38:29,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:29,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-15 11:38:29,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-15 11:38:29,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:29,809 INFO L225 Difference]: With dead ends: 2105 [2022-04-15 11:38:29,809 INFO L226 Difference]: Without dead ends: 1174 [2022-04-15 11:38:29,810 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:38:29,811 INFO L913 BasicCegarLoop]: 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-15 11:38:29,811 INFO L914 BasicCegarLoop]: 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-15 11:38:29,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2022-04-15 11:38:29,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 955. [2022-04-15 11:38:29,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:38:29,858 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-15 11:38:29,858 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-15 11:38:29,859 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-15 11:38:29,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:29,892 INFO L93 Difference]: Finished difference Result 1174 states and 1682 transitions. [2022-04-15 11:38:29,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1682 transitions. [2022-04-15 11:38:29,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:29,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:29,894 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-15 11:38:29,894 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-15 11:38:29,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:29,928 INFO L93 Difference]: Finished difference Result 1174 states and 1682 transitions. [2022-04-15 11:38:29,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1682 transitions. [2022-04-15 11:38:29,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:29,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:29,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:38:29,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:38:29,930 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-15 11:38:29,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1357 transitions. [2022-04-15 11:38:29,963 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1357 transitions. Word has length 172 [2022-04-15 11:38:29,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:38:29,963 INFO L478 AbstractCegarLoop]: Abstraction has 955 states and 1357 transitions. [2022-04-15 11:38:29,963 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:29,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 955 states and 1357 transitions. [2022-04-15 11:38:31,133 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-15 11:38:31,139 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1357 transitions. [2022-04-15 11:38:31,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-04-15 11:38:31,141 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:38:31,141 INFO L499 BasicCegarLoop]: 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-15 11:38:31,141 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 11:38:31,141 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:38:31,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:38:31,142 INFO L85 PathProgramCache]: Analyzing trace with hash -68628705, now seen corresponding path program 1 times [2022-04-15 11:38:31,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:31,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1385705342] [2022-04-15 11:38:47,030 WARN L232 SmtUtils]: Spent 9.96s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 11:38:56,408 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:38:56,408 INFO L85 PathProgramCache]: Analyzing trace with hash -68628705, now seen corresponding path program 2 times [2022-04-15 11:38:56,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:38:56,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119152215] [2022-04-15 11:38:56,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:38:56,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:38:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:56,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:38:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:56,623 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-15 11:38:56,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {93330#true} assume true; {93330#true} is VALID [2022-04-15 11:38:56,624 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {93330#true} {93330#true} #593#return; {93330#true} is VALID [2022-04-15 11:38:56,624 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-15 11:38:56,624 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-15 11:38:56,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {93330#true} assume true; {93330#true} is VALID [2022-04-15 11:38:56,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93330#true} {93330#true} #593#return; {93330#true} is VALID [2022-04-15 11:38:56,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {93330#true} call #t~ret158 := main(); {93330#true} is VALID [2022-04-15 11:38:56,625 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-15 11:38:56,625 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-15 11:38:56,625 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-15 11:38:56,625 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-15 11:38:56,625 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-15 11:38:56,625 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-15 11:38:56,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {93330#true} assume !false; {93330#true} is VALID [2022-04-15 11:38:56,625 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-15 11:38:56,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {93330#true} assume 12292 == #t~mem49;havoc #t~mem49; {93330#true} is VALID [2022-04-15 11:38:56,625 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-15 11:38:56,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {93330#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {93330#true} is VALID [2022-04-15 11:38:56,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {93330#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {93330#true} is VALID [2022-04-15 11:38:56,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {93330#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {93330#true} is VALID [2022-04-15 11:38:56,626 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-15 11:38:56,626 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-15 11:38:56,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {93330#true} assume !(0 == ~tmp___4~0); {93330#true} is VALID [2022-04-15 11:38:56,626 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-15 11:38:56,626 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-15 11:38:56,626 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-15 11:38:56,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {93330#true} ~skip~0 := 0; {93330#true} is VALID [2022-04-15 11:38:56,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {93330#true} assume !false; {93330#true} is VALID [2022-04-15 11:38:56,626 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-15 11:38:56,626 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-15 11:38:56,626 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-15 11:38:56,626 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-15 11:38:56,626 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-15 11:38:56,627 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-15 11:38:56,627 INFO L290 TraceCheckUtils]: 32: Hoare triple {93330#true} assume 4368 == #t~mem54;havoc #t~mem54; {93330#true} is VALID [2022-04-15 11:38:56,627 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-15 11:38:56,627 INFO L290 TraceCheckUtils]: 34: Hoare triple {93330#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {93330#true} is VALID [2022-04-15 11:38:56,627 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-15 11:38:56,627 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-15 11:38:56,627 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-15 11:38:56,627 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-15 11:38:56,627 INFO L290 TraceCheckUtils]: 39: Hoare triple {93330#true} ~skip~0 := 0; {93330#true} is VALID [2022-04-15 11:38:56,627 INFO L290 TraceCheckUtils]: 40: Hoare triple {93330#true} assume !false; {93330#true} is VALID [2022-04-15 11:38:56,627 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-15 11:38:56,627 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-15 11:38:56,627 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-15 11:38:56,627 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-15 11:38:56,627 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-15 11:38:56,628 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-15 11:38:56,628 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-15 11:38:56,628 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-15 11:38:56,628 INFO L290 TraceCheckUtils]: 49: Hoare triple {93330#true} assume 4384 == #t~mem56;havoc #t~mem56; {93330#true} is VALID [2022-04-15 11:38:56,628 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-15 11:38:56,628 INFO L290 TraceCheckUtils]: 51: Hoare triple {93330#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {93330#true} is VALID [2022-04-15 11:38:56,628 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-15 11:38:56,628 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-15 11:38:56,628 INFO L290 TraceCheckUtils]: 54: Hoare triple {93330#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {93330#true} is VALID [2022-04-15 11:38:56,628 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-15 11:38:56,628 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-15 11:38:56,628 INFO L290 TraceCheckUtils]: 57: Hoare triple {93330#true} ~skip~0 := 0; {93330#true} is VALID [2022-04-15 11:38:56,628 INFO L290 TraceCheckUtils]: 58: Hoare triple {93330#true} assume !false; {93330#true} is VALID [2022-04-15 11:38:56,628 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-15 11:38:56,629 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-15 11:38:56,629 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-15 11:38:56,629 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-15 11:38:56,629 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-15 11:38:56,629 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-15 11:38:56,629 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-15 11:38:56,629 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-15 11:38:56,629 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-15 11:38:56,629 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-15 11:38:56,629 INFO L290 TraceCheckUtils]: 69: Hoare triple {93330#true} assume 4400 == #t~mem58;havoc #t~mem58; {93330#true} is VALID [2022-04-15 11:38:56,629 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-15 11:38:56,629 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-15 11:38:56,629 INFO L290 TraceCheckUtils]: 72: Hoare triple {93330#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {93330#true} is VALID [2022-04-15 11:38:56,629 INFO L290 TraceCheckUtils]: 73: Hoare triple {93330#true} assume !(~ret~0 <= 0); {93330#true} is VALID [2022-04-15 11:38:56,630 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-15 11:38:56,630 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-15 11:38:56,630 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-15 11:38:56,630 INFO L290 TraceCheckUtils]: 77: Hoare triple {93330#true} ~skip~0 := 0; {93330#true} is VALID [2022-04-15 11:38:56,630 INFO L290 TraceCheckUtils]: 78: Hoare triple {93330#true} assume !false; {93330#true} is VALID [2022-04-15 11:38:56,630 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-15 11:38:56,630 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-15 11:38:56,630 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-15 11:38:56,630 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-15 11:38:56,630 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-15 11:38:56,630 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-15 11:38:56,630 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-15 11:38:56,630 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-15 11:38:56,630 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-15 11:38:56,630 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-15 11:38:56,631 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-15 11:38:56,631 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-15 11:38:56,631 INFO L290 TraceCheckUtils]: 91: Hoare triple {93330#true} assume 4416 == #t~mem60;havoc #t~mem60; {93330#true} is VALID [2022-04-15 11:38:56,631 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-15 11:38:56,631 INFO L290 TraceCheckUtils]: 93: Hoare triple {93330#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {93330#true} is VALID [2022-04-15 11:38:56,632 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-15 11:38:56,632 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-15 11:38:56,632 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-15 11:38:56,633 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-15 11:38:56,633 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-15 11:38:56,633 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-15 11:38:56,634 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-15 11:38:56,634 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-15 11:38:56,634 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-15 11:38:56,635 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-15 11:38:56,635 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-15 11:38:56,635 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-15 11:38:56,636 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-15 11:38:56,636 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-15 11:38:56,636 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-15 11:38:56,637 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-15 11:38:56,637 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-15 11:38:56,637 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-15 11:38:56,637 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-15 11:38:56,637 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-15 11:38:56,637 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-15 11:38:56,637 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-15 11:38:56,638 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-15 11:38:56,638 INFO L290 TraceCheckUtils]: 117: Hoare triple {93331#false} ~skip~0 := 0; {93331#false} is VALID [2022-04-15 11:38:56,638 INFO L290 TraceCheckUtils]: 118: Hoare triple {93331#false} assume !false; {93331#false} is VALID [2022-04-15 11:38:56,638 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-15 11:38:56,638 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-15 11:38:56,638 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-15 11:38:56,638 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-15 11:38:56,638 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-15 11:38:56,638 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-15 11:38:56,638 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-15 11:38:56,638 INFO L290 TraceCheckUtils]: 126: Hoare triple {93331#false} assume 4369 == #t~mem55;havoc #t~mem55; {93331#false} is VALID [2022-04-15 11:38:56,638 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-15 11:38:56,638 INFO L290 TraceCheckUtils]: 128: Hoare triple {93331#false} assume !(0 == ~blastFlag~0); {93331#false} is VALID [2022-04-15 11:38:56,638 INFO L290 TraceCheckUtils]: 129: Hoare triple {93331#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {93331#false} is VALID [2022-04-15 11:38:56,638 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-15 11:38:56,639 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-15 11:38:56,639 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-15 11:38:56,639 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-15 11:38:56,639 INFO L290 TraceCheckUtils]: 134: Hoare triple {93331#false} ~skip~0 := 0; {93331#false} is VALID [2022-04-15 11:38:56,639 INFO L290 TraceCheckUtils]: 135: Hoare triple {93331#false} assume !false; {93331#false} is VALID [2022-04-15 11:38:56,639 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-15 11:38:56,639 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-15 11:38:56,639 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-15 11:38:56,639 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-15 11:38:56,639 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-15 11:38:56,639 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-15 11:38:56,639 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-15 11:38:56,639 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-15 11:38:56,640 INFO L290 TraceCheckUtils]: 144: Hoare triple {93331#false} assume 4384 == #t~mem56;havoc #t~mem56; {93331#false} is VALID [2022-04-15 11:38:56,640 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-15 11:38:56,640 INFO L290 TraceCheckUtils]: 146: Hoare triple {93331#false} assume !(1 == ~blastFlag~0); {93331#false} is VALID [2022-04-15 11:38:56,640 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-15 11:38:56,640 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-15 11:38:56,640 INFO L290 TraceCheckUtils]: 149: Hoare triple {93331#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {93331#false} is VALID [2022-04-15 11:38:56,640 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-15 11:38:56,640 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-15 11:38:56,640 INFO L290 TraceCheckUtils]: 152: Hoare triple {93331#false} ~skip~0 := 0; {93331#false} is VALID [2022-04-15 11:38:56,640 INFO L290 TraceCheckUtils]: 153: Hoare triple {93331#false} assume !false; {93331#false} is VALID [2022-04-15 11:38:56,640 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-15 11:38:56,640 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-15 11:38:56,640 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-15 11:38:56,640 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-15 11:38:56,640 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-15 11:38:56,641 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-15 11:38:56,641 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-15 11:38:56,641 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-15 11:38:56,641 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-15 11:38:56,641 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-15 11:38:56,641 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-15 11:38:56,641 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-15 11:38:56,641 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-15 11:38:56,641 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-15 11:38:56,641 INFO L290 TraceCheckUtils]: 168: Hoare triple {93331#false} assume 4432 == #t~mem62;havoc #t~mem62; {93331#false} is VALID [2022-04-15 11:38:56,641 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-15 11:38:56,641 INFO L290 TraceCheckUtils]: 170: Hoare triple {93331#false} assume 5 == ~blastFlag~0; {93331#false} is VALID [2022-04-15 11:38:56,641 INFO L290 TraceCheckUtils]: 171: Hoare triple {93331#false} assume !false; {93331#false} is VALID [2022-04-15 11:38:56,642 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-15 11:38:56,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:38:56,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119152215] [2022-04-15 11:38:56,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119152215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:56,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:56,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:38:56,642 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:38:56,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1385705342] [2022-04-15 11:38:56,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1385705342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:56,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:56,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:38:56,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044919020] [2022-04-15 11:38:56,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:38:56,643 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-15 11:38:56,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:38:56,643 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-15 11:38:56,718 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-15 11:38:56,718 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:38:56,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:56,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:38:56,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:38:56,718 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-15 11:38:58,740 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:38:59,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:59,902 INFO L93 Difference]: Finished difference Result 2253 states and 3213 transitions. [2022-04-15 11:38:59,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:38:59,902 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-15 11:38:59,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:38:59,902 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-15 11:38:59,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-15 11:38:59,904 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-15 11:38:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-15 11:38:59,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-15 11:39:00,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:00,287 INFO L225 Difference]: With dead ends: 2253 [2022-04-15 11:39:00,287 INFO L226 Difference]: Without dead ends: 1314 [2022-04-15 11:39:00,288 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:39:00,289 INFO L913 BasicCegarLoop]: 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-15 11:39:00,289 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:39:00,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2022-04-15 11:39:00,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 970. [2022-04-15 11:39:00,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:39:00,344 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-15 11:39:00,345 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-15 11:39:00,346 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-15 11:39:00,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:00,387 INFO L93 Difference]: Finished difference Result 1314 states and 1871 transitions. [2022-04-15 11:39:00,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1871 transitions. [2022-04-15 11:39:00,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:00,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:00,390 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-15 11:39:00,390 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-15 11:39:00,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:00,432 INFO L93 Difference]: Finished difference Result 1314 states and 1871 transitions. [2022-04-15 11:39:00,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1871 transitions. [2022-04-15 11:39:00,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:00,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:00,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:39:00,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:39:00,435 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-15 11:39:00,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1382 transitions. [2022-04-15 11:39:00,470 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1382 transitions. Word has length 172 [2022-04-15 11:39:00,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:39:00,470 INFO L478 AbstractCegarLoop]: Abstraction has 970 states and 1382 transitions. [2022-04-15 11:39:00,470 INFO L479 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-15 11:39:00,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 970 states and 1382 transitions. [2022-04-15 11:39:01,816 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-15 11:39:01,816 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1382 transitions. [2022-04-15 11:39:01,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-04-15 11:39:01,818 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:39:01,818 INFO L499 BasicCegarLoop]: 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-15 11:39:01,818 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 11:39:01,818 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:39:01,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:39:01,818 INFO L85 PathProgramCache]: Analyzing trace with hash 506446570, now seen corresponding path program 1 times [2022-04-15 11:39:01,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:01,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [194398366] [2022-04-15 11:39:17,425 WARN L232 SmtUtils]: Spent 9.70s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 11:39:24,255 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:39:24,255 INFO L85 PathProgramCache]: Analyzing trace with hash 506446570, now seen corresponding path program 2 times [2022-04-15 11:39:24,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:39:24,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703423927] [2022-04-15 11:39:24,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:39:24,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:39:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:24,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:39:24,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:24,517 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-15 11:39:24,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {102416#true} assume true; {102416#true} is VALID [2022-04-15 11:39:24,517 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {102416#true} {102416#true} #593#return; {102416#true} is VALID [2022-04-15 11:39:24,518 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-15 11:39:24,518 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-15 11:39:24,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {102416#true} assume true; {102416#true} is VALID [2022-04-15 11:39:24,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {102416#true} {102416#true} #593#return; {102416#true} is VALID [2022-04-15 11:39:24,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {102416#true} call #t~ret158 := main(); {102416#true} is VALID [2022-04-15 11:39:24,519 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-15 11:39:24,519 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-15 11:39:24,519 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-15 11:39:24,519 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-15 11:39:24,519 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-15 11:39:24,519 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-15 11:39:24,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-15 11:39:24,519 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-15 11:39:24,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {102416#true} assume 12292 == #t~mem49;havoc #t~mem49; {102416#true} is VALID [2022-04-15 11:39:24,519 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-15 11:39:24,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {102416#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {102416#true} is VALID [2022-04-15 11:39:24,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {102416#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {102416#true} is VALID [2022-04-15 11:39:24,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {102416#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {102416#true} is VALID [2022-04-15 11:39:24,520 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-15 11:39:24,520 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-15 11:39:24,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {102416#true} assume !(0 == ~tmp___4~0); {102416#true} is VALID [2022-04-15 11:39:24,520 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-15 11:39:24,520 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-15 11:39:24,520 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-15 11:39:24,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-15 11:39:24,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-15 11:39:24,520 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-15 11:39:24,520 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-15 11:39:24,520 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-15 11:39:24,520 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-15 11:39:24,520 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-15 11:39:24,520 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-15 11:39:24,520 INFO L290 TraceCheckUtils]: 32: Hoare triple {102416#true} assume 4368 == #t~mem54;havoc #t~mem54; {102416#true} is VALID [2022-04-15 11:39:24,521 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-15 11:39:24,521 INFO L290 TraceCheckUtils]: 34: Hoare triple {102416#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {102416#true} is VALID [2022-04-15 11:39:24,521 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-15 11:39:24,521 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-15 11:39:24,521 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-15 11:39:24,521 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-15 11:39:24,521 INFO L290 TraceCheckUtils]: 39: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-15 11:39:24,521 INFO L290 TraceCheckUtils]: 40: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-15 11:39:24,521 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-15 11:39:24,521 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-15 11:39:24,521 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-15 11:39:24,521 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-15 11:39:24,521 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-15 11:39:24,521 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-15 11:39:24,522 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-15 11:39:24,522 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-15 11:39:24,522 INFO L290 TraceCheckUtils]: 49: Hoare triple {102416#true} assume 4384 == #t~mem56;havoc #t~mem56; {102416#true} is VALID [2022-04-15 11:39:24,522 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-15 11:39:24,522 INFO L290 TraceCheckUtils]: 51: Hoare triple {102416#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {102416#true} is VALID [2022-04-15 11:39:24,522 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-15 11:39:24,522 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-15 11:39:24,522 INFO L290 TraceCheckUtils]: 54: Hoare triple {102416#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {102416#true} is VALID [2022-04-15 11:39:24,522 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-15 11:39:24,522 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-15 11:39:24,522 INFO L290 TraceCheckUtils]: 57: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-15 11:39:24,522 INFO L290 TraceCheckUtils]: 58: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-15 11:39:24,522 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-15 11:39:24,523 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-15 11:39:24,523 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-15 11:39:24,523 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-15 11:39:24,523 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-15 11:39:24,523 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-15 11:39:24,523 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-15 11:39:24,523 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-15 11:39:24,523 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-15 11:39:24,523 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-15 11:39:24,523 INFO L290 TraceCheckUtils]: 69: Hoare triple {102416#true} assume 4400 == #t~mem58;havoc #t~mem58; {102416#true} is VALID [2022-04-15 11:39:24,523 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-15 11:39:24,523 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-15 11:39:24,523 INFO L290 TraceCheckUtils]: 72: Hoare triple {102416#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {102416#true} is VALID [2022-04-15 11:39:24,523 INFO L290 TraceCheckUtils]: 73: Hoare triple {102416#true} assume !(~ret~0 <= 0); {102416#true} is VALID [2022-04-15 11:39:24,523 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-15 11:39:24,524 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-15 11:39:24,524 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-15 11:39:24,524 INFO L290 TraceCheckUtils]: 77: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-15 11:39:24,524 INFO L290 TraceCheckUtils]: 78: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-15 11:39:24,524 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-15 11:39:24,524 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-15 11:39:24,524 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-15 11:39:24,524 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-15 11:39:24,524 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-15 11:39:24,524 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-15 11:39:24,524 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-15 11:39:24,524 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-15 11:39:24,524 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-15 11:39:24,524 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-15 11:39:24,525 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-15 11:39:24,525 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-15 11:39:24,525 INFO L290 TraceCheckUtils]: 91: Hoare triple {102416#true} assume 4416 == #t~mem60;havoc #t~mem60; {102416#true} is VALID [2022-04-15 11:39:24,525 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-15 11:39:24,525 INFO L290 TraceCheckUtils]: 93: Hoare triple {102416#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {102416#true} is VALID [2022-04-15 11:39:24,525 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-15 11:39:24,525 INFO L290 TraceCheckUtils]: 95: Hoare triple {102416#true} assume !(0 == ~tmp___6~0); {102416#true} is VALID [2022-04-15 11:39:24,525 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-15 11:39:24,525 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-15 11:39:24,525 INFO L290 TraceCheckUtils]: 98: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-15 11:39:24,525 INFO L290 TraceCheckUtils]: 99: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-15 11:39:24,525 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-15 11:39:24,525 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-15 11:39:24,525 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-15 11:39:24,526 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-15 11:39:24,526 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-15 11:39:24,526 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-15 11:39:24,526 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-15 11:39:24,526 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-15 11:39:24,526 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-15 11:39:24,526 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-15 11:39:24,527 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-15 11:39:24,527 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-15 11:39:24,527 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-15 11:39:24,528 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-15 11:39:24,528 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-15 11:39:24,528 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-15 11:39:24,528 INFO L290 TraceCheckUtils]: 116: Hoare triple {102416#true} assume !(5 == ~blastFlag~0); {102416#true} is VALID [2022-04-15 11:39:24,528 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-15 11:39:24,528 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-15 11:39:24,528 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-15 11:39:24,528 INFO L290 TraceCheckUtils]: 120: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-15 11:39:24,528 INFO L290 TraceCheckUtils]: 121: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-15 11:39:24,528 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-15 11:39:24,528 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-15 11:39:24,528 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-15 11:39:24,528 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-15 11:39:24,529 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-15 11:39:24,529 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-15 11:39:24,529 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-15 11:39:24,529 INFO L290 TraceCheckUtils]: 129: Hoare triple {102416#true} assume 4369 == #t~mem55;havoc #t~mem55; {102416#true} is VALID [2022-04-15 11:39:24,529 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-15 11:39:24,529 INFO L290 TraceCheckUtils]: 131: Hoare triple {102416#true} assume !(0 == ~blastFlag~0); {102416#true} is VALID [2022-04-15 11:39:24,529 INFO L290 TraceCheckUtils]: 132: Hoare triple {102416#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {102416#true} is VALID [2022-04-15 11:39:24,529 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-15 11:39:24,529 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-15 11:39:24,529 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-15 11:39:24,529 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-15 11:39:24,529 INFO L290 TraceCheckUtils]: 137: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-15 11:39:24,529 INFO L290 TraceCheckUtils]: 138: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-15 11:39:24,529 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-15 11:39:24,530 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-15 11:39:24,530 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-15 11:39:24,530 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-15 11:39:24,530 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-15 11:39:24,530 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-15 11:39:24,530 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-15 11:39:24,530 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-15 11:39:24,530 INFO L290 TraceCheckUtils]: 147: Hoare triple {102416#true} assume 4384 == #t~mem56;havoc #t~mem56; {102416#true} is VALID [2022-04-15 11:39:24,530 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-15 11:39:24,530 INFO L290 TraceCheckUtils]: 149: Hoare triple {102416#true} assume !(1 == ~blastFlag~0); {102416#true} is VALID [2022-04-15 11:39:24,530 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-15 11:39:24,531 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-15 11:39:24,532 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-15 11:39:24,532 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-15 11:39:24,532 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-15 11:39:24,532 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-15 11:39:24,533 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-15 11:39:24,533 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-15 11:39:24,533 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-15 11:39:24,533 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-15 11:39:24,534 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-15 11:39:24,534 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-15 11:39:24,534 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-15 11:39:24,534 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-15 11:39:24,535 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-15 11:39:24,535 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-15 11:39:24,535 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-15 11:39:24,535 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-15 11:39:24,536 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-15 11:39:24,536 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-15 11:39:24,536 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-15 11:39:24,536 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-15 11:39:24,537 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-15 11:39:24,537 INFO L290 TraceCheckUtils]: 173: Hoare triple {102417#false} assume 5 == ~blastFlag~0; {102417#false} is VALID [2022-04-15 11:39:24,537 INFO L290 TraceCheckUtils]: 174: Hoare triple {102417#false} assume !false; {102417#false} is VALID [2022-04-15 11:39:24,537 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-15 11:39:24,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:39:24,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703423927] [2022-04-15 11:39:24,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703423927] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:39:24,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882208886] [2022-04-15 11:39:24,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:39:24,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:39:24,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:39:24,545 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 11:39:24,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 11:40:52,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:40:52,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:40:52,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 1545 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 11:40:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:52,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:40:52,636 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-15 11:40:52,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 143 [2022-04-15 11:40:52,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 63 [2022-04-15 11:40:52,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-15 11:40:52,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-15 11:40:52,813 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-04-15 11:40:52,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 21 [2022-04-15 11:40:52,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-04-15 11:40:52,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-04-15 11:40:52,891 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-15 11:40:52,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-04-15 11:40:53,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-04-15 11:40:53,184 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-15 11:40:53,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-15 11:40:53,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-04-15 11:40:53,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {102416#true} call ULTIMATE.init(); {102416#true} is VALID [2022-04-15 11:40:53,311 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-15 11:40:53,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {102416#true} assume true; {102416#true} is VALID [2022-04-15 11:40:53,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {102416#true} {102416#true} #593#return; {102416#true} is VALID [2022-04-15 11:40:53,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {102416#true} call #t~ret158 := main(); {102416#true} is VALID [2022-04-15 11:40:53,312 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-15 11:40:53,312 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-15 11:40:53,312 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-15 11:40:53,312 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-15 11:40:53,312 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-15 11:40:53,312 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-15 11:40:53,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-15 11:40:53,312 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-15 11:40:53,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {102416#true} assume 12292 == #t~mem49;havoc #t~mem49; {102416#true} is VALID [2022-04-15 11:40:53,312 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-15 11:40:53,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {102416#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {102416#true} is VALID [2022-04-15 11:40:53,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {102416#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {102416#true} is VALID [2022-04-15 11:40:53,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {102416#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {102416#true} is VALID [2022-04-15 11:40:53,313 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-15 11:40:53,313 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-15 11:40:53,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {102416#true} assume !(0 == ~tmp___4~0); {102416#true} is VALID [2022-04-15 11:40:53,314 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-15 11:40:53,314 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-15 11:40:53,315 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-15 11:40:53,315 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-15 11:40:53,315 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-15 11:40:53,316 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-15 11:40:53,316 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-15 11:40:53,317 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-15 11:40:53,317 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-15 11:40:53,317 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-15 11:40:53,317 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-15 11:40:53,318 INFO L290 TraceCheckUtils]: 32: Hoare triple {102416#true} assume 4368 == #t~mem54;havoc #t~mem54; {102416#true} is VALID [2022-04-15 11:40:53,318 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-15 11:40:53,318 INFO L290 TraceCheckUtils]: 34: Hoare triple {102416#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {102416#true} is VALID [2022-04-15 11:40:53,318 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-15 11:40:53,318 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-15 11:40:53,318 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-15 11:40:53,318 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-15 11:40:53,318 INFO L290 TraceCheckUtils]: 39: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-15 11:40:53,318 INFO L290 TraceCheckUtils]: 40: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-15 11:40:53,318 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-15 11:40:53,318 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-15 11:40:53,318 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-15 11:40:53,318 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-15 11:40:53,319 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-15 11:40:53,319 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-15 11:40:53,319 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-15 11:40:53,319 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-15 11:40:53,319 INFO L290 TraceCheckUtils]: 49: Hoare triple {102416#true} assume 4384 == #t~mem56;havoc #t~mem56; {102416#true} is VALID [2022-04-15 11:40:53,319 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-15 11:40:53,319 INFO L290 TraceCheckUtils]: 51: Hoare triple {102416#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {102416#true} is VALID [2022-04-15 11:40:53,319 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-15 11:40:53,319 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-15 11:40:53,319 INFO L290 TraceCheckUtils]: 54: Hoare triple {102416#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {102416#true} is VALID [2022-04-15 11:40:53,319 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-15 11:40:53,319 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-15 11:40:53,320 INFO L290 TraceCheckUtils]: 57: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-15 11:40:53,320 INFO L290 TraceCheckUtils]: 58: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-15 11:40:53,320 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-15 11:40:53,320 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-15 11:40:53,320 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-15 11:40:53,320 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-15 11:40:53,320 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-15 11:40:53,320 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-15 11:40:53,320 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-15 11:40:53,320 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-15 11:40:53,320 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-15 11:40:53,320 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-15 11:40:53,320 INFO L290 TraceCheckUtils]: 69: Hoare triple {102416#true} assume 4400 == #t~mem58;havoc #t~mem58; {102416#true} is VALID [2022-04-15 11:40:53,321 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-15 11:40:53,321 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-15 11:40:53,321 INFO L290 TraceCheckUtils]: 72: Hoare triple {102416#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {102416#true} is VALID [2022-04-15 11:40:53,321 INFO L290 TraceCheckUtils]: 73: Hoare triple {102416#true} assume !(~ret~0 <= 0); {102416#true} is VALID [2022-04-15 11:40:53,321 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-15 11:40:53,321 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-15 11:40:53,321 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-15 11:40:53,321 INFO L290 TraceCheckUtils]: 77: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-15 11:40:53,321 INFO L290 TraceCheckUtils]: 78: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-15 11:40:53,321 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-15 11:40:53,321 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-15 11:40:53,321 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-15 11:40:53,321 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-15 11:40:53,322 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-15 11:40:53,322 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-15 11:40:53,322 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-15 11:40:53,322 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-15 11:40:53,322 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-15 11:40:53,322 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-15 11:40:53,322 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-15 11:40:53,322 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-15 11:40:53,322 INFO L290 TraceCheckUtils]: 91: Hoare triple {102416#true} assume 4416 == #t~mem60;havoc #t~mem60; {102416#true} is VALID [2022-04-15 11:40:53,322 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-15 11:40:53,322 INFO L290 TraceCheckUtils]: 93: Hoare triple {102416#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {102416#true} is VALID [2022-04-15 11:40:53,322 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-15 11:40:53,322 INFO L290 TraceCheckUtils]: 95: Hoare triple {102416#true} assume !(0 == ~tmp___6~0); {102416#true} is VALID [2022-04-15 11:40:53,323 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-15 11:40:53,323 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-15 11:40:53,323 INFO L290 TraceCheckUtils]: 98: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-15 11:40:53,323 INFO L290 TraceCheckUtils]: 99: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-15 11:40:53,323 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-15 11:40:53,323 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-15 11:40:53,323 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-15 11:40:53,323 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-15 11:40:53,323 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-15 11:40:53,323 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-15 11:40:53,323 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-15 11:40:53,324 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-15 11:40:53,324 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-15 11:40:53,324 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-15 11:40:53,324 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-15 11:40:53,324 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-15 11:40:53,324 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-15 11:40:53,324 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-15 11:40:53,324 INFO L290 TraceCheckUtils]: 114: Hoare triple {102416#true} assume 4432 == #t~mem62;havoc #t~mem62; {102416#true} is VALID [2022-04-15 11:40:53,324 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-15 11:40:53,324 INFO L290 TraceCheckUtils]: 116: Hoare triple {102416#true} assume !(5 == ~blastFlag~0); {102416#true} is VALID [2022-04-15 11:40:53,324 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-15 11:40:53,324 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-15 11:40:53,324 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-15 11:40:53,325 INFO L290 TraceCheckUtils]: 120: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-15 11:40:53,325 INFO L290 TraceCheckUtils]: 121: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-15 11:40:53,325 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-15 11:40:53,325 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-15 11:40:53,325 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-15 11:40:53,325 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-15 11:40:53,325 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-15 11:40:53,325 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-15 11:40:53,325 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-15 11:40:53,325 INFO L290 TraceCheckUtils]: 129: Hoare triple {102416#true} assume 4369 == #t~mem55;havoc #t~mem55; {102416#true} is VALID [2022-04-15 11:40:53,325 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-15 11:40:53,325 INFO L290 TraceCheckUtils]: 131: Hoare triple {102416#true} assume !(0 == ~blastFlag~0); {102416#true} is VALID [2022-04-15 11:40:53,325 INFO L290 TraceCheckUtils]: 132: Hoare triple {102416#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {102416#true} is VALID [2022-04-15 11:40:53,326 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-15 11:40:53,326 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-15 11:40:53,326 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-15 11:40:53,326 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-15 11:40:53,326 INFO L290 TraceCheckUtils]: 137: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-15 11:40:53,326 INFO L290 TraceCheckUtils]: 138: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-15 11:40:53,326 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-15 11:40:53,326 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-15 11:40:53,326 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-15 11:40:53,326 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-15 11:40:53,326 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-15 11:40:53,326 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-15 11:40:53,326 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-15 11:40:53,327 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-15 11:40:53,327 INFO L290 TraceCheckUtils]: 147: Hoare triple {102416#true} assume 4384 == #t~mem56;havoc #t~mem56; {102416#true} is VALID [2022-04-15 11:40:53,327 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-15 11:40:53,327 INFO L290 TraceCheckUtils]: 149: Hoare triple {102416#true} assume !(1 == ~blastFlag~0); {102416#true} is VALID [2022-04-15 11:40:53,327 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-15 11:40:53,328 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-15 11:40:53,328 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-15 11:40:53,328 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-15 11:40:53,329 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-15 11:40:53,329 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-15 11:40:53,329 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-15 11:40:53,330 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-15 11:40:53,330 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-15 11:40:53,330 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-15 11:40:53,330 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-15 11:40:53,331 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-15 11:40:53,331 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-15 11:40:53,331 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-15 11:40:53,331 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-15 11:40:53,332 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-15 11:40:53,332 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-15 11:40:53,332 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-15 11:40:53,332 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-15 11:40:53,333 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-15 11:40:53,333 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-15 11:40:53,333 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-15 11:40:53,334 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-15 11:40:53,334 INFO L290 TraceCheckUtils]: 173: Hoare triple {102417#false} assume 5 == ~blastFlag~0; {102417#false} is VALID [2022-04-15 11:40:53,334 INFO L290 TraceCheckUtils]: 174: Hoare triple {102417#false} assume !false; {102417#false} is VALID [2022-04-15 11:40:53,334 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-15 11:40:53,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:40:53,727 INFO L290 TraceCheckUtils]: 174: Hoare triple {102417#false} assume !false; {102417#false} is VALID [2022-04-15 11:40:53,727 INFO L290 TraceCheckUtils]: 173: Hoare triple {102417#false} assume 5 == ~blastFlag~0; {102417#false} is VALID [2022-04-15 11:40:53,727 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-15 11:40:53,727 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-15 11:40:53,728 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-15 11:40:53,728 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-15 11:40:53,728 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-15 11:40:53,729 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-15 11:40:53,729 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-15 11:40:53,729 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-15 11:40:53,730 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-15 11:40:53,730 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-15 11:40:53,730 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-15 11:40:53,731 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-15 11:40:53,731 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-15 11:40:53,731 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-15 11:40:53,732 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-15 11:40:53,732 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-15 11:40:53,732 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-15 11:40:53,732 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-15 11:40:53,733 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-15 11:40:53,733 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-15 11:40:53,734 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-15 11:40:53,734 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-15 11:40:53,735 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-15 11:40:53,735 INFO L290 TraceCheckUtils]: 149: Hoare triple {102416#true} assume !(1 == ~blastFlag~0); {102416#true} is VALID [2022-04-15 11:40:53,735 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-15 11:40:53,735 INFO L290 TraceCheckUtils]: 147: Hoare triple {102416#true} assume 4384 == #t~mem56;havoc #t~mem56; {102416#true} is VALID [2022-04-15 11:40:53,735 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-15 11:40:53,735 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-15 11:40:53,735 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-15 11:40:53,735 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-15 11:40:53,735 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-15 11:40:53,735 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-15 11:40:53,735 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-15 11:40:53,735 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-15 11:40:53,735 INFO L290 TraceCheckUtils]: 138: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-15 11:40:53,736 INFO L290 TraceCheckUtils]: 137: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-15 11:40:53,736 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-15 11:40:53,736 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-15 11:40:53,736 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-15 11:40:53,736 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-15 11:40:53,736 INFO L290 TraceCheckUtils]: 132: Hoare triple {102416#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {102416#true} is VALID [2022-04-15 11:40:53,736 INFO L290 TraceCheckUtils]: 131: Hoare triple {102416#true} assume !(0 == ~blastFlag~0); {102416#true} is VALID [2022-04-15 11:40:53,736 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-15 11:40:53,736 INFO L290 TraceCheckUtils]: 129: Hoare triple {102416#true} assume 4369 == #t~mem55;havoc #t~mem55; {102416#true} is VALID [2022-04-15 11:40:53,736 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-15 11:40:53,736 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-15 11:40:53,736 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-15 11:40:53,736 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-15 11:40:53,736 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-15 11:40:53,736 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-15 11:40:53,737 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-15 11:40:53,737 INFO L290 TraceCheckUtils]: 121: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-15 11:40:53,737 INFO L290 TraceCheckUtils]: 120: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-15 11:40:53,737 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-15 11:40:53,737 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-15 11:40:53,737 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-15 11:40:53,737 INFO L290 TraceCheckUtils]: 116: Hoare triple {102416#true} assume !(5 == ~blastFlag~0); {102416#true} is VALID [2022-04-15 11:40:53,737 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-15 11:40:53,737 INFO L290 TraceCheckUtils]: 114: Hoare triple {102416#true} assume 4432 == #t~mem62;havoc #t~mem62; {102416#true} is VALID [2022-04-15 11:40:53,737 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-15 11:40:53,737 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-15 11:40:53,737 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-15 11:40:53,737 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-15 11:40:53,737 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-15 11:40:53,738 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-15 11:40:53,738 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-15 11:40:53,738 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-15 11:40:53,738 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-15 11:40:53,738 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-15 11:40:53,738 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-15 11:40:53,738 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-15 11:40:53,738 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-15 11:40:53,738 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-15 11:40:53,738 INFO L290 TraceCheckUtils]: 99: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-15 11:40:53,738 INFO L290 TraceCheckUtils]: 98: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-15 11:40:53,738 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-15 11:40:53,738 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-15 11:40:53,738 INFO L290 TraceCheckUtils]: 95: Hoare triple {102416#true} assume !(0 == ~tmp___6~0); {102416#true} is VALID [2022-04-15 11:40:53,739 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-15 11:40:53,739 INFO L290 TraceCheckUtils]: 93: Hoare triple {102416#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {102416#true} is VALID [2022-04-15 11:40:53,739 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-15 11:40:53,739 INFO L290 TraceCheckUtils]: 91: Hoare triple {102416#true} assume 4416 == #t~mem60;havoc #t~mem60; {102416#true} is VALID [2022-04-15 11:40:53,739 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-15 11:40:53,739 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-15 11:40:53,739 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-15 11:40:53,739 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-15 11:40:53,739 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-15 11:40:53,739 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-15 11:40:53,739 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-15 11:40:53,739 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-15 11:40:53,739 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-15 11:40:53,739 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-15 11:40:53,740 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-15 11:40:53,740 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-15 11:40:53,740 INFO L290 TraceCheckUtils]: 78: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-15 11:40:53,740 INFO L290 TraceCheckUtils]: 77: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-15 11:40:53,740 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-15 11:40:53,740 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-15 11:40:53,740 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-15 11:40:53,740 INFO L290 TraceCheckUtils]: 73: Hoare triple {102416#true} assume !(~ret~0 <= 0); {102416#true} is VALID [2022-04-15 11:40:53,740 INFO L290 TraceCheckUtils]: 72: Hoare triple {102416#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {102416#true} is VALID [2022-04-15 11:40:53,740 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-15 11:40:53,740 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-15 11:40:53,740 INFO L290 TraceCheckUtils]: 69: Hoare triple {102416#true} assume 4400 == #t~mem58;havoc #t~mem58; {102416#true} is VALID [2022-04-15 11:40:53,740 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-15 11:40:53,740 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-15 11:40:53,741 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-15 11:40:53,741 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-15 11:40:53,741 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-15 11:40:53,741 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-15 11:40:53,741 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-15 11:40:53,741 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-15 11:40:53,741 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-15 11:40:53,741 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-15 11:40:53,741 INFO L290 TraceCheckUtils]: 58: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-15 11:40:53,741 INFO L290 TraceCheckUtils]: 57: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-15 11:40:53,741 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-15 11:40:53,741 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-15 11:40:53,741 INFO L290 TraceCheckUtils]: 54: Hoare triple {102416#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {102416#true} is VALID [2022-04-15 11:40:53,741 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-15 11:40:53,741 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-15 11:40:53,742 INFO L290 TraceCheckUtils]: 51: Hoare triple {102416#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {102416#true} is VALID [2022-04-15 11:40:53,742 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-15 11:40:53,742 INFO L290 TraceCheckUtils]: 49: Hoare triple {102416#true} assume 4384 == #t~mem56;havoc #t~mem56; {102416#true} is VALID [2022-04-15 11:40:53,742 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-15 11:40:53,742 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-15 11:40:53,742 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-15 11:40:53,742 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-15 11:40:53,742 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-15 11:40:53,742 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-15 11:40:53,742 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-15 11:40:53,742 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-15 11:40:53,742 INFO L290 TraceCheckUtils]: 40: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-15 11:40:53,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-15 11:40:53,742 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-15 11:40:53,743 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-15 11:40:53,743 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-15 11:40:53,743 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-15 11:40:53,743 INFO L290 TraceCheckUtils]: 34: Hoare triple {102416#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {102416#true} is VALID [2022-04-15 11:40:53,743 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-15 11:40:53,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {102416#true} assume 4368 == #t~mem54;havoc #t~mem54; {102416#true} is VALID [2022-04-15 11:40:53,743 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-15 11:40:53,743 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-15 11:40:53,743 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-15 11:40:53,743 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-15 11:40:53,743 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-15 11:40:53,743 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-15 11:40:53,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-15 11:40:53,743 INFO L290 TraceCheckUtils]: 24: Hoare triple {102416#true} ~skip~0 := 0; {102416#true} is VALID [2022-04-15 11:40:53,744 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-15 11:40:53,744 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-15 11:40:53,744 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-15 11:40:53,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {102416#true} assume !(0 == ~tmp___4~0); {102416#true} is VALID [2022-04-15 11:40:53,744 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-15 11:40:53,744 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-15 11:40:53,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {102416#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {102416#true} is VALID [2022-04-15 11:40:53,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {102416#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {102416#true} is VALID [2022-04-15 11:40:53,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {102416#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {102416#true} is VALID [2022-04-15 11:40:53,744 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-15 11:40:53,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {102416#true} assume 12292 == #t~mem49;havoc #t~mem49; {102416#true} is VALID [2022-04-15 11:40:53,744 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-15 11:40:53,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {102416#true} assume !false; {102416#true} is VALID [2022-04-15 11:40:53,744 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-15 11:40:53,744 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-15 11:40:53,745 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-15 11:40:53,745 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-15 11:40:53,745 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-15 11:40:53,745 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-15 11:40:53,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {102416#true} call #t~ret158 := main(); {102416#true} is VALID [2022-04-15 11:40:53,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {102416#true} {102416#true} #593#return; {102416#true} is VALID [2022-04-15 11:40:53,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {102416#true} assume true; {102416#true} is VALID [2022-04-15 11:40:53,745 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-15 11:40:53,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {102416#true} call ULTIMATE.init(); {102416#true} is VALID [2022-04-15 11:40:53,746 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-15 11:40:53,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882208886] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 11:40:53,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:40:53,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8, 5] total 13 [2022-04-15 11:40:53,746 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:40:53,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [194398366] [2022-04-15 11:40:53,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [194398366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:40:53,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:40:53,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:40:53,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170699850] [2022-04-15 11:40:53,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:40:53,747 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-15 11:40:53,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:40:53,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:53,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:40:53,813 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:40:53,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:53,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:40:53,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-04-15 11:40:53,814 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-15 11:40:59,878 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:41:01,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:41:01,212 INFO L93 Difference]: Finished difference Result 2377 states and 3382 transitions. [2022-04-15 11:41:01,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:41:01,212 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-15 11:41:01,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:41:01,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:01,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2022-04-15 11:41:01,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:01,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2022-04-15 11:41:01,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 471 transitions. [2022-04-15 11:41:01,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:41:01,564 INFO L225 Difference]: With dead ends: 2377 [2022-04-15 11:41:01,564 INFO L226 Difference]: Without dead ends: 1423 [2022-04-15 11:41:01,566 INFO L912 BasicCegarLoop]: 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-15 11:41:01,567 INFO L913 BasicCegarLoop]: 113 mSDtfsCounter, 94 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:41:01,567 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 314 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 11:41:01,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2022-04-15 11:41:01,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1095. [2022-04-15 11:41:01,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:41:01,945 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-15 11:41:01,946 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-15 11:41:01,946 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-15 11:41:01,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:41:01,999 INFO L93 Difference]: Finished difference Result 1423 states and 2015 transitions. [2022-04-15 11:41:02,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 2015 transitions. [2022-04-15 11:41:02,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:41:02,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:41:02,002 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-15 11:41:02,003 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-15 11:41:02,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:41:02,052 INFO L93 Difference]: Finished difference Result 1423 states and 2015 transitions. [2022-04-15 11:41:02,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 2015 transitions. [2022-04-15 11:41:02,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:41:02,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:41:02,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:41:02,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:41:02,055 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-15 11:41:02,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1557 transitions. [2022-04-15 11:41:02,109 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1557 transitions. Word has length 175 [2022-04-15 11:41:02,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:41:02,109 INFO L478 AbstractCegarLoop]: Abstraction has 1095 states and 1557 transitions. [2022-04-15 11:41:02,109 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:02,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1095 states and 1557 transitions. [2022-04-15 11:41:03,667 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-15 11:41:03,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1557 transitions. [2022-04-15 11:41:03,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-04-15 11:41:03,670 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:41:03,670 INFO L499 BasicCegarLoop]: 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-15 11:41:03,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 11:41:03,883 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-15 11:41:03,883 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:41:03,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:41:03,884 INFO L85 PathProgramCache]: Analyzing trace with hash 640460076, now seen corresponding path program 1 times [2022-04-15 11:41:03,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:41:03,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [913034610] [2022-04-15 11:41:17,017 WARN L232 SmtUtils]: Spent 7.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-15 11:41:26,656 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:41:26,657 INFO L85 PathProgramCache]: Analyzing trace with hash 640460076, now seen corresponding path program 2 times [2022-04-15 11:41:26,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:41:26,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086260538] [2022-04-15 11:41:26,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:41:26,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:41:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:41:26,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:41:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:41:26,864 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-15 11:41:26,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {113273#true} assume true; {113273#true} is VALID [2022-04-15 11:41:26,865 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {113273#true} {113273#true} #593#return; {113273#true} is VALID [2022-04-15 11:41:26,865 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-15 11:41:26,865 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-15 11:41:26,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {113273#true} assume true; {113273#true} is VALID [2022-04-15 11:41:26,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {113273#true} {113273#true} #593#return; {113273#true} is VALID [2022-04-15 11:41:26,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {113273#true} call #t~ret158 := main(); {113273#true} is VALID [2022-04-15 11:41:26,866 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-15 11:41:26,866 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-15 11:41:26,866 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-15 11:41:26,866 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-15 11:41:26,866 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-15 11:41:26,866 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-15 11:41:26,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-15 11:41:26,866 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-15 11:41:26,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {113273#true} assume 12292 == #t~mem49;havoc #t~mem49; {113273#true} is VALID [2022-04-15 11:41:26,866 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-15 11:41:26,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {113273#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {113273#true} is VALID [2022-04-15 11:41:26,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {113273#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {113273#true} is VALID [2022-04-15 11:41:26,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {113273#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {113273#true} is VALID [2022-04-15 11:41:26,867 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-15 11:41:26,867 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-15 11:41:26,867 INFO L290 TraceCheckUtils]: 20: Hoare triple {113273#true} assume !(0 == ~tmp___4~0); {113273#true} is VALID [2022-04-15 11:41:26,867 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-15 11:41:26,867 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-15 11:41:26,867 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-15 11:41:26,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-15 11:41:26,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-15 11:41:26,867 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-15 11:41:26,867 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-15 11:41:26,867 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-15 11:41:26,867 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-15 11:41:26,867 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-15 11:41:26,868 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-15 11:41:26,868 INFO L290 TraceCheckUtils]: 32: Hoare triple {113273#true} assume 4368 == #t~mem54;havoc #t~mem54; {113273#true} is VALID [2022-04-15 11:41:26,868 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-15 11:41:26,868 INFO L290 TraceCheckUtils]: 34: Hoare triple {113273#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {113273#true} is VALID [2022-04-15 11:41:26,868 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-15 11:41:26,868 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-15 11:41:26,868 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-15 11:41:26,868 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-15 11:41:26,868 INFO L290 TraceCheckUtils]: 39: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-15 11:41:26,868 INFO L290 TraceCheckUtils]: 40: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-15 11:41:26,868 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-15 11:41:26,868 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-15 11:41:26,868 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-15 11:41:26,868 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-15 11:41:26,868 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-15 11:41:26,869 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-15 11:41:26,869 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-15 11:41:26,869 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-15 11:41:26,869 INFO L290 TraceCheckUtils]: 49: Hoare triple {113273#true} assume 4384 == #t~mem56;havoc #t~mem56; {113273#true} is VALID [2022-04-15 11:41:26,869 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-15 11:41:26,869 INFO L290 TraceCheckUtils]: 51: Hoare triple {113273#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {113273#true} is VALID [2022-04-15 11:41:26,869 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-15 11:41:26,870 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-15 11:41:26,871 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-15 11:41:26,871 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-15 11:41:26,871 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-15 11:41:26,872 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-15 11:41:26,872 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-15 11:41:26,872 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-15 11:41:26,872 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-15 11:41:26,873 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-15 11:41:26,873 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-15 11:41:26,873 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-15 11:41:26,874 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-15 11:41:26,874 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-15 11:41:26,874 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-15 11:41:26,874 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-15 11:41:26,875 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-15 11:41:26,875 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-15 11:41:26,875 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-15 11:41:26,876 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-15 11:41:26,876 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-15 11:41:26,876 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-15 11:41:26,877 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-15 11:41:26,877 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-15 11:41:26,878 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-15 11:41:26,878 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-15 11:41:26,878 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-15 11:41:26,878 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-15 11:41:26,879 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-15 11:41:26,879 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-15 11:41:26,879 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-15 11:41:26,879 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-15 11:41:26,880 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-15 11:41:26,880 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-15 11:41:26,880 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-15 11:41:26,881 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-15 11:41:26,881 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-15 11:41:26,881 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-15 11:41:26,881 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-15 11:41:26,882 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-15 11:41:26,882 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-15 11:41:26,882 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-15 11:41:26,883 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-15 11:41:26,883 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-15 11:41:26,884 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-15 11:41:26,884 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-15 11:41:26,884 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-15 11:41:26,885 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-15 11:41:26,885 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-15 11:41:26,885 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-15 11:41:26,885 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-15 11:41:26,886 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-15 11:41:26,886 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-15 11:41:26,886 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-15 11:41:26,886 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-15 11:41:26,887 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-15 11:41:26,887 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-15 11:41:26,887 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-15 11:41:26,888 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-15 11:41:26,888 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-15 11:41:26,888 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-15 11:41:26,888 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-15 11:41:26,889 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-15 11:41:26,889 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-15 11:41:26,889 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-15 11:41:26,890 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-15 11:41:26,890 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-15 11:41:26,891 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-15 11:41:26,891 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-15 11:41:26,891 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-15 11:41:26,892 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-15 11:41:26,892 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-15 11:41:26,892 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-15 11:41:26,892 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-15 11:41:26,893 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-15 11:41:26,893 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-15 11:41:26,893 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-15 11:41:26,893 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-15 11:41:26,894 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-15 11:41:26,895 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-15 11:41:26,895 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-15 11:41:26,896 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-15 11:41:26,896 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-15 11:41:26,897 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-15 11:41:26,897 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-15 11:41:26,897 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-15 11:41:26,897 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-15 11:41:26,898 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-15 11:41:26,898 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-15 11:41:26,898 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-15 11:41:26,898 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-15 11:41:26,899 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-15 11:41:26,899 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-15 11:41:26,899 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-15 11:41:26,900 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-15 11:41:26,900 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-15 11:41:26,900 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-15 11:41:26,900 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-15 11:41:26,901 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-15 11:41:26,901 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-15 11:41:26,901 INFO L290 TraceCheckUtils]: 152: Hoare triple {113274#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {113274#false} is VALID [2022-04-15 11:41:26,901 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-15 11:41:26,901 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-15 11:41:26,901 INFO L290 TraceCheckUtils]: 155: Hoare triple {113274#false} ~skip~0 := 0; {113274#false} is VALID [2022-04-15 11:41:26,901 INFO L290 TraceCheckUtils]: 156: Hoare triple {113274#false} assume !false; {113274#false} is VALID [2022-04-15 11:41:26,901 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-15 11:41:26,902 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-15 11:41:26,902 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-15 11:41:26,902 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-15 11:41:26,902 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-15 11:41:26,902 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-15 11:41:26,902 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-15 11:41:26,902 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-15 11:41:26,902 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-15 11:41:26,902 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-15 11:41:26,902 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-15 11:41:26,902 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-15 11:41:26,902 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-15 11:41:26,902 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-15 11:41:26,902 INFO L290 TraceCheckUtils]: 171: Hoare triple {113274#false} assume 4432 == #t~mem62;havoc #t~mem62; {113274#false} is VALID [2022-04-15 11:41:26,902 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-15 11:41:26,903 INFO L290 TraceCheckUtils]: 173: Hoare triple {113274#false} assume 5 == ~blastFlag~0; {113274#false} is VALID [2022-04-15 11:41:26,903 INFO L290 TraceCheckUtils]: 174: Hoare triple {113274#false} assume !false; {113274#false} is VALID [2022-04-15 11:41:26,903 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-15 11:41:26,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:41:26,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086260538] [2022-04-15 11:41:26,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086260538] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:41:26,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373208944] [2022-04-15 11:41:26,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:41:26,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:41:26,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:41:26,905 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 11:41:26,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 11:42:53,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:42:53,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:42:53,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 1544 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 11:42:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:53,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:42:53,661 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-15 11:42:53,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 143 [2022-04-15 11:42:53,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 63 [2022-04-15 11:42:53,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-15 11:42:53,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-15 11:42:53,829 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-04-15 11:42:53,836 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-15 11:42:53,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-04-15 11:42:53,880 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-15 11:42:53,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-04-15 11:42:54,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-04-15 11:42:54,147 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-15 11:42:54,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-15 11:42:54,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-04-15 11:42:54,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {113273#true} call ULTIMATE.init(); {113273#true} is VALID [2022-04-15 11:42:54,264 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-15 11:42:54,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {113273#true} assume true; {113273#true} is VALID [2022-04-15 11:42:54,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {113273#true} {113273#true} #593#return; {113273#true} is VALID [2022-04-15 11:42:54,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {113273#true} call #t~ret158 := main(); {113273#true} is VALID [2022-04-15 11:42:54,264 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-15 11:42:54,264 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-15 11:42:54,264 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-15 11:42:54,264 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-15 11:42:54,265 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-15 11:42:54,265 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-15 11:42:54,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-15 11:42:54,265 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-15 11:42:54,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {113273#true} assume 12292 == #t~mem49;havoc #t~mem49; {113273#true} is VALID [2022-04-15 11:42:54,265 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-15 11:42:54,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {113273#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {113273#true} is VALID [2022-04-15 11:42:54,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {113273#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {113273#true} is VALID [2022-04-15 11:42:54,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {113273#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {113273#true} is VALID [2022-04-15 11:42:54,265 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-15 11:42:54,265 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-15 11:42:54,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {113273#true} assume !(0 == ~tmp___4~0); {113273#true} is VALID [2022-04-15 11:42:54,266 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-15 11:42:54,267 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-15 11:42:54,267 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-15 11:42:54,268 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-15 11:42:54,268 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-15 11:42:54,268 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-15 11:42:54,269 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-15 11:42:54,269 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-15 11:42:54,269 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-15 11:42:54,270 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-15 11:42:54,270 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-15 11:42:54,270 INFO L290 TraceCheckUtils]: 32: Hoare triple {113273#true} assume 4368 == #t~mem54;havoc #t~mem54; {113273#true} is VALID [2022-04-15 11:42:54,270 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-15 11:42:54,270 INFO L290 TraceCheckUtils]: 34: Hoare triple {113273#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {113273#true} is VALID [2022-04-15 11:42:54,270 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-15 11:42:54,270 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-15 11:42:54,270 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-15 11:42:54,270 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-15 11:42:54,270 INFO L290 TraceCheckUtils]: 39: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-15 11:42:54,270 INFO L290 TraceCheckUtils]: 40: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-15 11:42:54,271 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-15 11:42:54,271 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-15 11:42:54,271 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-15 11:42:54,271 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-15 11:42:54,271 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-15 11:42:54,271 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-15 11:42:54,271 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-15 11:42:54,271 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-15 11:42:54,271 INFO L290 TraceCheckUtils]: 49: Hoare triple {113273#true} assume 4384 == #t~mem56;havoc #t~mem56; {113273#true} is VALID [2022-04-15 11:42:54,271 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-15 11:42:54,271 INFO L290 TraceCheckUtils]: 51: Hoare triple {113273#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {113273#true} is VALID [2022-04-15 11:42:54,271 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-15 11:42:54,271 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-15 11:42:54,271 INFO L290 TraceCheckUtils]: 54: Hoare triple {113273#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {113273#true} is VALID [2022-04-15 11:42:54,272 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-15 11:42:54,272 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-15 11:42:54,272 INFO L290 TraceCheckUtils]: 57: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-15 11:42:54,272 INFO L290 TraceCheckUtils]: 58: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-15 11:42:54,272 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-15 11:42:54,272 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-15 11:42:54,272 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-15 11:42:54,272 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-15 11:42:54,272 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-15 11:42:54,272 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-15 11:42:54,272 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-15 11:42:54,272 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-15 11:42:54,272 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-15 11:42:54,272 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-15 11:42:54,272 INFO L290 TraceCheckUtils]: 69: Hoare triple {113273#true} assume 4400 == #t~mem58;havoc #t~mem58; {113273#true} is VALID [2022-04-15 11:42:54,273 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-15 11:42:54,273 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-15 11:42:54,273 INFO L290 TraceCheckUtils]: 72: Hoare triple {113273#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {113273#true} is VALID [2022-04-15 11:42:54,273 INFO L290 TraceCheckUtils]: 73: Hoare triple {113273#true} assume !(~ret~0 <= 0); {113273#true} is VALID [2022-04-15 11:42:54,273 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-15 11:42:54,273 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-15 11:42:54,273 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-15 11:42:54,273 INFO L290 TraceCheckUtils]: 77: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-15 11:42:54,273 INFO L290 TraceCheckUtils]: 78: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-15 11:42:54,273 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-15 11:42:54,273 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-15 11:42:54,273 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-15 11:42:54,273 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-15 11:42:54,273 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-15 11:42:54,273 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-15 11:42:54,274 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-15 11:42:54,274 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-15 11:42:54,274 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-15 11:42:54,274 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-15 11:42:54,274 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-15 11:42:54,274 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-15 11:42:54,274 INFO L290 TraceCheckUtils]: 91: Hoare triple {113273#true} assume 4416 == #t~mem60;havoc #t~mem60; {113273#true} is VALID [2022-04-15 11:42:54,274 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-15 11:42:54,274 INFO L290 TraceCheckUtils]: 93: Hoare triple {113273#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {113273#true} is VALID [2022-04-15 11:42:54,274 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-15 11:42:54,274 INFO L290 TraceCheckUtils]: 95: Hoare triple {113273#true} assume !(0 == ~tmp___6~0); {113273#true} is VALID [2022-04-15 11:42:54,274 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-15 11:42:54,274 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-15 11:42:54,274 INFO L290 TraceCheckUtils]: 98: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-15 11:42:54,274 INFO L290 TraceCheckUtils]: 99: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-15 11:42:54,275 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-15 11:42:54,275 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-15 11:42:54,275 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-15 11:42:54,275 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-15 11:42:54,275 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-15 11:42:54,275 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-15 11:42:54,275 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-15 11:42:54,275 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-15 11:42:54,275 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-15 11:42:54,275 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-15 11:42:54,275 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-15 11:42:54,275 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-15 11:42:54,275 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-15 11:42:54,275 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-15 11:42:54,275 INFO L290 TraceCheckUtils]: 114: Hoare triple {113273#true} assume 4432 == #t~mem62;havoc #t~mem62; {113273#true} is VALID [2022-04-15 11:42:54,276 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-15 11:42:54,276 INFO L290 TraceCheckUtils]: 116: Hoare triple {113273#true} assume !(5 == ~blastFlag~0); {113273#true} is VALID [2022-04-15 11:42:54,276 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-15 11:42:54,276 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-15 11:42:54,276 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-15 11:42:54,276 INFO L290 TraceCheckUtils]: 120: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-15 11:42:54,276 INFO L290 TraceCheckUtils]: 121: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-15 11:42:54,276 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-15 11:42:54,276 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-15 11:42:54,276 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-15 11:42:54,276 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-15 11:42:54,276 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-15 11:42:54,276 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-15 11:42:54,276 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-15 11:42:54,276 INFO L290 TraceCheckUtils]: 129: Hoare triple {113273#true} assume 4369 == #t~mem55;havoc #t~mem55; {113273#true} is VALID [2022-04-15 11:42:54,277 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-15 11:42:54,277 INFO L290 TraceCheckUtils]: 131: Hoare triple {113273#true} assume !(0 == ~blastFlag~0); {113273#true} is VALID [2022-04-15 11:42:54,277 INFO L290 TraceCheckUtils]: 132: Hoare triple {113273#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {113273#true} is VALID [2022-04-15 11:42:54,277 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-15 11:42:54,277 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-15 11:42:54,277 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-15 11:42:54,277 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-15 11:42:54,277 INFO L290 TraceCheckUtils]: 137: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-15 11:42:54,277 INFO L290 TraceCheckUtils]: 138: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-15 11:42:54,277 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-15 11:42:54,277 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-15 11:42:54,277 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-15 11:42:54,277 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-15 11:42:54,277 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-15 11:42:54,278 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-15 11:42:54,278 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-15 11:42:54,278 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-15 11:42:54,278 INFO L290 TraceCheckUtils]: 147: Hoare triple {113273#true} assume 4384 == #t~mem56;havoc #t~mem56; {113273#true} is VALID [2022-04-15 11:42:54,278 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-15 11:42:54,278 INFO L290 TraceCheckUtils]: 149: Hoare triple {113273#true} assume !(1 == ~blastFlag~0); {113273#true} is VALID [2022-04-15 11:42:54,278 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-15 11:42:54,279 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-15 11:42:54,280 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-15 11:42:54,280 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-15 11:42:54,280 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-15 11:42:54,280 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-15 11:42:54,281 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-15 11:42:54,281 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-15 11:42:54,281 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-15 11:42:54,282 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-15 11:42:54,282 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-15 11:42:54,282 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-15 11:42:54,283 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-15 11:42:54,283 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-15 11:42:54,283 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-15 11:42:54,283 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-15 11:42:54,284 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-15 11:42:54,284 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-15 11:42:54,284 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-15 11:42:54,285 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-15 11:42:54,285 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-15 11:42:54,285 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-15 11:42:54,286 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-15 11:42:54,286 INFO L290 TraceCheckUtils]: 173: Hoare triple {113274#false} assume 5 == ~blastFlag~0; {113274#false} is VALID [2022-04-15 11:42:54,286 INFO L290 TraceCheckUtils]: 174: Hoare triple {113274#false} assume !false; {113274#false} is VALID [2022-04-15 11:42:54,286 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-15 11:42:54,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:42:54,522 INFO L290 TraceCheckUtils]: 174: Hoare triple {113274#false} assume !false; {113274#false} is VALID [2022-04-15 11:42:54,522 INFO L290 TraceCheckUtils]: 173: Hoare triple {113274#false} assume 5 == ~blastFlag~0; {113274#false} is VALID [2022-04-15 11:42:54,522 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-15 11:42:54,523 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-15 11:42:54,523 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-15 11:42:54,523 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-15 11:42:54,523 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-15 11:42:54,524 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-15 11:42:54,524 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-15 11:42:54,524 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-15 11:42:54,524 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-15 11:42:54,525 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-15 11:42:54,525 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-15 11:42:54,525 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-15 11:42:54,525 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-15 11:42:54,526 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-15 11:42:54,526 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-15 11:42:54,526 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-15 11:42:54,526 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-15 11:42:54,527 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-15 11:42:54,527 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-15 11:42:54,527 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-15 11:42:54,528 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-15 11:42:54,528 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-15 11:42:54,528 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-15 11:42:54,528 INFO L290 TraceCheckUtils]: 149: Hoare triple {113273#true} assume !(1 == ~blastFlag~0); {113273#true} is VALID [2022-04-15 11:42:54,528 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-15 11:42:54,528 INFO L290 TraceCheckUtils]: 147: Hoare triple {113273#true} assume 4384 == #t~mem56;havoc #t~mem56; {113273#true} is VALID [2022-04-15 11:42:54,529 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-15 11:42:54,529 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-15 11:42:54,529 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-15 11:42:54,529 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-15 11:42:54,529 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-15 11:42:54,529 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-15 11:42:54,529 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-15 11:42:54,529 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-15 11:42:54,529 INFO L290 TraceCheckUtils]: 138: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-15 11:42:54,529 INFO L290 TraceCheckUtils]: 137: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-15 11:42:54,529 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-15 11:42:54,529 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-15 11:42:54,529 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-15 11:42:54,529 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-15 11:42:54,530 INFO L290 TraceCheckUtils]: 132: Hoare triple {113273#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {113273#true} is VALID [2022-04-15 11:42:54,530 INFO L290 TraceCheckUtils]: 131: Hoare triple {113273#true} assume !(0 == ~blastFlag~0); {113273#true} is VALID [2022-04-15 11:42:54,530 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-15 11:42:54,530 INFO L290 TraceCheckUtils]: 129: Hoare triple {113273#true} assume 4369 == #t~mem55;havoc #t~mem55; {113273#true} is VALID [2022-04-15 11:42:54,530 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-15 11:42:54,530 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-15 11:42:54,530 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-15 11:42:54,530 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-15 11:42:54,530 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-15 11:42:54,530 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-15 11:42:54,530 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-15 11:42:54,530 INFO L290 TraceCheckUtils]: 121: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-15 11:42:54,530 INFO L290 TraceCheckUtils]: 120: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-15 11:42:54,530 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-15 11:42:54,530 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-15 11:42:54,531 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-15 11:42:54,531 INFO L290 TraceCheckUtils]: 116: Hoare triple {113273#true} assume !(5 == ~blastFlag~0); {113273#true} is VALID [2022-04-15 11:42:54,531 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-15 11:42:54,531 INFO L290 TraceCheckUtils]: 114: Hoare triple {113273#true} assume 4432 == #t~mem62;havoc #t~mem62; {113273#true} is VALID [2022-04-15 11:42:54,531 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-15 11:42:54,531 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-15 11:42:54,531 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-15 11:42:54,531 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-15 11:42:54,531 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-15 11:42:54,531 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-15 11:42:54,531 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-15 11:42:54,531 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-15 11:42:54,531 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-15 11:42:54,531 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-15 11:42:54,531 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-15 11:42:54,532 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-15 11:42:54,532 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-15 11:42:54,532 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-15 11:42:54,532 INFO L290 TraceCheckUtils]: 99: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-15 11:42:54,532 INFO L290 TraceCheckUtils]: 98: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-15 11:42:54,532 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-15 11:42:54,532 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-15 11:42:54,532 INFO L290 TraceCheckUtils]: 95: Hoare triple {113273#true} assume !(0 == ~tmp___6~0); {113273#true} is VALID [2022-04-15 11:42:54,532 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-15 11:42:54,532 INFO L290 TraceCheckUtils]: 93: Hoare triple {113273#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {113273#true} is VALID [2022-04-15 11:42:54,532 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-15 11:42:54,532 INFO L290 TraceCheckUtils]: 91: Hoare triple {113273#true} assume 4416 == #t~mem60;havoc #t~mem60; {113273#true} is VALID [2022-04-15 11:42:54,532 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-15 11:42:54,532 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-15 11:42:54,532 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-15 11:42:54,533 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-15 11:42:54,533 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-15 11:42:54,533 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-15 11:42:54,533 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-15 11:42:54,533 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-15 11:42:54,533 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-15 11:42:54,533 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-15 11:42:54,533 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-15 11:42:54,533 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-15 11:42:54,533 INFO L290 TraceCheckUtils]: 78: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-15 11:42:54,533 INFO L290 TraceCheckUtils]: 77: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-15 11:42:54,533 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-15 11:42:54,533 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-15 11:42:54,533 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-15 11:42:54,534 INFO L290 TraceCheckUtils]: 73: Hoare triple {113273#true} assume !(~ret~0 <= 0); {113273#true} is VALID [2022-04-15 11:42:54,534 INFO L290 TraceCheckUtils]: 72: Hoare triple {113273#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {113273#true} is VALID [2022-04-15 11:42:54,534 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-15 11:42:54,534 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-15 11:42:54,534 INFO L290 TraceCheckUtils]: 69: Hoare triple {113273#true} assume 4400 == #t~mem58;havoc #t~mem58; {113273#true} is VALID [2022-04-15 11:42:54,534 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-15 11:42:54,534 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-15 11:42:54,534 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-15 11:42:54,534 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-15 11:42:54,534 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-15 11:42:54,534 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-15 11:42:54,534 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-15 11:42:54,534 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-15 11:42:54,534 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-15 11:42:54,534 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-15 11:42:54,535 INFO L290 TraceCheckUtils]: 58: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-15 11:42:54,535 INFO L290 TraceCheckUtils]: 57: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-15 11:42:54,535 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-15 11:42:54,535 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-15 11:42:54,535 INFO L290 TraceCheckUtils]: 54: Hoare triple {113273#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {113273#true} is VALID [2022-04-15 11:42:54,535 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-15 11:42:54,535 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-15 11:42:54,535 INFO L290 TraceCheckUtils]: 51: Hoare triple {113273#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {113273#true} is VALID [2022-04-15 11:42:54,535 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-15 11:42:54,535 INFO L290 TraceCheckUtils]: 49: Hoare triple {113273#true} assume 4384 == #t~mem56;havoc #t~mem56; {113273#true} is VALID [2022-04-15 11:42:54,535 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-15 11:42:54,535 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-15 11:42:54,535 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-15 11:42:54,535 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-15 11:42:54,535 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-15 11:42:54,536 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-15 11:42:54,536 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-15 11:42:54,536 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-15 11:42:54,536 INFO L290 TraceCheckUtils]: 40: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-15 11:42:54,536 INFO L290 TraceCheckUtils]: 39: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-15 11:42:54,536 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-15 11:42:54,536 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-15 11:42:54,536 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-15 11:42:54,536 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-15 11:42:54,536 INFO L290 TraceCheckUtils]: 34: Hoare triple {113273#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {113273#true} is VALID [2022-04-15 11:42:54,536 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-15 11:42:54,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {113273#true} assume 4368 == #t~mem54;havoc #t~mem54; {113273#true} is VALID [2022-04-15 11:42:54,536 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-15 11:42:54,536 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-15 11:42:54,537 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-15 11:42:54,537 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-15 11:42:54,537 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-15 11:42:54,537 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-15 11:42:54,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-15 11:42:54,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {113273#true} ~skip~0 := 0; {113273#true} is VALID [2022-04-15 11:42:54,537 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-15 11:42:54,537 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-15 11:42:54,537 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-15 11:42:54,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {113273#true} assume !(0 == ~tmp___4~0); {113273#true} is VALID [2022-04-15 11:42:54,537 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-15 11:42:54,537 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-15 11:42:54,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {113273#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {113273#true} is VALID [2022-04-15 11:42:54,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {113273#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {113273#true} is VALID [2022-04-15 11:42:54,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {113273#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {113273#true} is VALID [2022-04-15 11:42:54,538 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-15 11:42:54,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {113273#true} assume 12292 == #t~mem49;havoc #t~mem49; {113273#true} is VALID [2022-04-15 11:42:54,538 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-15 11:42:54,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {113273#true} assume !false; {113273#true} is VALID [2022-04-15 11:42:54,538 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-15 11:42:54,538 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-15 11:42:54,538 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-15 11:42:54,538 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-15 11:42:54,538 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-15 11:42:54,538 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-15 11:42:54,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {113273#true} call #t~ret158 := main(); {113273#true} is VALID [2022-04-15 11:42:54,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {113273#true} {113273#true} #593#return; {113273#true} is VALID [2022-04-15 11:42:54,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {113273#true} assume true; {113273#true} is VALID [2022-04-15 11:42:54,538 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-15 11:42:54,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {113273#true} call ULTIMATE.init(); {113273#true} is VALID [2022-04-15 11:42:54,539 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-15 11:42:54,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373208944] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 11:42:54,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:42:54,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 11 [2022-04-15 11:42:54,539 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:42:54,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [913034610] [2022-04-15 11:42:54,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [913034610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:54,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:54,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:42:54,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538193542] [2022-04-15 11:42:54,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:42:54,540 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-15 11:42:54,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:42:54,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:54,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:54,588 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:42:54,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:54,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:42:54,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-04-15 11:42:54,588 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-15 11:42:58,625 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:43:02,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:02,253 INFO L93 Difference]: Finished difference Result 2604 states and 3703 transitions. [2022-04-15 11:43:02,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:43:02,253 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-15 11:43:02,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:43:02,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 464 transitions. [2022-04-15 11:43:02,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:02,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 464 transitions. [2022-04-15 11:43:02,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 464 transitions. [2022-04-15 11:43:02,462 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-15 11:43:02,571 INFO L225 Difference]: With dead ends: 2604 [2022-04-15 11:43:02,571 INFO L226 Difference]: Without dead ends: 1525 [2022-04-15 11:43:02,572 INFO L912 BasicCegarLoop]: 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-15 11:43:02,572 INFO L913 BasicCegarLoop]: 225 mSDtfsCounter, 92 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:43:02,573 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 533 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 228 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 11:43:02,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2022-04-15 11:43:03,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1095. [2022-04-15 11:43:03,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:43:03,075 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-15 11:43:03,087 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-15 11:43:03,088 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-15 11:43:03,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:03,143 INFO L93 Difference]: Finished difference Result 1525 states and 2161 transitions. [2022-04-15 11:43:03,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2161 transitions. [2022-04-15 11:43:03,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:03,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:03,146 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-15 11:43:03,146 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-15 11:43:03,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:03,200 INFO L93 Difference]: Finished difference Result 1525 states and 2161 transitions. [2022-04-15 11:43:03,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2161 transitions. [2022-04-15 11:43:03,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:03,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:03,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:43:03,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:43:03,203 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-15 11:43:03,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1557 transitions. [2022-04-15 11:43:03,246 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1557 transitions. Word has length 175 [2022-04-15 11:43:03,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:43:03,246 INFO L478 AbstractCegarLoop]: Abstraction has 1095 states and 1557 transitions. [2022-04-15 11:43:03,246 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:03,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1095 states and 1557 transitions. [2022-04-15 11:43:04,701 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-15 11:43:04,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1557 transitions. [2022-04-15 11:43:04,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-04-15 11:43:04,703 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:43:04,704 INFO L499 BasicCegarLoop]: 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-15 11:43:04,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 11:43:04,927 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-15 11:43:04,927 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:43:04,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:43:04,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1484711279, now seen corresponding path program 1 times [2022-04-15 11:43:04,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:04,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2095613527] [2022-04-15 11:43:21,630 WARN L232 SmtUtils]: Spent 10.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-15 11:43:29,083 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:43:29,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1484711279, now seen corresponding path program 2 times [2022-04-15 11:43:29,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:43:29,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5429233] [2022-04-15 11:43:29,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:43:29,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:43:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:29,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:43:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:29,304 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-15 11:43:29,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {124786#true} assume true; {124786#true} is VALID [2022-04-15 11:43:29,305 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {124786#true} {124786#true} #593#return; {124786#true} is VALID [2022-04-15 11:43:29,305 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-15 11:43:29,305 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-15 11:43:29,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {124786#true} assume true; {124786#true} is VALID [2022-04-15 11:43:29,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {124786#true} {124786#true} #593#return; {124786#true} is VALID [2022-04-15 11:43:29,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {124786#true} call #t~ret158 := main(); {124786#true} is VALID [2022-04-15 11:43:29,306 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-15 11:43:29,306 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-15 11:43:29,306 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-15 11:43:29,306 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-15 11:43:29,306 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-15 11:43:29,306 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-15 11:43:29,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {124786#true} assume !false; {124786#true} is VALID [2022-04-15 11:43:29,306 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-15 11:43:29,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {124786#true} assume 12292 == #t~mem49;havoc #t~mem49; {124786#true} is VALID [2022-04-15 11:43:29,306 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-15 11:43:29,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {124786#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {124786#true} is VALID [2022-04-15 11:43:29,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {124786#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {124786#true} is VALID [2022-04-15 11:43:29,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {124786#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {124786#true} is VALID [2022-04-15 11:43:29,307 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-15 11:43:29,307 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-15 11:43:29,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {124786#true} assume !(0 == ~tmp___4~0); {124786#true} is VALID [2022-04-15 11:43:29,307 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-15 11:43:29,307 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-15 11:43:29,307 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-15 11:43:29,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {124786#true} ~skip~0 := 0; {124786#true} is VALID [2022-04-15 11:43:29,307 INFO L290 TraceCheckUtils]: 25: Hoare triple {124786#true} assume !false; {124786#true} is VALID [2022-04-15 11:43:29,307 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-15 11:43:29,307 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-15 11:43:29,307 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-15 11:43:29,307 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-15 11:43:29,307 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-15 11:43:29,307 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-15 11:43:29,308 INFO L290 TraceCheckUtils]: 32: Hoare triple {124786#true} assume 4368 == #t~mem54;havoc #t~mem54; {124786#true} is VALID [2022-04-15 11:43:29,308 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-15 11:43:29,308 INFO L290 TraceCheckUtils]: 34: Hoare triple {124786#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {124786#true} is VALID [2022-04-15 11:43:29,308 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-15 11:43:29,308 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-15 11:43:29,308 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-15 11:43:29,308 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-15 11:43:29,308 INFO L290 TraceCheckUtils]: 39: Hoare triple {124786#true} ~skip~0 := 0; {124786#true} is VALID [2022-04-15 11:43:29,308 INFO L290 TraceCheckUtils]: 40: Hoare triple {124786#true} assume !false; {124786#true} is VALID [2022-04-15 11:43:29,308 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-15 11:43:29,308 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-15 11:43:29,308 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-15 11:43:29,308 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-15 11:43:29,308 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-15 11:43:29,308 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-15 11:43:29,309 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-15 11:43:29,309 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-15 11:43:29,309 INFO L290 TraceCheckUtils]: 49: Hoare triple {124786#true} assume 4384 == #t~mem56;havoc #t~mem56; {124786#true} is VALID [2022-04-15 11:43:29,309 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-15 11:43:29,309 INFO L290 TraceCheckUtils]: 51: Hoare triple {124786#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {124786#true} is VALID [2022-04-15 11:43:29,309 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-15 11:43:29,309 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-15 11:43:29,309 INFO L290 TraceCheckUtils]: 54: Hoare triple {124786#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {124786#true} is VALID [2022-04-15 11:43:29,309 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-15 11:43:29,309 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-15 11:43:29,309 INFO L290 TraceCheckUtils]: 57: Hoare triple {124786#true} ~skip~0 := 0; {124786#true} is VALID [2022-04-15 11:43:29,309 INFO L290 TraceCheckUtils]: 58: Hoare triple {124786#true} assume !false; {124786#true} is VALID [2022-04-15 11:43:29,309 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-15 11:43:29,309 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-15 11:43:29,309 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-15 11:43:29,310 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-15 11:43:29,310 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-15 11:43:29,310 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-15 11:43:29,310 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-15 11:43:29,310 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-15 11:43:29,310 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-15 11:43:29,310 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-15 11:43:29,310 INFO L290 TraceCheckUtils]: 69: Hoare triple {124786#true} assume 4400 == #t~mem58;havoc #t~mem58; {124786#true} is VALID [2022-04-15 11:43:29,310 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-15 11:43:29,310 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-15 11:43:29,310 INFO L290 TraceCheckUtils]: 72: Hoare triple {124786#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {124786#true} is VALID [2022-04-15 11:43:29,310 INFO L290 TraceCheckUtils]: 73: Hoare triple {124786#true} assume !(~ret~0 <= 0); {124786#true} is VALID [2022-04-15 11:43:29,310 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-15 11:43:29,310 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-15 11:43:29,310 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-15 11:43:29,311 INFO L290 TraceCheckUtils]: 77: Hoare triple {124786#true} ~skip~0 := 0; {124786#true} is VALID [2022-04-15 11:43:29,311 INFO L290 TraceCheckUtils]: 78: Hoare triple {124786#true} assume !false; {124786#true} is VALID [2022-04-15 11:43:29,311 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-15 11:43:29,311 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-15 11:43:29,311 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-15 11:43:29,311 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-15 11:43:29,311 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-15 11:43:29,311 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-15 11:43:29,311 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-15 11:43:29,311 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-15 11:43:29,311 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-15 11:43:29,311 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-15 11:43:29,311 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-15 11:43:29,311 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-15 11:43:29,312 INFO L290 TraceCheckUtils]: 91: Hoare triple {124786#true} assume 4416 == #t~mem60;havoc #t~mem60; {124786#true} is VALID [2022-04-15 11:43:29,312 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-15 11:43:29,312 INFO L290 TraceCheckUtils]: 93: Hoare triple {124786#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {124786#true} is VALID [2022-04-15 11:43:29,312 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-15 11:43:29,312 INFO L290 TraceCheckUtils]: 95: Hoare triple {124786#true} assume !(0 == ~tmp___6~0); {124786#true} is VALID [2022-04-15 11:43:29,312 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-15 11:43:29,312 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-15 11:43:29,312 INFO L290 TraceCheckUtils]: 98: Hoare triple {124786#true} ~skip~0 := 0; {124786#true} is VALID [2022-04-15 11:43:29,312 INFO L290 TraceCheckUtils]: 99: Hoare triple {124786#true} assume !false; {124786#true} is VALID [2022-04-15 11:43:29,312 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-15 11:43:29,312 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-15 11:43:29,312 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-15 11:43:29,312 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-15 11:43:29,312 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-15 11:43:29,312 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-15 11:43:29,313 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-15 11:43:29,313 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-15 11:43:29,313 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-15 11:43:29,313 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-15 11:43:29,313 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-15 11:43:29,313 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-15 11:43:29,313 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-15 11:43:29,313 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-15 11:43:29,313 INFO L290 TraceCheckUtils]: 114: Hoare triple {124786#true} assume 4432 == #t~mem62;havoc #t~mem62; {124786#true} is VALID [2022-04-15 11:43:29,313 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-15 11:43:29,313 INFO L290 TraceCheckUtils]: 116: Hoare triple {124786#true} assume !(5 == ~blastFlag~0); {124786#true} is VALID [2022-04-15 11:43:29,313 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-15 11:43:29,313 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-15 11:43:29,313 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-15 11:43:29,313 INFO L290 TraceCheckUtils]: 120: Hoare triple {124786#true} ~skip~0 := 0; {124786#true} is VALID [2022-04-15 11:43:29,314 INFO L290 TraceCheckUtils]: 121: Hoare triple {124786#true} assume !false; {124786#true} is VALID [2022-04-15 11:43:29,314 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-15 11:43:29,314 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-15 11:43:29,314 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-15 11:43:29,314 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-15 11:43:29,314 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-15 11:43:29,314 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-15 11:43:29,314 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-15 11:43:29,314 INFO L290 TraceCheckUtils]: 129: Hoare triple {124786#true} assume 4369 == #t~mem55;havoc #t~mem55; {124786#true} is VALID [2022-04-15 11:43:29,314 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-15 11:43:29,314 INFO L290 TraceCheckUtils]: 131: Hoare triple {124786#true} assume !(0 == ~blastFlag~0); {124786#true} is VALID [2022-04-15 11:43:29,314 INFO L290 TraceCheckUtils]: 132: Hoare triple {124786#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {124786#true} is VALID [2022-04-15 11:43:29,314 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-15 11:43:29,314 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-15 11:43:29,314 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-15 11:43:29,315 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-15 11:43:29,315 INFO L290 TraceCheckUtils]: 137: Hoare triple {124786#true} ~skip~0 := 0; {124786#true} is VALID [2022-04-15 11:43:29,315 INFO L290 TraceCheckUtils]: 138: Hoare triple {124786#true} assume !false; {124786#true} is VALID [2022-04-15 11:43:29,315 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-15 11:43:29,315 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-15 11:43:29,315 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-15 11:43:29,315 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-15 11:43:29,315 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-15 11:43:29,315 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-15 11:43:29,315 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-15 11:43:29,315 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-15 11:43:29,315 INFO L290 TraceCheckUtils]: 147: Hoare triple {124786#true} assume 4384 == #t~mem56;havoc #t~mem56; {124786#true} is VALID [2022-04-15 11:43:29,315 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-15 11:43:29,315 INFO L290 TraceCheckUtils]: 149: Hoare triple {124786#true} assume !(1 == ~blastFlag~0); {124786#true} is VALID [2022-04-15 11:43:29,315 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-15 11:43:29,316 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-15 11:43:29,317 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-15 11:43:29,317 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-15 11:43:29,317 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-15 11:43:29,317 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-15 11:43:29,318 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-15 11:43:29,318 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-15 11:43:29,318 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-15 11:43:29,318 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-15 11:43:29,319 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-15 11:43:29,319 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-15 11:43:29,319 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-15 11:43:29,319 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-15 11:43:29,320 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-15 11:43:29,320 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-15 11:43:29,320 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-15 11:43:29,320 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-15 11:43:29,320 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-15 11:43:29,321 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-15 11:43:29,321 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-15 11:43:29,321 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-15 11:43:29,321 INFO L290 TraceCheckUtils]: 172: Hoare triple {124787#false} assume 4433 == #t~mem63;havoc #t~mem63; {124787#false} is VALID [2022-04-15 11:43:29,321 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-15 11:43:29,321 INFO L290 TraceCheckUtils]: 174: Hoare triple {124787#false} assume 5 == ~blastFlag~0; {124787#false} is VALID [2022-04-15 11:43:29,321 INFO L290 TraceCheckUtils]: 175: Hoare triple {124787#false} assume !false; {124787#false} is VALID [2022-04-15 11:43:29,321 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-15 11:43:29,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:43:29,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5429233] [2022-04-15 11:43:29,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5429233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:29,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:29,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:29,322 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:43:29,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2095613527] [2022-04-15 11:43:29,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2095613527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:29,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:29,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:29,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079989350] [2022-04-15 11:43:29,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:43:29,325 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-15 11:43:29,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:43:29,325 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-15 11:43:29,378 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-15 11:43:29,378 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:43:29,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:29,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:43:29,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:43:29,379 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-15 11:43:31,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-15 11:43:33,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:33,003 INFO L93 Difference]: Finished difference Result 2281 states and 3225 transitions. [2022-04-15 11:43:33,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:43:33,003 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-15 11:43:33,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:43:33,004 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-15 11:43:33,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 393 transitions. [2022-04-15 11:43:33,005 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-15 11:43:33,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 393 transitions. [2022-04-15 11:43:33,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 393 transitions. [2022-04-15 11:43:33,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 393 edges. 393 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:33,311 INFO L225 Difference]: With dead ends: 2281 [2022-04-15 11:43:33,311 INFO L226 Difference]: Without dead ends: 1202 [2022-04-15 11:43:33,312 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:43:33,312 INFO L913 BasicCegarLoop]: 194 mSDtfsCounter, 34 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:43:33,312 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 479 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 365 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:43:33,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2022-04-15 11:43:33,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1095. [2022-04-15 11:43:33,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:43:33,818 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-15 11:43:33,819 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-15 11:43:33,819 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-15 11:43:33,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:33,855 INFO L93 Difference]: Finished difference Result 1202 states and 1683 transitions. [2022-04-15 11:43:33,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1683 transitions. [2022-04-15 11:43:33,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:33,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:33,857 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-15 11:43:33,857 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-15 11:43:33,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:33,893 INFO L93 Difference]: Finished difference Result 1202 states and 1683 transitions. [2022-04-15 11:43:33,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1683 transitions. [2022-04-15 11:43:33,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:33,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:33,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:43:33,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:43:33,896 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-15 11:43:33,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1552 transitions. [2022-04-15 11:43:33,937 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1552 transitions. Word has length 176 [2022-04-15 11:43:33,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:43:33,937 INFO L478 AbstractCegarLoop]: Abstraction has 1095 states and 1552 transitions. [2022-04-15 11:43:33,938 INFO L479 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-15 11:43:33,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1095 states and 1552 transitions. [2022-04-15 11:43:35,445 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-15 11:43:35,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1552 transitions. [2022-04-15 11:43:35,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-04-15 11:43:35,447 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:43:35,447 INFO L499 BasicCegarLoop]: 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-15 11:43:35,447 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 11:43:35,447 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:43:35,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:43:35,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1625259889, now seen corresponding path program 1 times [2022-04-15 11:43:35,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:35,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [963729669] [2022-04-15 11:43:50,382 WARN L232 SmtUtils]: Spent 9.44s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 11:43:59,584 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:43:59,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1625259889, now seen corresponding path program 2 times [2022-04-15 11:43:59,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:43:59,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515016549] [2022-04-15 11:43:59,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:43:59,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:43:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:59,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:43:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:59,822 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-15 11:43:59,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {133954#true} assume true; {133954#true} is VALID [2022-04-15 11:43:59,822 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {133954#true} {133954#true} #593#return; {133954#true} is VALID [2022-04-15 11:43:59,823 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-15 11:43:59,823 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-15 11:43:59,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {133954#true} assume true; {133954#true} is VALID [2022-04-15 11:43:59,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {133954#true} {133954#true} #593#return; {133954#true} is VALID [2022-04-15 11:43:59,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {133954#true} call #t~ret158 := main(); {133954#true} is VALID [2022-04-15 11:43:59,823 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-15 11:43:59,823 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-15 11:43:59,823 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-15 11:43:59,823 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-15 11:43:59,824 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-15 11:43:59,824 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-15 11:43:59,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {133954#true} assume !false; {133954#true} is VALID [2022-04-15 11:43:59,824 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-15 11:43:59,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {133954#true} assume 12292 == #t~mem49;havoc #t~mem49; {133954#true} is VALID [2022-04-15 11:43:59,824 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-15 11:43:59,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {133954#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:43:59,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {133954#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {133954#true} is VALID [2022-04-15 11:43:59,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {133954#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:43:59,824 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-15 11:43:59,824 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-15 11:43:59,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {133954#true} assume !(0 == ~tmp___4~0); {133954#true} is VALID [2022-04-15 11:43:59,824 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-15 11:43:59,824 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-15 11:43:59,824 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-15 11:43:59,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {133954#true} ~skip~0 := 0; {133954#true} is VALID [2022-04-15 11:43:59,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {133954#true} assume !false; {133954#true} is VALID [2022-04-15 11:43:59,825 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-15 11:43:59,825 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-15 11:43:59,825 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-15 11:43:59,825 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-15 11:43:59,825 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-15 11:43:59,825 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-15 11:43:59,825 INFO L290 TraceCheckUtils]: 32: Hoare triple {133954#true} assume 4368 == #t~mem54;havoc #t~mem54; {133954#true} is VALID [2022-04-15 11:43:59,825 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-15 11:43:59,825 INFO L290 TraceCheckUtils]: 34: Hoare triple {133954#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {133954#true} is VALID [2022-04-15 11:43:59,825 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-15 11:43:59,825 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-15 11:43:59,825 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-15 11:43:59,825 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-15 11:43:59,826 INFO L290 TraceCheckUtils]: 39: Hoare triple {133954#true} ~skip~0 := 0; {133954#true} is VALID [2022-04-15 11:43:59,826 INFO L290 TraceCheckUtils]: 40: Hoare triple {133954#true} assume !false; {133954#true} is VALID [2022-04-15 11:43:59,826 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-15 11:43:59,826 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-15 11:43:59,826 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-15 11:43:59,826 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-15 11:43:59,826 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-15 11:43:59,826 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-15 11:43:59,826 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-15 11:43:59,826 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-15 11:43:59,826 INFO L290 TraceCheckUtils]: 49: Hoare triple {133954#true} assume 4384 == #t~mem56;havoc #t~mem56; {133954#true} is VALID [2022-04-15 11:43:59,826 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-15 11:43:59,826 INFO L290 TraceCheckUtils]: 51: Hoare triple {133954#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {133954#true} is VALID [2022-04-15 11:43:59,827 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-15 11:43:59,827 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-15 11:43:59,828 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-15 11:43:59,828 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-15 11:43:59,829 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-15 11:43:59,829 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-15 11:43:59,829 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-15 11:43:59,829 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-15 11:43:59,830 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-15 11:43:59,830 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-15 11:43:59,830 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-15 11:43:59,830 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-15 11:43:59,831 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-15 11:43:59,831 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-15 11:43:59,831 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-15 11:43:59,832 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-15 11:43:59,832 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-15 11:43:59,832 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-15 11:43:59,832 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-15 11:43:59,833 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-15 11:43:59,833 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-15 11:43:59,833 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-15 11:43:59,834 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-15 11:43:59,834 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-15 11:43:59,835 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-15 11:43:59,835 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-15 11:43:59,835 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-15 11:43:59,835 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-15 11:43:59,836 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-15 11:43:59,836 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-15 11:43:59,836 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-15 11:43:59,836 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-15 11:43:59,837 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-15 11:43:59,837 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-15 11:43:59,837 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-15 11:43:59,837 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-15 11:43:59,838 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-15 11:43:59,838 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-15 11:43:59,838 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-15 11:43:59,839 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-15 11:43:59,839 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-15 11:43:59,839 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-15 11:43:59,840 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-15 11:43:59,840 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-15 11:43:59,840 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-15 11:43:59,841 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-15 11:43:59,841 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-15 11:43:59,841 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-15 11:43:59,842 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-15 11:43:59,842 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-15 11:43:59,842 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-15 11:43:59,842 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-15 11:43:59,843 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-15 11:43:59,843 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-15 11:43:59,843 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-15 11:43:59,843 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-15 11:43:59,844 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-15 11:43:59,844 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-15 11:43:59,844 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-15 11:43:59,844 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-15 11:43:59,845 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-15 11:43:59,845 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-15 11:43:59,845 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-15 11:43:59,846 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-15 11:43:59,846 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-15 11:43:59,847 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-15 11:43:59,847 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-15 11:43:59,847 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-15 11:43:59,848 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-15 11:43:59,848 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-15 11:43:59,848 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-15 11:43:59,848 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-15 11:43:59,849 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-15 11:43:59,851 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-15 11:43:59,851 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-15 11:43:59,855 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-15 11:43:59,855 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-15 11:43:59,855 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-15 11:43:59,856 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-15 11:43:59,856 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-15 11:43:59,856 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-15 11:43:59,857 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-15 11:43:59,858 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-15 11:43:59,858 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-15 11:43:59,858 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-15 11:43:59,859 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-15 11:43:59,859 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-15 11:43:59,859 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-15 11:43:59,859 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-15 11:43:59,860 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-15 11:43:59,860 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-15 11:43:59,860 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-15 11:43:59,860 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-15 11:43:59,861 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-15 11:43:59,861 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-15 11:43:59,861 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-15 11:43:59,862 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-15 11:43:59,862 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-15 11:43:59,862 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-15 11:43:59,862 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-15 11:43:59,863 INFO L290 TraceCheckUtils]: 152: Hoare triple {133955#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {133955#false} is VALID [2022-04-15 11:43:59,863 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-15 11:43:59,863 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-15 11:43:59,863 INFO L290 TraceCheckUtils]: 155: Hoare triple {133955#false} ~skip~0 := 0; {133955#false} is VALID [2022-04-15 11:43:59,863 INFO L290 TraceCheckUtils]: 156: Hoare triple {133955#false} assume !false; {133955#false} is VALID [2022-04-15 11:43:59,863 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-15 11:43:59,863 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-15 11:43:59,863 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-15 11:43:59,863 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-15 11:43:59,863 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-15 11:43:59,863 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-15 11:43:59,863 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-15 11:43:59,863 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-15 11:43:59,863 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-15 11:43:59,863 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-15 11:43:59,864 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-15 11:43:59,864 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-15 11:43:59,864 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-15 11:43:59,864 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-15 11:43:59,864 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-15 11:43:59,864 INFO L290 TraceCheckUtils]: 172: Hoare triple {133955#false} assume 4433 == #t~mem63;havoc #t~mem63; {133955#false} is VALID [2022-04-15 11:43:59,864 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-15 11:43:59,864 INFO L290 TraceCheckUtils]: 174: Hoare triple {133955#false} assume 5 == ~blastFlag~0; {133955#false} is VALID [2022-04-15 11:43:59,864 INFO L290 TraceCheckUtils]: 175: Hoare triple {133955#false} assume !false; {133955#false} is VALID [2022-04-15 11:43:59,865 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-15 11:43:59,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:43:59,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515016549] [2022-04-15 11:43:59,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515016549] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:43:59,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737479723] [2022-04-15 11:43:59,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:43:59,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:43:59,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:43:59,867 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 11:43:59,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 11:44:55,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:44:55,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:44:56,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 1547 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 11:44:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:56,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:44:56,121 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-15 11:44:56,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 143 [2022-04-15 11:44:56,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 63 [2022-04-15 11:44:56,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-15 11:44:56,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-15 11:44:56,271 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-15 11:44:56,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-04-15 11:44:56,312 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-15 11:44:56,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-04-15 11:44:56,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-04-15 11:44:56,553 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-15 11:44:56,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-15 11:44:56,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-04-15 11:44:56,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {133954#true} call ULTIMATE.init(); {133954#true} is VALID [2022-04-15 11:44:56,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {133954#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); {133954#true} is VALID [2022-04-15 11:44:56,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {133954#true} assume true; {133954#true} is VALID [2022-04-15 11:44:56,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {133954#true} {133954#true} #593#return; {133954#true} is VALID [2022-04-15 11:44:56,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {133954#true} call #t~ret158 := main(); {133954#true} is VALID [2022-04-15 11:44:56,664 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-15 11:44:56,664 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-15 11:44:56,664 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-15 11:44:56,664 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-15 11:44:56,664 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-15 11:44:56,664 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-15 11:44:56,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {133954#true} assume !false; {133954#true} is VALID [2022-04-15 11:44:56,664 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-15 11:44:56,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {133954#true} assume 12292 == #t~mem49;havoc #t~mem49; {133954#true} is VALID [2022-04-15 11:44:56,664 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-15 11:44:56,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {133954#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:56,664 INFO L290 TraceCheckUtils]: 16: Hoare triple {133954#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {133954#true} is VALID [2022-04-15 11:44:56,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {133954#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:56,664 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-15 11:44:56,665 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-15 11:44:56,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {133954#true} assume !(0 == ~tmp___4~0); {133954#true} is VALID [2022-04-15 11:44:56,666 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); {134029#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {134029#(= 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); {134029#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,666 INFO L290 TraceCheckUtils]: 23: Hoare triple {134029#(= 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; {134029#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,667 INFO L290 TraceCheckUtils]: 24: Hoare triple {134029#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} ~skip~0 := 0; {134029#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {134029#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !false; {134029#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {134029#(= 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); {134029#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {134029#(= 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); {134029#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,668 INFO L290 TraceCheckUtils]: 28: Hoare triple {134029#(= 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); {134029#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,669 INFO L290 TraceCheckUtils]: 29: Hoare triple {134029#(= 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); {134029#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {134029#(= 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); {134029#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,669 INFO L290 TraceCheckUtils]: 31: Hoare triple {134029#(= 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); {133954#true} is VALID [2022-04-15 11:44:56,669 INFO L290 TraceCheckUtils]: 32: Hoare triple {133954#true} assume 4368 == #t~mem54;havoc #t~mem54; {133954#true} is VALID [2022-04-15 11:44:56,669 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-15 11:44:56,669 INFO L290 TraceCheckUtils]: 34: Hoare triple {133954#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {133954#true} is VALID [2022-04-15 11:44:56,669 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-15 11:44:56,669 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-15 11:44:56,669 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-15 11:44:56,669 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-15 11:44:56,670 INFO L290 TraceCheckUtils]: 39: Hoare triple {133954#true} ~skip~0 := 0; {133954#true} is VALID [2022-04-15 11:44:56,670 INFO L290 TraceCheckUtils]: 40: Hoare triple {133954#true} assume !false; {133954#true} is VALID [2022-04-15 11:44:56,670 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-15 11:44:56,670 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-15 11:44:56,670 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-15 11:44:56,670 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-15 11:44:56,670 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-15 11:44:56,670 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-15 11:44:56,670 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-15 11:44:56,670 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-15 11:44:56,670 INFO L290 TraceCheckUtils]: 49: Hoare triple {133954#true} assume 4384 == #t~mem56;havoc #t~mem56; {133954#true} is VALID [2022-04-15 11:44:56,670 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-15 11:44:56,670 INFO L290 TraceCheckUtils]: 51: Hoare triple {133954#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {133954#true} is VALID [2022-04-15 11:44:56,670 INFO L290 TraceCheckUtils]: 52: Hoare triple {133954#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:56,671 INFO L290 TraceCheckUtils]: 53: Hoare triple {133954#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:56,671 INFO L290 TraceCheckUtils]: 54: Hoare triple {133954#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:56,671 INFO L290 TraceCheckUtils]: 55: 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-15 11:44:56,671 INFO L290 TraceCheckUtils]: 56: Hoare triple {133954#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {133954#true} is VALID [2022-04-15 11:44:56,671 INFO L290 TraceCheckUtils]: 57: Hoare triple {133954#true} ~skip~0 := 0; {133954#true} is VALID [2022-04-15 11:44:56,671 INFO L290 TraceCheckUtils]: 58: Hoare triple {133954#true} assume !false; {133954#true} is VALID [2022-04-15 11:44:56,671 INFO L290 TraceCheckUtils]: 59: 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-15 11:44:56,671 INFO L290 TraceCheckUtils]: 60: 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-15 11:44:56,671 INFO L290 TraceCheckUtils]: 61: 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-15 11:44:56,671 INFO L290 TraceCheckUtils]: 62: 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-15 11:44:56,671 INFO L290 TraceCheckUtils]: 63: 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-15 11:44:56,671 INFO L290 TraceCheckUtils]: 64: 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-15 11:44:56,671 INFO L290 TraceCheckUtils]: 65: 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-15 11:44:56,671 INFO L290 TraceCheckUtils]: 66: 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-15 11:44:56,671 INFO L290 TraceCheckUtils]: 67: Hoare triple {133954#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:56,672 INFO L290 TraceCheckUtils]: 68: Hoare triple {133954#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:56,672 INFO L290 TraceCheckUtils]: 69: Hoare triple {133954#true} assume 4400 == #t~mem58;havoc #t~mem58; {133954#true} is VALID [2022-04-15 11:44:56,672 INFO L290 TraceCheckUtils]: 70: Hoare triple {133954#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); {133954#true} is VALID [2022-04-15 11:44:56,672 INFO L290 TraceCheckUtils]: 71: Hoare triple {133954#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; {133954#true} is VALID [2022-04-15 11:44:56,672 INFO L290 TraceCheckUtils]: 72: Hoare triple {133954#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {133954#true} is VALID [2022-04-15 11:44:56,672 INFO L290 TraceCheckUtils]: 73: Hoare triple {133954#true} assume !(~ret~0 <= 0); {133954#true} is VALID [2022-04-15 11:44:56,672 INFO L290 TraceCheckUtils]: 74: Hoare triple {133954#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:56,672 INFO L290 TraceCheckUtils]: 75: 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-15 11:44:56,672 INFO L290 TraceCheckUtils]: 76: Hoare triple {133954#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {133954#true} is VALID [2022-04-15 11:44:56,672 INFO L290 TraceCheckUtils]: 77: Hoare triple {133954#true} ~skip~0 := 0; {133954#true} is VALID [2022-04-15 11:44:56,672 INFO L290 TraceCheckUtils]: 78: Hoare triple {133954#true} assume !false; {133954#true} is VALID [2022-04-15 11:44:56,672 INFO L290 TraceCheckUtils]: 79: 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-15 11:44:56,672 INFO L290 TraceCheckUtils]: 80: 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-15 11:44:56,673 INFO L290 TraceCheckUtils]: 81: 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-15 11:44:56,673 INFO L290 TraceCheckUtils]: 82: 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-15 11:44:56,673 INFO L290 TraceCheckUtils]: 83: 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-15 11:44:56,673 INFO L290 TraceCheckUtils]: 84: 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-15 11:44:56,673 INFO L290 TraceCheckUtils]: 85: 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-15 11:44:56,673 INFO L290 TraceCheckUtils]: 86: 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-15 11:44:56,673 INFO L290 TraceCheckUtils]: 87: Hoare triple {133954#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:56,673 INFO L290 TraceCheckUtils]: 88: Hoare triple {133954#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:56,673 INFO L290 TraceCheckUtils]: 89: Hoare triple {133954#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:56,673 INFO L290 TraceCheckUtils]: 90: Hoare triple {133954#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:56,673 INFO L290 TraceCheckUtils]: 91: Hoare triple {133954#true} assume 4416 == #t~mem60;havoc #t~mem60; {133954#true} is VALID [2022-04-15 11:44:56,673 INFO L290 TraceCheckUtils]: 92: Hoare triple {133954#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {133954#true} is VALID [2022-04-15 11:44:56,673 INFO L290 TraceCheckUtils]: 93: Hoare triple {133954#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {133954#true} is VALID [2022-04-15 11:44:56,673 INFO L290 TraceCheckUtils]: 94: Hoare triple {133954#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); {133954#true} is VALID [2022-04-15 11:44:56,674 INFO L290 TraceCheckUtils]: 95: Hoare triple {133954#true} assume !(0 == ~tmp___6~0); {133954#true} is VALID [2022-04-15 11:44:56,674 INFO L290 TraceCheckUtils]: 96: 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-15 11:44:56,674 INFO L290 TraceCheckUtils]: 97: Hoare triple {133954#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {133954#true} is VALID [2022-04-15 11:44:56,674 INFO L290 TraceCheckUtils]: 98: Hoare triple {133954#true} ~skip~0 := 0; {133954#true} is VALID [2022-04-15 11:44:56,674 INFO L290 TraceCheckUtils]: 99: Hoare triple {133954#true} assume !false; {133954#true} is VALID [2022-04-15 11:44:56,674 INFO L290 TraceCheckUtils]: 100: 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-15 11:44:56,674 INFO L290 TraceCheckUtils]: 101: 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-15 11:44:56,674 INFO L290 TraceCheckUtils]: 102: 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-15 11:44:56,674 INFO L290 TraceCheckUtils]: 103: 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-15 11:44:56,674 INFO L290 TraceCheckUtils]: 104: 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-15 11:44:56,674 INFO L290 TraceCheckUtils]: 105: 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-15 11:44:56,674 INFO L290 TraceCheckUtils]: 106: 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-15 11:44:56,674 INFO L290 TraceCheckUtils]: 107: 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-15 11:44:56,674 INFO L290 TraceCheckUtils]: 108: Hoare triple {133954#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:56,675 INFO L290 TraceCheckUtils]: 109: Hoare triple {133954#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:56,675 INFO L290 TraceCheckUtils]: 110: Hoare triple {133954#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:56,675 INFO L290 TraceCheckUtils]: 111: Hoare triple {133954#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:56,675 INFO L290 TraceCheckUtils]: 112: Hoare triple {133954#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:56,675 INFO L290 TraceCheckUtils]: 113: Hoare triple {133954#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:56,675 INFO L290 TraceCheckUtils]: 114: Hoare triple {133954#true} assume 4432 == #t~mem62;havoc #t~mem62; {133954#true} is VALID [2022-04-15 11:44:56,675 INFO L290 TraceCheckUtils]: 115: Hoare triple {133954#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {133954#true} is VALID [2022-04-15 11:44:56,675 INFO L290 TraceCheckUtils]: 116: Hoare triple {133954#true} assume !(5 == ~blastFlag~0); {133954#true} is VALID [2022-04-15 11:44:56,675 INFO L290 TraceCheckUtils]: 117: Hoare triple {133954#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); {133954#true} is VALID [2022-04-15 11:44:56,675 INFO L290 TraceCheckUtils]: 118: 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-15 11:44:56,675 INFO L290 TraceCheckUtils]: 119: Hoare triple {133954#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {133954#true} is VALID [2022-04-15 11:44:56,675 INFO L290 TraceCheckUtils]: 120: Hoare triple {133954#true} ~skip~0 := 0; {133954#true} is VALID [2022-04-15 11:44:56,675 INFO L290 TraceCheckUtils]: 121: Hoare triple {133954#true} assume !false; {133954#true} is VALID [2022-04-15 11:44:56,675 INFO L290 TraceCheckUtils]: 122: 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-15 11:44:56,676 INFO L290 TraceCheckUtils]: 123: 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-15 11:44:56,676 INFO L290 TraceCheckUtils]: 124: 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-15 11:44:56,676 INFO L290 TraceCheckUtils]: 125: 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-15 11:44:56,676 INFO L290 TraceCheckUtils]: 126: 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-15 11:44:56,676 INFO L290 TraceCheckUtils]: 127: 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-15 11:44:56,676 INFO L290 TraceCheckUtils]: 128: 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-15 11:44:56,676 INFO L290 TraceCheckUtils]: 129: Hoare triple {133954#true} assume 4369 == #t~mem55;havoc #t~mem55; {133954#true} is VALID [2022-04-15 11:44:56,676 INFO L290 TraceCheckUtils]: 130: 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-15 11:44:56,676 INFO L290 TraceCheckUtils]: 131: Hoare triple {133954#true} assume !(0 == ~blastFlag~0); {133954#true} is VALID [2022-04-15 11:44:56,676 INFO L290 TraceCheckUtils]: 132: Hoare triple {133954#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {133954#true} is VALID [2022-04-15 11:44:56,676 INFO L290 TraceCheckUtils]: 133: 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-15 11:44:56,676 INFO L290 TraceCheckUtils]: 134: 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-15 11:44:56,676 INFO L290 TraceCheckUtils]: 135: 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-15 11:44:56,676 INFO L290 TraceCheckUtils]: 136: Hoare triple {133954#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {133954#true} is VALID [2022-04-15 11:44:56,676 INFO L290 TraceCheckUtils]: 137: Hoare triple {133954#true} ~skip~0 := 0; {133954#true} is VALID [2022-04-15 11:44:56,677 INFO L290 TraceCheckUtils]: 138: Hoare triple {133954#true} assume !false; {133954#true} is VALID [2022-04-15 11:44:56,677 INFO L290 TraceCheckUtils]: 139: 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-15 11:44:56,677 INFO L290 TraceCheckUtils]: 140: 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-15 11:44:56,677 INFO L290 TraceCheckUtils]: 141: 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-15 11:44:56,677 INFO L290 TraceCheckUtils]: 142: 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-15 11:44:56,677 INFO L290 TraceCheckUtils]: 143: 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-15 11:44:56,677 INFO L290 TraceCheckUtils]: 144: 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-15 11:44:56,677 INFO L290 TraceCheckUtils]: 145: 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-15 11:44:56,677 INFO L290 TraceCheckUtils]: 146: 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-15 11:44:56,677 INFO L290 TraceCheckUtils]: 147: Hoare triple {133954#true} assume 4384 == #t~mem56;havoc #t~mem56; {133954#true} is VALID [2022-04-15 11:44:56,677 INFO L290 TraceCheckUtils]: 148: Hoare triple {133954#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {133954#true} is VALID [2022-04-15 11:44:56,677 INFO L290 TraceCheckUtils]: 149: Hoare triple {133954#true} assume !(1 == ~blastFlag~0); {133954#true} is VALID [2022-04-15 11:44:56,677 INFO L290 TraceCheckUtils]: 150: Hoare triple {133954#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:56,678 INFO L290 TraceCheckUtils]: 151: Hoare triple {133954#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {134420#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,679 INFO L290 TraceCheckUtils]: 152: Hoare triple {134420#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {134420#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,679 INFO L290 TraceCheckUtils]: 153: Hoare triple {134420#(<= 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); {134420#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,679 INFO L290 TraceCheckUtils]: 154: Hoare triple {134420#(<= 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; {134420#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,680 INFO L290 TraceCheckUtils]: 155: Hoare triple {134420#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {134420#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,680 INFO L290 TraceCheckUtils]: 156: Hoare triple {134420#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {134420#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,680 INFO L290 TraceCheckUtils]: 157: Hoare triple {134420#(<= 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); {134420#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,680 INFO L290 TraceCheckUtils]: 158: Hoare triple {134420#(<= 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); {134420#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,680 INFO L290 TraceCheckUtils]: 159: Hoare triple {134420#(<= 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); {134420#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,681 INFO L290 TraceCheckUtils]: 160: Hoare triple {134420#(<= 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); {134420#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,681 INFO L290 TraceCheckUtils]: 161: Hoare triple {134420#(<= 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); {134420#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,681 INFO L290 TraceCheckUtils]: 162: Hoare triple {134420#(<= 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); {134420#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,681 INFO L290 TraceCheckUtils]: 163: Hoare triple {134420#(<= 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); {134420#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,682 INFO L290 TraceCheckUtils]: 164: Hoare triple {134420#(<= 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); {134420#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,682 INFO L290 TraceCheckUtils]: 165: Hoare triple {134420#(<= 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); {134420#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,682 INFO L290 TraceCheckUtils]: 166: Hoare triple {134420#(<= 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); {134420#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,682 INFO L290 TraceCheckUtils]: 167: Hoare triple {134420#(<= 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); {134420#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,683 INFO L290 TraceCheckUtils]: 168: Hoare triple {134420#(<= 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); {134420#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,683 INFO L290 TraceCheckUtils]: 169: Hoare triple {134420#(<= 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); {134420#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,683 INFO L290 TraceCheckUtils]: 170: Hoare triple {134420#(<= 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); {134420#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:56,683 INFO L290 TraceCheckUtils]: 171: Hoare triple {134420#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {134481#(<= 4560 |ssl3_connect_#t~mem63|)} is VALID [2022-04-15 11:44:56,684 INFO L290 TraceCheckUtils]: 172: Hoare triple {134481#(<= 4560 |ssl3_connect_#t~mem63|)} assume 4433 == #t~mem63;havoc #t~mem63; {133955#false} is VALID [2022-04-15 11:44:56,684 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-15 11:44:56,684 INFO L290 TraceCheckUtils]: 174: Hoare triple {133955#false} assume 5 == ~blastFlag~0; {133955#false} is VALID [2022-04-15 11:44:56,684 INFO L290 TraceCheckUtils]: 175: Hoare triple {133955#false} assume !false; {133955#false} is VALID [2022-04-15 11:44:56,684 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-15 11:44:56,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:44:57,033 INFO L290 TraceCheckUtils]: 175: Hoare triple {133955#false} assume !false; {133955#false} is VALID [2022-04-15 11:44:57,034 INFO L290 TraceCheckUtils]: 174: Hoare triple {133955#false} assume 5 == ~blastFlag~0; {133955#false} is VALID [2022-04-15 11:44:57,034 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-15 11:44:57,034 INFO L290 TraceCheckUtils]: 172: Hoare triple {134503#(not (<= |ssl3_connect_#t~mem63| 4433))} assume 4433 == #t~mem63;havoc #t~mem63; {133955#false} is VALID [2022-04-15 11:44:57,034 INFO L290 TraceCheckUtils]: 171: Hoare triple {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {134503#(not (<= |ssl3_connect_#t~mem63| 4433))} is VALID [2022-04-15 11:44:57,035 INFO L290 TraceCheckUtils]: 170: Hoare triple {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:57,035 INFO L290 TraceCheckUtils]: 169: Hoare triple {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:57,035 INFO L290 TraceCheckUtils]: 168: Hoare triple {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:57,035 INFO L290 TraceCheckUtils]: 167: Hoare triple {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:57,036 INFO L290 TraceCheckUtils]: 166: Hoare triple {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:57,036 INFO L290 TraceCheckUtils]: 165: Hoare triple {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:57,036 INFO L290 TraceCheckUtils]: 164: Hoare triple {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:57,037 INFO L290 TraceCheckUtils]: 163: Hoare triple {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:57,037 INFO L290 TraceCheckUtils]: 162: Hoare triple {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:57,037 INFO L290 TraceCheckUtils]: 161: Hoare triple {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:57,037 INFO L290 TraceCheckUtils]: 160: Hoare triple {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:57,038 INFO L290 TraceCheckUtils]: 159: Hoare triple {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:57,038 INFO L290 TraceCheckUtils]: 158: Hoare triple {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:57,038 INFO L290 TraceCheckUtils]: 157: Hoare triple {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:57,039 INFO L290 TraceCheckUtils]: 156: Hoare triple {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:57,039 INFO L290 TraceCheckUtils]: 155: Hoare triple {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:57,039 INFO L290 TraceCheckUtils]: 154: Hoare triple {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:57,039 INFO L290 TraceCheckUtils]: 153: Hoare triple {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:57,040 INFO L290 TraceCheckUtils]: 152: Hoare triple {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:57,041 INFO L290 TraceCheckUtils]: 151: Hoare triple {133954#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {134507#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:57,041 INFO L290 TraceCheckUtils]: 150: Hoare triple {133954#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:57,041 INFO L290 TraceCheckUtils]: 149: Hoare triple {133954#true} assume !(1 == ~blastFlag~0); {133954#true} is VALID [2022-04-15 11:44:57,041 INFO L290 TraceCheckUtils]: 148: Hoare triple {133954#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {133954#true} is VALID [2022-04-15 11:44:57,041 INFO L290 TraceCheckUtils]: 147: Hoare triple {133954#true} assume 4384 == #t~mem56;havoc #t~mem56; {133954#true} is VALID [2022-04-15 11:44:57,041 INFO L290 TraceCheckUtils]: 146: 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-15 11:44:57,041 INFO L290 TraceCheckUtils]: 145: 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-15 11:44:57,041 INFO L290 TraceCheckUtils]: 144: 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-15 11:44:57,041 INFO L290 TraceCheckUtils]: 143: 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-15 11:44:57,041 INFO L290 TraceCheckUtils]: 142: 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-15 11:44:57,042 INFO L290 TraceCheckUtils]: 141: 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-15 11:44:57,042 INFO L290 TraceCheckUtils]: 140: 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-15 11:44:57,042 INFO L290 TraceCheckUtils]: 139: 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-15 11:44:57,042 INFO L290 TraceCheckUtils]: 138: Hoare triple {133954#true} assume !false; {133954#true} is VALID [2022-04-15 11:44:57,042 INFO L290 TraceCheckUtils]: 137: Hoare triple {133954#true} ~skip~0 := 0; {133954#true} is VALID [2022-04-15 11:44:57,042 INFO L290 TraceCheckUtils]: 136: Hoare triple {133954#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {133954#true} is VALID [2022-04-15 11:44:57,042 INFO L290 TraceCheckUtils]: 135: 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-15 11:44:57,042 INFO L290 TraceCheckUtils]: 134: 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-15 11:44:57,042 INFO L290 TraceCheckUtils]: 133: 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-15 11:44:57,042 INFO L290 TraceCheckUtils]: 132: Hoare triple {133954#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {133954#true} is VALID [2022-04-15 11:44:57,042 INFO L290 TraceCheckUtils]: 131: Hoare triple {133954#true} assume !(0 == ~blastFlag~0); {133954#true} is VALID [2022-04-15 11:44:57,042 INFO L290 TraceCheckUtils]: 130: 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-15 11:44:57,042 INFO L290 TraceCheckUtils]: 129: Hoare triple {133954#true} assume 4369 == #t~mem55;havoc #t~mem55; {133954#true} is VALID [2022-04-15 11:44:57,042 INFO L290 TraceCheckUtils]: 128: 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-15 11:44:57,043 INFO L290 TraceCheckUtils]: 127: 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-15 11:44:57,043 INFO L290 TraceCheckUtils]: 126: 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-15 11:44:57,043 INFO L290 TraceCheckUtils]: 125: 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-15 11:44:57,043 INFO L290 TraceCheckUtils]: 124: 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-15 11:44:57,043 INFO L290 TraceCheckUtils]: 123: 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-15 11:44:57,043 INFO L290 TraceCheckUtils]: 122: 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-15 11:44:57,043 INFO L290 TraceCheckUtils]: 121: Hoare triple {133954#true} assume !false; {133954#true} is VALID [2022-04-15 11:44:57,043 INFO L290 TraceCheckUtils]: 120: Hoare triple {133954#true} ~skip~0 := 0; {133954#true} is VALID [2022-04-15 11:44:57,043 INFO L290 TraceCheckUtils]: 119: Hoare triple {133954#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {133954#true} is VALID [2022-04-15 11:44:57,043 INFO L290 TraceCheckUtils]: 118: 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-15 11:44:57,043 INFO L290 TraceCheckUtils]: 117: Hoare triple {133954#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); {133954#true} is VALID [2022-04-15 11:44:57,043 INFO L290 TraceCheckUtils]: 116: Hoare triple {133954#true} assume !(5 == ~blastFlag~0); {133954#true} is VALID [2022-04-15 11:44:57,043 INFO L290 TraceCheckUtils]: 115: Hoare triple {133954#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {133954#true} is VALID [2022-04-15 11:44:57,043 INFO L290 TraceCheckUtils]: 114: Hoare triple {133954#true} assume 4432 == #t~mem62;havoc #t~mem62; {133954#true} is VALID [2022-04-15 11:44:57,044 INFO L290 TraceCheckUtils]: 113: Hoare triple {133954#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:57,044 INFO L290 TraceCheckUtils]: 112: Hoare triple {133954#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:57,044 INFO L290 TraceCheckUtils]: 111: Hoare triple {133954#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:57,044 INFO L290 TraceCheckUtils]: 110: Hoare triple {133954#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:57,044 INFO L290 TraceCheckUtils]: 109: Hoare triple {133954#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:57,044 INFO L290 TraceCheckUtils]: 108: Hoare triple {133954#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:57,044 INFO L290 TraceCheckUtils]: 107: 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-15 11:44:57,044 INFO L290 TraceCheckUtils]: 106: 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-15 11:44:57,044 INFO L290 TraceCheckUtils]: 105: 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-15 11:44:57,044 INFO L290 TraceCheckUtils]: 104: 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-15 11:44:57,044 INFO L290 TraceCheckUtils]: 103: 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-15 11:44:57,044 INFO L290 TraceCheckUtils]: 102: 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-15 11:44:57,044 INFO L290 TraceCheckUtils]: 101: 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-15 11:44:57,045 INFO L290 TraceCheckUtils]: 100: 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-15 11:44:57,045 INFO L290 TraceCheckUtils]: 99: Hoare triple {133954#true} assume !false; {133954#true} is VALID [2022-04-15 11:44:57,045 INFO L290 TraceCheckUtils]: 98: Hoare triple {133954#true} ~skip~0 := 0; {133954#true} is VALID [2022-04-15 11:44:57,045 INFO L290 TraceCheckUtils]: 97: Hoare triple {133954#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {133954#true} is VALID [2022-04-15 11:44:57,045 INFO L290 TraceCheckUtils]: 96: 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-15 11:44:57,045 INFO L290 TraceCheckUtils]: 95: Hoare triple {133954#true} assume !(0 == ~tmp___6~0); {133954#true} is VALID [2022-04-15 11:44:57,045 INFO L290 TraceCheckUtils]: 94: Hoare triple {133954#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); {133954#true} is VALID [2022-04-15 11:44:57,045 INFO L290 TraceCheckUtils]: 93: Hoare triple {133954#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {133954#true} is VALID [2022-04-15 11:44:57,045 INFO L290 TraceCheckUtils]: 92: Hoare triple {133954#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {133954#true} is VALID [2022-04-15 11:44:57,045 INFO L290 TraceCheckUtils]: 91: Hoare triple {133954#true} assume 4416 == #t~mem60;havoc #t~mem60; {133954#true} is VALID [2022-04-15 11:44:57,045 INFO L290 TraceCheckUtils]: 90: Hoare triple {133954#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:57,045 INFO L290 TraceCheckUtils]: 89: Hoare triple {133954#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:57,045 INFO L290 TraceCheckUtils]: 88: Hoare triple {133954#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:57,045 INFO L290 TraceCheckUtils]: 87: Hoare triple {133954#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:57,045 INFO L290 TraceCheckUtils]: 86: 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-15 11:44:57,046 INFO L290 TraceCheckUtils]: 85: 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-15 11:44:57,046 INFO L290 TraceCheckUtils]: 84: 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-15 11:44:57,046 INFO L290 TraceCheckUtils]: 83: 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-15 11:44:57,046 INFO L290 TraceCheckUtils]: 82: 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-15 11:44:57,046 INFO L290 TraceCheckUtils]: 81: 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-15 11:44:57,046 INFO L290 TraceCheckUtils]: 80: 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-15 11:44:57,046 INFO L290 TraceCheckUtils]: 79: 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-15 11:44:57,046 INFO L290 TraceCheckUtils]: 78: Hoare triple {133954#true} assume !false; {133954#true} is VALID [2022-04-15 11:44:57,046 INFO L290 TraceCheckUtils]: 77: Hoare triple {133954#true} ~skip~0 := 0; {133954#true} is VALID [2022-04-15 11:44:57,046 INFO L290 TraceCheckUtils]: 76: Hoare triple {133954#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {133954#true} is VALID [2022-04-15 11:44:57,046 INFO L290 TraceCheckUtils]: 75: 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-15 11:44:57,046 INFO L290 TraceCheckUtils]: 74: Hoare triple {133954#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:57,046 INFO L290 TraceCheckUtils]: 73: Hoare triple {133954#true} assume !(~ret~0 <= 0); {133954#true} is VALID [2022-04-15 11:44:57,046 INFO L290 TraceCheckUtils]: 72: Hoare triple {133954#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {133954#true} is VALID [2022-04-15 11:44:57,047 INFO L290 TraceCheckUtils]: 71: Hoare triple {133954#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; {133954#true} is VALID [2022-04-15 11:44:57,047 INFO L290 TraceCheckUtils]: 70: Hoare triple {133954#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); {133954#true} is VALID [2022-04-15 11:44:57,047 INFO L290 TraceCheckUtils]: 69: Hoare triple {133954#true} assume 4400 == #t~mem58;havoc #t~mem58; {133954#true} is VALID [2022-04-15 11:44:57,047 INFO L290 TraceCheckUtils]: 68: Hoare triple {133954#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:57,047 INFO L290 TraceCheckUtils]: 67: Hoare triple {133954#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:57,047 INFO L290 TraceCheckUtils]: 66: 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-15 11:44:57,047 INFO L290 TraceCheckUtils]: 65: 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-15 11:44:57,047 INFO L290 TraceCheckUtils]: 64: 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-15 11:44:57,047 INFO L290 TraceCheckUtils]: 63: 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-15 11:44:57,047 INFO L290 TraceCheckUtils]: 62: 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-15 11:44:57,047 INFO L290 TraceCheckUtils]: 61: 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-15 11:44:57,047 INFO L290 TraceCheckUtils]: 60: 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-15 11:44:57,047 INFO L290 TraceCheckUtils]: 59: 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-15 11:44:57,047 INFO L290 TraceCheckUtils]: 58: Hoare triple {133954#true} assume !false; {133954#true} is VALID [2022-04-15 11:44:57,047 INFO L290 TraceCheckUtils]: 57: Hoare triple {133954#true} ~skip~0 := 0; {133954#true} is VALID [2022-04-15 11:44:57,048 INFO L290 TraceCheckUtils]: 56: Hoare triple {133954#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {133954#true} is VALID [2022-04-15 11:44:57,048 INFO L290 TraceCheckUtils]: 55: 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-15 11:44:57,048 INFO L290 TraceCheckUtils]: 54: Hoare triple {133954#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:57,048 INFO L290 TraceCheckUtils]: 53: Hoare triple {133954#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:57,048 INFO L290 TraceCheckUtils]: 52: Hoare triple {133954#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:57,048 INFO L290 TraceCheckUtils]: 51: Hoare triple {133954#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {133954#true} is VALID [2022-04-15 11:44:57,048 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-15 11:44:57,048 INFO L290 TraceCheckUtils]: 49: Hoare triple {133954#true} assume 4384 == #t~mem56;havoc #t~mem56; {133954#true} is VALID [2022-04-15 11:44:57,048 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-15 11:44:57,048 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-15 11:44:57,048 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-15 11:44:57,048 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-15 11:44:57,048 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-15 11:44:57,048 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-15 11:44:57,049 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-15 11:44:57,049 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-15 11:44:57,049 INFO L290 TraceCheckUtils]: 40: Hoare triple {133954#true} assume !false; {133954#true} is VALID [2022-04-15 11:44:57,049 INFO L290 TraceCheckUtils]: 39: Hoare triple {133954#true} ~skip~0 := 0; {133954#true} is VALID [2022-04-15 11:44:57,049 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-15 11:44:57,049 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-15 11:44:57,049 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-15 11:44:57,049 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-15 11:44:57,049 INFO L290 TraceCheckUtils]: 34: Hoare triple {133954#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {133954#true} is VALID [2022-04-15 11:44:57,049 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-15 11:44:57,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {133954#true} assume 4368 == #t~mem54;havoc #t~mem54; {133954#true} is VALID [2022-04-15 11:44:57,049 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-15 11:44:57,049 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-15 11:44:57,049 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-15 11:44:57,050 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-15 11:44:57,050 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-15 11:44:57,050 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-15 11:44:57,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {133954#true} assume !false; {133954#true} is VALID [2022-04-15 11:44:57,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {133954#true} ~skip~0 := 0; {133954#true} is VALID [2022-04-15 11:44:57,050 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-15 11:44:57,050 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-15 11:44:57,050 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-15 11:44:57,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {133954#true} assume !(0 == ~tmp___4~0); {133954#true} is VALID [2022-04-15 11:44:57,050 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-15 11:44:57,050 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-15 11:44:57,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {133954#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:57,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {133954#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {133954#true} is VALID [2022-04-15 11:44:57,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {133954#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {133954#true} is VALID [2022-04-15 11:44:57,051 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-15 11:44:57,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {133954#true} assume 12292 == #t~mem49;havoc #t~mem49; {133954#true} is VALID [2022-04-15 11:44:57,051 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-15 11:44:57,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {133954#true} assume !false; {133954#true} is VALID [2022-04-15 11:44:57,051 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-15 11:44:57,051 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-15 11:44:57,051 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-15 11:44:57,051 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-15 11:44:57,051 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-15 11:44:57,051 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-15 11:44:57,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {133954#true} call #t~ret158 := main(); {133954#true} is VALID [2022-04-15 11:44:57,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {133954#true} {133954#true} #593#return; {133954#true} is VALID [2022-04-15 11:44:57,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {133954#true} assume true; {133954#true} is VALID [2022-04-15 11:44:57,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {133954#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); {133954#true} is VALID [2022-04-15 11:44:57,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {133954#true} call ULTIMATE.init(); {133954#true} is VALID [2022-04-15 11:44:57,052 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-15 11:44:57,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737479723] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 11:44:57,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:44:57,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 11 [2022-04-15 11:44:57,052 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:57,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [963729669] [2022-04-15 11:44:57,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [963729669] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:57,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:57,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:44:57,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652759037] [2022-04-15 11:44:57,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:57,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 176 [2022-04-15 11:44:57,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:57,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:57,119 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-15 11:44:57,119 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:44:57,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:57,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:44:57,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-04-15 11:44:57,120 INFO L87 Difference]: Start difference. First operand 1095 states and 1552 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:03,192 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:05,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:05,368 INFO L93 Difference]: Finished difference Result 2587 states and 3671 transitions. [2022-04-15 11:45:05,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:45:05,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 176 [2022-04-15 11:45:05,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:45:05,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:05,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 458 transitions. [2022-04-15 11:45:05,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:05,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 458 transitions. [2022-04-15 11:45:05,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 458 transitions. [2022-04-15 11:45:05,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 458 edges. 458 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:05,737 INFO L225 Difference]: With dead ends: 2587 [2022-04-15 11:45:05,737 INFO L226 Difference]: Without dead ends: 1508 [2022-04-15 11:45:05,739 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-04-15 11:45:05,739 INFO L913 BasicCegarLoop]: 220 mSDtfsCounter, 86 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:45:05,739 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 523 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 226 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 11:45:05,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2022-04-15 11:45:06,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1225. [2022-04-15 11:45:06,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:45:06,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1508 states. Second operand has 1225 states, 1220 states have (on average 1.4163934426229507) internal successors, (1728), 1220 states have internal predecessors, (1728), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:06,494 INFO L74 IsIncluded]: Start isIncluded. First operand 1508 states. Second operand has 1225 states, 1220 states have (on average 1.4163934426229507) internal successors, (1728), 1220 states have internal predecessors, (1728), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:06,495 INFO L87 Difference]: Start difference. First operand 1508 states. Second operand has 1225 states, 1220 states have (on average 1.4163934426229507) internal successors, (1728), 1220 states have internal predecessors, (1728), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:06,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:06,548 INFO L93 Difference]: Finished difference Result 1508 states and 2134 transitions. [2022-04-15 11:45:06,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2134 transitions. [2022-04-15 11:45:06,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:06,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:06,551 INFO L74 IsIncluded]: Start isIncluded. First operand has 1225 states, 1220 states have (on average 1.4163934426229507) internal successors, (1728), 1220 states have internal predecessors, (1728), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1508 states. [2022-04-15 11:45:06,552 INFO L87 Difference]: Start difference. First operand has 1225 states, 1220 states have (on average 1.4163934426229507) internal successors, (1728), 1220 states have internal predecessors, (1728), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1508 states. [2022-04-15 11:45:06,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:06,605 INFO L93 Difference]: Finished difference Result 1508 states and 2134 transitions. [2022-04-15 11:45:06,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2134 transitions. [2022-04-15 11:45:06,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:06,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:06,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:45:06,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:45:06,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1220 states have (on average 1.4163934426229507) internal successors, (1728), 1220 states have internal predecessors, (1728), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:06,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1732 transitions. [2022-04-15 11:45:06,684 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1732 transitions. Word has length 176 [2022-04-15 11:45:06,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:45:06,684 INFO L478 AbstractCegarLoop]: Abstraction has 1225 states and 1732 transitions. [2022-04-15 11:45:06,684 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:06,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1225 states and 1732 transitions. [2022-04-15 11:45:08,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1732 edges. 1732 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1732 transitions. [2022-04-15 11:45:08,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-04-15 11:45:08,256 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:45:08,256 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:45:08,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 11:45:08,463 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:45:08,464 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:45:08,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:45:08,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1889371132, now seen corresponding path program 1 times [2022-04-15 11:45:08,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:08,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1257742332] [2022-04-15 11:45:32,002 WARN L232 SmtUtils]: Spent 15.78s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 11:45:41,654 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:45:41,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1889371132, now seen corresponding path program 2 times [2022-04-15 11:45:41,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:45:41,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546958379] [2022-04-15 11:45:41,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:45:41,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:45:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:41,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:45:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:41,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {145674#(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); {145665#true} is VALID [2022-04-15 11:45:41,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {145665#true} assume true; {145665#true} is VALID [2022-04-15 11:45:41,894 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {145665#true} {145665#true} #593#return; {145665#true} is VALID [2022-04-15 11:45:41,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {145665#true} call ULTIMATE.init(); {145674#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:45:41,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {145674#(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); {145665#true} is VALID [2022-04-15 11:45:41,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {145665#true} assume true; {145665#true} is VALID [2022-04-15 11:45:41,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {145665#true} {145665#true} #593#return; {145665#true} is VALID [2022-04-15 11:45:41,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {145665#true} call #t~ret158 := main(); {145665#true} is VALID [2022-04-15 11:45:41,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {145665#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; {145665#true} is VALID [2022-04-15 11:45:41,895 INFO L272 TraceCheckUtils]: 6: Hoare triple {145665#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {145665#true} is VALID [2022-04-15 11:45:41,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {145665#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); {145665#true} is VALID [2022-04-15 11:45:41,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {145665#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; {145665#true} is VALID [2022-04-15 11:45:41,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {145665#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; {145665#true} is VALID [2022-04-15 11:45:41,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {145665#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {145665#true} is VALID [2022-04-15 11:45:41,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {145665#true} assume !false; {145665#true} is VALID [2022-04-15 11:45:41,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {145665#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {145665#true} assume 12292 == #t~mem49;havoc #t~mem49; {145665#true} is VALID [2022-04-15 11:45:41,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {145665#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; {145665#true} is VALID [2022-04-15 11:45:41,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {145665#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {145665#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {145665#true} is VALID [2022-04-15 11:45:41,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {145665#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {145665#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); {145665#true} is VALID [2022-04-15 11:45:41,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {145665#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {145665#true} is VALID [2022-04-15 11:45:41,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {145665#true} assume !(0 == ~tmp___4~0); {145665#true} is VALID [2022-04-15 11:45:41,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {145665#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); {145665#true} is VALID [2022-04-15 11:45:41,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {145665#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,896 INFO L290 TraceCheckUtils]: 23: Hoare triple {145665#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {145665#true} is VALID [2022-04-15 11:45:41,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {145665#true} ~skip~0 := 0; {145665#true} is VALID [2022-04-15 11:45:41,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {145665#true} assume !false; {145665#true} is VALID [2022-04-15 11:45:41,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {145665#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {145665#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {145665#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {145665#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {145665#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {145665#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,897 INFO L290 TraceCheckUtils]: 32: Hoare triple {145665#true} assume 4368 == #t~mem54;havoc #t~mem54; {145665#true} is VALID [2022-04-15 11:45:41,897 INFO L290 TraceCheckUtils]: 33: Hoare triple {145665#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; {145665#true} is VALID [2022-04-15 11:45:41,897 INFO L290 TraceCheckUtils]: 34: Hoare triple {145665#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {145665#true} is VALID [2022-04-15 11:45:41,897 INFO L290 TraceCheckUtils]: 35: Hoare triple {145665#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); {145665#true} is VALID [2022-04-15 11:45:41,897 INFO L290 TraceCheckUtils]: 36: Hoare triple {145665#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; {145665#true} is VALID [2022-04-15 11:45:41,897 INFO L290 TraceCheckUtils]: 37: Hoare triple {145665#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,897 INFO L290 TraceCheckUtils]: 38: Hoare triple {145665#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {145665#true} is VALID [2022-04-15 11:45:41,897 INFO L290 TraceCheckUtils]: 39: Hoare triple {145665#true} ~skip~0 := 0; {145665#true} is VALID [2022-04-15 11:45:41,897 INFO L290 TraceCheckUtils]: 40: Hoare triple {145665#true} assume !false; {145665#true} is VALID [2022-04-15 11:45:41,897 INFO L290 TraceCheckUtils]: 41: Hoare triple {145665#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,897 INFO L290 TraceCheckUtils]: 42: Hoare triple {145665#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,898 INFO L290 TraceCheckUtils]: 43: Hoare triple {145665#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,898 INFO L290 TraceCheckUtils]: 44: Hoare triple {145665#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,898 INFO L290 TraceCheckUtils]: 45: Hoare triple {145665#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,898 INFO L290 TraceCheckUtils]: 46: Hoare triple {145665#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,898 INFO L290 TraceCheckUtils]: 47: Hoare triple {145665#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,898 INFO L290 TraceCheckUtils]: 48: Hoare triple {145665#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,898 INFO L290 TraceCheckUtils]: 49: Hoare triple {145665#true} assume 4384 == #t~mem56;havoc #t~mem56; {145665#true} is VALID [2022-04-15 11:45:41,898 INFO L290 TraceCheckUtils]: 50: Hoare triple {145665#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {145665#true} is VALID [2022-04-15 11:45:41,898 INFO L290 TraceCheckUtils]: 51: Hoare triple {145665#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {145665#true} is VALID [2022-04-15 11:45:41,898 INFO L290 TraceCheckUtils]: 52: Hoare triple {145665#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,898 INFO L290 TraceCheckUtils]: 53: Hoare triple {145665#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,898 INFO L290 TraceCheckUtils]: 54: Hoare triple {145665#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,898 INFO L290 TraceCheckUtils]: 55: Hoare triple {145665#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,898 INFO L290 TraceCheckUtils]: 56: Hoare triple {145665#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {145665#true} is VALID [2022-04-15 11:45:41,898 INFO L290 TraceCheckUtils]: 57: Hoare triple {145665#true} ~skip~0 := 0; {145665#true} is VALID [2022-04-15 11:45:41,899 INFO L290 TraceCheckUtils]: 58: Hoare triple {145665#true} assume !false; {145665#true} is VALID [2022-04-15 11:45:41,899 INFO L290 TraceCheckUtils]: 59: Hoare triple {145665#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,899 INFO L290 TraceCheckUtils]: 60: Hoare triple {145665#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,899 INFO L290 TraceCheckUtils]: 61: Hoare triple {145665#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,899 INFO L290 TraceCheckUtils]: 62: Hoare triple {145665#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {145670#(= |ssl3_connect_#t~mem52| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:41,900 INFO L290 TraceCheckUtils]: 63: Hoare triple {145670#(= |ssl3_connect_#t~mem52| (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); {145671#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:41,900 INFO L290 TraceCheckUtils]: 64: Hoare triple {145671#(not (= 20480 (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); {145671#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:41,900 INFO L290 TraceCheckUtils]: 65: Hoare triple {145671#(not (= 20480 (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); {145671#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:41,901 INFO L290 TraceCheckUtils]: 66: Hoare triple {145671#(not (= 20480 (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); {145671#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:41,901 INFO L290 TraceCheckUtils]: 67: Hoare triple {145671#(not (= 20480 (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); {145671#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:41,901 INFO L290 TraceCheckUtils]: 68: Hoare triple {145671#(not (= 20480 (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); {145672#(not (= |ssl3_connect_#t~mem58| 20480))} is VALID [2022-04-15 11:45:41,901 INFO L290 TraceCheckUtils]: 69: Hoare triple {145672#(not (= |ssl3_connect_#t~mem58| 20480))} assume 4400 == #t~mem58;havoc #t~mem58; {145665#true} is VALID [2022-04-15 11:45:41,901 INFO L290 TraceCheckUtils]: 70: Hoare triple {145665#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); {145665#true} is VALID [2022-04-15 11:45:41,901 INFO L290 TraceCheckUtils]: 71: Hoare triple {145665#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; {145665#true} is VALID [2022-04-15 11:45:41,902 INFO L290 TraceCheckUtils]: 72: Hoare triple {145665#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {145665#true} is VALID [2022-04-15 11:45:41,902 INFO L290 TraceCheckUtils]: 73: Hoare triple {145665#true} assume !(~ret~0 <= 0); {145665#true} is VALID [2022-04-15 11:45:41,902 INFO L290 TraceCheckUtils]: 74: Hoare triple {145665#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,902 INFO L290 TraceCheckUtils]: 75: Hoare triple {145665#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,902 INFO L290 TraceCheckUtils]: 76: Hoare triple {145665#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {145665#true} is VALID [2022-04-15 11:45:41,902 INFO L290 TraceCheckUtils]: 77: Hoare triple {145665#true} ~skip~0 := 0; {145665#true} is VALID [2022-04-15 11:45:41,902 INFO L290 TraceCheckUtils]: 78: Hoare triple {145665#true} assume !false; {145665#true} is VALID [2022-04-15 11:45:41,902 INFO L290 TraceCheckUtils]: 79: Hoare triple {145665#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,902 INFO L290 TraceCheckUtils]: 80: Hoare triple {145665#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,902 INFO L290 TraceCheckUtils]: 81: Hoare triple {145665#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,902 INFO L290 TraceCheckUtils]: 82: Hoare triple {145665#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,902 INFO L290 TraceCheckUtils]: 83: Hoare triple {145665#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,902 INFO L290 TraceCheckUtils]: 84: Hoare triple {145665#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,902 INFO L290 TraceCheckUtils]: 85: Hoare triple {145665#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,902 INFO L290 TraceCheckUtils]: 86: Hoare triple {145665#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,903 INFO L290 TraceCheckUtils]: 87: Hoare triple {145665#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,903 INFO L290 TraceCheckUtils]: 88: Hoare triple {145665#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,903 INFO L290 TraceCheckUtils]: 89: Hoare triple {145665#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,903 INFO L290 TraceCheckUtils]: 90: Hoare triple {145665#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,903 INFO L290 TraceCheckUtils]: 91: Hoare triple {145665#true} assume 4416 == #t~mem60;havoc #t~mem60; {145665#true} is VALID [2022-04-15 11:45:41,903 INFO L290 TraceCheckUtils]: 92: Hoare triple {145665#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {145665#true} is VALID [2022-04-15 11:45:41,903 INFO L290 TraceCheckUtils]: 93: Hoare triple {145665#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {145665#true} is VALID [2022-04-15 11:45:41,903 INFO L290 TraceCheckUtils]: 94: Hoare triple {145665#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); {145665#true} is VALID [2022-04-15 11:45:41,903 INFO L290 TraceCheckUtils]: 95: Hoare triple {145665#true} assume !(0 == ~tmp___6~0); {145665#true} is VALID [2022-04-15 11:45:41,903 INFO L290 TraceCheckUtils]: 96: Hoare triple {145665#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,903 INFO L290 TraceCheckUtils]: 97: Hoare triple {145665#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {145665#true} is VALID [2022-04-15 11:45:41,903 INFO L290 TraceCheckUtils]: 98: Hoare triple {145665#true} ~skip~0 := 0; {145665#true} is VALID [2022-04-15 11:45:41,903 INFO L290 TraceCheckUtils]: 99: Hoare triple {145665#true} assume !false; {145665#true} is VALID [2022-04-15 11:45:41,903 INFO L290 TraceCheckUtils]: 100: Hoare triple {145665#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,904 INFO L290 TraceCheckUtils]: 101: Hoare triple {145665#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,904 INFO L290 TraceCheckUtils]: 102: Hoare triple {145665#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,904 INFO L290 TraceCheckUtils]: 103: Hoare triple {145665#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,904 INFO L290 TraceCheckUtils]: 104: Hoare triple {145665#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,904 INFO L290 TraceCheckUtils]: 105: Hoare triple {145665#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,904 INFO L290 TraceCheckUtils]: 106: Hoare triple {145665#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,904 INFO L290 TraceCheckUtils]: 107: Hoare triple {145665#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,904 INFO L290 TraceCheckUtils]: 108: Hoare triple {145665#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,904 INFO L290 TraceCheckUtils]: 109: Hoare triple {145665#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,904 INFO L290 TraceCheckUtils]: 110: Hoare triple {145665#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,904 INFO L290 TraceCheckUtils]: 111: Hoare triple {145665#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,904 INFO L290 TraceCheckUtils]: 112: Hoare triple {145665#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,904 INFO L290 TraceCheckUtils]: 113: Hoare triple {145665#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,904 INFO L290 TraceCheckUtils]: 114: Hoare triple {145665#true} assume 4432 == #t~mem62;havoc #t~mem62; {145665#true} is VALID [2022-04-15 11:45:41,904 INFO L290 TraceCheckUtils]: 115: Hoare triple {145665#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {145665#true} is VALID [2022-04-15 11:45:41,905 INFO L290 TraceCheckUtils]: 116: Hoare triple {145665#true} assume !(5 == ~blastFlag~0); {145665#true} is VALID [2022-04-15 11:45:41,905 INFO L290 TraceCheckUtils]: 117: Hoare triple {145665#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); {145665#true} is VALID [2022-04-15 11:45:41,905 INFO L290 TraceCheckUtils]: 118: Hoare triple {145665#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,905 INFO L290 TraceCheckUtils]: 119: Hoare triple {145665#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {145665#true} is VALID [2022-04-15 11:45:41,905 INFO L290 TraceCheckUtils]: 120: Hoare triple {145665#true} ~skip~0 := 0; {145665#true} is VALID [2022-04-15 11:45:41,905 INFO L290 TraceCheckUtils]: 121: Hoare triple {145665#true} assume !false; {145665#true} is VALID [2022-04-15 11:45:41,905 INFO L290 TraceCheckUtils]: 122: Hoare triple {145665#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,905 INFO L290 TraceCheckUtils]: 123: Hoare triple {145665#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,905 INFO L290 TraceCheckUtils]: 124: Hoare triple {145665#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,905 INFO L290 TraceCheckUtils]: 125: Hoare triple {145665#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,905 INFO L290 TraceCheckUtils]: 126: Hoare triple {145665#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,905 INFO L290 TraceCheckUtils]: 127: Hoare triple {145665#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,905 INFO L290 TraceCheckUtils]: 128: Hoare triple {145665#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,905 INFO L290 TraceCheckUtils]: 129: Hoare triple {145665#true} assume 4369 == #t~mem55;havoc #t~mem55; {145665#true} is VALID [2022-04-15 11:45:41,905 INFO L290 TraceCheckUtils]: 130: Hoare triple {145665#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; {145665#true} is VALID [2022-04-15 11:45:41,906 INFO L290 TraceCheckUtils]: 131: Hoare triple {145665#true} assume !(0 == ~blastFlag~0); {145665#true} is VALID [2022-04-15 11:45:41,906 INFO L290 TraceCheckUtils]: 132: Hoare triple {145665#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {145665#true} is VALID [2022-04-15 11:45:41,906 INFO L290 TraceCheckUtils]: 133: Hoare triple {145665#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); {145665#true} is VALID [2022-04-15 11:45:41,906 INFO L290 TraceCheckUtils]: 134: Hoare triple {145665#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; {145665#true} is VALID [2022-04-15 11:45:41,906 INFO L290 TraceCheckUtils]: 135: Hoare triple {145665#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,906 INFO L290 TraceCheckUtils]: 136: Hoare triple {145665#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {145665#true} is VALID [2022-04-15 11:45:41,906 INFO L290 TraceCheckUtils]: 137: Hoare triple {145665#true} ~skip~0 := 0; {145665#true} is VALID [2022-04-15 11:45:41,906 INFO L290 TraceCheckUtils]: 138: Hoare triple {145665#true} assume !false; {145665#true} is VALID [2022-04-15 11:45:41,906 INFO L290 TraceCheckUtils]: 139: Hoare triple {145665#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,906 INFO L290 TraceCheckUtils]: 140: Hoare triple {145665#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,906 INFO L290 TraceCheckUtils]: 141: Hoare triple {145665#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,906 INFO L290 TraceCheckUtils]: 142: Hoare triple {145665#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,906 INFO L290 TraceCheckUtils]: 143: Hoare triple {145665#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,906 INFO L290 TraceCheckUtils]: 144: Hoare triple {145665#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,906 INFO L290 TraceCheckUtils]: 145: Hoare triple {145665#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,907 INFO L290 TraceCheckUtils]: 146: Hoare triple {145665#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,907 INFO L290 TraceCheckUtils]: 147: Hoare triple {145665#true} assume 4384 == #t~mem56;havoc #t~mem56; {145665#true} is VALID [2022-04-15 11:45:41,907 INFO L290 TraceCheckUtils]: 148: Hoare triple {145665#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {145665#true} is VALID [2022-04-15 11:45:41,907 INFO L290 TraceCheckUtils]: 149: Hoare triple {145665#true} assume !(1 == ~blastFlag~0); {145665#true} is VALID [2022-04-15 11:45:41,907 INFO L290 TraceCheckUtils]: 150: Hoare triple {145665#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {145665#true} is VALID [2022-04-15 11:45:41,908 INFO L290 TraceCheckUtils]: 151: Hoare triple {145665#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {145671#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:41,908 INFO L290 TraceCheckUtils]: 152: Hoare triple {145671#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {145671#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:41,909 INFO L290 TraceCheckUtils]: 153: Hoare triple {145671#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {145671#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:41,909 INFO L290 TraceCheckUtils]: 154: Hoare triple {145671#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {145671#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:41,909 INFO L290 TraceCheckUtils]: 155: Hoare triple {145671#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {145671#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:41,910 INFO L290 TraceCheckUtils]: 156: Hoare triple {145671#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {145671#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:41,910 INFO L290 TraceCheckUtils]: 157: Hoare triple {145671#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {145671#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:41,910 INFO L290 TraceCheckUtils]: 158: Hoare triple {145671#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {145671#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:41,911 INFO L290 TraceCheckUtils]: 159: Hoare triple {145671#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {145671#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:41,911 INFO L290 TraceCheckUtils]: 160: Hoare triple {145671#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {145673#(not (= |ssl3_connect_#t~mem52| 20480))} is VALID [2022-04-15 11:45:41,911 INFO L290 TraceCheckUtils]: 161: Hoare triple {145673#(not (= |ssl3_connect_#t~mem52| 20480))} assume 20480 == #t~mem52;havoc #t~mem52; {145666#false} is VALID [2022-04-15 11:45:41,911 INFO L290 TraceCheckUtils]: 162: Hoare triple {145666#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {145666#false} is VALID [2022-04-15 11:45:41,911 INFO L290 TraceCheckUtils]: 163: Hoare triple {145666#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {145666#false} is VALID [2022-04-15 11:45:41,911 INFO L290 TraceCheckUtils]: 164: Hoare triple {145666#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {145666#false} is VALID [2022-04-15 11:45:41,911 INFO L290 TraceCheckUtils]: 165: Hoare triple {145666#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); {145666#false} is VALID [2022-04-15 11:45:41,911 INFO L290 TraceCheckUtils]: 166: Hoare triple {145666#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {145666#false} is VALID [2022-04-15 11:45:41,912 INFO L290 TraceCheckUtils]: 167: Hoare triple {145666#false} assume !(0 == ~tmp___4~0); {145666#false} is VALID [2022-04-15 11:45:41,912 INFO L290 TraceCheckUtils]: 168: Hoare triple {145666#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); {145666#false} is VALID [2022-04-15 11:45:41,912 INFO L290 TraceCheckUtils]: 169: Hoare triple {145666#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); {145666#false} is VALID [2022-04-15 11:45:41,912 INFO L290 TraceCheckUtils]: 170: Hoare triple {145666#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {145666#false} is VALID [2022-04-15 11:45:41,912 INFO L290 TraceCheckUtils]: 171: Hoare triple {145666#false} ~skip~0 := 0; {145666#false} is VALID [2022-04-15 11:45:41,912 INFO L290 TraceCheckUtils]: 172: Hoare triple {145666#false} assume !false; {145666#false} is VALID [2022-04-15 11:45:41,912 INFO L290 TraceCheckUtils]: 173: Hoare triple {145666#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); {145666#false} is VALID [2022-04-15 11:45:41,912 INFO L290 TraceCheckUtils]: 174: Hoare triple {145666#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {145666#false} is VALID [2022-04-15 11:45:41,912 INFO L290 TraceCheckUtils]: 175: Hoare triple {145666#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {145666#false} is VALID [2022-04-15 11:45:41,912 INFO L290 TraceCheckUtils]: 176: Hoare triple {145666#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {145666#false} is VALID [2022-04-15 11:45:41,912 INFO L290 TraceCheckUtils]: 177: Hoare triple {145666#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {145666#false} is VALID [2022-04-15 11:45:41,912 INFO L290 TraceCheckUtils]: 178: Hoare triple {145666#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {145666#false} is VALID [2022-04-15 11:45:41,912 INFO L290 TraceCheckUtils]: 179: Hoare triple {145666#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {145666#false} is VALID [2022-04-15 11:45:41,912 INFO L290 TraceCheckUtils]: 180: Hoare triple {145666#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {145666#false} is VALID [2022-04-15 11:45:41,913 INFO L290 TraceCheckUtils]: 181: Hoare triple {145666#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {145666#false} is VALID [2022-04-15 11:45:41,913 INFO L290 TraceCheckUtils]: 182: Hoare triple {145666#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {145666#false} is VALID [2022-04-15 11:45:41,913 INFO L290 TraceCheckUtils]: 183: Hoare triple {145666#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {145666#false} is VALID [2022-04-15 11:45:41,913 INFO L290 TraceCheckUtils]: 184: Hoare triple {145666#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {145666#false} is VALID [2022-04-15 11:45:41,913 INFO L290 TraceCheckUtils]: 185: Hoare triple {145666#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {145666#false} is VALID [2022-04-15 11:45:41,913 INFO L290 TraceCheckUtils]: 186: Hoare triple {145666#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {145666#false} is VALID [2022-04-15 11:45:41,913 INFO L290 TraceCheckUtils]: 187: Hoare triple {145666#false} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {145666#false} is VALID [2022-04-15 11:45:41,913 INFO L290 TraceCheckUtils]: 188: Hoare triple {145666#false} assume 4433 == #t~mem63;havoc #t~mem63; {145666#false} is VALID [2022-04-15 11:45:41,913 INFO L290 TraceCheckUtils]: 189: Hoare triple {145666#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {145666#false} is VALID [2022-04-15 11:45:41,913 INFO L290 TraceCheckUtils]: 190: Hoare triple {145666#false} assume 5 == ~blastFlag~0; {145666#false} is VALID [2022-04-15 11:45:41,913 INFO L290 TraceCheckUtils]: 191: Hoare triple {145666#false} assume !false; {145666#false} is VALID [2022-04-15 11:45:41,914 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 195 proven. 24 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2022-04-15 11:45:41,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:45:41,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546958379] [2022-04-15 11:45:41,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546958379] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:45:41,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828075173] [2022-04-15 11:45:41,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:45:41,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:45:41,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:45:41,915 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 11:45:41,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process