/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/openssl/s3_clnt.blast.03.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 16:09:47,673 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 16:09:47,674 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 16:09:47,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 16:09:47,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 16:09:47,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 16:09:47,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 16:09:47,712 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 16:09:47,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 16:09:47,716 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 16:09:47,716 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 16:09:47,717 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 16:09:47,718 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 16:09:47,719 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 16:09:47,720 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 16:09:47,721 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 16:09:47,721 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 16:09:47,722 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 16:09:47,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 16:09:47,728 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 16:09:47,729 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 16:09:47,730 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 16:09:47,731 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 16:09:47,731 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 16:09:47,732 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 16:09:47,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 16:09:47,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 16:09:47,737 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 16:09:47,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 16:09:47,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 16:09:47,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 16:09:47,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 16:09:47,738 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 16:09:47,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 16:09:47,739 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 16:09:47,739 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 16:09:47,740 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 16:09:47,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 16:09:47,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 16:09:47,740 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 16:09:47,741 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 16:09:47,744 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 16:09:47,744 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-07 16:09:47,768 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 16:09:47,768 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 16:09:47,768 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 16:09:47,768 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 16:09:47,769 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 16:09:47,769 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 16:09:47,769 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 16:09:47,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 16:09:47,769 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 16:09:47,770 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 16:09:47,770 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 16:09:47,770 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 16:09:47,770 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 16:09:47,770 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 16:09:47,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 16:09:47,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 16:09:47,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 16:09:47,771 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 16:09:47,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 16:09:47,771 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 16:09:47,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 16:09:47,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 16:09:47,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 16:09:47,772 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 16:09:47,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:09:47,772 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 16:09:47,772 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 16:09:47,772 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 16:09:47,772 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 16:09:47,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 16:09:47,772 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 16:09:47,772 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 16:09:47,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 16:09:47,773 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-07 16:09:47,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 16:09:47,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 16:09:47,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 16:09:47,926 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 16:09:47,926 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 16:09:47,927 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.03.i.cil-2.c [2022-04-07 16:09:47,969 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2499ad0a4/8badbf4977e4401fac79e3084193cd8f/FLAGc712e94eb [2022-04-07 16:09:48,447 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 16:09:48,448 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.03.i.cil-2.c [2022-04-07 16:09:48,461 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2499ad0a4/8badbf4977e4401fac79e3084193cd8f/FLAGc712e94eb [2022-04-07 16:09:48,475 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2499ad0a4/8badbf4977e4401fac79e3084193cd8f [2022-04-07 16:09:48,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 16:09:48,477 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 16:09:48,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 16:09:48,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 16:09:48,485 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 16:09:48,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:09:48" (1/1) ... [2022-04-07 16:09:48,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1457a84b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:48, skipping insertion in model container [2022-04-07 16:09:48,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:09:48" (1/1) ... [2022-04-07 16:09:48,491 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 16:09:48,540 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 16:09:48,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.03.i.cil-2.c[65397,65410] [2022-04-07 16:09:48,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:09:48,868 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 16:09:48,947 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.03.i.cil-2.c[65397,65410] [2022-04-07 16:09:48,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:09:48,972 INFO L208 MainTranslator]: Completed translation [2022-04-07 16:09:48,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:48 WrapperNode [2022-04-07 16:09:48,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 16:09:48,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 16:09:48,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 16:09:48,973 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 16:09:48,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:48" (1/1) ... [2022-04-07 16:09:48,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:48" (1/1) ... [2022-04-07 16:09:49,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:48" (1/1) ... [2022-04-07 16:09:49,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:48" (1/1) ... [2022-04-07 16:09:49,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:48" (1/1) ... [2022-04-07 16:09:49,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:48" (1/1) ... [2022-04-07 16:09:49,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:48" (1/1) ... [2022-04-07 16:09:49,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 16:09:49,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 16:09:49,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 16:09:49,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 16:09:49,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:48" (1/1) ... [2022-04-07 16:09:49,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:09:49,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:09:49,120 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-07 16:09:49,126 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-07 16:09:49,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 16:09:49,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 16:09:49,152 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 16:09:49,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-07 16:09:49,154 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-07 16:09:49,154 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 16:09:49,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-07 16:09:49,154 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-07 16:09:49,154 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-07 16:09:49,154 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-07 16:09:49,154 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 16:09:49,154 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 16:09:49,154 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 16:09:49,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 16:09:49,154 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-07 16:09:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-07 16:09:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 16:09:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-07 16:09:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-07 16:09:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-07 16:09:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-07 16:09:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-07 16:09:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-07 16:09:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-07 16:09:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-07 16:09:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-07 16:09:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 16:09:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-07 16:09:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 16:09:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-07 16:09:49,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 16:09:49,156 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-07 16:09:49,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-07 16:09:49,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 16:09:49,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 16:09:49,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 16:09:49,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-07 16:09:49,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-07 16:09:49,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-07 16:09:49,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-07 16:09:49,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 16:09:49,298 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 16:09:49,301 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 16:09:50,505 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-07 16:09:50,912 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-07 16:09:50,912 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-07 16:09:50,921 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 16:09:50,944 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 16:09:50,944 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 16:09:50,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:09:50 BoogieIcfgContainer [2022-04-07 16:09:50,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 16:09:50,946 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 16:09:50,946 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 16:09:50,950 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 16:09:50,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 04:09:48" (1/3) ... [2022-04-07 16:09:50,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dc2cc9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:09:50, skipping insertion in model container [2022-04-07 16:09:50,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:48" (2/3) ... [2022-04-07 16:09:50,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dc2cc9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:09:50, skipping insertion in model container [2022-04-07 16:09:50,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:09:50" (3/3) ... [2022-04-07 16:09:50,952 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03.i.cil-2.c [2022-04-07 16:09:50,957 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 16:09:50,957 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 16:09:50,999 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 16:09:51,005 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-07 16:09:51,005 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 16:09:51,027 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-07 16:09:51,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-07 16:09:51,031 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:09:51,031 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-07 16:09:51,031 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:09:51,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:09:51,035 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 1 times [2022-04-07 16:09:51,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:09:51,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53726264] [2022-04-07 16:09:51,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:09:51,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:09:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:51,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:09:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:51,592 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-07 16:09:51,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-07 16:09:51,593 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-07 16:09:51,596 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-07 16:09:51,596 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-07 16:09:51,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-07 16:09:51,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-07 16:09:51,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {141#true} call #t~ret158 := main(); {141#true} is VALID [2022-04-07 16:09:51,603 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-07 16:09:51,603 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-07 16:09:51,621 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-07 16:09:51,622 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-07 16:09:51,623 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-07 16:09:51,624 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-07 16:09:51,624 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-07 16:09:51,625 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-07 16:09:51,625 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-07 16:09:51,626 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-07 16:09:51,626 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-07 16:09:51,626 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-07 16:09:51,626 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-07 16:09:51,626 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-07 16:09:51,627 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-07 16:09:51,627 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-07 16:09:51,627 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-07 16:09:51,627 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-07 16:09:51,627 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-07 16:09:51,628 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-07 16:09:51,628 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-07 16:09:51,628 INFO L290 TraceCheckUtils]: 26: Hoare triple {142#false} assume 4432 == #t~mem62;havoc #t~mem62; {142#false} is VALID [2022-04-07 16:09:51,628 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-07 16:09:51,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {142#false} assume 5 == ~blastFlag~0; {142#false} is VALID [2022-04-07 16:09:51,628 INFO L290 TraceCheckUtils]: 29: Hoare triple {142#false} assume !false; {142#false} is VALID [2022-04-07 16:09:51,629 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-07 16:09:51,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:09:51,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53726264] [2022-04-07 16:09:51,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53726264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:09:51,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:09:51,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:09:51,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865881085] [2022-04-07 16:09:51,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:09:51,636 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-07 16:09:51,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:09:51,640 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-07 16:09:51,675 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-07 16:09:51,675 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:09:51,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:09:51,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:09:51,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:09:51,697 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-07 16:09:53,741 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-07 16:09:54,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:54,812 INFO L93 Difference]: Finished difference Result 267 states and 442 transitions. [2022-04-07 16:09:54,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:09:54,817 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-07 16:09:54,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:09:54,818 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-07 16:09:54,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-07 16:09:54,834 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-07 16:09:54,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-07 16:09:54,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-07 16:09:55,128 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-07 16:09:55,136 INFO L225 Difference]: With dead ends: 267 [2022-04-07 16:09:55,136 INFO L226 Difference]: Without dead ends: 122 [2022-04-07 16:09:55,138 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-07 16:09:55,140 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-07 16:09:55,140 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-07 16:09:55,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-07 16:09:55,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-04-07 16:09:55,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:09:55,165 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-07 16:09:55,166 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-07 16:09:55,167 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-07 16:09:55,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:55,171 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-07 16:09:55,171 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-07 16:09:55,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:55,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:55,173 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-07 16:09:55,173 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-07 16:09:55,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:55,178 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-07 16:09:55,178 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-07 16:09:55,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:55,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:55,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:09:55,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:09:55,179 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-07 16:09:55,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2022-04-07 16:09:55,183 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 30 [2022-04-07 16:09:55,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:09:55,183 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2022-04-07 16:09:55,183 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-07 16:09:55,183 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2022-04-07 16:09:55,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-07 16:09:55,184 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:09:55,185 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-07 16:09:55,185 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 16:09:55,185 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:09:55,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:09:55,185 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 1 times [2022-04-07 16:09:55,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:09:55,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049385511] [2022-04-07 16:09:55,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:09:55,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:09:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:55,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:09:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:55,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {861#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {855#true} is VALID [2022-04-07 16:09:55,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {855#true} assume true; {855#true} is VALID [2022-04-07 16:09:55,371 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {855#true} {855#true} #593#return; {855#true} is VALID [2022-04-07 16:09:55,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {855#true} call ULTIMATE.init(); {861#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:09:55,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {861#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {855#true} is VALID [2022-04-07 16:09:55,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {855#true} assume true; {855#true} is VALID [2022-04-07 16:09:55,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {855#true} {855#true} #593#return; {855#true} is VALID [2022-04-07 16:09:55,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {855#true} call #t~ret158 := main(); {855#true} is VALID [2022-04-07 16:09:55,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {855#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; {855#true} is VALID [2022-04-07 16:09:55,373 INFO L272 TraceCheckUtils]: 6: Hoare triple {855#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {855#true} is VALID [2022-04-07 16:09:55,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {855#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); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {860#(= 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; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {860#(= 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; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {860#(= 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)))); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !false; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {860#(= 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); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume 12292 == #t~mem49;havoc #t~mem49; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {860#(= 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; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call write~int(0, ~s.base, 36 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {860#(= 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); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___4~0); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {860#(= 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); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,381 INFO L290 TraceCheckUtils]: 22: Hoare triple {860#(= 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); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} ~skip~0 := 0; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,382 INFO L290 TraceCheckUtils]: 25: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !false; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,382 INFO L290 TraceCheckUtils]: 26: Hoare triple {860#(= 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); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,382 INFO L290 TraceCheckUtils]: 27: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,382 INFO L290 TraceCheckUtils]: 28: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,383 INFO L290 TraceCheckUtils]: 29: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,383 INFO L290 TraceCheckUtils]: 30: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,383 INFO L290 TraceCheckUtils]: 31: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,384 INFO L290 TraceCheckUtils]: 32: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,384 INFO L290 TraceCheckUtils]: 33: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,384 INFO L290 TraceCheckUtils]: 34: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,385 INFO L290 TraceCheckUtils]: 35: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,385 INFO L290 TraceCheckUtils]: 36: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,386 INFO L290 TraceCheckUtils]: 37: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,386 INFO L290 TraceCheckUtils]: 38: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,386 INFO L290 TraceCheckUtils]: 39: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,387 INFO L290 TraceCheckUtils]: 40: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume 4432 == #t~mem62;havoc #t~mem62; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,387 INFO L290 TraceCheckUtils]: 41: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:55,387 INFO L290 TraceCheckUtils]: 42: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume 5 == ~blastFlag~0; {856#false} is VALID [2022-04-07 16:09:55,387 INFO L290 TraceCheckUtils]: 43: Hoare triple {856#false} assume !false; {856#false} is VALID [2022-04-07 16:09:55,388 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-07 16:09:55,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:09:55,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049385511] [2022-04-07 16:09:55,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049385511] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:09:55,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:09:55,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:09:55,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791155789] [2022-04-07 16:09:55,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:09:55,390 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-07 16:09:55,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:09:55,390 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-07 16:09:55,421 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-07 16:09:55,422 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:09:55,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:09:55,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:09:55,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:09:55,423 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-07 16:09:57,440 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-07 16:09:58,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:58,007 INFO L93 Difference]: Finished difference Result 327 states and 490 transitions. [2022-04-07 16:09:58,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:09:58,008 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-07 16:09:58,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:09:58,008 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-07 16:09:58,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-07 16:09:58,011 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-07 16:09:58,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-07 16:09:58,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-07 16:09:58,361 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-07 16:09:58,365 INFO L225 Difference]: With dead ends: 327 [2022-04-07 16:09:58,365 INFO L226 Difference]: Without dead ends: 222 [2022-04-07 16:09:58,366 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-07 16:09:58,366 INFO L913 BasicCegarLoop]: 166 mSDtfsCounter, 124 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-07 16:09:58,367 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 319 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 190 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-07 16:09:58,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-07 16:09:58,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-04-07 16:09:58,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:09:58,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:58,378 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:58,378 INFO L87 Difference]: Start difference. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:58,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:58,385 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-07 16:09:58,385 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-07 16:09:58,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:58,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:58,388 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-07 16:09:58,388 INFO L87 Difference]: Start difference. First operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-07 16:09:58,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:58,394 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-07 16:09:58,394 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-07 16:09:58,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:58,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:58,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:09:58,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:09:58,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:58,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 326 transitions. [2022-04-07 16:09:58,401 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 326 transitions. Word has length 44 [2022-04-07 16:09:58,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:09:58,402 INFO L478 AbstractCegarLoop]: Abstraction has 222 states and 326 transitions. [2022-04-07 16:09:58,402 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-07 16:09:58,402 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-07 16:09:58,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-07 16:09:58,403 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:09:58,403 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-07 16:09:58,403 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 16:09:58,403 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:09:58,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:09:58,404 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 1 times [2022-04-07 16:09:58,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:09:58,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699783150] [2022-04-07 16:09:58,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:09:58,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:09:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:58,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:09:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:58,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {1959#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {1952#true} is VALID [2022-04-07 16:09:58,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {1952#true} assume true; {1952#true} is VALID [2022-04-07 16:09:58,608 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1952#true} {1952#true} #593#return; {1952#true} is VALID [2022-04-07 16:09:58,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {1952#true} call ULTIMATE.init(); {1959#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:09:58,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {1959#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {1952#true} is VALID [2022-04-07 16:09:58,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {1952#true} assume true; {1952#true} is VALID [2022-04-07 16:09:58,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1952#true} {1952#true} #593#return; {1952#true} is VALID [2022-04-07 16:09:58,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {1952#true} call #t~ret158 := main(); {1952#true} is VALID [2022-04-07 16:09:58,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {1952#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; {1952#true} is VALID [2022-04-07 16:09:58,609 INFO L272 TraceCheckUtils]: 6: Hoare triple {1952#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {1952#true} is VALID [2022-04-07 16:09:58,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {1952#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); {1952#true} is VALID [2022-04-07 16:09:58,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {1952#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; {1952#true} is VALID [2022-04-07 16:09:58,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {1952#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; {1952#true} is VALID [2022-04-07 16:09:58,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {1952#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1952#true} is VALID [2022-04-07 16:09:58,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {1952#true} assume !false; {1952#true} is VALID [2022-04-07 16:09:58,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {1952#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1952#true} is VALID [2022-04-07 16:09:58,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {1952#true} assume 12292 == #t~mem49;havoc #t~mem49; {1952#true} is VALID [2022-04-07 16:09:58,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {1952#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; {1952#true} is VALID [2022-04-07 16:09:58,610 INFO L290 TraceCheckUtils]: 15: Hoare triple {1952#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {1952#true} is VALID [2022-04-07 16:09:58,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {1952#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {1952#true} is VALID [2022-04-07 16:09:58,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {1952#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {1952#true} is VALID [2022-04-07 16:09:58,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {1952#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); {1952#true} is VALID [2022-04-07 16:09:58,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {1952#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {1952#true} is VALID [2022-04-07 16:09:58,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {1952#true} assume !(0 == ~tmp___4~0); {1952#true} is VALID [2022-04-07 16:09:58,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {1952#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); {1952#true} is VALID [2022-04-07 16:09:58,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {1952#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {1952#true} is VALID [2022-04-07 16:09:58,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {1952#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {1952#true} is VALID [2022-04-07 16:09:58,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {1952#true} ~skip~0 := 0; {1952#true} is VALID [2022-04-07 16:09:58,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {1952#true} assume !false; {1952#true} is VALID [2022-04-07 16:09:58,612 INFO L290 TraceCheckUtils]: 26: Hoare triple {1952#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1952#true} is VALID [2022-04-07 16:09:58,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {1952#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1952#true} is VALID [2022-04-07 16:09:58,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {1952#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1952#true} is VALID [2022-04-07 16:09:58,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {1952#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1952#true} is VALID [2022-04-07 16:09:58,612 INFO L290 TraceCheckUtils]: 30: Hoare triple {1952#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1952#true} is VALID [2022-04-07 16:09:58,612 INFO L290 TraceCheckUtils]: 31: Hoare triple {1952#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1952#true} is VALID [2022-04-07 16:09:58,612 INFO L290 TraceCheckUtils]: 32: Hoare triple {1952#true} assume 4368 == #t~mem54;havoc #t~mem54; {1952#true} is VALID [2022-04-07 16:09:58,612 INFO L290 TraceCheckUtils]: 33: Hoare triple {1952#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; {1952#true} is VALID [2022-04-07 16:09:58,613 INFO L290 TraceCheckUtils]: 34: Hoare triple {1952#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {1952#true} is VALID [2022-04-07 16:09:58,614 INFO L290 TraceCheckUtils]: 35: Hoare triple {1952#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); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:58,615 INFO L290 TraceCheckUtils]: 36: Hoare triple {1957#(= 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; {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:58,621 INFO L290 TraceCheckUtils]: 37: Hoare triple {1957#(= 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); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:58,621 INFO L290 TraceCheckUtils]: 38: Hoare triple {1957#(= 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; {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:58,622 INFO L290 TraceCheckUtils]: 39: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:58,622 INFO L290 TraceCheckUtils]: 40: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:58,623 INFO L290 TraceCheckUtils]: 41: Hoare triple {1957#(= 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); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:58,624 INFO L290 TraceCheckUtils]: 42: Hoare triple {1957#(= 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); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:58,624 INFO L290 TraceCheckUtils]: 43: Hoare triple {1957#(= 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); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:58,625 INFO L290 TraceCheckUtils]: 44: Hoare triple {1957#(= 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); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:58,625 INFO L290 TraceCheckUtils]: 45: Hoare triple {1957#(= 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); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:58,625 INFO L290 TraceCheckUtils]: 46: Hoare triple {1957#(= 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); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:58,626 INFO L290 TraceCheckUtils]: 47: Hoare triple {1957#(= 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); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:58,626 INFO L290 TraceCheckUtils]: 48: Hoare triple {1957#(= 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); {1958#(= |ssl3_connect_#t~mem56| 4384)} is VALID [2022-04-07 16:09:58,626 INFO L290 TraceCheckUtils]: 49: Hoare triple {1958#(= |ssl3_connect_#t~mem56| 4384)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1953#false} is VALID [2022-04-07 16:09:58,626 INFO L290 TraceCheckUtils]: 50: Hoare triple {1953#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1953#false} is VALID [2022-04-07 16:09:58,627 INFO L290 TraceCheckUtils]: 51: Hoare triple {1953#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1953#false} is VALID [2022-04-07 16:09:58,627 INFO L290 TraceCheckUtils]: 52: Hoare triple {1953#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1953#false} is VALID [2022-04-07 16:09:58,627 INFO L290 TraceCheckUtils]: 53: Hoare triple {1953#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1953#false} is VALID [2022-04-07 16:09:58,627 INFO L290 TraceCheckUtils]: 54: Hoare triple {1953#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1953#false} is VALID [2022-04-07 16:09:58,627 INFO L290 TraceCheckUtils]: 55: Hoare triple {1953#false} assume 4432 == #t~mem62;havoc #t~mem62; {1953#false} is VALID [2022-04-07 16:09:58,627 INFO L290 TraceCheckUtils]: 56: Hoare triple {1953#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {1953#false} is VALID [2022-04-07 16:09:58,627 INFO L290 TraceCheckUtils]: 57: Hoare triple {1953#false} assume 5 == ~blastFlag~0; {1953#false} is VALID [2022-04-07 16:09:58,627 INFO L290 TraceCheckUtils]: 58: Hoare triple {1953#false} assume !false; {1953#false} is VALID [2022-04-07 16:09:58,629 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-07 16:09:58,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:09:58,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699783150] [2022-04-07 16:09:58,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699783150] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:09:58,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:09:58,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:09:58,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355713912] [2022-04-07 16:09:58,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:09:58,630 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-07 16:09:58,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:09:58,631 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-07 16:09:58,669 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-07 16:09:58,669 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:09:58,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:09:58,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:09:58,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:09:58,672 INFO L87 Difference]: Start difference. First operand 222 states and 326 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:00,692 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-07 16:10:01,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:01,586 INFO L93 Difference]: Finished difference Result 363 states and 539 transitions. [2022-04-07 16:10:01,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:01,586 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-07 16:10:01,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:01,587 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-07 16:10:01,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-07 16:10:01,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-07 16:10:01,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-07 16:10:01,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 388 transitions. [2022-04-07 16:10:01,845 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-07 16:10:01,849 INFO L225 Difference]: With dead ends: 363 [2022-04-07 16:10:01,849 INFO L226 Difference]: Without dead ends: 258 [2022-04-07 16:10:01,850 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-07 16:10:01,851 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 33 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:01,852 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 486 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 360 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:10:01,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-04-07 16:10:01,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 240. [2022-04-07 16:10:01,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:01,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:01,859 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:01,860 INFO L87 Difference]: Start difference. First operand 258 states. Second operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:01,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:01,865 INFO L93 Difference]: Finished difference Result 258 states and 380 transitions. [2022-04-07 16:10:01,865 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 380 transitions. [2022-04-07 16:10:01,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:01,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:01,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 258 states. [2022-04-07 16:10:01,866 INFO L87 Difference]: Start difference. First operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 258 states. [2022-04-07 16:10:01,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:01,872 INFO L93 Difference]: Finished difference Result 258 states and 380 transitions. [2022-04-07 16:10:01,872 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 380 transitions. [2022-04-07 16:10:01,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:01,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:01,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:01,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:01,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:01,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 356 transitions. [2022-04-07 16:10:01,877 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 356 transitions. Word has length 59 [2022-04-07 16:10:01,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:01,878 INFO L478 AbstractCegarLoop]: Abstraction has 240 states and 356 transitions. [2022-04-07 16:10:01,878 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-07 16:10:01,878 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 356 transitions. [2022-04-07 16:10:01,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-07 16:10:01,878 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:01,879 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-07 16:10:01,879 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 16:10:01,879 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:01,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:01,879 INFO L85 PathProgramCache]: Analyzing trace with hash -2084364124, now seen corresponding path program 2 times [2022-04-07 16:10:01,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:01,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800619264] [2022-04-07 16:10:01,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:01,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:02,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:02,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {3191#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {3184#true} is VALID [2022-04-07 16:10:02,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-07 16:10:02,018 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3184#true} {3184#true} #593#return; {3184#true} is VALID [2022-04-07 16:10:02,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {3184#true} call ULTIMATE.init(); {3191#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:02,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {3191#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {3184#true} is VALID [2022-04-07 16:10:02,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-07 16:10:02,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3184#true} {3184#true} #593#return; {3184#true} is VALID [2022-04-07 16:10:02,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {3184#true} call #t~ret158 := main(); {3184#true} is VALID [2022-04-07 16:10:02,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {3184#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; {3184#true} is VALID [2022-04-07 16:10:02,019 INFO L272 TraceCheckUtils]: 6: Hoare triple {3184#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {3184#true} is VALID [2022-04-07 16:10:02,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {3184#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); {3184#true} is VALID [2022-04-07 16:10:02,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {3184#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; {3184#true} is VALID [2022-04-07 16:10:02,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {3184#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; {3184#true} is VALID [2022-04-07 16:10:02,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {3184#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3184#true} is VALID [2022-04-07 16:10:02,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {3184#true} assume !false; {3184#true} is VALID [2022-04-07 16:10:02,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {3184#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3184#true} is VALID [2022-04-07 16:10:02,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {3184#true} assume 12292 == #t~mem49;havoc #t~mem49; {3184#true} is VALID [2022-04-07 16:10:02,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {3184#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; {3184#true} is VALID [2022-04-07 16:10:02,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {3184#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {3184#true} is VALID [2022-04-07 16:10:02,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {3184#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {3184#true} is VALID [2022-04-07 16:10:02,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {3184#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {3184#true} is VALID [2022-04-07 16:10:02,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {3184#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); {3184#true} is VALID [2022-04-07 16:10:02,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {3184#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {3184#true} is VALID [2022-04-07 16:10:02,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {3184#true} assume !(0 == ~tmp___4~0); {3184#true} is VALID [2022-04-07 16:10:02,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {3184#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); {3184#true} is VALID [2022-04-07 16:10:02,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {3184#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {3184#true} is VALID [2022-04-07 16:10:02,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {3184#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {3184#true} is VALID [2022-04-07 16:10:02,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {3184#true} ~skip~0 := 0; {3184#true} is VALID [2022-04-07 16:10:02,021 INFO L290 TraceCheckUtils]: 25: Hoare triple {3184#true} assume !false; {3184#true} is VALID [2022-04-07 16:10:02,021 INFO L290 TraceCheckUtils]: 26: Hoare triple {3184#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3184#true} is VALID [2022-04-07 16:10:02,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {3184#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3184#true} is VALID [2022-04-07 16:10:02,021 INFO L290 TraceCheckUtils]: 28: Hoare triple {3184#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3184#true} is VALID [2022-04-07 16:10:02,021 INFO L290 TraceCheckUtils]: 29: Hoare triple {3184#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3184#true} is VALID [2022-04-07 16:10:02,021 INFO L290 TraceCheckUtils]: 30: Hoare triple {3184#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3184#true} is VALID [2022-04-07 16:10:02,021 INFO L290 TraceCheckUtils]: 31: Hoare triple {3184#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3184#true} is VALID [2022-04-07 16:10:02,022 INFO L290 TraceCheckUtils]: 32: Hoare triple {3184#true} assume 4368 == #t~mem54;havoc #t~mem54; {3184#true} is VALID [2022-04-07 16:10:02,023 INFO L290 TraceCheckUtils]: 33: Hoare triple {3184#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; {3184#true} is VALID [2022-04-07 16:10:02,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {3184#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {3184#true} is VALID [2022-04-07 16:10:02,024 INFO L290 TraceCheckUtils]: 35: Hoare triple {3184#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); {3189#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:02,025 INFO L290 TraceCheckUtils]: 36: Hoare triple {3189#(= 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; {3189#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:02,025 INFO L290 TraceCheckUtils]: 37: Hoare triple {3189#(= 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); {3189#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:02,025 INFO L290 TraceCheckUtils]: 38: Hoare triple {3189#(= 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; {3189#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:02,026 INFO L290 TraceCheckUtils]: 39: Hoare triple {3189#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {3189#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:02,026 INFO L290 TraceCheckUtils]: 40: Hoare triple {3189#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {3189#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:02,026 INFO L290 TraceCheckUtils]: 41: Hoare triple {3189#(= 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); {3190#(= |ssl3_connect_#t~mem49| 4384)} is VALID [2022-04-07 16:10:02,027 INFO L290 TraceCheckUtils]: 42: Hoare triple {3190#(= |ssl3_connect_#t~mem49| 4384)} assume 12292 == #t~mem49;havoc #t~mem49; {3185#false} is VALID [2022-04-07 16:10:02,027 INFO L290 TraceCheckUtils]: 43: Hoare triple {3185#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; {3185#false} is VALID [2022-04-07 16:10:02,027 INFO L290 TraceCheckUtils]: 44: Hoare triple {3185#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {3185#false} is VALID [2022-04-07 16:10:02,027 INFO L290 TraceCheckUtils]: 45: Hoare triple {3185#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {3185#false} is VALID [2022-04-07 16:10:02,027 INFO L290 TraceCheckUtils]: 46: Hoare triple {3185#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {3185#false} is VALID [2022-04-07 16:10:02,027 INFO L290 TraceCheckUtils]: 47: Hoare triple {3185#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); {3185#false} is VALID [2022-04-07 16:10:02,027 INFO L290 TraceCheckUtils]: 48: Hoare triple {3185#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {3185#false} is VALID [2022-04-07 16:10:02,027 INFO L290 TraceCheckUtils]: 49: Hoare triple {3185#false} assume !(0 == ~tmp___4~0); {3185#false} is VALID [2022-04-07 16:10:02,027 INFO L290 TraceCheckUtils]: 50: Hoare triple {3185#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); {3185#false} is VALID [2022-04-07 16:10:02,027 INFO L290 TraceCheckUtils]: 51: Hoare triple {3185#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); {3185#false} is VALID [2022-04-07 16:10:02,027 INFO L290 TraceCheckUtils]: 52: Hoare triple {3185#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {3185#false} is VALID [2022-04-07 16:10:02,027 INFO L290 TraceCheckUtils]: 53: Hoare triple {3185#false} ~skip~0 := 0; {3185#false} is VALID [2022-04-07 16:10:02,028 INFO L290 TraceCheckUtils]: 54: Hoare triple {3185#false} assume !false; {3185#false} is VALID [2022-04-07 16:10:02,028 INFO L290 TraceCheckUtils]: 55: Hoare triple {3185#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); {3185#false} is VALID [2022-04-07 16:10:02,028 INFO L290 TraceCheckUtils]: 56: Hoare triple {3185#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3185#false} is VALID [2022-04-07 16:10:02,030 INFO L290 TraceCheckUtils]: 57: Hoare triple {3185#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3185#false} is VALID [2022-04-07 16:10:02,030 INFO L290 TraceCheckUtils]: 58: Hoare triple {3185#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3185#false} is VALID [2022-04-07 16:10:02,030 INFO L290 TraceCheckUtils]: 59: Hoare triple {3185#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3185#false} is VALID [2022-04-07 16:10:02,030 INFO L290 TraceCheckUtils]: 60: Hoare triple {3185#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3185#false} is VALID [2022-04-07 16:10:02,030 INFO L290 TraceCheckUtils]: 61: Hoare triple {3185#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3185#false} is VALID [2022-04-07 16:10:02,030 INFO L290 TraceCheckUtils]: 62: Hoare triple {3185#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3185#false} is VALID [2022-04-07 16:10:02,031 INFO L290 TraceCheckUtils]: 63: Hoare triple {3185#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3185#false} is VALID [2022-04-07 16:10:02,031 INFO L290 TraceCheckUtils]: 64: Hoare triple {3185#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3185#false} is VALID [2022-04-07 16:10:02,031 INFO L290 TraceCheckUtils]: 65: Hoare triple {3185#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3185#false} is VALID [2022-04-07 16:10:02,031 INFO L290 TraceCheckUtils]: 66: Hoare triple {3185#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3185#false} is VALID [2022-04-07 16:10:02,031 INFO L290 TraceCheckUtils]: 67: Hoare triple {3185#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3185#false} is VALID [2022-04-07 16:10:02,031 INFO L290 TraceCheckUtils]: 68: Hoare triple {3185#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3185#false} is VALID [2022-04-07 16:10:02,031 INFO L290 TraceCheckUtils]: 69: Hoare triple {3185#false} assume 4432 == #t~mem62;havoc #t~mem62; {3185#false} is VALID [2022-04-07 16:10:02,031 INFO L290 TraceCheckUtils]: 70: Hoare triple {3185#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {3185#false} is VALID [2022-04-07 16:10:02,031 INFO L290 TraceCheckUtils]: 71: Hoare triple {3185#false} assume 5 == ~blastFlag~0; {3185#false} is VALID [2022-04-07 16:10:02,031 INFO L290 TraceCheckUtils]: 72: Hoare triple {3185#false} assume !false; {3185#false} is VALID [2022-04-07 16:10:02,032 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-07 16:10:02,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:02,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800619264] [2022-04-07 16:10:02,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800619264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:02,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:02,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:02,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643681907] [2022-04-07 16:10:02,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:02,033 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-07 16:10:02,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:02,033 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-07 16:10:02,090 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-07 16:10:02,091 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:02,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:02,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:02,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:02,091 INFO L87 Difference]: Start difference. First operand 240 states and 356 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:04,109 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-07 16:10:04,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:04,984 INFO L93 Difference]: Finished difference Result 380 states and 567 transitions. [2022-04-07 16:10:04,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:04,984 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-07 16:10:04,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:04,984 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-07 16:10:04,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-07 16:10:04,987 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-07 16:10:04,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-07 16:10:04,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 386 transitions. [2022-04-07 16:10:05,242 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-07 16:10:05,249 INFO L225 Difference]: With dead ends: 380 [2022-04-07 16:10:05,249 INFO L226 Difference]: Without dead ends: 257 [2022-04-07 16:10:05,251 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-07 16:10:05,252 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 39 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:05,252 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 486 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 353 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:10:05,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-07 16:10:05,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 240. [2022-04-07 16:10:05,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:05,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand has 240 states, 235 states have (on average 1.4936170212765958) internal successors, (351), 235 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-07 16:10:05,267 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand has 240 states, 235 states have (on average 1.4936170212765958) internal successors, (351), 235 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-07 16:10:05,268 INFO L87 Difference]: Start difference. First operand 257 states. Second operand has 240 states, 235 states have (on average 1.4936170212765958) internal successors, (351), 235 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-07 16:10:05,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:05,273 INFO L93 Difference]: Finished difference Result 257 states and 378 transitions. [2022-04-07 16:10:05,273 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 378 transitions. [2022-04-07 16:10:05,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:05,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:05,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 240 states, 235 states have (on average 1.4936170212765958) internal successors, (351), 235 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-07 16:10:05,274 INFO L87 Difference]: Start difference. First operand has 240 states, 235 states have (on average 1.4936170212765958) internal successors, (351), 235 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-07 16:10:05,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:05,279 INFO L93 Difference]: Finished difference Result 257 states and 378 transitions. [2022-04-07 16:10:05,279 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 378 transitions. [2022-04-07 16:10:05,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:05,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:05,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:05,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:05,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 235 states have (on average 1.4936170212765958) internal successors, (351), 235 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-07 16:10:05,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 355 transitions. [2022-04-07 16:10:05,284 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 355 transitions. Word has length 73 [2022-04-07 16:10:05,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:05,285 INFO L478 AbstractCegarLoop]: Abstraction has 240 states and 355 transitions. [2022-04-07 16:10:05,285 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-07 16:10:05,285 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 355 transitions. [2022-04-07 16:10:05,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-07 16:10:05,285 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:05,285 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-07 16:10:05,286 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 16:10:05,286 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:05,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:05,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1101622726, now seen corresponding path program 1 times [2022-04-07 16:10:05,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:05,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511554179] [2022-04-07 16:10:05,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:05,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:05,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:05,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {4438#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {4431#true} is VALID [2022-04-07 16:10:05,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {4431#true} assume true; {4431#true} is VALID [2022-04-07 16:10:05,444 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4431#true} {4431#true} #593#return; {4431#true} is VALID [2022-04-07 16:10:05,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {4431#true} call ULTIMATE.init(); {4438#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:05,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {4438#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {4431#true} is VALID [2022-04-07 16:10:05,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {4431#true} assume true; {4431#true} is VALID [2022-04-07 16:10:05,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4431#true} {4431#true} #593#return; {4431#true} is VALID [2022-04-07 16:10:05,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {4431#true} call #t~ret158 := main(); {4431#true} is VALID [2022-04-07 16:10:05,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {4431#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; {4431#true} is VALID [2022-04-07 16:10:05,445 INFO L272 TraceCheckUtils]: 6: Hoare triple {4431#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {4431#true} is VALID [2022-04-07 16:10:05,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {4431#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); {4431#true} is VALID [2022-04-07 16:10:05,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {4431#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; {4431#true} is VALID [2022-04-07 16:10:05,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {4431#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; {4431#true} is VALID [2022-04-07 16:10:05,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {4431#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4431#true} is VALID [2022-04-07 16:10:05,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {4431#true} assume !false; {4431#true} is VALID [2022-04-07 16:10:05,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {4431#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4431#true} is VALID [2022-04-07 16:10:05,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {4431#true} assume 12292 == #t~mem49;havoc #t~mem49; {4431#true} is VALID [2022-04-07 16:10:05,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {4431#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; {4431#true} is VALID [2022-04-07 16:10:05,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {4431#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4431#true} is VALID [2022-04-07 16:10:05,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {4431#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4431#true} is VALID [2022-04-07 16:10:05,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {4431#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4431#true} is VALID [2022-04-07 16:10:05,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {4431#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); {4431#true} is VALID [2022-04-07 16:10:05,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {4431#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4431#true} is VALID [2022-04-07 16:10:05,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {4431#true} assume !(0 == ~tmp___4~0); {4431#true} is VALID [2022-04-07 16:10:05,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {4431#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); {4431#true} is VALID [2022-04-07 16:10:05,450 INFO L290 TraceCheckUtils]: 22: Hoare triple {4431#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {4431#true} is VALID [2022-04-07 16:10:05,451 INFO L290 TraceCheckUtils]: 23: Hoare triple {4431#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4431#true} is VALID [2022-04-07 16:10:05,451 INFO L290 TraceCheckUtils]: 24: Hoare triple {4431#true} ~skip~0 := 0; {4431#true} is VALID [2022-04-07 16:10:05,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {4431#true} assume !false; {4431#true} is VALID [2022-04-07 16:10:05,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {4431#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4431#true} is VALID [2022-04-07 16:10:05,455 INFO L290 TraceCheckUtils]: 27: Hoare triple {4431#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4431#true} is VALID [2022-04-07 16:10:05,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {4431#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4431#true} is VALID [2022-04-07 16:10:05,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {4431#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4431#true} is VALID [2022-04-07 16:10:05,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {4431#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4431#true} is VALID [2022-04-07 16:10:05,456 INFO L290 TraceCheckUtils]: 31: Hoare triple {4431#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4431#true} is VALID [2022-04-07 16:10:05,456 INFO L290 TraceCheckUtils]: 32: Hoare triple {4431#true} assume 4368 == #t~mem54;havoc #t~mem54; {4431#true} is VALID [2022-04-07 16:10:05,457 INFO L290 TraceCheckUtils]: 33: Hoare triple {4431#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; {4431#true} is VALID [2022-04-07 16:10:05,458 INFO L290 TraceCheckUtils]: 34: Hoare triple {4431#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4431#true} is VALID [2022-04-07 16:10:05,460 INFO L290 TraceCheckUtils]: 35: Hoare triple {4431#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); {4436#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:05,460 INFO L290 TraceCheckUtils]: 36: Hoare triple {4436#(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; {4436#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:05,461 INFO L290 TraceCheckUtils]: 37: Hoare triple {4436#(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); {4436#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:05,461 INFO L290 TraceCheckUtils]: 38: Hoare triple {4436#(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; {4436#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:05,461 INFO L290 TraceCheckUtils]: 39: Hoare triple {4436#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {4436#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:05,462 INFO L290 TraceCheckUtils]: 40: Hoare triple {4436#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {4436#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:05,462 INFO L290 TraceCheckUtils]: 41: Hoare triple {4436#(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); {4436#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:05,462 INFO L290 TraceCheckUtils]: 42: Hoare triple {4436#(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); {4437#(not (= |ssl3_connect_#t~mem50| 16384))} is VALID [2022-04-07 16:10:05,463 INFO L290 TraceCheckUtils]: 43: Hoare triple {4437#(not (= |ssl3_connect_#t~mem50| 16384))} assume 16384 == #t~mem50;havoc #t~mem50; {4432#false} is VALID [2022-04-07 16:10:05,463 INFO L290 TraceCheckUtils]: 44: Hoare triple {4432#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4432#false} is VALID [2022-04-07 16:10:05,463 INFO L290 TraceCheckUtils]: 45: Hoare triple {4432#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4432#false} is VALID [2022-04-07 16:10:05,463 INFO L290 TraceCheckUtils]: 46: Hoare triple {4432#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4432#false} is VALID [2022-04-07 16:10:05,463 INFO L290 TraceCheckUtils]: 47: Hoare triple {4432#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); {4432#false} is VALID [2022-04-07 16:10:05,463 INFO L290 TraceCheckUtils]: 48: Hoare triple {4432#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4432#false} is VALID [2022-04-07 16:10:05,463 INFO L290 TraceCheckUtils]: 49: Hoare triple {4432#false} assume !(0 == ~tmp___4~0); {4432#false} is VALID [2022-04-07 16:10:05,463 INFO L290 TraceCheckUtils]: 50: Hoare triple {4432#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); {4432#false} is VALID [2022-04-07 16:10:05,463 INFO L290 TraceCheckUtils]: 51: Hoare triple {4432#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); {4432#false} is VALID [2022-04-07 16:10:05,463 INFO L290 TraceCheckUtils]: 52: Hoare triple {4432#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4432#false} is VALID [2022-04-07 16:10:05,463 INFO L290 TraceCheckUtils]: 53: Hoare triple {4432#false} ~skip~0 := 0; {4432#false} is VALID [2022-04-07 16:10:05,463 INFO L290 TraceCheckUtils]: 54: Hoare triple {4432#false} assume !false; {4432#false} is VALID [2022-04-07 16:10:05,464 INFO L290 TraceCheckUtils]: 55: Hoare triple {4432#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); {4432#false} is VALID [2022-04-07 16:10:05,464 INFO L290 TraceCheckUtils]: 56: Hoare triple {4432#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4432#false} is VALID [2022-04-07 16:10:05,464 INFO L290 TraceCheckUtils]: 57: Hoare triple {4432#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4432#false} is VALID [2022-04-07 16:10:05,464 INFO L290 TraceCheckUtils]: 58: Hoare triple {4432#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4432#false} is VALID [2022-04-07 16:10:05,464 INFO L290 TraceCheckUtils]: 59: Hoare triple {4432#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4432#false} is VALID [2022-04-07 16:10:05,464 INFO L290 TraceCheckUtils]: 60: Hoare triple {4432#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4432#false} is VALID [2022-04-07 16:10:05,464 INFO L290 TraceCheckUtils]: 61: Hoare triple {4432#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4432#false} is VALID [2022-04-07 16:10:05,464 INFO L290 TraceCheckUtils]: 62: Hoare triple {4432#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4432#false} is VALID [2022-04-07 16:10:05,464 INFO L290 TraceCheckUtils]: 63: Hoare triple {4432#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4432#false} is VALID [2022-04-07 16:10:05,464 INFO L290 TraceCheckUtils]: 64: Hoare triple {4432#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4432#false} is VALID [2022-04-07 16:10:05,464 INFO L290 TraceCheckUtils]: 65: Hoare triple {4432#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4432#false} is VALID [2022-04-07 16:10:05,464 INFO L290 TraceCheckUtils]: 66: Hoare triple {4432#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4432#false} is VALID [2022-04-07 16:10:05,464 INFO L290 TraceCheckUtils]: 67: Hoare triple {4432#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4432#false} is VALID [2022-04-07 16:10:05,465 INFO L290 TraceCheckUtils]: 68: Hoare triple {4432#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4432#false} is VALID [2022-04-07 16:10:05,465 INFO L290 TraceCheckUtils]: 69: Hoare triple {4432#false} assume 4432 == #t~mem62;havoc #t~mem62; {4432#false} is VALID [2022-04-07 16:10:05,465 INFO L290 TraceCheckUtils]: 70: Hoare triple {4432#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {4432#false} is VALID [2022-04-07 16:10:05,465 INFO L290 TraceCheckUtils]: 71: Hoare triple {4432#false} assume 5 == ~blastFlag~0; {4432#false} is VALID [2022-04-07 16:10:05,465 INFO L290 TraceCheckUtils]: 72: Hoare triple {4432#false} assume !false; {4432#false} is VALID [2022-04-07 16:10:05,466 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-07 16:10:05,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:05,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511554179] [2022-04-07 16:10:05,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511554179] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:05,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:05,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:05,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151772238] [2022-04-07 16:10:05,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:05,468 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-07 16:10:05,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:05,468 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-07 16:10:05,530 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-07 16:10:05,530 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:05,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:05,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:05,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:05,531 INFO L87 Difference]: Start difference. First operand 240 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-07 16:10:07,554 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-07 16:10:08,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:08,488 INFO L93 Difference]: Finished difference Result 647 states and 966 transitions. [2022-04-07 16:10:08,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:08,488 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-07 16:10:08,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:08,489 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-07 16:10:08,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-07 16:10:08,501 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-07 16:10:08,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-07 16:10:08,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-07 16:10:08,819 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-07 16:10:08,830 INFO L225 Difference]: With dead ends: 647 [2022-04-07 16:10:08,830 INFO L226 Difference]: Without dead ends: 423 [2022-04-07 16:10:08,831 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-07 16:10:08,831 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-07 16:10:08,831 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-07 16:10:08,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-04-07 16:10:08,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 264. [2022-04-07 16:10:08,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:08,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 423 states. Second operand has 264 states, 259 states have (on average 1.4903474903474903) internal successors, (386), 259 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:08,841 INFO L74 IsIncluded]: Start isIncluded. First operand 423 states. Second operand has 264 states, 259 states have (on average 1.4903474903474903) internal successors, (386), 259 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:08,841 INFO L87 Difference]: Start difference. First operand 423 states. Second operand has 264 states, 259 states have (on average 1.4903474903474903) internal successors, (386), 259 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:08,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:08,853 INFO L93 Difference]: Finished difference Result 423 states and 628 transitions. [2022-04-07 16:10:08,853 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 628 transitions. [2022-04-07 16:10:08,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:08,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:08,854 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.4903474903474903) internal successors, (386), 259 states have internal predecessors, (386), 3 states have call successors, (3), 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 423 states. [2022-04-07 16:10:08,855 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.4903474903474903) internal successors, (386), 259 states have internal predecessors, (386), 3 states have call successors, (3), 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 423 states. [2022-04-07 16:10:08,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:08,865 INFO L93 Difference]: Finished difference Result 423 states and 628 transitions. [2022-04-07 16:10:08,865 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 628 transitions. [2022-04-07 16:10:08,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:08,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:08,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:08,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:08,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.4903474903474903) internal successors, (386), 259 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:08,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 390 transitions. [2022-04-07 16:10:08,870 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 390 transitions. Word has length 73 [2022-04-07 16:10:08,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:08,870 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 390 transitions. [2022-04-07 16:10:08,870 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-07 16:10:08,870 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 390 transitions. [2022-04-07 16:10:08,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-07 16:10:08,871 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:08,871 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-07 16:10:08,871 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-07 16:10:08,871 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:08,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:08,872 INFO L85 PathProgramCache]: Analyzing trace with hash -155040791, now seen corresponding path program 1 times [2022-04-07 16:10:08,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:08,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116188396] [2022-04-07 16:10:08,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:08,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:09,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:09,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {6356#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {6349#true} is VALID [2022-04-07 16:10:09,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {6349#true} assume true; {6349#true} is VALID [2022-04-07 16:10:09,053 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6349#true} {6349#true} #593#return; {6349#true} is VALID [2022-04-07 16:10:09,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {6349#true} call ULTIMATE.init(); {6356#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:09,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {6356#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {6349#true} is VALID [2022-04-07 16:10:09,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {6349#true} assume true; {6349#true} is VALID [2022-04-07 16:10:09,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6349#true} {6349#true} #593#return; {6349#true} is VALID [2022-04-07 16:10:09,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {6349#true} call #t~ret158 := main(); {6349#true} is VALID [2022-04-07 16:10:09,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {6349#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; {6349#true} is VALID [2022-04-07 16:10:09,054 INFO L272 TraceCheckUtils]: 6: Hoare triple {6349#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {6349#true} is VALID [2022-04-07 16:10:09,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {6349#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); {6349#true} is VALID [2022-04-07 16:10:09,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {6349#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; {6349#true} is VALID [2022-04-07 16:10:09,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {6349#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; {6349#true} is VALID [2022-04-07 16:10:09,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {6349#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {6349#true} is VALID [2022-04-07 16:10:09,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {6349#true} assume !false; {6349#true} is VALID [2022-04-07 16:10:09,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {6349#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6349#true} is VALID [2022-04-07 16:10:09,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {6349#true} assume 12292 == #t~mem49;havoc #t~mem49; {6349#true} is VALID [2022-04-07 16:10:09,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {6349#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; {6349#true} is VALID [2022-04-07 16:10:09,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {6349#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {6349#true} is VALID [2022-04-07 16:10:09,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {6349#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {6349#true} is VALID [2022-04-07 16:10:09,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {6349#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {6349#true} is VALID [2022-04-07 16:10:09,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {6349#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); {6349#true} is VALID [2022-04-07 16:10:09,056 INFO L290 TraceCheckUtils]: 19: Hoare triple {6349#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {6349#true} is VALID [2022-04-07 16:10:09,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {6349#true} assume !(0 == ~tmp___4~0); {6349#true} is VALID [2022-04-07 16:10:09,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {6349#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); {6349#true} is VALID [2022-04-07 16:10:09,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {6349#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {6349#true} is VALID [2022-04-07 16:10:09,056 INFO L290 TraceCheckUtils]: 23: Hoare triple {6349#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {6349#true} is VALID [2022-04-07 16:10:09,056 INFO L290 TraceCheckUtils]: 24: Hoare triple {6349#true} ~skip~0 := 0; {6349#true} is VALID [2022-04-07 16:10:09,056 INFO L290 TraceCheckUtils]: 25: Hoare triple {6349#true} assume !false; {6349#true} is VALID [2022-04-07 16:10:09,056 INFO L290 TraceCheckUtils]: 26: Hoare triple {6349#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6349#true} is VALID [2022-04-07 16:10:09,056 INFO L290 TraceCheckUtils]: 27: Hoare triple {6349#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6349#true} is VALID [2022-04-07 16:10:09,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {6349#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6349#true} is VALID [2022-04-07 16:10:09,057 INFO L290 TraceCheckUtils]: 29: Hoare triple {6349#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6349#true} is VALID [2022-04-07 16:10:09,057 INFO L290 TraceCheckUtils]: 30: Hoare triple {6349#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6349#true} is VALID [2022-04-07 16:10:09,057 INFO L290 TraceCheckUtils]: 31: Hoare triple {6349#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6349#true} is VALID [2022-04-07 16:10:09,057 INFO L290 TraceCheckUtils]: 32: Hoare triple {6349#true} assume 4368 == #t~mem54;havoc #t~mem54; {6349#true} is VALID [2022-04-07 16:10:09,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {6349#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; {6349#true} is VALID [2022-04-07 16:10:09,057 INFO L290 TraceCheckUtils]: 34: Hoare triple {6349#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {6349#true} is VALID [2022-04-07 16:10:09,058 INFO L290 TraceCheckUtils]: 35: Hoare triple {6349#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); {6354#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:09,058 INFO L290 TraceCheckUtils]: 36: Hoare triple {6354#(= 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; {6354#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:09,059 INFO L290 TraceCheckUtils]: 37: Hoare triple {6354#(= 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); {6354#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:09,059 INFO L290 TraceCheckUtils]: 38: Hoare triple {6354#(= 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; {6354#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:09,059 INFO L290 TraceCheckUtils]: 39: Hoare triple {6354#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {6354#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:09,059 INFO L290 TraceCheckUtils]: 40: Hoare triple {6354#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {6354#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:09,060 INFO L290 TraceCheckUtils]: 41: Hoare triple {6354#(= 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); {6354#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:09,060 INFO L290 TraceCheckUtils]: 42: Hoare triple {6354#(= 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); {6354#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:09,060 INFO L290 TraceCheckUtils]: 43: Hoare triple {6354#(= 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); {6355#(= |ssl3_connect_#t~mem51| 4384)} is VALID [2022-04-07 16:10:09,061 INFO L290 TraceCheckUtils]: 44: Hoare triple {6355#(= |ssl3_connect_#t~mem51| 4384)} assume 4096 == #t~mem51;havoc #t~mem51; {6350#false} is VALID [2022-04-07 16:10:09,061 INFO L290 TraceCheckUtils]: 45: Hoare triple {6350#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {6350#false} is VALID [2022-04-07 16:10:09,061 INFO L290 TraceCheckUtils]: 46: Hoare triple {6350#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {6350#false} is VALID [2022-04-07 16:10:09,061 INFO L290 TraceCheckUtils]: 47: Hoare triple {6350#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {6350#false} is VALID [2022-04-07 16:10:09,061 INFO L290 TraceCheckUtils]: 48: Hoare triple {6350#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); {6350#false} is VALID [2022-04-07 16:10:09,061 INFO L290 TraceCheckUtils]: 49: Hoare triple {6350#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {6350#false} is VALID [2022-04-07 16:10:09,061 INFO L290 TraceCheckUtils]: 50: Hoare triple {6350#false} assume !(0 == ~tmp___4~0); {6350#false} is VALID [2022-04-07 16:10:09,065 INFO L290 TraceCheckUtils]: 51: Hoare triple {6350#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); {6350#false} is VALID [2022-04-07 16:10:09,065 INFO L290 TraceCheckUtils]: 52: Hoare triple {6350#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); {6350#false} is VALID [2022-04-07 16:10:09,065 INFO L290 TraceCheckUtils]: 53: Hoare triple {6350#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {6350#false} is VALID [2022-04-07 16:10:09,065 INFO L290 TraceCheckUtils]: 54: Hoare triple {6350#false} ~skip~0 := 0; {6350#false} is VALID [2022-04-07 16:10:09,066 INFO L290 TraceCheckUtils]: 55: Hoare triple {6350#false} assume !false; {6350#false} is VALID [2022-04-07 16:10:09,066 INFO L290 TraceCheckUtils]: 56: Hoare triple {6350#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); {6350#false} is VALID [2022-04-07 16:10:09,066 INFO L290 TraceCheckUtils]: 57: Hoare triple {6350#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6350#false} is VALID [2022-04-07 16:10:09,066 INFO L290 TraceCheckUtils]: 58: Hoare triple {6350#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6350#false} is VALID [2022-04-07 16:10:09,066 INFO L290 TraceCheckUtils]: 59: Hoare triple {6350#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6350#false} is VALID [2022-04-07 16:10:09,066 INFO L290 TraceCheckUtils]: 60: Hoare triple {6350#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6350#false} is VALID [2022-04-07 16:10:09,066 INFO L290 TraceCheckUtils]: 61: Hoare triple {6350#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6350#false} is VALID [2022-04-07 16:10:09,066 INFO L290 TraceCheckUtils]: 62: Hoare triple {6350#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {6350#false} is VALID [2022-04-07 16:10:09,066 INFO L290 TraceCheckUtils]: 63: Hoare triple {6350#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {6350#false} is VALID [2022-04-07 16:10:09,066 INFO L290 TraceCheckUtils]: 64: Hoare triple {6350#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {6350#false} is VALID [2022-04-07 16:10:09,066 INFO L290 TraceCheckUtils]: 65: Hoare triple {6350#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {6350#false} is VALID [2022-04-07 16:10:09,067 INFO L290 TraceCheckUtils]: 66: Hoare triple {6350#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {6350#false} is VALID [2022-04-07 16:10:09,067 INFO L290 TraceCheckUtils]: 67: Hoare triple {6350#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {6350#false} is VALID [2022-04-07 16:10:09,067 INFO L290 TraceCheckUtils]: 68: Hoare triple {6350#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {6350#false} is VALID [2022-04-07 16:10:09,067 INFO L290 TraceCheckUtils]: 69: Hoare triple {6350#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {6350#false} is VALID [2022-04-07 16:10:09,067 INFO L290 TraceCheckUtils]: 70: Hoare triple {6350#false} assume 4432 == #t~mem62;havoc #t~mem62; {6350#false} is VALID [2022-04-07 16:10:09,067 INFO L290 TraceCheckUtils]: 71: Hoare triple {6350#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {6350#false} is VALID [2022-04-07 16:10:09,067 INFO L290 TraceCheckUtils]: 72: Hoare triple {6350#false} assume 5 == ~blastFlag~0; {6350#false} is VALID [2022-04-07 16:10:09,068 INFO L290 TraceCheckUtils]: 73: Hoare triple {6350#false} assume !false; {6350#false} is VALID [2022-04-07 16:10:09,068 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-07 16:10:09,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:09,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116188396] [2022-04-07 16:10:09,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116188396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:09,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:09,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:09,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182708528] [2022-04-07 16:10:09,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:09,070 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-07 16:10:09,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:09,070 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-07 16:10:09,119 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-07 16:10:09,119 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:09,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:09,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:09,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:09,120 INFO L87 Difference]: Start difference. First operand 264 states and 390 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-07 16:10:11,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-07 16:10:12,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:12,043 INFO L93 Difference]: Finished difference Result 416 states and 617 transitions. [2022-04-07 16:10:12,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:12,043 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-07 16:10:12,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:12,044 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-07 16:10:12,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-07 16:10:12,046 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-07 16:10:12,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-07 16:10:12,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 384 transitions. [2022-04-07 16:10:12,300 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-07 16:10:12,304 INFO L225 Difference]: With dead ends: 416 [2022-04-07 16:10:12,304 INFO L226 Difference]: Without dead ends: 281 [2022-04-07 16:10:12,304 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-07 16:10:12,305 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 35 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:12,305 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 482 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 351 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:10:12,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-07 16:10:12,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 264. [2022-04-07 16:10:12,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:12,312 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 states. Second operand has 264 states, 259 states have (on average 1.4864864864864864) internal successors, (385), 259 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:12,312 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand has 264 states, 259 states have (on average 1.4864864864864864) internal successors, (385), 259 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:12,313 INFO L87 Difference]: Start difference. First operand 281 states. Second operand has 264 states, 259 states have (on average 1.4864864864864864) internal successors, (385), 259 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:12,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:12,317 INFO L93 Difference]: Finished difference Result 281 states and 412 transitions. [2022-04-07 16:10:12,317 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 412 transitions. [2022-04-07 16:10:12,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:12,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:12,318 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.4864864864864864) internal successors, (385), 259 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 281 states. [2022-04-07 16:10:12,318 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.4864864864864864) internal successors, (385), 259 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 281 states. [2022-04-07 16:10:12,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:12,322 INFO L93 Difference]: Finished difference Result 281 states and 412 transitions. [2022-04-07 16:10:12,322 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 412 transitions. [2022-04-07 16:10:12,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:12,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:12,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:12,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:12,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.4864864864864864) internal successors, (385), 259 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 389 transitions. [2022-04-07 16:10:12,327 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 389 transitions. Word has length 74 [2022-04-07 16:10:12,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:12,327 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 389 transitions. [2022-04-07 16:10:12,328 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-07 16:10:12,328 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 389 transitions. [2022-04-07 16:10:12,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-07 16:10:12,329 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:12,329 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-07 16:10:12,329 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-07 16:10:12,329 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:12,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:12,330 INFO L85 PathProgramCache]: Analyzing trace with hash -400323519, now seen corresponding path program 1 times [2022-04-07 16:10:12,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:12,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252697217] [2022-04-07 16:10:12,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:12,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:12,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:12,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {7716#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {7709#true} is VALID [2022-04-07 16:10:12,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {7709#true} assume true; {7709#true} is VALID [2022-04-07 16:10:12,482 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7709#true} {7709#true} #593#return; {7709#true} is VALID [2022-04-07 16:10:12,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {7709#true} call ULTIMATE.init(); {7716#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:12,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {7716#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {7709#true} is VALID [2022-04-07 16:10:12,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {7709#true} assume true; {7709#true} is VALID [2022-04-07 16:10:12,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7709#true} {7709#true} #593#return; {7709#true} is VALID [2022-04-07 16:10:12,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {7709#true} call #t~ret158 := main(); {7709#true} is VALID [2022-04-07 16:10:12,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {7709#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; {7709#true} is VALID [2022-04-07 16:10:12,485 INFO L272 TraceCheckUtils]: 6: Hoare triple {7709#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {7709#true} is VALID [2022-04-07 16:10:12,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {7709#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); {7709#true} is VALID [2022-04-07 16:10:12,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {7709#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; {7709#true} is VALID [2022-04-07 16:10:12,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {7709#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; {7709#true} is VALID [2022-04-07 16:10:12,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {7709#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7709#true} is VALID [2022-04-07 16:10:12,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {7709#true} assume !false; {7709#true} is VALID [2022-04-07 16:10:12,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {7709#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7709#true} is VALID [2022-04-07 16:10:12,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {7709#true} assume 12292 == #t~mem49;havoc #t~mem49; {7709#true} is VALID [2022-04-07 16:10:12,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {7709#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; {7709#true} is VALID [2022-04-07 16:10:12,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {7709#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7709#true} is VALID [2022-04-07 16:10:12,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {7709#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7709#true} is VALID [2022-04-07 16:10:12,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {7709#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7709#true} is VALID [2022-04-07 16:10:12,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {7709#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); {7709#true} is VALID [2022-04-07 16:10:12,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {7709#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7709#true} is VALID [2022-04-07 16:10:12,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {7709#true} assume !(0 == ~tmp___4~0); {7709#true} is VALID [2022-04-07 16:10:12,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {7709#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); {7709#true} is VALID [2022-04-07 16:10:12,486 INFO L290 TraceCheckUtils]: 22: Hoare triple {7709#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {7709#true} is VALID [2022-04-07 16:10:12,486 INFO L290 TraceCheckUtils]: 23: Hoare triple {7709#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7709#true} is VALID [2022-04-07 16:10:12,487 INFO L290 TraceCheckUtils]: 24: Hoare triple {7709#true} ~skip~0 := 0; {7709#true} is VALID [2022-04-07 16:10:12,487 INFO L290 TraceCheckUtils]: 25: Hoare triple {7709#true} assume !false; {7709#true} is VALID [2022-04-07 16:10:12,487 INFO L290 TraceCheckUtils]: 26: Hoare triple {7709#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7709#true} is VALID [2022-04-07 16:10:12,487 INFO L290 TraceCheckUtils]: 27: Hoare triple {7709#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7709#true} is VALID [2022-04-07 16:10:12,487 INFO L290 TraceCheckUtils]: 28: Hoare triple {7709#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7709#true} is VALID [2022-04-07 16:10:12,487 INFO L290 TraceCheckUtils]: 29: Hoare triple {7709#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7709#true} is VALID [2022-04-07 16:10:12,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {7709#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7709#true} is VALID [2022-04-07 16:10:12,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {7709#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7709#true} is VALID [2022-04-07 16:10:12,487 INFO L290 TraceCheckUtils]: 32: Hoare triple {7709#true} assume 4368 == #t~mem54;havoc #t~mem54; {7709#true} is VALID [2022-04-07 16:10:12,487 INFO L290 TraceCheckUtils]: 33: Hoare triple {7709#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; {7709#true} is VALID [2022-04-07 16:10:12,487 INFO L290 TraceCheckUtils]: 34: Hoare triple {7709#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7709#true} is VALID [2022-04-07 16:10:12,488 INFO L290 TraceCheckUtils]: 35: Hoare triple {7709#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); {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:12,489 INFO L290 TraceCheckUtils]: 36: Hoare triple {7714#(= 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; {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:12,489 INFO L290 TraceCheckUtils]: 37: Hoare triple {7714#(= 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); {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:12,489 INFO L290 TraceCheckUtils]: 38: Hoare triple {7714#(= 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; {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:12,490 INFO L290 TraceCheckUtils]: 39: Hoare triple {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:12,490 INFO L290 TraceCheckUtils]: 40: Hoare triple {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:12,491 INFO L290 TraceCheckUtils]: 41: Hoare triple {7714#(= 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); {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:12,491 INFO L290 TraceCheckUtils]: 42: Hoare triple {7714#(= 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); {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:12,492 INFO L290 TraceCheckUtils]: 43: Hoare triple {7714#(= 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); {7714#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:12,492 INFO L290 TraceCheckUtils]: 44: Hoare triple {7714#(= 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); {7715#(= |ssl3_connect_#t~mem52| 4384)} is VALID [2022-04-07 16:10:12,492 INFO L290 TraceCheckUtils]: 45: Hoare triple {7715#(= |ssl3_connect_#t~mem52| 4384)} assume 20480 == #t~mem52;havoc #t~mem52; {7710#false} is VALID [2022-04-07 16:10:12,492 INFO L290 TraceCheckUtils]: 46: Hoare triple {7710#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7710#false} is VALID [2022-04-07 16:10:12,492 INFO L290 TraceCheckUtils]: 47: Hoare triple {7710#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7710#false} is VALID [2022-04-07 16:10:12,492 INFO L290 TraceCheckUtils]: 48: Hoare triple {7710#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7710#false} is VALID [2022-04-07 16:10:12,492 INFO L290 TraceCheckUtils]: 49: Hoare triple {7710#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); {7710#false} is VALID [2022-04-07 16:10:12,493 INFO L290 TraceCheckUtils]: 50: Hoare triple {7710#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7710#false} is VALID [2022-04-07 16:10:12,493 INFO L290 TraceCheckUtils]: 51: Hoare triple {7710#false} assume !(0 == ~tmp___4~0); {7710#false} is VALID [2022-04-07 16:10:12,493 INFO L290 TraceCheckUtils]: 52: Hoare triple {7710#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); {7710#false} is VALID [2022-04-07 16:10:12,493 INFO L290 TraceCheckUtils]: 53: Hoare triple {7710#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); {7710#false} is VALID [2022-04-07 16:10:12,493 INFO L290 TraceCheckUtils]: 54: Hoare triple {7710#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7710#false} is VALID [2022-04-07 16:10:12,493 INFO L290 TraceCheckUtils]: 55: Hoare triple {7710#false} ~skip~0 := 0; {7710#false} is VALID [2022-04-07 16:10:12,493 INFO L290 TraceCheckUtils]: 56: Hoare triple {7710#false} assume !false; {7710#false} is VALID [2022-04-07 16:10:12,493 INFO L290 TraceCheckUtils]: 57: Hoare triple {7710#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); {7710#false} is VALID [2022-04-07 16:10:12,493 INFO L290 TraceCheckUtils]: 58: Hoare triple {7710#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7710#false} is VALID [2022-04-07 16:10:12,493 INFO L290 TraceCheckUtils]: 59: Hoare triple {7710#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7710#false} is VALID [2022-04-07 16:10:12,493 INFO L290 TraceCheckUtils]: 60: Hoare triple {7710#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7710#false} is VALID [2022-04-07 16:10:12,493 INFO L290 TraceCheckUtils]: 61: Hoare triple {7710#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7710#false} is VALID [2022-04-07 16:10:12,493 INFO L290 TraceCheckUtils]: 62: Hoare triple {7710#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7710#false} is VALID [2022-04-07 16:10:12,493 INFO L290 TraceCheckUtils]: 63: Hoare triple {7710#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7710#false} is VALID [2022-04-07 16:10:12,493 INFO L290 TraceCheckUtils]: 64: Hoare triple {7710#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7710#false} is VALID [2022-04-07 16:10:12,493 INFO L290 TraceCheckUtils]: 65: Hoare triple {7710#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7710#false} is VALID [2022-04-07 16:10:12,494 INFO L290 TraceCheckUtils]: 66: Hoare triple {7710#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7710#false} is VALID [2022-04-07 16:10:12,494 INFO L290 TraceCheckUtils]: 67: Hoare triple {7710#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7710#false} is VALID [2022-04-07 16:10:12,494 INFO L290 TraceCheckUtils]: 68: Hoare triple {7710#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7710#false} is VALID [2022-04-07 16:10:12,494 INFO L290 TraceCheckUtils]: 69: Hoare triple {7710#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7710#false} is VALID [2022-04-07 16:10:12,494 INFO L290 TraceCheckUtils]: 70: Hoare triple {7710#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7710#false} is VALID [2022-04-07 16:10:12,494 INFO L290 TraceCheckUtils]: 71: Hoare triple {7710#false} assume 4432 == #t~mem62;havoc #t~mem62; {7710#false} is VALID [2022-04-07 16:10:12,494 INFO L290 TraceCheckUtils]: 72: Hoare triple {7710#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {7710#false} is VALID [2022-04-07 16:10:12,494 INFO L290 TraceCheckUtils]: 73: Hoare triple {7710#false} assume 5 == ~blastFlag~0; {7710#false} is VALID [2022-04-07 16:10:12,494 INFO L290 TraceCheckUtils]: 74: Hoare triple {7710#false} assume !false; {7710#false} is VALID [2022-04-07 16:10:12,495 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-07 16:10:12,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:12,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252697217] [2022-04-07 16:10:12,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252697217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:12,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:12,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:12,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309486819] [2022-04-07 16:10:12,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:12,496 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-07 16:10:12,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:12,496 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-07 16:10:12,551 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-07 16:10:12,551 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:12,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:12,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:12,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:12,552 INFO L87 Difference]: Start difference. First operand 264 states and 389 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-07 16:10:14,573 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-07 16:10:15,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:15,418 INFO L93 Difference]: Finished difference Result 416 states and 615 transitions. [2022-04-07 16:10:15,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:15,418 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-07 16:10:15,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:15,418 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-07 16:10:15,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2022-04-07 16:10:15,420 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-07 16:10:15,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2022-04-07 16:10:15,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 383 transitions. [2022-04-07 16:10:15,646 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-07 16:10:15,650 INFO L225 Difference]: With dead ends: 416 [2022-04-07 16:10:15,650 INFO L226 Difference]: Without dead ends: 281 [2022-04-07 16:10:15,650 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-07 16:10:15,651 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 33 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:15,651 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 480 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 350 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:10:15,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-07 16:10:15,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 264. [2022-04-07 16:10:15,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:15,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 states. Second operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:15,656 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:15,656 INFO L87 Difference]: Start difference. First operand 281 states. Second operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:15,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:15,660 INFO L93 Difference]: Finished difference Result 281 states and 411 transitions. [2022-04-07 16:10:15,660 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 411 transitions. [2022-04-07 16:10:15,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:15,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:15,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 281 states. [2022-04-07 16:10:15,661 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 281 states. [2022-04-07 16:10:15,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:15,665 INFO L93 Difference]: Finished difference Result 281 states and 411 transitions. [2022-04-07 16:10:15,666 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 411 transitions. [2022-04-07 16:10:15,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:15,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:15,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:15,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:15,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:15,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 388 transitions. [2022-04-07 16:10:15,670 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 388 transitions. Word has length 75 [2022-04-07 16:10:15,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:15,670 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 388 transitions. [2022-04-07 16:10:15,670 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-07 16:10:15,671 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 388 transitions. [2022-04-07 16:10:15,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-07 16:10:15,671 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:15,671 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-07 16:10:15,671 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-07 16:10:15,671 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:15,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:15,672 INFO L85 PathProgramCache]: Analyzing trace with hash 642427140, now seen corresponding path program 1 times [2022-04-07 16:10:15,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:15,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47322298] [2022-04-07 16:10:15,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:15,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:15,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:15,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {9076#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {9069#true} is VALID [2022-04-07 16:10:15,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {9069#true} assume true; {9069#true} is VALID [2022-04-07 16:10:15,811 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9069#true} {9069#true} #593#return; {9069#true} is VALID [2022-04-07 16:10:15,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {9069#true} call ULTIMATE.init(); {9076#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:15,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {9076#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {9069#true} is VALID [2022-04-07 16:10:15,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {9069#true} assume true; {9069#true} is VALID [2022-04-07 16:10:15,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9069#true} {9069#true} #593#return; {9069#true} is VALID [2022-04-07 16:10:15,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {9069#true} call #t~ret158 := main(); {9069#true} is VALID [2022-04-07 16:10:15,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {9069#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; {9069#true} is VALID [2022-04-07 16:10:15,812 INFO L272 TraceCheckUtils]: 6: Hoare triple {9069#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {9069#true} is VALID [2022-04-07 16:10:15,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {9069#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); {9069#true} is VALID [2022-04-07 16:10:15,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {9069#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; {9069#true} is VALID [2022-04-07 16:10:15,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {9069#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; {9069#true} is VALID [2022-04-07 16:10:15,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {9069#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9069#true} is VALID [2022-04-07 16:10:15,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {9069#true} assume !false; {9069#true} is VALID [2022-04-07 16:10:15,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {9069#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9069#true} is VALID [2022-04-07 16:10:15,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {9069#true} assume 12292 == #t~mem49;havoc #t~mem49; {9069#true} is VALID [2022-04-07 16:10:15,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {9069#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; {9069#true} is VALID [2022-04-07 16:10:15,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {9069#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9069#true} is VALID [2022-04-07 16:10:15,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {9069#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9069#true} is VALID [2022-04-07 16:10:15,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {9069#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9069#true} is VALID [2022-04-07 16:10:15,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {9069#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); {9069#true} is VALID [2022-04-07 16:10:15,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {9069#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9069#true} is VALID [2022-04-07 16:10:15,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {9069#true} assume !(0 == ~tmp___4~0); {9069#true} is VALID [2022-04-07 16:10:15,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {9069#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); {9069#true} is VALID [2022-04-07 16:10:15,813 INFO L290 TraceCheckUtils]: 22: Hoare triple {9069#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {9069#true} is VALID [2022-04-07 16:10:15,813 INFO L290 TraceCheckUtils]: 23: Hoare triple {9069#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9069#true} is VALID [2022-04-07 16:10:15,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {9069#true} ~skip~0 := 0; {9069#true} is VALID [2022-04-07 16:10:15,814 INFO L290 TraceCheckUtils]: 25: Hoare triple {9069#true} assume !false; {9069#true} is VALID [2022-04-07 16:10:15,814 INFO L290 TraceCheckUtils]: 26: Hoare triple {9069#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9069#true} is VALID [2022-04-07 16:10:15,814 INFO L290 TraceCheckUtils]: 27: Hoare triple {9069#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9069#true} is VALID [2022-04-07 16:10:15,814 INFO L290 TraceCheckUtils]: 28: Hoare triple {9069#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9069#true} is VALID [2022-04-07 16:10:15,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {9069#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9069#true} is VALID [2022-04-07 16:10:15,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {9069#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9069#true} is VALID [2022-04-07 16:10:15,814 INFO L290 TraceCheckUtils]: 31: Hoare triple {9069#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9069#true} is VALID [2022-04-07 16:10:15,814 INFO L290 TraceCheckUtils]: 32: Hoare triple {9069#true} assume 4368 == #t~mem54;havoc #t~mem54; {9069#true} is VALID [2022-04-07 16:10:15,814 INFO L290 TraceCheckUtils]: 33: Hoare triple {9069#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; {9069#true} is VALID [2022-04-07 16:10:15,814 INFO L290 TraceCheckUtils]: 34: Hoare triple {9069#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9069#true} is VALID [2022-04-07 16:10:15,815 INFO L290 TraceCheckUtils]: 35: Hoare triple {9069#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); {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:15,816 INFO L290 TraceCheckUtils]: 36: Hoare triple {9074#(not (= 4099 (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; {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:15,816 INFO L290 TraceCheckUtils]: 37: Hoare triple {9074#(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); {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:15,816 INFO L290 TraceCheckUtils]: 38: Hoare triple {9074#(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; {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:15,816 INFO L290 TraceCheckUtils]: 39: Hoare triple {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:15,817 INFO L290 TraceCheckUtils]: 40: Hoare triple {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:15,817 INFO L290 TraceCheckUtils]: 41: Hoare triple {9074#(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); {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:15,817 INFO L290 TraceCheckUtils]: 42: Hoare triple {9074#(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); {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:15,817 INFO L290 TraceCheckUtils]: 43: Hoare triple {9074#(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); {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:15,818 INFO L290 TraceCheckUtils]: 44: Hoare triple {9074#(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); {9074#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:15,818 INFO L290 TraceCheckUtils]: 45: Hoare triple {9074#(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); {9075#(not (= |ssl3_connect_#t~mem53| 4099))} is VALID [2022-04-07 16:10:15,818 INFO L290 TraceCheckUtils]: 46: Hoare triple {9075#(not (= |ssl3_connect_#t~mem53| 4099))} assume 4099 == #t~mem53;havoc #t~mem53; {9070#false} is VALID [2022-04-07 16:10:15,818 INFO L290 TraceCheckUtils]: 47: Hoare triple {9070#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9070#false} is VALID [2022-04-07 16:10:15,818 INFO L290 TraceCheckUtils]: 48: Hoare triple {9070#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9070#false} is VALID [2022-04-07 16:10:15,818 INFO L290 TraceCheckUtils]: 49: Hoare triple {9070#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9070#false} is VALID [2022-04-07 16:10:15,818 INFO L290 TraceCheckUtils]: 50: Hoare triple {9070#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); {9070#false} is VALID [2022-04-07 16:10:15,819 INFO L290 TraceCheckUtils]: 51: Hoare triple {9070#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9070#false} is VALID [2022-04-07 16:10:15,819 INFO L290 TraceCheckUtils]: 52: Hoare triple {9070#false} assume !(0 == ~tmp___4~0); {9070#false} is VALID [2022-04-07 16:10:15,819 INFO L290 TraceCheckUtils]: 53: Hoare triple {9070#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); {9070#false} is VALID [2022-04-07 16:10:15,819 INFO L290 TraceCheckUtils]: 54: Hoare triple {9070#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); {9070#false} is VALID [2022-04-07 16:10:15,819 INFO L290 TraceCheckUtils]: 55: Hoare triple {9070#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9070#false} is VALID [2022-04-07 16:10:15,819 INFO L290 TraceCheckUtils]: 56: Hoare triple {9070#false} ~skip~0 := 0; {9070#false} is VALID [2022-04-07 16:10:15,819 INFO L290 TraceCheckUtils]: 57: Hoare triple {9070#false} assume !false; {9070#false} is VALID [2022-04-07 16:10:15,819 INFO L290 TraceCheckUtils]: 58: Hoare triple {9070#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); {9070#false} is VALID [2022-04-07 16:10:15,819 INFO L290 TraceCheckUtils]: 59: Hoare triple {9070#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9070#false} is VALID [2022-04-07 16:10:15,819 INFO L290 TraceCheckUtils]: 60: Hoare triple {9070#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9070#false} is VALID [2022-04-07 16:10:15,819 INFO L290 TraceCheckUtils]: 61: Hoare triple {9070#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9070#false} is VALID [2022-04-07 16:10:15,819 INFO L290 TraceCheckUtils]: 62: Hoare triple {9070#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9070#false} is VALID [2022-04-07 16:10:15,819 INFO L290 TraceCheckUtils]: 63: Hoare triple {9070#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9070#false} is VALID [2022-04-07 16:10:15,819 INFO L290 TraceCheckUtils]: 64: Hoare triple {9070#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9070#false} is VALID [2022-04-07 16:10:15,819 INFO L290 TraceCheckUtils]: 65: Hoare triple {9070#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9070#false} is VALID [2022-04-07 16:10:15,819 INFO L290 TraceCheckUtils]: 66: Hoare triple {9070#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9070#false} is VALID [2022-04-07 16:10:15,820 INFO L290 TraceCheckUtils]: 67: Hoare triple {9070#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9070#false} is VALID [2022-04-07 16:10:15,820 INFO L290 TraceCheckUtils]: 68: Hoare triple {9070#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9070#false} is VALID [2022-04-07 16:10:15,820 INFO L290 TraceCheckUtils]: 69: Hoare triple {9070#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9070#false} is VALID [2022-04-07 16:10:15,820 INFO L290 TraceCheckUtils]: 70: Hoare triple {9070#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9070#false} is VALID [2022-04-07 16:10:15,820 INFO L290 TraceCheckUtils]: 71: Hoare triple {9070#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9070#false} is VALID [2022-04-07 16:10:15,820 INFO L290 TraceCheckUtils]: 72: Hoare triple {9070#false} assume 4432 == #t~mem62;havoc #t~mem62; {9070#false} is VALID [2022-04-07 16:10:15,820 INFO L290 TraceCheckUtils]: 73: Hoare triple {9070#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {9070#false} is VALID [2022-04-07 16:10:15,820 INFO L290 TraceCheckUtils]: 74: Hoare triple {9070#false} assume 5 == ~blastFlag~0; {9070#false} is VALID [2022-04-07 16:10:15,820 INFO L290 TraceCheckUtils]: 75: Hoare triple {9070#false} assume !false; {9070#false} is VALID [2022-04-07 16:10:15,820 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-07 16:10:15,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:15,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47322298] [2022-04-07 16:10:15,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47322298] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:15,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:15,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:15,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533789499] [2022-04-07 16:10:15,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:15,821 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-07 16:10:15,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:15,821 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-07 16:10:15,877 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-07 16:10:15,878 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:15,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:15,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:15,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:15,878 INFO L87 Difference]: Start difference. First operand 264 states and 388 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-07 16:10:17,898 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-07 16:10:18,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:18,826 INFO L93 Difference]: Finished difference Result 671 states and 994 transitions. [2022-04-07 16:10:18,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:18,826 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-07 16:10:18,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:18,827 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-07 16:10:18,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-07 16:10:18,830 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-07 16:10:18,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-07 16:10:18,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-07 16:10:19,158 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-07 16:10:19,166 INFO L225 Difference]: With dead ends: 671 [2022-04-07 16:10:19,166 INFO L226 Difference]: Without dead ends: 423 [2022-04-07 16:10:19,167 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-07 16:10:19,167 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 115 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:19,167 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:10:19,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-04-07 16:10:19,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 270. [2022-04-07 16:10:19,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:19,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 423 states. Second operand has 270 states, 265 states have (on average 1.4830188679245282) internal successors, (393), 265 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:19,178 INFO L74 IsIncluded]: Start isIncluded. First operand 423 states. Second operand has 270 states, 265 states have (on average 1.4830188679245282) internal successors, (393), 265 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:19,179 INFO L87 Difference]: Start difference. First operand 423 states. Second operand has 270 states, 265 states have (on average 1.4830188679245282) internal successors, (393), 265 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:19,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:19,187 INFO L93 Difference]: Finished difference Result 423 states and 623 transitions. [2022-04-07 16:10:19,187 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 623 transitions. [2022-04-07 16:10:19,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:19,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:19,188 INFO L74 IsIncluded]: Start isIncluded. First operand has 270 states, 265 states have (on average 1.4830188679245282) internal successors, (393), 265 states have internal predecessors, (393), 3 states have call successors, (3), 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 423 states. [2022-04-07 16:10:19,188 INFO L87 Difference]: Start difference. First operand has 270 states, 265 states have (on average 1.4830188679245282) internal successors, (393), 265 states have internal predecessors, (393), 3 states have call successors, (3), 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 423 states. [2022-04-07 16:10:19,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:19,196 INFO L93 Difference]: Finished difference Result 423 states and 623 transitions. [2022-04-07 16:10:19,196 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 623 transitions. [2022-04-07 16:10:19,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:19,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:19,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:19,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:19,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 265 states have (on average 1.4830188679245282) internal successors, (393), 265 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:19,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 397 transitions. [2022-04-07 16:10:19,201 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 397 transitions. Word has length 76 [2022-04-07 16:10:19,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:19,201 INFO L478 AbstractCegarLoop]: Abstraction has 270 states and 397 transitions. [2022-04-07 16:10:19,201 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-07 16:10:19,201 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 397 transitions. [2022-04-07 16:10:19,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-07 16:10:19,204 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:19,204 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-07 16:10:19,204 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-07 16:10:19,204 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:19,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:19,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1188358039, now seen corresponding path program 1 times [2022-04-07 16:10:19,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:19,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616534495] [2022-04-07 16:10:19,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:19,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:19,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:19,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {11025#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {11019#true} is VALID [2022-04-07 16:10:19,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {11019#true} assume true; {11019#true} is VALID [2022-04-07 16:10:19,359 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11019#true} {11019#true} #593#return; {11019#true} is VALID [2022-04-07 16:10:19,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {11019#true} call ULTIMATE.init(); {11025#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:19,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {11025#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {11019#true} is VALID [2022-04-07 16:10:19,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {11019#true} assume true; {11019#true} is VALID [2022-04-07 16:10:19,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11019#true} {11019#true} #593#return; {11019#true} is VALID [2022-04-07 16:10:19,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {11019#true} call #t~ret158 := main(); {11019#true} is VALID [2022-04-07 16:10:19,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {11019#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; {11019#true} is VALID [2022-04-07 16:10:19,361 INFO L272 TraceCheckUtils]: 6: Hoare triple {11019#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {11019#true} is VALID [2022-04-07 16:10:19,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {11019#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); {11019#true} is VALID [2022-04-07 16:10:19,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {11019#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; {11019#true} is VALID [2022-04-07 16:10:19,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {11019#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; {11019#true} is VALID [2022-04-07 16:10:19,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {11019#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11019#true} is VALID [2022-04-07 16:10:19,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {11019#true} assume !false; {11019#true} is VALID [2022-04-07 16:10:19,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {11019#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-07 16:10:19,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {11019#true} assume 12292 == #t~mem49;havoc #t~mem49; {11019#true} is VALID [2022-04-07 16:10:19,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {11019#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; {11019#true} is VALID [2022-04-07 16:10:19,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {11019#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11019#true} is VALID [2022-04-07 16:10:19,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {11019#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11019#true} is VALID [2022-04-07 16:10:19,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {11019#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11019#true} is VALID [2022-04-07 16:10:19,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {11019#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); {11019#true} is VALID [2022-04-07 16:10:19,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {11019#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {11019#true} is VALID [2022-04-07 16:10:19,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {11019#true} assume !(0 == ~tmp___4~0); {11019#true} is VALID [2022-04-07 16:10:19,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {11019#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); {11019#true} is VALID [2022-04-07 16:10:19,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {11019#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {11019#true} is VALID [2022-04-07 16:10:19,362 INFO L290 TraceCheckUtils]: 23: Hoare triple {11019#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11019#true} is VALID [2022-04-07 16:10:19,362 INFO L290 TraceCheckUtils]: 24: Hoare triple {11019#true} ~skip~0 := 0; {11019#true} is VALID [2022-04-07 16:10:19,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {11019#true} assume !false; {11019#true} is VALID [2022-04-07 16:10:19,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {11019#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-07 16:10:19,362 INFO L290 TraceCheckUtils]: 27: Hoare triple {11019#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-07 16:10:19,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {11019#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-07 16:10:19,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {11019#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-07 16:10:19,362 INFO L290 TraceCheckUtils]: 30: Hoare triple {11019#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-07 16:10:19,362 INFO L290 TraceCheckUtils]: 31: Hoare triple {11019#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-07 16:10:19,362 INFO L290 TraceCheckUtils]: 32: Hoare triple {11019#true} assume 4368 == #t~mem54;havoc #t~mem54; {11019#true} is VALID [2022-04-07 16:10:19,362 INFO L290 TraceCheckUtils]: 33: Hoare triple {11019#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; {11019#true} is VALID [2022-04-07 16:10:19,363 INFO L290 TraceCheckUtils]: 34: Hoare triple {11019#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11019#true} is VALID [2022-04-07 16:10:19,363 INFO L290 TraceCheckUtils]: 35: Hoare triple {11019#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); {11019#true} is VALID [2022-04-07 16:10:19,363 INFO L290 TraceCheckUtils]: 36: Hoare triple {11019#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; {11019#true} is VALID [2022-04-07 16:10:19,363 INFO L290 TraceCheckUtils]: 37: Hoare triple {11019#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {11019#true} is VALID [2022-04-07 16:10:19,363 INFO L290 TraceCheckUtils]: 38: Hoare triple {11019#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11019#true} is VALID [2022-04-07 16:10:19,363 INFO L290 TraceCheckUtils]: 39: Hoare triple {11019#true} ~skip~0 := 0; {11019#true} is VALID [2022-04-07 16:10:19,363 INFO L290 TraceCheckUtils]: 40: Hoare triple {11019#true} assume !false; {11019#true} is VALID [2022-04-07 16:10:19,363 INFO L290 TraceCheckUtils]: 41: Hoare triple {11019#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-07 16:10:19,363 INFO L290 TraceCheckUtils]: 42: Hoare triple {11019#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-07 16:10:19,363 INFO L290 TraceCheckUtils]: 43: Hoare triple {11019#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-07 16:10:19,363 INFO L290 TraceCheckUtils]: 44: Hoare triple {11019#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-07 16:10:19,363 INFO L290 TraceCheckUtils]: 45: Hoare triple {11019#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-07 16:10:19,363 INFO L290 TraceCheckUtils]: 46: Hoare triple {11019#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-07 16:10:19,363 INFO L290 TraceCheckUtils]: 47: Hoare triple {11019#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-07 16:10:19,363 INFO L290 TraceCheckUtils]: 48: Hoare triple {11019#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11019#true} is VALID [2022-04-07 16:10:19,363 INFO L290 TraceCheckUtils]: 49: Hoare triple {11019#true} assume 4384 == #t~mem56;havoc #t~mem56; {11019#true} is VALID [2022-04-07 16:10:19,364 INFO L290 TraceCheckUtils]: 50: Hoare triple {11019#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {11019#true} is VALID [2022-04-07 16:10:19,364 INFO L290 TraceCheckUtils]: 51: Hoare triple {11019#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:19,364 INFO L290 TraceCheckUtils]: 52: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:19,364 INFO L290 TraceCheckUtils]: 53: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:19,365 INFO L290 TraceCheckUtils]: 54: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:19,365 INFO L290 TraceCheckUtils]: 55: Hoare triple {11024#(= 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); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:19,365 INFO L290 TraceCheckUtils]: 56: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:19,365 INFO L290 TraceCheckUtils]: 57: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:19,366 INFO L290 TraceCheckUtils]: 58: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:19,366 INFO L290 TraceCheckUtils]: 59: Hoare triple {11024#(= 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); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:19,366 INFO L290 TraceCheckUtils]: 60: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:19,366 INFO L290 TraceCheckUtils]: 61: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:19,367 INFO L290 TraceCheckUtils]: 62: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:19,367 INFO L290 TraceCheckUtils]: 63: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:19,367 INFO L290 TraceCheckUtils]: 64: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:19,367 INFO L290 TraceCheckUtils]: 65: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:19,368 INFO L290 TraceCheckUtils]: 66: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:19,368 INFO L290 TraceCheckUtils]: 67: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:19,368 INFO L290 TraceCheckUtils]: 68: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:19,368 INFO L290 TraceCheckUtils]: 69: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:19,369 INFO L290 TraceCheckUtils]: 70: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:19,369 INFO L290 TraceCheckUtils]: 71: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:19,369 INFO L290 TraceCheckUtils]: 72: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:19,369 INFO L290 TraceCheckUtils]: 73: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:19,370 INFO L290 TraceCheckUtils]: 74: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {11024#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:19,370 INFO L290 TraceCheckUtils]: 75: Hoare triple {11024#(= 2 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {11020#false} is VALID [2022-04-07 16:10:19,370 INFO L290 TraceCheckUtils]: 76: Hoare triple {11020#false} assume !false; {11020#false} is VALID [2022-04-07 16:10:19,370 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-07 16:10:19,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:19,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616534495] [2022-04-07 16:10:19,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616534495] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:19,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:19,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:10:19,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163592220] [2022-04-07 16:10:19,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:19,371 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-07 16:10:19,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:19,372 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-07 16:10:19,420 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-07 16:10:19,420 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:10:19,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:19,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:10:19,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:10:19,421 INFO L87 Difference]: Start difference. First operand 270 states and 397 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-07 16:10:21,437 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-07 16:10:22,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:22,285 INFO L93 Difference]: Finished difference Result 543 states and 807 transitions. [2022-04-07 16:10:22,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:10:22,285 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-07 16:10:22,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:22,285 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-07 16:10:22,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-07 16:10:22,287 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-07 16:10:22,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-07 16:10:22,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 489 transitions. [2022-04-07 16:10:22,605 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-07 16:10:22,612 INFO L225 Difference]: With dead ends: 543 [2022-04-07 16:10:22,612 INFO L226 Difference]: Without dead ends: 405 [2022-04-07 16:10:22,613 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-07 16:10:22,613 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-07 16:10:22,613 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-07 16:10:22,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-04-07 16:10:22,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2022-04-07 16:10:22,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:22,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 405 states. Second operand has 405 states, 400 states have (on average 1.4775) internal successors, (591), 400 states have internal predecessors, (591), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:22,620 INFO L74 IsIncluded]: Start isIncluded. First operand 405 states. Second operand has 405 states, 400 states have (on average 1.4775) internal successors, (591), 400 states have internal predecessors, (591), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:22,620 INFO L87 Difference]: Start difference. First operand 405 states. Second operand has 405 states, 400 states have (on average 1.4775) internal successors, (591), 400 states have internal predecessors, (591), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:22,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:22,645 INFO L93 Difference]: Finished difference Result 405 states and 595 transitions. [2022-04-07 16:10:22,645 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 595 transitions. [2022-04-07 16:10:22,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:22,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:22,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 405 states, 400 states have (on average 1.4775) internal successors, (591), 400 states have internal predecessors, (591), 3 states have call successors, (3), 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 405 states. [2022-04-07 16:10:22,646 INFO L87 Difference]: Start difference. First operand has 405 states, 400 states have (on average 1.4775) internal successors, (591), 400 states have internal predecessors, (591), 3 states have call successors, (3), 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 405 states. [2022-04-07 16:10:22,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:22,654 INFO L93 Difference]: Finished difference Result 405 states and 595 transitions. [2022-04-07 16:10:22,654 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 595 transitions. [2022-04-07 16:10:22,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:22,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:22,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:22,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:22,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 400 states have (on average 1.4775) internal successors, (591), 400 states have internal predecessors, (591), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:22,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 595 transitions. [2022-04-07 16:10:22,662 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 595 transitions. Word has length 77 [2022-04-07 16:10:22,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:22,662 INFO L478 AbstractCegarLoop]: Abstraction has 405 states and 595 transitions. [2022-04-07 16:10:22,663 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-07 16:10:22,663 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 595 transitions. [2022-04-07 16:10:22,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-07 16:10:22,663 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:22,663 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:22,663 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-07 16:10:22,663 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:22,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:22,664 INFO L85 PathProgramCache]: Analyzing trace with hash -979274608, now seen corresponding path program 1 times [2022-04-07 16:10:22,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:22,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017980961] [2022-04-07 16:10:22,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:22,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:22,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:22,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {12931#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {12925#true} is VALID [2022-04-07 16:10:22,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {12925#true} assume true; {12925#true} is VALID [2022-04-07 16:10:22,786 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12925#true} {12925#true} #593#return; {12925#true} is VALID [2022-04-07 16:10:22,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {12925#true} call ULTIMATE.init(); {12931#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:22,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {12931#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {12925#true} is VALID [2022-04-07 16:10:22,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {12925#true} assume true; {12925#true} is VALID [2022-04-07 16:10:22,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12925#true} {12925#true} #593#return; {12925#true} is VALID [2022-04-07 16:10:22,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {12925#true} call #t~ret158 := main(); {12925#true} is VALID [2022-04-07 16:10:22,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {12925#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; {12925#true} is VALID [2022-04-07 16:10:22,789 INFO L272 TraceCheckUtils]: 6: Hoare triple {12925#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {12925#true} is VALID [2022-04-07 16:10:22,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {12925#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); {12925#true} is VALID [2022-04-07 16:10:22,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {12925#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; {12925#true} is VALID [2022-04-07 16:10:22,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {12925#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; {12925#true} is VALID [2022-04-07 16:10:22,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {12925#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {12925#true} is VALID [2022-04-07 16:10:22,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {12925#true} assume !false; {12925#true} is VALID [2022-04-07 16:10:22,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {12925#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12925#true} is VALID [2022-04-07 16:10:22,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {12925#true} assume 12292 == #t~mem49;havoc #t~mem49; {12925#true} is VALID [2022-04-07 16:10:22,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {12925#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; {12925#true} is VALID [2022-04-07 16:10:22,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {12925#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {12925#true} is VALID [2022-04-07 16:10:22,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {12925#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {12925#true} is VALID [2022-04-07 16:10:22,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {12925#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {12925#true} is VALID [2022-04-07 16:10:22,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {12925#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); {12925#true} is VALID [2022-04-07 16:10:22,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {12925#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {12925#true} is VALID [2022-04-07 16:10:22,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {12925#true} assume !(0 == ~tmp___4~0); {12925#true} is VALID [2022-04-07 16:10:22,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {12925#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); {12925#true} is VALID [2022-04-07 16:10:22,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {12925#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {12925#true} is VALID [2022-04-07 16:10:22,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {12925#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {12925#true} is VALID [2022-04-07 16:10:22,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {12925#true} ~skip~0 := 0; {12925#true} is VALID [2022-04-07 16:10:22,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {12925#true} assume !false; {12925#true} is VALID [2022-04-07 16:10:22,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {12925#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12925#true} is VALID [2022-04-07 16:10:22,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {12925#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12925#true} is VALID [2022-04-07 16:10:22,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {12925#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12925#true} is VALID [2022-04-07 16:10:22,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {12925#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12925#true} is VALID [2022-04-07 16:10:22,790 INFO L290 TraceCheckUtils]: 30: Hoare triple {12925#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12925#true} is VALID [2022-04-07 16:10:22,790 INFO L290 TraceCheckUtils]: 31: Hoare triple {12925#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12925#true} is VALID [2022-04-07 16:10:22,790 INFO L290 TraceCheckUtils]: 32: Hoare triple {12925#true} assume 4368 == #t~mem54;havoc #t~mem54; {12925#true} is VALID [2022-04-07 16:10:22,790 INFO L290 TraceCheckUtils]: 33: Hoare triple {12925#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; {12925#true} is VALID [2022-04-07 16:10:22,791 INFO L290 TraceCheckUtils]: 34: Hoare triple {12925#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:22,791 INFO L290 TraceCheckUtils]: 35: Hoare triple {12930#(= 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); {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:22,791 INFO L290 TraceCheckUtils]: 36: Hoare triple {12930#(= 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; {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:22,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {12930#(= 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); {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:22,792 INFO L290 TraceCheckUtils]: 38: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:22,792 INFO L290 TraceCheckUtils]: 39: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:22,792 INFO L290 TraceCheckUtils]: 40: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} assume !false; {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:22,792 INFO L290 TraceCheckUtils]: 41: Hoare triple {12930#(= 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); {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:22,793 INFO L290 TraceCheckUtils]: 42: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:22,793 INFO L290 TraceCheckUtils]: 43: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:22,793 INFO L290 TraceCheckUtils]: 44: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:22,793 INFO L290 TraceCheckUtils]: 45: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:22,794 INFO L290 TraceCheckUtils]: 46: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:22,794 INFO L290 TraceCheckUtils]: 47: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:22,794 INFO L290 TraceCheckUtils]: 48: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:22,794 INFO L290 TraceCheckUtils]: 49: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} assume 4384 == #t~mem56;havoc #t~mem56; {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:22,794 INFO L290 TraceCheckUtils]: 50: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {12930#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:22,795 INFO L290 TraceCheckUtils]: 51: Hoare triple {12930#(= ssl3_connect_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {12926#false} is VALID [2022-04-07 16:10:22,795 INFO L290 TraceCheckUtils]: 52: Hoare triple {12926#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {12926#false} is VALID [2022-04-07 16:10:22,795 INFO L290 TraceCheckUtils]: 53: Hoare triple {12926#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {12926#false} is VALID [2022-04-07 16:10:22,795 INFO L290 TraceCheckUtils]: 54: Hoare triple {12926#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-07 16:10:22,795 INFO L290 TraceCheckUtils]: 55: Hoare triple {12926#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {12926#false} is VALID [2022-04-07 16:10:22,795 INFO L290 TraceCheckUtils]: 56: Hoare triple {12926#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); {12926#false} is VALID [2022-04-07 16:10:22,795 INFO L290 TraceCheckUtils]: 57: Hoare triple {12926#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {12926#false} is VALID [2022-04-07 16:10:22,796 INFO L290 TraceCheckUtils]: 58: Hoare triple {12926#false} ~skip~0 := 0; {12926#false} is VALID [2022-04-07 16:10:22,796 INFO L290 TraceCheckUtils]: 59: Hoare triple {12926#false} assume !false; {12926#false} is VALID [2022-04-07 16:10:22,796 INFO L290 TraceCheckUtils]: 60: Hoare triple {12926#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); {12926#false} is VALID [2022-04-07 16:10:22,796 INFO L290 TraceCheckUtils]: 61: Hoare triple {12926#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-07 16:10:22,796 INFO L290 TraceCheckUtils]: 62: Hoare triple {12926#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-07 16:10:22,796 INFO L290 TraceCheckUtils]: 63: Hoare triple {12926#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-07 16:10:22,796 INFO L290 TraceCheckUtils]: 64: Hoare triple {12926#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-07 16:10:22,796 INFO L290 TraceCheckUtils]: 65: Hoare triple {12926#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-07 16:10:22,796 INFO L290 TraceCheckUtils]: 66: Hoare triple {12926#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-07 16:10:22,796 INFO L290 TraceCheckUtils]: 67: Hoare triple {12926#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-07 16:10:22,796 INFO L290 TraceCheckUtils]: 68: Hoare triple {12926#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-07 16:10:22,796 INFO L290 TraceCheckUtils]: 69: Hoare triple {12926#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-07 16:10:22,796 INFO L290 TraceCheckUtils]: 70: Hoare triple {12926#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-07 16:10:22,796 INFO L290 TraceCheckUtils]: 71: Hoare triple {12926#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-07 16:10:22,796 INFO L290 TraceCheckUtils]: 72: Hoare triple {12926#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-07 16:10:22,797 INFO L290 TraceCheckUtils]: 73: Hoare triple {12926#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12926#false} is VALID [2022-04-07 16:10:22,797 INFO L290 TraceCheckUtils]: 74: Hoare triple {12926#false} assume 4432 == #t~mem62;havoc #t~mem62; {12926#false} is VALID [2022-04-07 16:10:22,797 INFO L290 TraceCheckUtils]: 75: Hoare triple {12926#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {12926#false} is VALID [2022-04-07 16:10:22,797 INFO L290 TraceCheckUtils]: 76: Hoare triple {12926#false} assume 5 == ~blastFlag~0; {12926#false} is VALID [2022-04-07 16:10:22,797 INFO L290 TraceCheckUtils]: 77: Hoare triple {12926#false} assume !false; {12926#false} is VALID [2022-04-07 16:10:22,798 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-07 16:10:22,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:22,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017980961] [2022-04-07 16:10:22,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017980961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:22,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:22,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:10:22,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464929883] [2022-04-07 16:10:22,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:22,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-07 16:10:22,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:22,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:22,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:22,863 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:10:22,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:22,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:10:22,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:10:22,864 INFO L87 Difference]: Start difference. First operand 405 states and 595 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:24,880 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 16:10:25,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:25,397 INFO L93 Difference]: Finished difference Result 702 states and 1033 transitions. [2022-04-07 16:10:25,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:10:25,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-07 16:10:25,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:25,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:25,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2022-04-07 16:10:25,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2022-04-07 16:10:25,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 367 transitions. [2022-04-07 16:10:25,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 367 edges. 367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:25,633 INFO L225 Difference]: With dead ends: 702 [2022-04-07 16:10:25,633 INFO L226 Difference]: Without dead ends: 429 [2022-04-07 16:10:25,634 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-07 16:10:25,634 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 15 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:25,634 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 359 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 213 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-07 16:10:25,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-04-07 16:10:25,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2022-04-07 16:10:25,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:25,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 429 states. Second operand has 429 states, 424 states have (on average 1.4693396226415094) internal successors, (623), 424 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:25,651 INFO L74 IsIncluded]: Start isIncluded. First operand 429 states. Second operand has 429 states, 424 states have (on average 1.4693396226415094) internal successors, (623), 424 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:25,651 INFO L87 Difference]: Start difference. First operand 429 states. Second operand has 429 states, 424 states have (on average 1.4693396226415094) internal successors, (623), 424 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:25,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:25,659 INFO L93 Difference]: Finished difference Result 429 states and 627 transitions. [2022-04-07 16:10:25,659 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 627 transitions. [2022-04-07 16:10:25,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:25,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:25,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 429 states, 424 states have (on average 1.4693396226415094) internal successors, (623), 424 states have internal predecessors, (623), 3 states have call successors, (3), 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 429 states. [2022-04-07 16:10:25,660 INFO L87 Difference]: Start difference. First operand has 429 states, 424 states have (on average 1.4693396226415094) internal successors, (623), 424 states have internal predecessors, (623), 3 states have call successors, (3), 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 429 states. [2022-04-07 16:10:25,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:25,667 INFO L93 Difference]: Finished difference Result 429 states and 627 transitions. [2022-04-07 16:10:25,667 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 627 transitions. [2022-04-07 16:10:25,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:25,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:25,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:25,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:25,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 424 states have (on average 1.4693396226415094) internal successors, (623), 424 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:25,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 627 transitions. [2022-04-07 16:10:25,676 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 627 transitions. Word has length 78 [2022-04-07 16:10:25,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:25,676 INFO L478 AbstractCegarLoop]: Abstraction has 429 states and 627 transitions. [2022-04-07 16:10:25,676 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:25,676 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 627 transitions. [2022-04-07 16:10:25,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-07 16:10:25,677 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:25,677 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-07 16:10:25,677 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-07 16:10:25,677 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:25,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:25,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1809534672, now seen corresponding path program 1 times [2022-04-07 16:10:25,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:25,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192863967] [2022-04-07 16:10:25,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:25,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:25,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:25,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {15092#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {15086#true} is VALID [2022-04-07 16:10:25,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {15086#true} assume true; {15086#true} is VALID [2022-04-07 16:10:25,804 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15086#true} {15086#true} #593#return; {15086#true} is VALID [2022-04-07 16:10:25,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {15086#true} call ULTIMATE.init(); {15092#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:25,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {15092#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {15086#true} is VALID [2022-04-07 16:10:25,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {15086#true} assume true; {15086#true} is VALID [2022-04-07 16:10:25,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15086#true} {15086#true} #593#return; {15086#true} is VALID [2022-04-07 16:10:25,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {15086#true} call #t~ret158 := main(); {15086#true} is VALID [2022-04-07 16:10:25,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {15086#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; {15086#true} is VALID [2022-04-07 16:10:25,805 INFO L272 TraceCheckUtils]: 6: Hoare triple {15086#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {15086#true} is VALID [2022-04-07 16:10:25,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {15086#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); {15086#true} is VALID [2022-04-07 16:10:25,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {15086#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; {15086#true} is VALID [2022-04-07 16:10:25,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {15086#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; {15086#true} is VALID [2022-04-07 16:10:25,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {15086#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15086#true} is VALID [2022-04-07 16:10:25,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {15086#true} assume !false; {15086#true} is VALID [2022-04-07 16:10:25,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {15086#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {15086#true} assume 12292 == #t~mem49;havoc #t~mem49; {15086#true} is VALID [2022-04-07 16:10:25,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {15086#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; {15086#true} is VALID [2022-04-07 16:10:25,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {15086#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {15086#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15086#true} is VALID [2022-04-07 16:10:25,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {15086#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {15086#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); {15086#true} is VALID [2022-04-07 16:10:25,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {15086#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {15086#true} is VALID [2022-04-07 16:10:25,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {15086#true} assume !(0 == ~tmp___4~0); {15086#true} is VALID [2022-04-07 16:10:25,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {15086#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); {15086#true} is VALID [2022-04-07 16:10:25,817 INFO L290 TraceCheckUtils]: 22: Hoare triple {15086#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,818 INFO L290 TraceCheckUtils]: 23: Hoare triple {15086#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15086#true} is VALID [2022-04-07 16:10:25,818 INFO L290 TraceCheckUtils]: 24: Hoare triple {15086#true} ~skip~0 := 0; {15086#true} is VALID [2022-04-07 16:10:25,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {15086#true} assume !false; {15086#true} is VALID [2022-04-07 16:10:25,818 INFO L290 TraceCheckUtils]: 26: Hoare triple {15086#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,818 INFO L290 TraceCheckUtils]: 27: Hoare triple {15086#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,818 INFO L290 TraceCheckUtils]: 28: Hoare triple {15086#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,818 INFO L290 TraceCheckUtils]: 29: Hoare triple {15086#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {15086#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,818 INFO L290 TraceCheckUtils]: 31: Hoare triple {15086#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,818 INFO L290 TraceCheckUtils]: 32: Hoare triple {15086#true} assume 4368 == #t~mem54;havoc #t~mem54; {15086#true} is VALID [2022-04-07 16:10:25,818 INFO L290 TraceCheckUtils]: 33: Hoare triple {15086#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; {15086#true} is VALID [2022-04-07 16:10:25,818 INFO L290 TraceCheckUtils]: 34: Hoare triple {15086#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15086#true} is VALID [2022-04-07 16:10:25,818 INFO L290 TraceCheckUtils]: 35: Hoare triple {15086#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); {15086#true} is VALID [2022-04-07 16:10:25,818 INFO L290 TraceCheckUtils]: 36: Hoare triple {15086#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; {15086#true} is VALID [2022-04-07 16:10:25,818 INFO L290 TraceCheckUtils]: 37: Hoare triple {15086#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,818 INFO L290 TraceCheckUtils]: 38: Hoare triple {15086#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15086#true} is VALID [2022-04-07 16:10:25,819 INFO L290 TraceCheckUtils]: 39: Hoare triple {15086#true} ~skip~0 := 0; {15086#true} is VALID [2022-04-07 16:10:25,819 INFO L290 TraceCheckUtils]: 40: Hoare triple {15086#true} assume !false; {15086#true} is VALID [2022-04-07 16:10:25,819 INFO L290 TraceCheckUtils]: 41: Hoare triple {15086#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,819 INFO L290 TraceCheckUtils]: 42: Hoare triple {15086#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,819 INFO L290 TraceCheckUtils]: 43: Hoare triple {15086#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,819 INFO L290 TraceCheckUtils]: 44: Hoare triple {15086#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,819 INFO L290 TraceCheckUtils]: 45: Hoare triple {15086#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,819 INFO L290 TraceCheckUtils]: 46: Hoare triple {15086#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,819 INFO L290 TraceCheckUtils]: 47: Hoare triple {15086#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,819 INFO L290 TraceCheckUtils]: 48: Hoare triple {15086#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,819 INFO L290 TraceCheckUtils]: 49: Hoare triple {15086#true} assume 4384 == #t~mem56;havoc #t~mem56; {15086#true} is VALID [2022-04-07 16:10:25,819 INFO L290 TraceCheckUtils]: 50: Hoare triple {15086#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {15086#true} is VALID [2022-04-07 16:10:25,819 INFO L290 TraceCheckUtils]: 51: Hoare triple {15086#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {15086#true} is VALID [2022-04-07 16:10:25,819 INFO L290 TraceCheckUtils]: 52: Hoare triple {15086#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,819 INFO L290 TraceCheckUtils]: 53: Hoare triple {15086#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,819 INFO L290 TraceCheckUtils]: 54: Hoare triple {15086#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,820 INFO L290 TraceCheckUtils]: 55: Hoare triple {15086#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,820 INFO L290 TraceCheckUtils]: 56: Hoare triple {15086#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15086#true} is VALID [2022-04-07 16:10:25,820 INFO L290 TraceCheckUtils]: 57: Hoare triple {15086#true} ~skip~0 := 0; {15086#true} is VALID [2022-04-07 16:10:25,820 INFO L290 TraceCheckUtils]: 58: Hoare triple {15086#true} assume !false; {15086#true} is VALID [2022-04-07 16:10:25,820 INFO L290 TraceCheckUtils]: 59: Hoare triple {15086#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,820 INFO L290 TraceCheckUtils]: 60: Hoare triple {15086#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,820 INFO L290 TraceCheckUtils]: 61: Hoare triple {15086#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,820 INFO L290 TraceCheckUtils]: 62: Hoare triple {15086#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,820 INFO L290 TraceCheckUtils]: 63: Hoare triple {15086#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,820 INFO L290 TraceCheckUtils]: 64: Hoare triple {15086#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,820 INFO L290 TraceCheckUtils]: 65: Hoare triple {15086#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,820 INFO L290 TraceCheckUtils]: 66: Hoare triple {15086#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,820 INFO L290 TraceCheckUtils]: 67: Hoare triple {15086#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,820 INFO L290 TraceCheckUtils]: 68: Hoare triple {15086#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15086#true} is VALID [2022-04-07 16:10:25,820 INFO L290 TraceCheckUtils]: 69: Hoare triple {15086#true} assume 4400 == #t~mem58;havoc #t~mem58; {15086#true} is VALID [2022-04-07 16:10:25,821 INFO L290 TraceCheckUtils]: 70: Hoare triple {15086#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); {15086#true} is VALID [2022-04-07 16:10:25,821 INFO L290 TraceCheckUtils]: 71: Hoare triple {15086#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; {15086#true} is VALID [2022-04-07 16:10:25,821 INFO L290 TraceCheckUtils]: 72: Hoare triple {15086#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:25,821 INFO L290 TraceCheckUtils]: 73: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:25,822 INFO L290 TraceCheckUtils]: 74: Hoare triple {15091#(= 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); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:25,822 INFO L290 TraceCheckUtils]: 75: Hoare triple {15091#(= 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); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:25,822 INFO L290 TraceCheckUtils]: 76: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:25,822 INFO L290 TraceCheckUtils]: 77: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:25,822 INFO L290 TraceCheckUtils]: 78: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:25,823 INFO L290 TraceCheckUtils]: 79: Hoare triple {15091#(= 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); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:25,823 INFO L290 TraceCheckUtils]: 80: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:25,823 INFO L290 TraceCheckUtils]: 81: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:25,823 INFO L290 TraceCheckUtils]: 82: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:25,823 INFO L290 TraceCheckUtils]: 83: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:25,824 INFO L290 TraceCheckUtils]: 84: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:25,824 INFO L290 TraceCheckUtils]: 85: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:25,824 INFO L290 TraceCheckUtils]: 86: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:25,824 INFO L290 TraceCheckUtils]: 87: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:25,825 INFO L290 TraceCheckUtils]: 88: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:25,825 INFO L290 TraceCheckUtils]: 89: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:25,825 INFO L290 TraceCheckUtils]: 90: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:25,825 INFO L290 TraceCheckUtils]: 91: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:25,825 INFO L290 TraceCheckUtils]: 92: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:25,826 INFO L290 TraceCheckUtils]: 93: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:25,826 INFO L290 TraceCheckUtils]: 94: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {15091#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:25,826 INFO L290 TraceCheckUtils]: 95: Hoare triple {15091#(= 3 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {15087#false} is VALID [2022-04-07 16:10:25,826 INFO L290 TraceCheckUtils]: 96: Hoare triple {15087#false} assume !false; {15087#false} is VALID [2022-04-07 16:10:25,826 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-07 16:10:25,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:25,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192863967] [2022-04-07 16:10:25,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192863967] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:25,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:25,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:10:25,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866846734] [2022-04-07 16:10:25,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:25,839 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-07 16:10:25,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:25,839 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-07 16:10:25,894 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-07 16:10:25,894 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:10:25,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:25,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:10:25,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:10:25,895 INFO L87 Difference]: Start difference. First operand 429 states and 627 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-07 16:10:27,912 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-07 16:10:28,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:28,739 INFO L93 Difference]: Finished difference Result 860 states and 1266 transitions. [2022-04-07 16:10:28,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:10:28,739 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-07 16:10:28,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:28,739 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-07 16:10:28,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-07 16:10:28,741 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-07 16:10:28,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-07 16:10:28,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 488 transitions. [2022-04-07 16:10:29,049 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-07 16:10:29,061 INFO L225 Difference]: With dead ends: 860 [2022-04-07 16:10:29,061 INFO L226 Difference]: Without dead ends: 563 [2022-04-07 16:10:29,061 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-07 16:10:29,062 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-07 16:10:29,062 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-07 16:10:29,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-04-07 16:10:29,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2022-04-07 16:10:29,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:29,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 563 states. Second operand has 563 states, 558 states have (on average 1.4695340501792116) internal successors, (820), 558 states have internal predecessors, (820), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:29,070 INFO L74 IsIncluded]: Start isIncluded. First operand 563 states. Second operand has 563 states, 558 states have (on average 1.4695340501792116) internal successors, (820), 558 states have internal predecessors, (820), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:29,076 INFO L87 Difference]: Start difference. First operand 563 states. Second operand has 563 states, 558 states have (on average 1.4695340501792116) internal successors, (820), 558 states have internal predecessors, (820), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:29,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:29,087 INFO L93 Difference]: Finished difference Result 563 states and 824 transitions. [2022-04-07 16:10:29,087 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 824 transitions. [2022-04-07 16:10:29,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:29,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:29,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 563 states, 558 states have (on average 1.4695340501792116) internal successors, (820), 558 states have internal predecessors, (820), 3 states have call successors, (3), 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 563 states. [2022-04-07 16:10:29,088 INFO L87 Difference]: Start difference. First operand has 563 states, 558 states have (on average 1.4695340501792116) internal successors, (820), 558 states have internal predecessors, (820), 3 states have call successors, (3), 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 563 states. [2022-04-07 16:10:29,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:29,099 INFO L93 Difference]: Finished difference Result 563 states and 824 transitions. [2022-04-07 16:10:29,099 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 824 transitions. [2022-04-07 16:10:29,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:29,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:29,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:29,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:29,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 558 states have (on average 1.4695340501792116) internal successors, (820), 558 states have internal predecessors, (820), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:29,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 824 transitions. [2022-04-07 16:10:29,111 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 824 transitions. Word has length 97 [2022-04-07 16:10:29,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:29,112 INFO L478 AbstractCegarLoop]: Abstraction has 563 states and 824 transitions. [2022-04-07 16:10:29,112 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-07 16:10:29,112 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 824 transitions. [2022-04-07 16:10:29,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-07 16:10:29,114 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:29,114 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-07 16:10:29,114 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-07 16:10:29,114 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:29,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:29,115 INFO L85 PathProgramCache]: Analyzing trace with hash -120492913, now seen corresponding path program 1 times [2022-04-07 16:10:29,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:29,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378413810] [2022-04-07 16:10:29,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:29,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:29,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:29,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {17852#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {17846#true} is VALID [2022-04-07 16:10:29,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {17846#true} assume true; {17846#true} is VALID [2022-04-07 16:10:29,248 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17846#true} {17846#true} #593#return; {17846#true} is VALID [2022-04-07 16:10:29,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {17846#true} call ULTIMATE.init(); {17852#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:29,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {17852#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {17846#true} is VALID [2022-04-07 16:10:29,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {17846#true} assume true; {17846#true} is VALID [2022-04-07 16:10:29,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17846#true} {17846#true} #593#return; {17846#true} is VALID [2022-04-07 16:10:29,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {17846#true} call #t~ret158 := main(); {17846#true} is VALID [2022-04-07 16:10:29,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {17846#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; {17846#true} is VALID [2022-04-07 16:10:29,249 INFO L272 TraceCheckUtils]: 6: Hoare triple {17846#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {17846#true} is VALID [2022-04-07 16:10:29,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {17846#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); {17846#true} is VALID [2022-04-07 16:10:29,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {17846#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; {17846#true} is VALID [2022-04-07 16:10:29,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {17846#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; {17846#true} is VALID [2022-04-07 16:10:29,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {17846#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {17846#true} is VALID [2022-04-07 16:10:29,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {17846#true} assume !false; {17846#true} is VALID [2022-04-07 16:10:29,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {17846#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {17846#true} assume 12292 == #t~mem49;havoc #t~mem49; {17846#true} is VALID [2022-04-07 16:10:29,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {17846#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; {17846#true} is VALID [2022-04-07 16:10:29,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {17846#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {17846#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {17846#true} is VALID [2022-04-07 16:10:29,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {17846#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {17846#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); {17846#true} is VALID [2022-04-07 16:10:29,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {17846#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {17846#true} is VALID [2022-04-07 16:10:29,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {17846#true} assume !(0 == ~tmp___4~0); {17846#true} is VALID [2022-04-07 16:10:29,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {17846#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); {17846#true} is VALID [2022-04-07 16:10:29,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {17846#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {17846#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17846#true} is VALID [2022-04-07 16:10:29,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {17846#true} ~skip~0 := 0; {17846#true} is VALID [2022-04-07 16:10:29,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {17846#true} assume !false; {17846#true} is VALID [2022-04-07 16:10:29,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {17846#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {17846#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,253 INFO L290 TraceCheckUtils]: 28: Hoare triple {17846#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {17846#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {17846#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,254 INFO L290 TraceCheckUtils]: 31: Hoare triple {17846#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,254 INFO L290 TraceCheckUtils]: 32: Hoare triple {17846#true} assume 4368 == #t~mem54;havoc #t~mem54; {17846#true} is VALID [2022-04-07 16:10:29,254 INFO L290 TraceCheckUtils]: 33: Hoare triple {17846#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; {17846#true} is VALID [2022-04-07 16:10:29,254 INFO L290 TraceCheckUtils]: 34: Hoare triple {17846#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {17846#true} is VALID [2022-04-07 16:10:29,254 INFO L290 TraceCheckUtils]: 35: Hoare triple {17846#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); {17846#true} is VALID [2022-04-07 16:10:29,254 INFO L290 TraceCheckUtils]: 36: Hoare triple {17846#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; {17846#true} is VALID [2022-04-07 16:10:29,254 INFO L290 TraceCheckUtils]: 37: Hoare triple {17846#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,254 INFO L290 TraceCheckUtils]: 38: Hoare triple {17846#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17846#true} is VALID [2022-04-07 16:10:29,254 INFO L290 TraceCheckUtils]: 39: Hoare triple {17846#true} ~skip~0 := 0; {17846#true} is VALID [2022-04-07 16:10:29,254 INFO L290 TraceCheckUtils]: 40: Hoare triple {17846#true} assume !false; {17846#true} is VALID [2022-04-07 16:10:29,254 INFO L290 TraceCheckUtils]: 41: Hoare triple {17846#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,254 INFO L290 TraceCheckUtils]: 42: Hoare triple {17846#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,254 INFO L290 TraceCheckUtils]: 43: Hoare triple {17846#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,254 INFO L290 TraceCheckUtils]: 44: Hoare triple {17846#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,255 INFO L290 TraceCheckUtils]: 45: Hoare triple {17846#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,255 INFO L290 TraceCheckUtils]: 46: Hoare triple {17846#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,255 INFO L290 TraceCheckUtils]: 47: Hoare triple {17846#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,255 INFO L290 TraceCheckUtils]: 48: Hoare triple {17846#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,255 INFO L290 TraceCheckUtils]: 49: Hoare triple {17846#true} assume 4384 == #t~mem56;havoc #t~mem56; {17846#true} is VALID [2022-04-07 16:10:29,255 INFO L290 TraceCheckUtils]: 50: Hoare triple {17846#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {17846#true} is VALID [2022-04-07 16:10:29,255 INFO L290 TraceCheckUtils]: 51: Hoare triple {17846#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {17846#true} is VALID [2022-04-07 16:10:29,255 INFO L290 TraceCheckUtils]: 52: Hoare triple {17846#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,255 INFO L290 TraceCheckUtils]: 53: Hoare triple {17846#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,255 INFO L290 TraceCheckUtils]: 54: Hoare triple {17846#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,255 INFO L290 TraceCheckUtils]: 55: Hoare triple {17846#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,255 INFO L290 TraceCheckUtils]: 56: Hoare triple {17846#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17846#true} is VALID [2022-04-07 16:10:29,255 INFO L290 TraceCheckUtils]: 57: Hoare triple {17846#true} ~skip~0 := 0; {17846#true} is VALID [2022-04-07 16:10:29,255 INFO L290 TraceCheckUtils]: 58: Hoare triple {17846#true} assume !false; {17846#true} is VALID [2022-04-07 16:10:29,255 INFO L290 TraceCheckUtils]: 59: Hoare triple {17846#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,256 INFO L290 TraceCheckUtils]: 60: Hoare triple {17846#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,256 INFO L290 TraceCheckUtils]: 61: Hoare triple {17846#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,256 INFO L290 TraceCheckUtils]: 62: Hoare triple {17846#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,256 INFO L290 TraceCheckUtils]: 63: Hoare triple {17846#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,256 INFO L290 TraceCheckUtils]: 64: Hoare triple {17846#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,256 INFO L290 TraceCheckUtils]: 65: Hoare triple {17846#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,256 INFO L290 TraceCheckUtils]: 66: Hoare triple {17846#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,256 INFO L290 TraceCheckUtils]: 67: Hoare triple {17846#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,256 INFO L290 TraceCheckUtils]: 68: Hoare triple {17846#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,256 INFO L290 TraceCheckUtils]: 69: Hoare triple {17846#true} assume 4400 == #t~mem58;havoc #t~mem58; {17846#true} is VALID [2022-04-07 16:10:29,256 INFO L290 TraceCheckUtils]: 70: Hoare triple {17846#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); {17846#true} is VALID [2022-04-07 16:10:29,256 INFO L290 TraceCheckUtils]: 71: Hoare triple {17846#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; {17846#true} is VALID [2022-04-07 16:10:29,256 INFO L290 TraceCheckUtils]: 72: Hoare triple {17846#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {17846#true} is VALID [2022-04-07 16:10:29,256 INFO L290 TraceCheckUtils]: 73: Hoare triple {17846#true} assume !(~ret~0 <= 0); {17846#true} is VALID [2022-04-07 16:10:29,257 INFO L290 TraceCheckUtils]: 74: Hoare triple {17846#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,257 INFO L290 TraceCheckUtils]: 75: Hoare triple {17846#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,257 INFO L290 TraceCheckUtils]: 76: Hoare triple {17846#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17846#true} is VALID [2022-04-07 16:10:29,257 INFO L290 TraceCheckUtils]: 77: Hoare triple {17846#true} ~skip~0 := 0; {17846#true} is VALID [2022-04-07 16:10:29,257 INFO L290 TraceCheckUtils]: 78: Hoare triple {17846#true} assume !false; {17846#true} is VALID [2022-04-07 16:10:29,257 INFO L290 TraceCheckUtils]: 79: Hoare triple {17846#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,257 INFO L290 TraceCheckUtils]: 80: Hoare triple {17846#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,257 INFO L290 TraceCheckUtils]: 81: Hoare triple {17846#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,257 INFO L290 TraceCheckUtils]: 82: Hoare triple {17846#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,257 INFO L290 TraceCheckUtils]: 83: Hoare triple {17846#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,257 INFO L290 TraceCheckUtils]: 84: Hoare triple {17846#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,257 INFO L290 TraceCheckUtils]: 85: Hoare triple {17846#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,257 INFO L290 TraceCheckUtils]: 86: Hoare triple {17846#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,257 INFO L290 TraceCheckUtils]: 87: Hoare triple {17846#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,257 INFO L290 TraceCheckUtils]: 88: Hoare triple {17846#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,257 INFO L290 TraceCheckUtils]: 89: Hoare triple {17846#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,258 INFO L290 TraceCheckUtils]: 90: Hoare triple {17846#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {17846#true} is VALID [2022-04-07 16:10:29,258 INFO L290 TraceCheckUtils]: 91: Hoare triple {17846#true} assume 4416 == #t~mem60;havoc #t~mem60; {17846#true} is VALID [2022-04-07 16:10:29,258 INFO L290 TraceCheckUtils]: 92: Hoare triple {17846#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {17846#true} is VALID [2022-04-07 16:10:29,258 INFO L290 TraceCheckUtils]: 93: Hoare triple {17846#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {17851#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:29,258 INFO L290 TraceCheckUtils]: 94: Hoare triple {17851#(= 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); {17851#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:29,259 INFO L290 TraceCheckUtils]: 95: Hoare triple {17851#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == ~tmp___6~0); {17851#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:29,259 INFO L290 TraceCheckUtils]: 96: Hoare triple {17851#(= 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); {17851#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:29,259 INFO L290 TraceCheckUtils]: 97: Hoare triple {17851#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17851#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:29,259 INFO L290 TraceCheckUtils]: 98: Hoare triple {17851#(= ssl3_connect_~blastFlag~0 4)} ~skip~0 := 0; {17851#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:29,260 INFO L290 TraceCheckUtils]: 99: Hoare triple {17851#(= ssl3_connect_~blastFlag~0 4)} assume !false; {17851#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:29,260 INFO L290 TraceCheckUtils]: 100: Hoare triple {17851#(= 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); {17851#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:29,260 INFO L290 TraceCheckUtils]: 101: Hoare triple {17851#(= ssl3_connect_~blastFlag~0 4)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17851#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:29,260 INFO L290 TraceCheckUtils]: 102: Hoare triple {17851#(= ssl3_connect_~blastFlag~0 4)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17851#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:29,261 INFO L290 TraceCheckUtils]: 103: Hoare triple {17851#(= ssl3_connect_~blastFlag~0 4)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17851#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:29,261 INFO L290 TraceCheckUtils]: 104: Hoare triple {17851#(= ssl3_connect_~blastFlag~0 4)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17851#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:29,261 INFO L290 TraceCheckUtils]: 105: Hoare triple {17851#(= ssl3_connect_~blastFlag~0 4)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17851#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:29,261 INFO L290 TraceCheckUtils]: 106: Hoare triple {17851#(= ssl3_connect_~blastFlag~0 4)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17851#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:29,262 INFO L290 TraceCheckUtils]: 107: Hoare triple {17851#(= ssl3_connect_~blastFlag~0 4)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17851#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:29,262 INFO L290 TraceCheckUtils]: 108: Hoare triple {17851#(= ssl3_connect_~blastFlag~0 4)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {17851#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:29,262 INFO L290 TraceCheckUtils]: 109: Hoare triple {17851#(= ssl3_connect_~blastFlag~0 4)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {17851#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:29,262 INFO L290 TraceCheckUtils]: 110: Hoare triple {17851#(= ssl3_connect_~blastFlag~0 4)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {17851#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:29,263 INFO L290 TraceCheckUtils]: 111: Hoare triple {17851#(= ssl3_connect_~blastFlag~0 4)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {17851#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:29,263 INFO L290 TraceCheckUtils]: 112: Hoare triple {17851#(= ssl3_connect_~blastFlag~0 4)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {17851#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:29,263 INFO L290 TraceCheckUtils]: 113: Hoare triple {17851#(= ssl3_connect_~blastFlag~0 4)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {17851#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:29,263 INFO L290 TraceCheckUtils]: 114: Hoare triple {17851#(= ssl3_connect_~blastFlag~0 4)} assume 4432 == #t~mem62;havoc #t~mem62; {17851#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:29,264 INFO L290 TraceCheckUtils]: 115: Hoare triple {17851#(= ssl3_connect_~blastFlag~0 4)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {17851#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:29,264 INFO L290 TraceCheckUtils]: 116: Hoare triple {17851#(= ssl3_connect_~blastFlag~0 4)} assume 5 == ~blastFlag~0; {17847#false} is VALID [2022-04-07 16:10:29,264 INFO L290 TraceCheckUtils]: 117: Hoare triple {17847#false} assume !false; {17847#false} is VALID [2022-04-07 16:10:29,264 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-07 16:10:29,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:29,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378413810] [2022-04-07 16:10:29,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378413810] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:29,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:29,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:10:29,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549581847] [2022-04-07 16:10:29,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:29,265 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-07 16:10:29,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:29,265 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-07 16:10:29,319 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-07 16:10:29,319 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:10:29,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:29,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:10:29,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:10:29,319 INFO L87 Difference]: Start difference. First operand 563 states and 824 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-07 16:10:31,335 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-07 16:10:32,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:32,178 INFO L93 Difference]: Finished difference Result 1127 states and 1658 transitions. [2022-04-07 16:10:32,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:10:32,178 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-07 16:10:32,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:32,179 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-07 16:10:32,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2022-04-07 16:10:32,181 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-07 16:10:32,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2022-04-07 16:10:32,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 486 transitions. [2022-04-07 16:10:32,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 486 edges. 486 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:32,484 INFO L225 Difference]: With dead ends: 1127 [2022-04-07 16:10:32,484 INFO L226 Difference]: Without dead ends: 696 [2022-04-07 16:10:32,485 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-07 16:10:32,485 INFO L913 BasicCegarLoop]: 312 mSDtfsCounter, 124 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:32,485 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 474 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 336 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:10:32,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2022-04-07 16:10:32,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 696. [2022-04-07 16:10:32,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:32,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 696 states. Second operand has 696 states, 691 states have (on average 1.4688856729377713) internal successors, (1015), 691 states have internal predecessors, (1015), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:32,495 INFO L74 IsIncluded]: Start isIncluded. First operand 696 states. Second operand has 696 states, 691 states have (on average 1.4688856729377713) internal successors, (1015), 691 states have internal predecessors, (1015), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:32,495 INFO L87 Difference]: Start difference. First operand 696 states. Second operand has 696 states, 691 states have (on average 1.4688856729377713) internal successors, (1015), 691 states have internal predecessors, (1015), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:32,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:32,510 INFO L93 Difference]: Finished difference Result 696 states and 1019 transitions. [2022-04-07 16:10:32,510 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1019 transitions. [2022-04-07 16:10:32,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:32,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:32,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 696 states, 691 states have (on average 1.4688856729377713) internal successors, (1015), 691 states have internal predecessors, (1015), 3 states have call successors, (3), 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 696 states. [2022-04-07 16:10:32,512 INFO L87 Difference]: Start difference. First operand has 696 states, 691 states have (on average 1.4688856729377713) internal successors, (1015), 691 states have internal predecessors, (1015), 3 states have call successors, (3), 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 696 states. [2022-04-07 16:10:32,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:32,526 INFO L93 Difference]: Finished difference Result 696 states and 1019 transitions. [2022-04-07 16:10:32,526 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1019 transitions. [2022-04-07 16:10:32,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:32,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:32,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:32,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:32,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 691 states have (on average 1.4688856729377713) internal successors, (1015), 691 states have internal predecessors, (1015), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:32,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1019 transitions. [2022-04-07 16:10:32,543 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1019 transitions. Word has length 118 [2022-04-07 16:10:32,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:32,543 INFO L478 AbstractCegarLoop]: Abstraction has 696 states and 1019 transitions. [2022-04-07 16:10:32,543 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-07 16:10:32,543 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1019 transitions. [2022-04-07 16:10:32,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-07 16:10:32,544 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:32,545 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:32,545 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-07 16:10:32,545 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:32,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:32,545 INFO L85 PathProgramCache]: Analyzing trace with hash 707325485, now seen corresponding path program 1 times [2022-04-07 16:10:32,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:32,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804322340] [2022-04-07 16:10:32,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:32,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:32,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:32,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {21333#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {21326#true} is VALID [2022-04-07 16:10:32,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {21326#true} assume true; {21326#true} is VALID [2022-04-07 16:10:32,716 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21326#true} {21326#true} #593#return; {21326#true} is VALID [2022-04-07 16:10:32,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {21326#true} call ULTIMATE.init(); {21333#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:32,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {21333#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {21326#true} is VALID [2022-04-07 16:10:32,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {21326#true} assume true; {21326#true} is VALID [2022-04-07 16:10:32,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21326#true} {21326#true} #593#return; {21326#true} is VALID [2022-04-07 16:10:32,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {21326#true} call #t~ret158 := main(); {21326#true} is VALID [2022-04-07 16:10:32,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {21326#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; {21326#true} is VALID [2022-04-07 16:10:32,717 INFO L272 TraceCheckUtils]: 6: Hoare triple {21326#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {21326#true} is VALID [2022-04-07 16:10:32,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {21326#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); {21326#true} is VALID [2022-04-07 16:10:32,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {21326#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; {21326#true} is VALID [2022-04-07 16:10:32,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {21326#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; {21326#true} is VALID [2022-04-07 16:10:32,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {21326#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21326#true} is VALID [2022-04-07 16:10:32,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {21326#true} assume !false; {21326#true} is VALID [2022-04-07 16:10:32,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {21326#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {21326#true} assume 12292 == #t~mem49;havoc #t~mem49; {21326#true} is VALID [2022-04-07 16:10:32,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {21326#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; {21326#true} is VALID [2022-04-07 16:10:32,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {21326#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {21326#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {21326#true} is VALID [2022-04-07 16:10:32,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {21326#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {21326#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); {21326#true} is VALID [2022-04-07 16:10:32,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {21326#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {21326#true} is VALID [2022-04-07 16:10:32,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {21326#true} assume !(0 == ~tmp___4~0); {21326#true} is VALID [2022-04-07 16:10:32,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {21326#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); {21326#true} is VALID [2022-04-07 16:10:32,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {21326#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {21326#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21326#true} is VALID [2022-04-07 16:10:32,718 INFO L290 TraceCheckUtils]: 24: Hoare triple {21326#true} ~skip~0 := 0; {21326#true} is VALID [2022-04-07 16:10:32,718 INFO L290 TraceCheckUtils]: 25: Hoare triple {21326#true} assume !false; {21326#true} is VALID [2022-04-07 16:10:32,718 INFO L290 TraceCheckUtils]: 26: Hoare triple {21326#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,718 INFO L290 TraceCheckUtils]: 27: Hoare triple {21326#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,718 INFO L290 TraceCheckUtils]: 28: Hoare triple {21326#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {21326#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,718 INFO L290 TraceCheckUtils]: 30: Hoare triple {21326#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,718 INFO L290 TraceCheckUtils]: 31: Hoare triple {21326#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,718 INFO L290 TraceCheckUtils]: 32: Hoare triple {21326#true} assume 4368 == #t~mem54;havoc #t~mem54; {21326#true} is VALID [2022-04-07 16:10:32,719 INFO L290 TraceCheckUtils]: 33: Hoare triple {21326#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; {21326#true} is VALID [2022-04-07 16:10:32,719 INFO L290 TraceCheckUtils]: 34: Hoare triple {21326#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21326#true} is VALID [2022-04-07 16:10:32,719 INFO L290 TraceCheckUtils]: 35: Hoare triple {21326#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); {21326#true} is VALID [2022-04-07 16:10:32,719 INFO L290 TraceCheckUtils]: 36: Hoare triple {21326#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; {21326#true} is VALID [2022-04-07 16:10:32,719 INFO L290 TraceCheckUtils]: 37: Hoare triple {21326#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,719 INFO L290 TraceCheckUtils]: 38: Hoare triple {21326#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21326#true} is VALID [2022-04-07 16:10:32,719 INFO L290 TraceCheckUtils]: 39: Hoare triple {21326#true} ~skip~0 := 0; {21326#true} is VALID [2022-04-07 16:10:32,719 INFO L290 TraceCheckUtils]: 40: Hoare triple {21326#true} assume !false; {21326#true} is VALID [2022-04-07 16:10:32,719 INFO L290 TraceCheckUtils]: 41: Hoare triple {21326#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,719 INFO L290 TraceCheckUtils]: 42: Hoare triple {21326#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,719 INFO L290 TraceCheckUtils]: 43: Hoare triple {21326#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,719 INFO L290 TraceCheckUtils]: 44: Hoare triple {21326#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,719 INFO L290 TraceCheckUtils]: 45: Hoare triple {21326#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,719 INFO L290 TraceCheckUtils]: 46: Hoare triple {21326#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,719 INFO L290 TraceCheckUtils]: 47: Hoare triple {21326#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,719 INFO L290 TraceCheckUtils]: 48: Hoare triple {21326#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,720 INFO L290 TraceCheckUtils]: 49: Hoare triple {21326#true} assume 4384 == #t~mem56;havoc #t~mem56; {21326#true} is VALID [2022-04-07 16:10:32,720 INFO L290 TraceCheckUtils]: 50: Hoare triple {21326#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {21326#true} is VALID [2022-04-07 16:10:32,720 INFO L290 TraceCheckUtils]: 51: Hoare triple {21326#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {21326#true} is VALID [2022-04-07 16:10:32,720 INFO L290 TraceCheckUtils]: 52: Hoare triple {21326#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,720 INFO L290 TraceCheckUtils]: 53: Hoare triple {21326#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,720 INFO L290 TraceCheckUtils]: 54: Hoare triple {21326#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,720 INFO L290 TraceCheckUtils]: 55: Hoare triple {21326#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,720 INFO L290 TraceCheckUtils]: 56: Hoare triple {21326#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21326#true} is VALID [2022-04-07 16:10:32,720 INFO L290 TraceCheckUtils]: 57: Hoare triple {21326#true} ~skip~0 := 0; {21326#true} is VALID [2022-04-07 16:10:32,720 INFO L290 TraceCheckUtils]: 58: Hoare triple {21326#true} assume !false; {21326#true} is VALID [2022-04-07 16:10:32,720 INFO L290 TraceCheckUtils]: 59: Hoare triple {21326#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,720 INFO L290 TraceCheckUtils]: 60: Hoare triple {21326#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,720 INFO L290 TraceCheckUtils]: 61: Hoare triple {21326#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,720 INFO L290 TraceCheckUtils]: 62: Hoare triple {21326#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,720 INFO L290 TraceCheckUtils]: 63: Hoare triple {21326#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,720 INFO L290 TraceCheckUtils]: 64: Hoare triple {21326#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,721 INFO L290 TraceCheckUtils]: 65: Hoare triple {21326#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,721 INFO L290 TraceCheckUtils]: 66: Hoare triple {21326#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,721 INFO L290 TraceCheckUtils]: 67: Hoare triple {21326#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,721 INFO L290 TraceCheckUtils]: 68: Hoare triple {21326#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,721 INFO L290 TraceCheckUtils]: 69: Hoare triple {21326#true} assume 4400 == #t~mem58;havoc #t~mem58; {21326#true} is VALID [2022-04-07 16:10:32,721 INFO L290 TraceCheckUtils]: 70: Hoare triple {21326#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); {21326#true} is VALID [2022-04-07 16:10:32,721 INFO L290 TraceCheckUtils]: 71: Hoare triple {21326#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; {21326#true} is VALID [2022-04-07 16:10:32,721 INFO L290 TraceCheckUtils]: 72: Hoare triple {21326#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {21326#true} is VALID [2022-04-07 16:10:32,721 INFO L290 TraceCheckUtils]: 73: Hoare triple {21326#true} assume !(~ret~0 <= 0); {21326#true} is VALID [2022-04-07 16:10:32,721 INFO L290 TraceCheckUtils]: 74: Hoare triple {21326#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,721 INFO L290 TraceCheckUtils]: 75: Hoare triple {21326#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,721 INFO L290 TraceCheckUtils]: 76: Hoare triple {21326#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21326#true} is VALID [2022-04-07 16:10:32,721 INFO L290 TraceCheckUtils]: 77: Hoare triple {21326#true} ~skip~0 := 0; {21326#true} is VALID [2022-04-07 16:10:32,721 INFO L290 TraceCheckUtils]: 78: Hoare triple {21326#true} assume !false; {21326#true} is VALID [2022-04-07 16:10:32,721 INFO L290 TraceCheckUtils]: 79: Hoare triple {21326#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,721 INFO L290 TraceCheckUtils]: 80: Hoare triple {21326#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,721 INFO L290 TraceCheckUtils]: 81: Hoare triple {21326#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,722 INFO L290 TraceCheckUtils]: 82: Hoare triple {21326#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,722 INFO L290 TraceCheckUtils]: 83: Hoare triple {21326#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,722 INFO L290 TraceCheckUtils]: 84: Hoare triple {21326#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,722 INFO L290 TraceCheckUtils]: 85: Hoare triple {21326#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,722 INFO L290 TraceCheckUtils]: 86: Hoare triple {21326#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,722 INFO L290 TraceCheckUtils]: 87: Hoare triple {21326#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,722 INFO L290 TraceCheckUtils]: 88: Hoare triple {21326#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,722 INFO L290 TraceCheckUtils]: 89: Hoare triple {21326#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,722 INFO L290 TraceCheckUtils]: 90: Hoare triple {21326#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {21326#true} is VALID [2022-04-07 16:10:32,722 INFO L290 TraceCheckUtils]: 91: Hoare triple {21326#true} assume 4416 == #t~mem60;havoc #t~mem60; {21326#true} is VALID [2022-04-07 16:10:32,722 INFO L290 TraceCheckUtils]: 92: Hoare triple {21326#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {21326#true} is VALID [2022-04-07 16:10:32,722 INFO L290 TraceCheckUtils]: 93: Hoare triple {21326#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {21326#true} is VALID [2022-04-07 16:10:32,723 INFO L290 TraceCheckUtils]: 94: Hoare triple {21326#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); {21331#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:32,723 INFO L290 TraceCheckUtils]: 95: Hoare triple {21331#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {21331#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:32,724 INFO L290 TraceCheckUtils]: 96: Hoare triple {21331#(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); {21331#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:32,724 INFO L290 TraceCheckUtils]: 97: Hoare triple {21331#(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; {21331#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:32,724 INFO L290 TraceCheckUtils]: 98: Hoare triple {21331#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {21331#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:32,725 INFO L290 TraceCheckUtils]: 99: Hoare triple {21331#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {21331#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:32,725 INFO L290 TraceCheckUtils]: 100: Hoare triple {21331#(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); {21331#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:32,725 INFO L290 TraceCheckUtils]: 101: Hoare triple {21331#(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); {21331#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:32,726 INFO L290 TraceCheckUtils]: 102: Hoare triple {21331#(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); {21331#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:32,726 INFO L290 TraceCheckUtils]: 103: Hoare triple {21331#(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); {21331#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:32,726 INFO L290 TraceCheckUtils]: 104: Hoare triple {21331#(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); {21331#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:32,726 INFO L290 TraceCheckUtils]: 105: Hoare triple {21331#(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); {21331#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:32,727 INFO L290 TraceCheckUtils]: 106: Hoare triple {21331#(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); {21331#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:32,727 INFO L290 TraceCheckUtils]: 107: Hoare triple {21331#(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); {21332#(not (= |ssl3_connect_#t~mem56| 4384))} is VALID [2022-04-07 16:10:32,727 INFO L290 TraceCheckUtils]: 108: Hoare triple {21332#(not (= |ssl3_connect_#t~mem56| 4384))} assume 4384 == #t~mem56;havoc #t~mem56; {21327#false} is VALID [2022-04-07 16:10:32,727 INFO L290 TraceCheckUtils]: 109: Hoare triple {21327#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {21327#false} is VALID [2022-04-07 16:10:32,727 INFO L290 TraceCheckUtils]: 110: Hoare triple {21327#false} assume !(1 == ~blastFlag~0); {21327#false} is VALID [2022-04-07 16:10:32,727 INFO L290 TraceCheckUtils]: 111: Hoare triple {21327#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {21327#false} is VALID [2022-04-07 16:10:32,728 INFO L290 TraceCheckUtils]: 112: Hoare triple {21327#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {21327#false} is VALID [2022-04-07 16:10:32,728 INFO L290 TraceCheckUtils]: 113: Hoare triple {21327#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {21327#false} is VALID [2022-04-07 16:10:32,728 INFO L290 TraceCheckUtils]: 114: Hoare triple {21327#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {21327#false} is VALID [2022-04-07 16:10:32,728 INFO L290 TraceCheckUtils]: 115: Hoare triple {21327#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); {21327#false} is VALID [2022-04-07 16:10:32,728 INFO L290 TraceCheckUtils]: 116: Hoare triple {21327#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21327#false} is VALID [2022-04-07 16:10:32,728 INFO L290 TraceCheckUtils]: 117: Hoare triple {21327#false} ~skip~0 := 0; {21327#false} is VALID [2022-04-07 16:10:32,728 INFO L290 TraceCheckUtils]: 118: Hoare triple {21327#false} assume !false; {21327#false} is VALID [2022-04-07 16:10:32,728 INFO L290 TraceCheckUtils]: 119: Hoare triple {21327#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); {21327#false} is VALID [2022-04-07 16:10:32,728 INFO L290 TraceCheckUtils]: 120: Hoare triple {21327#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21327#false} is VALID [2022-04-07 16:10:32,728 INFO L290 TraceCheckUtils]: 121: Hoare triple {21327#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21327#false} is VALID [2022-04-07 16:10:32,728 INFO L290 TraceCheckUtils]: 122: Hoare triple {21327#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21327#false} is VALID [2022-04-07 16:10:32,728 INFO L290 TraceCheckUtils]: 123: Hoare triple {21327#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21327#false} is VALID [2022-04-07 16:10:32,728 INFO L290 TraceCheckUtils]: 124: Hoare triple {21327#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21327#false} is VALID [2022-04-07 16:10:32,728 INFO L290 TraceCheckUtils]: 125: Hoare triple {21327#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21327#false} is VALID [2022-04-07 16:10:32,728 INFO L290 TraceCheckUtils]: 126: Hoare triple {21327#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21327#false} is VALID [2022-04-07 16:10:32,728 INFO L290 TraceCheckUtils]: 127: Hoare triple {21327#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21327#false} is VALID [2022-04-07 16:10:32,729 INFO L290 TraceCheckUtils]: 128: Hoare triple {21327#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21327#false} is VALID [2022-04-07 16:10:32,729 INFO L290 TraceCheckUtils]: 129: Hoare triple {21327#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {21327#false} is VALID [2022-04-07 16:10:32,729 INFO L290 TraceCheckUtils]: 130: Hoare triple {21327#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {21327#false} is VALID [2022-04-07 16:10:32,729 INFO L290 TraceCheckUtils]: 131: Hoare triple {21327#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {21327#false} is VALID [2022-04-07 16:10:32,729 INFO L290 TraceCheckUtils]: 132: Hoare triple {21327#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {21327#false} is VALID [2022-04-07 16:10:32,729 INFO L290 TraceCheckUtils]: 133: Hoare triple {21327#false} assume 4432 == #t~mem62;havoc #t~mem62; {21327#false} is VALID [2022-04-07 16:10:32,729 INFO L290 TraceCheckUtils]: 134: Hoare triple {21327#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {21327#false} is VALID [2022-04-07 16:10:32,729 INFO L290 TraceCheckUtils]: 135: Hoare triple {21327#false} assume 5 == ~blastFlag~0; {21327#false} is VALID [2022-04-07 16:10:32,729 INFO L290 TraceCheckUtils]: 136: Hoare triple {21327#false} assume !false; {21327#false} is VALID [2022-04-07 16:10:32,729 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-07 16:10:32,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:32,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804322340] [2022-04-07 16:10:32,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804322340] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:32,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:32,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:32,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98010460] [2022-04-07 16:10:32,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:32,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 137 [2022-04-07 16:10:32,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:32,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:32,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:32,792 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:32,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:32,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:32,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:32,793 INFO L87 Difference]: Start difference. First operand 696 states and 1019 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:37,843 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-07 16:10:39,866 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-07 16:10:41,887 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-07 16:10:42,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:42,811 INFO L93 Difference]: Finished difference Result 1754 states and 2570 transitions. [2022-04-07 16:10:42,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:42,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 137 [2022-04-07 16:10:42,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:42,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:42,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-07 16:10:42,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:42,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-07 16:10:42,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-07 16:10:43,109 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-07 16:10:43,148 INFO L225 Difference]: With dead ends: 1754 [2022-04-07 16:10:43,149 INFO L226 Difference]: Without dead ends: 1074 [2022-04-07 16:10:43,150 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-07 16:10:43,151 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 109 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 44 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:43,151 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 284 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 386 Invalid, 3 Unknown, 0 Unchecked, 7.4s Time] [2022-04-07 16:10:43,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2022-04-07 16:10:43,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 711. [2022-04-07 16:10:43,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:43,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1074 states. Second operand has 711 states, 706 states have (on average 1.4730878186968839) internal successors, (1040), 706 states have internal predecessors, (1040), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:43,164 INFO L74 IsIncluded]: Start isIncluded. First operand 1074 states. Second operand has 711 states, 706 states have (on average 1.4730878186968839) internal successors, (1040), 706 states have internal predecessors, (1040), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:43,164 INFO L87 Difference]: Start difference. First operand 1074 states. Second operand has 711 states, 706 states have (on average 1.4730878186968839) internal successors, (1040), 706 states have internal predecessors, (1040), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:43,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:43,199 INFO L93 Difference]: Finished difference Result 1074 states and 1566 transitions. [2022-04-07 16:10:43,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1566 transitions. [2022-04-07 16:10:43,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:43,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:43,202 INFO L74 IsIncluded]: Start isIncluded. First operand has 711 states, 706 states have (on average 1.4730878186968839) internal successors, (1040), 706 states have internal predecessors, (1040), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1074 states. [2022-04-07 16:10:43,202 INFO L87 Difference]: Start difference. First operand has 711 states, 706 states have (on average 1.4730878186968839) internal successors, (1040), 706 states have internal predecessors, (1040), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1074 states. [2022-04-07 16:10:43,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:43,236 INFO L93 Difference]: Finished difference Result 1074 states and 1566 transitions. [2022-04-07 16:10:43,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1566 transitions. [2022-04-07 16:10:43,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:43,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:43,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:43,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:43,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 706 states have (on average 1.4730878186968839) internal successors, (1040), 706 states have internal predecessors, (1040), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:43,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1044 transitions. [2022-04-07 16:10:43,256 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1044 transitions. Word has length 137 [2022-04-07 16:10:43,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:43,256 INFO L478 AbstractCegarLoop]: Abstraction has 711 states and 1044 transitions. [2022-04-07 16:10:43,256 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:43,256 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1044 transitions. [2022-04-07 16:10:43,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-07 16:10:43,257 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:43,257 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:43,258 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-07 16:10:43,258 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:43,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:43,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1627312080, now seen corresponding path program 1 times [2022-04-07 16:10:43,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:43,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78782580] [2022-04-07 16:10:43,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:43,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:43,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:43,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {26325#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {26318#true} is VALID [2022-04-07 16:10:43,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {26318#true} assume true; {26318#true} is VALID [2022-04-07 16:10:43,463 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26318#true} {26318#true} #593#return; {26318#true} is VALID [2022-04-07 16:10:43,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {26318#true} call ULTIMATE.init(); {26325#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:43,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {26325#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {26318#true} is VALID [2022-04-07 16:10:43,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {26318#true} assume true; {26318#true} is VALID [2022-04-07 16:10:43,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26318#true} {26318#true} #593#return; {26318#true} is VALID [2022-04-07 16:10:43,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {26318#true} call #t~ret158 := main(); {26318#true} is VALID [2022-04-07 16:10:43,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {26318#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; {26318#true} is VALID [2022-04-07 16:10:43,464 INFO L272 TraceCheckUtils]: 6: Hoare triple {26318#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {26318#true} is VALID [2022-04-07 16:10:43,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {26318#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); {26318#true} is VALID [2022-04-07 16:10:43,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {26318#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; {26318#true} is VALID [2022-04-07 16:10:43,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {26318#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; {26318#true} is VALID [2022-04-07 16:10:43,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {26318#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {26318#true} is VALID [2022-04-07 16:10:43,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {26318#true} assume !false; {26318#true} is VALID [2022-04-07 16:10:43,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {26318#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {26318#true} assume 12292 == #t~mem49;havoc #t~mem49; {26318#true} is VALID [2022-04-07 16:10:43,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {26318#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; {26318#true} is VALID [2022-04-07 16:10:43,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {26318#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {26318#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {26318#true} is VALID [2022-04-07 16:10:43,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {26318#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {26318#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); {26318#true} is VALID [2022-04-07 16:10:43,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {26318#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {26318#true} is VALID [2022-04-07 16:10:43,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {26318#true} assume !(0 == ~tmp___4~0); {26318#true} is VALID [2022-04-07 16:10:43,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {26318#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); {26318#true} is VALID [2022-04-07 16:10:43,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {26318#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {26318#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {26318#true} is VALID [2022-04-07 16:10:43,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {26318#true} ~skip~0 := 0; {26318#true} is VALID [2022-04-07 16:10:43,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {26318#true} assume !false; {26318#true} is VALID [2022-04-07 16:10:43,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {26318#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {26318#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,465 INFO L290 TraceCheckUtils]: 28: Hoare triple {26318#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {26318#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,466 INFO L290 TraceCheckUtils]: 30: Hoare triple {26318#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,466 INFO L290 TraceCheckUtils]: 31: Hoare triple {26318#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,466 INFO L290 TraceCheckUtils]: 32: Hoare triple {26318#true} assume 4368 == #t~mem54;havoc #t~mem54; {26318#true} is VALID [2022-04-07 16:10:43,466 INFO L290 TraceCheckUtils]: 33: Hoare triple {26318#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; {26318#true} is VALID [2022-04-07 16:10:43,466 INFO L290 TraceCheckUtils]: 34: Hoare triple {26318#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {26318#true} is VALID [2022-04-07 16:10:43,466 INFO L290 TraceCheckUtils]: 35: Hoare triple {26318#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); {26318#true} is VALID [2022-04-07 16:10:43,466 INFO L290 TraceCheckUtils]: 36: Hoare triple {26318#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; {26318#true} is VALID [2022-04-07 16:10:43,466 INFO L290 TraceCheckUtils]: 37: Hoare triple {26318#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,466 INFO L290 TraceCheckUtils]: 38: Hoare triple {26318#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {26318#true} is VALID [2022-04-07 16:10:43,466 INFO L290 TraceCheckUtils]: 39: Hoare triple {26318#true} ~skip~0 := 0; {26318#true} is VALID [2022-04-07 16:10:43,466 INFO L290 TraceCheckUtils]: 40: Hoare triple {26318#true} assume !false; {26318#true} is VALID [2022-04-07 16:10:43,466 INFO L290 TraceCheckUtils]: 41: Hoare triple {26318#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,466 INFO L290 TraceCheckUtils]: 42: Hoare triple {26318#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,466 INFO L290 TraceCheckUtils]: 43: Hoare triple {26318#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,466 INFO L290 TraceCheckUtils]: 44: Hoare triple {26318#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,467 INFO L290 TraceCheckUtils]: 45: Hoare triple {26318#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,467 INFO L290 TraceCheckUtils]: 46: Hoare triple {26318#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,467 INFO L290 TraceCheckUtils]: 47: Hoare triple {26318#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,467 INFO L290 TraceCheckUtils]: 48: Hoare triple {26318#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,467 INFO L290 TraceCheckUtils]: 49: Hoare triple {26318#true} assume 4384 == #t~mem56;havoc #t~mem56; {26318#true} is VALID [2022-04-07 16:10:43,467 INFO L290 TraceCheckUtils]: 50: Hoare triple {26318#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {26318#true} is VALID [2022-04-07 16:10:43,467 INFO L290 TraceCheckUtils]: 51: Hoare triple {26318#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {26318#true} is VALID [2022-04-07 16:10:43,467 INFO L290 TraceCheckUtils]: 52: Hoare triple {26318#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,467 INFO L290 TraceCheckUtils]: 53: Hoare triple {26318#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,467 INFO L290 TraceCheckUtils]: 54: Hoare triple {26318#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,467 INFO L290 TraceCheckUtils]: 55: Hoare triple {26318#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,467 INFO L290 TraceCheckUtils]: 56: Hoare triple {26318#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {26318#true} is VALID [2022-04-07 16:10:43,467 INFO L290 TraceCheckUtils]: 57: Hoare triple {26318#true} ~skip~0 := 0; {26318#true} is VALID [2022-04-07 16:10:43,467 INFO L290 TraceCheckUtils]: 58: Hoare triple {26318#true} assume !false; {26318#true} is VALID [2022-04-07 16:10:43,467 INFO L290 TraceCheckUtils]: 59: Hoare triple {26318#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,468 INFO L290 TraceCheckUtils]: 60: Hoare triple {26318#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,468 INFO L290 TraceCheckUtils]: 61: Hoare triple {26318#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,468 INFO L290 TraceCheckUtils]: 62: Hoare triple {26318#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,468 INFO L290 TraceCheckUtils]: 63: Hoare triple {26318#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,468 INFO L290 TraceCheckUtils]: 64: Hoare triple {26318#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,468 INFO L290 TraceCheckUtils]: 65: Hoare triple {26318#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,468 INFO L290 TraceCheckUtils]: 66: Hoare triple {26318#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,468 INFO L290 TraceCheckUtils]: 67: Hoare triple {26318#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,468 INFO L290 TraceCheckUtils]: 68: Hoare triple {26318#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,468 INFO L290 TraceCheckUtils]: 69: Hoare triple {26318#true} assume 4400 == #t~mem58;havoc #t~mem58; {26318#true} is VALID [2022-04-07 16:10:43,468 INFO L290 TraceCheckUtils]: 70: Hoare triple {26318#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); {26318#true} is VALID [2022-04-07 16:10:43,468 INFO L290 TraceCheckUtils]: 71: Hoare triple {26318#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; {26318#true} is VALID [2022-04-07 16:10:43,468 INFO L290 TraceCheckUtils]: 72: Hoare triple {26318#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {26318#true} is VALID [2022-04-07 16:10:43,468 INFO L290 TraceCheckUtils]: 73: Hoare triple {26318#true} assume !(~ret~0 <= 0); {26318#true} is VALID [2022-04-07 16:10:43,468 INFO L290 TraceCheckUtils]: 74: Hoare triple {26318#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,468 INFO L290 TraceCheckUtils]: 75: Hoare triple {26318#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,469 INFO L290 TraceCheckUtils]: 76: Hoare triple {26318#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {26318#true} is VALID [2022-04-07 16:10:43,469 INFO L290 TraceCheckUtils]: 77: Hoare triple {26318#true} ~skip~0 := 0; {26318#true} is VALID [2022-04-07 16:10:43,469 INFO L290 TraceCheckUtils]: 78: Hoare triple {26318#true} assume !false; {26318#true} is VALID [2022-04-07 16:10:43,469 INFO L290 TraceCheckUtils]: 79: Hoare triple {26318#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,469 INFO L290 TraceCheckUtils]: 80: Hoare triple {26318#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,469 INFO L290 TraceCheckUtils]: 81: Hoare triple {26318#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,469 INFO L290 TraceCheckUtils]: 82: Hoare triple {26318#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,469 INFO L290 TraceCheckUtils]: 83: Hoare triple {26318#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,469 INFO L290 TraceCheckUtils]: 84: Hoare triple {26318#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,469 INFO L290 TraceCheckUtils]: 85: Hoare triple {26318#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,469 INFO L290 TraceCheckUtils]: 86: Hoare triple {26318#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,469 INFO L290 TraceCheckUtils]: 87: Hoare triple {26318#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,469 INFO L290 TraceCheckUtils]: 88: Hoare triple {26318#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,469 INFO L290 TraceCheckUtils]: 89: Hoare triple {26318#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,469 INFO L290 TraceCheckUtils]: 90: Hoare triple {26318#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26318#true} is VALID [2022-04-07 16:10:43,469 INFO L290 TraceCheckUtils]: 91: Hoare triple {26318#true} assume 4416 == #t~mem60;havoc #t~mem60; {26318#true} is VALID [2022-04-07 16:10:43,470 INFO L290 TraceCheckUtils]: 92: Hoare triple {26318#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {26318#true} is VALID [2022-04-07 16:10:43,470 INFO L290 TraceCheckUtils]: 93: Hoare triple {26318#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {26318#true} is VALID [2022-04-07 16:10:43,470 INFO L290 TraceCheckUtils]: 94: Hoare triple {26318#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); {26323#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:43,471 INFO L290 TraceCheckUtils]: 95: Hoare triple {26323#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {26323#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:43,471 INFO L290 TraceCheckUtils]: 96: Hoare triple {26323#(= 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); {26323#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:43,471 INFO L290 TraceCheckUtils]: 97: Hoare triple {26323#(= 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; {26323#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:43,472 INFO L290 TraceCheckUtils]: 98: Hoare triple {26323#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {26323#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:43,472 INFO L290 TraceCheckUtils]: 99: Hoare triple {26323#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {26323#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:43,472 INFO L290 TraceCheckUtils]: 100: Hoare triple {26323#(= 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); {26323#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:43,472 INFO L290 TraceCheckUtils]: 101: Hoare triple {26323#(= 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); {26323#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:43,473 INFO L290 TraceCheckUtils]: 102: Hoare triple {26323#(= 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); {26323#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:43,473 INFO L290 TraceCheckUtils]: 103: Hoare triple {26323#(= 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); {26323#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:43,473 INFO L290 TraceCheckUtils]: 104: Hoare triple {26323#(= 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); {26323#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:43,473 INFO L290 TraceCheckUtils]: 105: Hoare triple {26323#(= 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); {26323#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:43,474 INFO L290 TraceCheckUtils]: 106: Hoare triple {26323#(= 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); {26323#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:43,474 INFO L290 TraceCheckUtils]: 107: Hoare triple {26323#(= 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); {26323#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:43,474 INFO L290 TraceCheckUtils]: 108: Hoare triple {26323#(= 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); {26324#(= |ssl3_connect_#t~mem57| 4432)} is VALID [2022-04-07 16:10:43,474 INFO L290 TraceCheckUtils]: 109: Hoare triple {26324#(= |ssl3_connect_#t~mem57| 4432)} assume 4385 == #t~mem57;havoc #t~mem57; {26319#false} is VALID [2022-04-07 16:10:43,475 INFO L290 TraceCheckUtils]: 110: Hoare triple {26319#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {26319#false} is VALID [2022-04-07 16:10:43,475 INFO L290 TraceCheckUtils]: 111: Hoare triple {26319#false} assume !(1 == ~blastFlag~0); {26319#false} is VALID [2022-04-07 16:10:43,475 INFO L290 TraceCheckUtils]: 112: Hoare triple {26319#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {26319#false} is VALID [2022-04-07 16:10:43,475 INFO L290 TraceCheckUtils]: 113: Hoare triple {26319#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {26319#false} is VALID [2022-04-07 16:10:43,475 INFO L290 TraceCheckUtils]: 114: Hoare triple {26319#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {26319#false} is VALID [2022-04-07 16:10:43,475 INFO L290 TraceCheckUtils]: 115: Hoare triple {26319#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {26319#false} is VALID [2022-04-07 16:10:43,475 INFO L290 TraceCheckUtils]: 116: Hoare triple {26319#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); {26319#false} is VALID [2022-04-07 16:10:43,475 INFO L290 TraceCheckUtils]: 117: Hoare triple {26319#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {26319#false} is VALID [2022-04-07 16:10:43,475 INFO L290 TraceCheckUtils]: 118: Hoare triple {26319#false} ~skip~0 := 0; {26319#false} is VALID [2022-04-07 16:10:43,475 INFO L290 TraceCheckUtils]: 119: Hoare triple {26319#false} assume !false; {26319#false} is VALID [2022-04-07 16:10:43,475 INFO L290 TraceCheckUtils]: 120: Hoare triple {26319#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); {26319#false} is VALID [2022-04-07 16:10:43,475 INFO L290 TraceCheckUtils]: 121: Hoare triple {26319#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26319#false} is VALID [2022-04-07 16:10:43,475 INFO L290 TraceCheckUtils]: 122: Hoare triple {26319#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26319#false} is VALID [2022-04-07 16:10:43,475 INFO L290 TraceCheckUtils]: 123: Hoare triple {26319#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26319#false} is VALID [2022-04-07 16:10:43,475 INFO L290 TraceCheckUtils]: 124: Hoare triple {26319#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26319#false} is VALID [2022-04-07 16:10:43,475 INFO L290 TraceCheckUtils]: 125: Hoare triple {26319#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26319#false} is VALID [2022-04-07 16:10:43,476 INFO L290 TraceCheckUtils]: 126: Hoare triple {26319#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26319#false} is VALID [2022-04-07 16:10:43,476 INFO L290 TraceCheckUtils]: 127: Hoare triple {26319#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26319#false} is VALID [2022-04-07 16:10:43,476 INFO L290 TraceCheckUtils]: 128: Hoare triple {26319#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26319#false} is VALID [2022-04-07 16:10:43,476 INFO L290 TraceCheckUtils]: 129: Hoare triple {26319#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26319#false} is VALID [2022-04-07 16:10:43,476 INFO L290 TraceCheckUtils]: 130: Hoare triple {26319#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26319#false} is VALID [2022-04-07 16:10:43,476 INFO L290 TraceCheckUtils]: 131: Hoare triple {26319#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26319#false} is VALID [2022-04-07 16:10:43,476 INFO L290 TraceCheckUtils]: 132: Hoare triple {26319#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26319#false} is VALID [2022-04-07 16:10:43,476 INFO L290 TraceCheckUtils]: 133: Hoare triple {26319#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26319#false} is VALID [2022-04-07 16:10:43,476 INFO L290 TraceCheckUtils]: 134: Hoare triple {26319#false} assume 4432 == #t~mem62;havoc #t~mem62; {26319#false} is VALID [2022-04-07 16:10:43,476 INFO L290 TraceCheckUtils]: 135: Hoare triple {26319#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {26319#false} is VALID [2022-04-07 16:10:43,476 INFO L290 TraceCheckUtils]: 136: Hoare triple {26319#false} assume 5 == ~blastFlag~0; {26319#false} is VALID [2022-04-07 16:10:43,476 INFO L290 TraceCheckUtils]: 137: Hoare triple {26319#false} assume !false; {26319#false} is VALID [2022-04-07 16:10:43,477 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-07 16:10:43,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:43,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78782580] [2022-04-07 16:10:43,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78782580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:43,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:43,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:43,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254835208] [2022-04-07 16:10:43,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:43,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 138 [2022-04-07 16:10:43,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:43,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:43,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:43,550 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:43,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:43,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:43,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:43,551 INFO L87 Difference]: Start difference. First operand 711 states and 1044 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:45,572 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-07 16:10:46,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:46,827 INFO L93 Difference]: Finished difference Result 1753 states and 2578 transitions. [2022-04-07 16:10:46,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:46,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 138 [2022-04-07 16:10:46,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:46,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:46,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 464 transitions. [2022-04-07 16:10:46,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:46,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 464 transitions. [2022-04-07 16:10:46,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 464 transitions. [2022-04-07 16:10:47,108 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-07 16:10:47,144 INFO L225 Difference]: With dead ends: 1753 [2022-04-07 16:10:47,144 INFO L226 Difference]: Without dead ends: 1058 [2022-04-07 16:10:47,145 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-07 16:10:47,146 INFO L913 BasicCegarLoop]: 238 mSDtfsCounter, 93 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:47,146 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 565 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 531 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:10:47,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2022-04-07 16:10:47,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 787. [2022-04-07 16:10:47,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:47,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1058 states. Second operand has 787 states, 782 states have (on average 1.4782608695652173) internal successors, (1156), 782 states have internal predecessors, (1156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:47,158 INFO L74 IsIncluded]: Start isIncluded. First operand 1058 states. Second operand has 787 states, 782 states have (on average 1.4782608695652173) internal successors, (1156), 782 states have internal predecessors, (1156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:47,159 INFO L87 Difference]: Start difference. First operand 1058 states. Second operand has 787 states, 782 states have (on average 1.4782608695652173) internal successors, (1156), 782 states have internal predecessors, (1156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:47,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:47,190 INFO L93 Difference]: Finished difference Result 1058 states and 1550 transitions. [2022-04-07 16:10:47,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1550 transitions. [2022-04-07 16:10:47,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:47,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:47,192 INFO L74 IsIncluded]: Start isIncluded. First operand has 787 states, 782 states have (on average 1.4782608695652173) internal successors, (1156), 782 states have internal predecessors, (1156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1058 states. [2022-04-07 16:10:47,192 INFO L87 Difference]: Start difference. First operand has 787 states, 782 states have (on average 1.4782608695652173) internal successors, (1156), 782 states have internal predecessors, (1156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1058 states. [2022-04-07 16:10:47,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:47,225 INFO L93 Difference]: Finished difference Result 1058 states and 1550 transitions. [2022-04-07 16:10:47,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1550 transitions. [2022-04-07 16:10:47,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:47,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:47,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:47,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:47,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 782 states have (on average 1.4782608695652173) internal successors, (1156), 782 states have internal predecessors, (1156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:47,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1160 transitions. [2022-04-07 16:10:47,248 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1160 transitions. Word has length 138 [2022-04-07 16:10:47,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:47,249 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 1160 transitions. [2022-04-07 16:10:47,249 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:47,249 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1160 transitions. [2022-04-07 16:10:47,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-04-07 16:10:47,250 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:47,250 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:47,250 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-07 16:10:47,251 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:47,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:47,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1099530376, now seen corresponding path program 2 times [2022-04-07 16:10:47,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:47,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590728668] [2022-04-07 16:10:47,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:47,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:47,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:47,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {31349#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {31342#true} is VALID [2022-04-07 16:10:47,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {31342#true} assume true; {31342#true} is VALID [2022-04-07 16:10:47,427 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31342#true} {31342#true} #593#return; {31342#true} is VALID [2022-04-07 16:10:47,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {31342#true} call ULTIMATE.init(); {31349#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:47,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {31349#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {31342#true} is VALID [2022-04-07 16:10:47,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {31342#true} assume true; {31342#true} is VALID [2022-04-07 16:10:47,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31342#true} {31342#true} #593#return; {31342#true} is VALID [2022-04-07 16:10:47,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {31342#true} call #t~ret158 := main(); {31342#true} is VALID [2022-04-07 16:10:47,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {31342#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; {31342#true} is VALID [2022-04-07 16:10:47,428 INFO L272 TraceCheckUtils]: 6: Hoare triple {31342#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {31342#true} is VALID [2022-04-07 16:10:47,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {31342#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); {31342#true} is VALID [2022-04-07 16:10:47,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {31342#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; {31342#true} is VALID [2022-04-07 16:10:47,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {31342#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; {31342#true} is VALID [2022-04-07 16:10:47,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {31342#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {31342#true} is VALID [2022-04-07 16:10:47,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {31342#true} assume !false; {31342#true} is VALID [2022-04-07 16:10:47,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {31342#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {31342#true} assume 12292 == #t~mem49;havoc #t~mem49; {31342#true} is VALID [2022-04-07 16:10:47,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {31342#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; {31342#true} is VALID [2022-04-07 16:10:47,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {31342#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,428 INFO L290 TraceCheckUtils]: 16: Hoare triple {31342#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {31342#true} is VALID [2022-04-07 16:10:47,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {31342#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {31342#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); {31342#true} is VALID [2022-04-07 16:10:47,429 INFO L290 TraceCheckUtils]: 19: Hoare triple {31342#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {31342#true} is VALID [2022-04-07 16:10:47,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {31342#true} assume !(0 == ~tmp___4~0); {31342#true} is VALID [2022-04-07 16:10:47,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {31342#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); {31342#true} is VALID [2022-04-07 16:10:47,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {31342#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,429 INFO L290 TraceCheckUtils]: 23: Hoare triple {31342#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {31342#true} is VALID [2022-04-07 16:10:47,429 INFO L290 TraceCheckUtils]: 24: Hoare triple {31342#true} ~skip~0 := 0; {31342#true} is VALID [2022-04-07 16:10:47,429 INFO L290 TraceCheckUtils]: 25: Hoare triple {31342#true} assume !false; {31342#true} is VALID [2022-04-07 16:10:47,429 INFO L290 TraceCheckUtils]: 26: Hoare triple {31342#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,429 INFO L290 TraceCheckUtils]: 27: Hoare triple {31342#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,432 INFO L290 TraceCheckUtils]: 28: Hoare triple {31342#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,432 INFO L290 TraceCheckUtils]: 29: Hoare triple {31342#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,432 INFO L290 TraceCheckUtils]: 30: Hoare triple {31342#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {31342#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,432 INFO L290 TraceCheckUtils]: 32: Hoare triple {31342#true} assume 4368 == #t~mem54;havoc #t~mem54; {31342#true} is VALID [2022-04-07 16:10:47,432 INFO L290 TraceCheckUtils]: 33: Hoare triple {31342#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; {31342#true} is VALID [2022-04-07 16:10:47,432 INFO L290 TraceCheckUtils]: 34: Hoare triple {31342#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {31342#true} is VALID [2022-04-07 16:10:47,432 INFO L290 TraceCheckUtils]: 35: Hoare triple {31342#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); {31342#true} is VALID [2022-04-07 16:10:47,432 INFO L290 TraceCheckUtils]: 36: Hoare triple {31342#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; {31342#true} is VALID [2022-04-07 16:10:47,433 INFO L290 TraceCheckUtils]: 37: Hoare triple {31342#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,433 INFO L290 TraceCheckUtils]: 38: Hoare triple {31342#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {31342#true} is VALID [2022-04-07 16:10:47,433 INFO L290 TraceCheckUtils]: 39: Hoare triple {31342#true} ~skip~0 := 0; {31342#true} is VALID [2022-04-07 16:10:47,433 INFO L290 TraceCheckUtils]: 40: Hoare triple {31342#true} assume !false; {31342#true} is VALID [2022-04-07 16:10:47,433 INFO L290 TraceCheckUtils]: 41: Hoare triple {31342#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,433 INFO L290 TraceCheckUtils]: 42: Hoare triple {31342#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,433 INFO L290 TraceCheckUtils]: 43: Hoare triple {31342#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,433 INFO L290 TraceCheckUtils]: 44: Hoare triple {31342#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,433 INFO L290 TraceCheckUtils]: 45: Hoare triple {31342#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,433 INFO L290 TraceCheckUtils]: 46: Hoare triple {31342#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,433 INFO L290 TraceCheckUtils]: 47: Hoare triple {31342#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,433 INFO L290 TraceCheckUtils]: 48: Hoare triple {31342#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,433 INFO L290 TraceCheckUtils]: 49: Hoare triple {31342#true} assume 4384 == #t~mem56;havoc #t~mem56; {31342#true} is VALID [2022-04-07 16:10:47,433 INFO L290 TraceCheckUtils]: 50: Hoare triple {31342#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {31342#true} is VALID [2022-04-07 16:10:47,433 INFO L290 TraceCheckUtils]: 51: Hoare triple {31342#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {31342#true} is VALID [2022-04-07 16:10:47,433 INFO L290 TraceCheckUtils]: 52: Hoare triple {31342#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,433 INFO L290 TraceCheckUtils]: 53: Hoare triple {31342#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,434 INFO L290 TraceCheckUtils]: 54: Hoare triple {31342#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,434 INFO L290 TraceCheckUtils]: 55: Hoare triple {31342#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,434 INFO L290 TraceCheckUtils]: 56: Hoare triple {31342#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {31342#true} is VALID [2022-04-07 16:10:47,434 INFO L290 TraceCheckUtils]: 57: Hoare triple {31342#true} ~skip~0 := 0; {31342#true} is VALID [2022-04-07 16:10:47,434 INFO L290 TraceCheckUtils]: 58: Hoare triple {31342#true} assume !false; {31342#true} is VALID [2022-04-07 16:10:47,434 INFO L290 TraceCheckUtils]: 59: Hoare triple {31342#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,434 INFO L290 TraceCheckUtils]: 60: Hoare triple {31342#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,434 INFO L290 TraceCheckUtils]: 61: Hoare triple {31342#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,434 INFO L290 TraceCheckUtils]: 62: Hoare triple {31342#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,434 INFO L290 TraceCheckUtils]: 63: Hoare triple {31342#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,434 INFO L290 TraceCheckUtils]: 64: Hoare triple {31342#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,434 INFO L290 TraceCheckUtils]: 65: Hoare triple {31342#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,434 INFO L290 TraceCheckUtils]: 66: Hoare triple {31342#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,434 INFO L290 TraceCheckUtils]: 67: Hoare triple {31342#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,434 INFO L290 TraceCheckUtils]: 68: Hoare triple {31342#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,435 INFO L290 TraceCheckUtils]: 69: Hoare triple {31342#true} assume 4400 == #t~mem58;havoc #t~mem58; {31342#true} is VALID [2022-04-07 16:10:47,435 INFO L290 TraceCheckUtils]: 70: Hoare triple {31342#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); {31342#true} is VALID [2022-04-07 16:10:47,435 INFO L290 TraceCheckUtils]: 71: Hoare triple {31342#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; {31342#true} is VALID [2022-04-07 16:10:47,435 INFO L290 TraceCheckUtils]: 72: Hoare triple {31342#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {31342#true} is VALID [2022-04-07 16:10:47,435 INFO L290 TraceCheckUtils]: 73: Hoare triple {31342#true} assume !(~ret~0 <= 0); {31342#true} is VALID [2022-04-07 16:10:47,435 INFO L290 TraceCheckUtils]: 74: Hoare triple {31342#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,435 INFO L290 TraceCheckUtils]: 75: Hoare triple {31342#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,435 INFO L290 TraceCheckUtils]: 76: Hoare triple {31342#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {31342#true} is VALID [2022-04-07 16:10:47,435 INFO L290 TraceCheckUtils]: 77: Hoare triple {31342#true} ~skip~0 := 0; {31342#true} is VALID [2022-04-07 16:10:47,435 INFO L290 TraceCheckUtils]: 78: Hoare triple {31342#true} assume !false; {31342#true} is VALID [2022-04-07 16:10:47,435 INFO L290 TraceCheckUtils]: 79: Hoare triple {31342#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,435 INFO L290 TraceCheckUtils]: 80: Hoare triple {31342#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,435 INFO L290 TraceCheckUtils]: 81: Hoare triple {31342#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,435 INFO L290 TraceCheckUtils]: 82: Hoare triple {31342#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,435 INFO L290 TraceCheckUtils]: 83: Hoare triple {31342#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,436 INFO L290 TraceCheckUtils]: 84: Hoare triple {31342#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,436 INFO L290 TraceCheckUtils]: 85: Hoare triple {31342#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,436 INFO L290 TraceCheckUtils]: 86: Hoare triple {31342#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,436 INFO L290 TraceCheckUtils]: 87: Hoare triple {31342#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,436 INFO L290 TraceCheckUtils]: 88: Hoare triple {31342#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,436 INFO L290 TraceCheckUtils]: 89: Hoare triple {31342#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,436 INFO L290 TraceCheckUtils]: 90: Hoare triple {31342#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {31342#true} is VALID [2022-04-07 16:10:47,436 INFO L290 TraceCheckUtils]: 91: Hoare triple {31342#true} assume 4416 == #t~mem60;havoc #t~mem60; {31342#true} is VALID [2022-04-07 16:10:47,436 INFO L290 TraceCheckUtils]: 92: Hoare triple {31342#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {31342#true} is VALID [2022-04-07 16:10:47,436 INFO L290 TraceCheckUtils]: 93: Hoare triple {31342#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {31342#true} is VALID [2022-04-07 16:10:47,437 INFO L290 TraceCheckUtils]: 94: Hoare triple {31342#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); {31347#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:47,437 INFO L290 TraceCheckUtils]: 95: Hoare triple {31347#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {31347#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:47,438 INFO L290 TraceCheckUtils]: 96: Hoare triple {31347#(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); {31347#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:47,438 INFO L290 TraceCheckUtils]: 97: Hoare triple {31347#(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; {31347#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:47,438 INFO L290 TraceCheckUtils]: 98: Hoare triple {31347#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {31347#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:47,438 INFO L290 TraceCheckUtils]: 99: Hoare triple {31347#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {31347#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:47,439 INFO L290 TraceCheckUtils]: 100: Hoare triple {31347#(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); {31348#(not (= 12292 |ssl3_connect_#t~mem49|))} is VALID [2022-04-07 16:10:47,439 INFO L290 TraceCheckUtils]: 101: Hoare triple {31348#(not (= 12292 |ssl3_connect_#t~mem49|))} assume 12292 == #t~mem49;havoc #t~mem49; {31343#false} is VALID [2022-04-07 16:10:47,439 INFO L290 TraceCheckUtils]: 102: Hoare triple {31343#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; {31343#false} is VALID [2022-04-07 16:10:47,439 INFO L290 TraceCheckUtils]: 103: Hoare triple {31343#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {31343#false} is VALID [2022-04-07 16:10:47,439 INFO L290 TraceCheckUtils]: 104: Hoare triple {31343#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {31343#false} is VALID [2022-04-07 16:10:47,439 INFO L290 TraceCheckUtils]: 105: Hoare triple {31343#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {31343#false} is VALID [2022-04-07 16:10:47,439 INFO L290 TraceCheckUtils]: 106: Hoare triple {31343#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); {31343#false} is VALID [2022-04-07 16:10:47,439 INFO L290 TraceCheckUtils]: 107: Hoare triple {31343#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {31343#false} is VALID [2022-04-07 16:10:47,439 INFO L290 TraceCheckUtils]: 108: Hoare triple {31343#false} assume !(0 == ~tmp___4~0); {31343#false} is VALID [2022-04-07 16:10:47,440 INFO L290 TraceCheckUtils]: 109: Hoare triple {31343#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); {31343#false} is VALID [2022-04-07 16:10:47,440 INFO L290 TraceCheckUtils]: 110: Hoare triple {31343#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); {31343#false} is VALID [2022-04-07 16:10:47,440 INFO L290 TraceCheckUtils]: 111: Hoare triple {31343#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {31343#false} is VALID [2022-04-07 16:10:47,440 INFO L290 TraceCheckUtils]: 112: Hoare triple {31343#false} ~skip~0 := 0; {31343#false} is VALID [2022-04-07 16:10:47,440 INFO L290 TraceCheckUtils]: 113: Hoare triple {31343#false} assume !false; {31343#false} is VALID [2022-04-07 16:10:47,440 INFO L290 TraceCheckUtils]: 114: Hoare triple {31343#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); {31343#false} is VALID [2022-04-07 16:10:47,440 INFO L290 TraceCheckUtils]: 115: Hoare triple {31343#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31343#false} is VALID [2022-04-07 16:10:47,440 INFO L290 TraceCheckUtils]: 116: Hoare triple {31343#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31343#false} is VALID [2022-04-07 16:10:47,440 INFO L290 TraceCheckUtils]: 117: Hoare triple {31343#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31343#false} is VALID [2022-04-07 16:10:47,440 INFO L290 TraceCheckUtils]: 118: Hoare triple {31343#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31343#false} is VALID [2022-04-07 16:10:47,440 INFO L290 TraceCheckUtils]: 119: Hoare triple {31343#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31343#false} is VALID [2022-04-07 16:10:47,440 INFO L290 TraceCheckUtils]: 120: Hoare triple {31343#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31343#false} is VALID [2022-04-07 16:10:47,440 INFO L290 TraceCheckUtils]: 121: Hoare triple {31343#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31343#false} is VALID [2022-04-07 16:10:47,440 INFO L290 TraceCheckUtils]: 122: Hoare triple {31343#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {31343#false} is VALID [2022-04-07 16:10:47,440 INFO L290 TraceCheckUtils]: 123: Hoare triple {31343#false} assume 4385 == #t~mem57;havoc #t~mem57; {31343#false} is VALID [2022-04-07 16:10:47,441 INFO L290 TraceCheckUtils]: 124: Hoare triple {31343#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {31343#false} is VALID [2022-04-07 16:10:47,441 INFO L290 TraceCheckUtils]: 125: Hoare triple {31343#false} assume !(1 == ~blastFlag~0); {31343#false} is VALID [2022-04-07 16:10:47,441 INFO L290 TraceCheckUtils]: 126: Hoare triple {31343#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {31343#false} is VALID [2022-04-07 16:10:47,441 INFO L290 TraceCheckUtils]: 127: Hoare triple {31343#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {31343#false} is VALID [2022-04-07 16:10:47,441 INFO L290 TraceCheckUtils]: 128: Hoare triple {31343#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {31343#false} is VALID [2022-04-07 16:10:47,441 INFO L290 TraceCheckUtils]: 129: Hoare triple {31343#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {31343#false} is VALID [2022-04-07 16:10:47,441 INFO L290 TraceCheckUtils]: 130: Hoare triple {31343#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); {31343#false} is VALID [2022-04-07 16:10:47,441 INFO L290 TraceCheckUtils]: 131: Hoare triple {31343#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {31343#false} is VALID [2022-04-07 16:10:47,441 INFO L290 TraceCheckUtils]: 132: Hoare triple {31343#false} ~skip~0 := 0; {31343#false} is VALID [2022-04-07 16:10:47,441 INFO L290 TraceCheckUtils]: 133: Hoare triple {31343#false} assume !false; {31343#false} is VALID [2022-04-07 16:10:47,441 INFO L290 TraceCheckUtils]: 134: Hoare triple {31343#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); {31343#false} is VALID [2022-04-07 16:10:47,441 INFO L290 TraceCheckUtils]: 135: Hoare triple {31343#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31343#false} is VALID [2022-04-07 16:10:47,441 INFO L290 TraceCheckUtils]: 136: Hoare triple {31343#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31343#false} is VALID [2022-04-07 16:10:47,441 INFO L290 TraceCheckUtils]: 137: Hoare triple {31343#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31343#false} is VALID [2022-04-07 16:10:47,441 INFO L290 TraceCheckUtils]: 138: Hoare triple {31343#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31343#false} is VALID [2022-04-07 16:10:47,441 INFO L290 TraceCheckUtils]: 139: Hoare triple {31343#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31343#false} is VALID [2022-04-07 16:10:47,442 INFO L290 TraceCheckUtils]: 140: Hoare triple {31343#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31343#false} is VALID [2022-04-07 16:10:47,442 INFO L290 TraceCheckUtils]: 141: Hoare triple {31343#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31343#false} is VALID [2022-04-07 16:10:47,442 INFO L290 TraceCheckUtils]: 142: Hoare triple {31343#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {31343#false} is VALID [2022-04-07 16:10:47,442 INFO L290 TraceCheckUtils]: 143: Hoare triple {31343#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {31343#false} is VALID [2022-04-07 16:10:47,442 INFO L290 TraceCheckUtils]: 144: Hoare triple {31343#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {31343#false} is VALID [2022-04-07 16:10:47,442 INFO L290 TraceCheckUtils]: 145: Hoare triple {31343#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {31343#false} is VALID [2022-04-07 16:10:47,442 INFO L290 TraceCheckUtils]: 146: Hoare triple {31343#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {31343#false} is VALID [2022-04-07 16:10:47,442 INFO L290 TraceCheckUtils]: 147: Hoare triple {31343#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {31343#false} is VALID [2022-04-07 16:10:47,442 INFO L290 TraceCheckUtils]: 148: Hoare triple {31343#false} assume 4432 == #t~mem62;havoc #t~mem62; {31343#false} is VALID [2022-04-07 16:10:47,442 INFO L290 TraceCheckUtils]: 149: Hoare triple {31343#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {31343#false} is VALID [2022-04-07 16:10:47,442 INFO L290 TraceCheckUtils]: 150: Hoare triple {31343#false} assume 5 == ~blastFlag~0; {31343#false} is VALID [2022-04-07 16:10:47,442 INFO L290 TraceCheckUtils]: 151: Hoare triple {31343#false} assume !false; {31343#false} is VALID [2022-04-07 16:10:47,443 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-07 16:10:47,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:47,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590728668] [2022-04-07 16:10:47,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590728668] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:47,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:47,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:47,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922873092] [2022-04-07 16:10:47,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:47,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 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-07 16:10:47,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:47,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:47,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:47,523 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:47,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:47,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:47,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:47,524 INFO L87 Difference]: Start difference. First operand 787 states and 1160 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:49,546 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-07 16:10:50,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:50,478 INFO L93 Difference]: Finished difference Result 1916 states and 2817 transitions. [2022-04-07 16:10:50,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:50,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 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-07 16:10:50,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:50,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:50,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-07 16:10:50,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:50,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-07 16:10:50,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-07 16:10:50,785 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-07 16:10:50,839 INFO L225 Difference]: With dead ends: 1916 [2022-04-07 16:10:50,839 INFO L226 Difference]: Without dead ends: 1145 [2022-04-07 16:10:50,840 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-07 16:10:50,840 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 110 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:50,840 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 296 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 379 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:10:50,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2022-04-07 16:10:50,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 787. [2022-04-07 16:10:50,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:50,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1145 states. Second operand has 787 states, 782 states have (on average 1.4667519181585678) internal successors, (1147), 782 states have internal predecessors, (1147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:50,856 INFO L74 IsIncluded]: Start isIncluded. First operand 1145 states. Second operand has 787 states, 782 states have (on average 1.4667519181585678) internal successors, (1147), 782 states have internal predecessors, (1147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:50,857 INFO L87 Difference]: Start difference. First operand 1145 states. Second operand has 787 states, 782 states have (on average 1.4667519181585678) internal successors, (1147), 782 states have internal predecessors, (1147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:50,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:50,896 INFO L93 Difference]: Finished difference Result 1145 states and 1668 transitions. [2022-04-07 16:10:50,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1668 transitions. [2022-04-07 16:10:50,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:50,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:50,898 INFO L74 IsIncluded]: Start isIncluded. First operand has 787 states, 782 states have (on average 1.4667519181585678) internal successors, (1147), 782 states have internal predecessors, (1147), 3 states have call successors, (3), 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 1145 states. [2022-04-07 16:10:50,898 INFO L87 Difference]: Start difference. First operand has 787 states, 782 states have (on average 1.4667519181585678) internal successors, (1147), 782 states have internal predecessors, (1147), 3 states have call successors, (3), 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 1145 states. [2022-04-07 16:10:50,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:50,933 INFO L93 Difference]: Finished difference Result 1145 states and 1668 transitions. [2022-04-07 16:10:50,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1668 transitions. [2022-04-07 16:10:50,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:50,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:50,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:50,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:50,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 782 states have (on average 1.4667519181585678) internal successors, (1147), 782 states have internal predecessors, (1147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:50,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1151 transitions. [2022-04-07 16:10:50,957 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1151 transitions. Word has length 152 [2022-04-07 16:10:50,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:50,957 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 1151 transitions. [2022-04-07 16:10:50,957 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:50,957 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1151 transitions. [2022-04-07 16:10:50,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-04-07 16:10:50,959 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:50,959 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-07 16:10:50,959 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-07 16:10:50,959 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:50,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:50,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1029384155, now seen corresponding path program 1 times [2022-04-07 16:10:50,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:50,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065228783] [2022-04-07 16:10:50,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:50,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:51,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:51,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {36728#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {36721#true} is VALID [2022-04-07 16:10:51,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {36721#true} assume true; {36721#true} is VALID [2022-04-07 16:10:51,104 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36721#true} {36721#true} #593#return; {36721#true} is VALID [2022-04-07 16:10:51,104 INFO L272 TraceCheckUtils]: 0: Hoare triple {36721#true} call ULTIMATE.init(); {36728#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:51,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {36728#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {36721#true} is VALID [2022-04-07 16:10:51,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {36721#true} assume true; {36721#true} is VALID [2022-04-07 16:10:51,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36721#true} {36721#true} #593#return; {36721#true} is VALID [2022-04-07 16:10:51,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {36721#true} call #t~ret158 := main(); {36721#true} is VALID [2022-04-07 16:10:51,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {36721#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; {36721#true} is VALID [2022-04-07 16:10:51,105 INFO L272 TraceCheckUtils]: 6: Hoare triple {36721#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {36721#true} is VALID [2022-04-07 16:10:51,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {36721#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); {36721#true} is VALID [2022-04-07 16:10:51,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {36721#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; {36721#true} is VALID [2022-04-07 16:10:51,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {36721#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; {36721#true} is VALID [2022-04-07 16:10:51,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {36721#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {36721#true} is VALID [2022-04-07 16:10:51,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {36721#true} assume !false; {36721#true} is VALID [2022-04-07 16:10:51,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {36721#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {36721#true} assume 12292 == #t~mem49;havoc #t~mem49; {36721#true} is VALID [2022-04-07 16:10:51,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {36721#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; {36721#true} is VALID [2022-04-07 16:10:51,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {36721#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {36721#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {36721#true} is VALID [2022-04-07 16:10:51,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {36721#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {36721#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); {36721#true} is VALID [2022-04-07 16:10:51,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {36721#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {36721#true} is VALID [2022-04-07 16:10:51,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {36721#true} assume !(0 == ~tmp___4~0); {36721#true} is VALID [2022-04-07 16:10:51,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {36721#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); {36721#true} is VALID [2022-04-07 16:10:51,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {36721#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {36721#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {36721#true} is VALID [2022-04-07 16:10:51,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {36721#true} ~skip~0 := 0; {36721#true} is VALID [2022-04-07 16:10:51,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {36721#true} assume !false; {36721#true} is VALID [2022-04-07 16:10:51,106 INFO L290 TraceCheckUtils]: 26: Hoare triple {36721#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {36721#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,106 INFO L290 TraceCheckUtils]: 28: Hoare triple {36721#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,106 INFO L290 TraceCheckUtils]: 29: Hoare triple {36721#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,106 INFO L290 TraceCheckUtils]: 30: Hoare triple {36721#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,106 INFO L290 TraceCheckUtils]: 31: Hoare triple {36721#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,106 INFO L290 TraceCheckUtils]: 32: Hoare triple {36721#true} assume 4368 == #t~mem54;havoc #t~mem54; {36721#true} is VALID [2022-04-07 16:10:51,107 INFO L290 TraceCheckUtils]: 33: Hoare triple {36721#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; {36721#true} is VALID [2022-04-07 16:10:51,107 INFO L290 TraceCheckUtils]: 34: Hoare triple {36721#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {36721#true} is VALID [2022-04-07 16:10:51,107 INFO L290 TraceCheckUtils]: 35: Hoare triple {36721#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); {36721#true} is VALID [2022-04-07 16:10:51,107 INFO L290 TraceCheckUtils]: 36: Hoare triple {36721#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; {36721#true} is VALID [2022-04-07 16:10:51,107 INFO L290 TraceCheckUtils]: 37: Hoare triple {36721#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,107 INFO L290 TraceCheckUtils]: 38: Hoare triple {36721#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {36721#true} is VALID [2022-04-07 16:10:51,107 INFO L290 TraceCheckUtils]: 39: Hoare triple {36721#true} ~skip~0 := 0; {36721#true} is VALID [2022-04-07 16:10:51,107 INFO L290 TraceCheckUtils]: 40: Hoare triple {36721#true} assume !false; {36721#true} is VALID [2022-04-07 16:10:51,107 INFO L290 TraceCheckUtils]: 41: Hoare triple {36721#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,107 INFO L290 TraceCheckUtils]: 42: Hoare triple {36721#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,107 INFO L290 TraceCheckUtils]: 43: Hoare triple {36721#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,107 INFO L290 TraceCheckUtils]: 44: Hoare triple {36721#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,107 INFO L290 TraceCheckUtils]: 45: Hoare triple {36721#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,107 INFO L290 TraceCheckUtils]: 46: Hoare triple {36721#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,107 INFO L290 TraceCheckUtils]: 47: Hoare triple {36721#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,108 INFO L290 TraceCheckUtils]: 48: Hoare triple {36721#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,108 INFO L290 TraceCheckUtils]: 49: Hoare triple {36721#true} assume 4384 == #t~mem56;havoc #t~mem56; {36721#true} is VALID [2022-04-07 16:10:51,108 INFO L290 TraceCheckUtils]: 50: Hoare triple {36721#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {36721#true} is VALID [2022-04-07 16:10:51,108 INFO L290 TraceCheckUtils]: 51: Hoare triple {36721#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {36721#true} is VALID [2022-04-07 16:10:51,108 INFO L290 TraceCheckUtils]: 52: Hoare triple {36721#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,108 INFO L290 TraceCheckUtils]: 53: Hoare triple {36721#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,108 INFO L290 TraceCheckUtils]: 54: Hoare triple {36721#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,108 INFO L290 TraceCheckUtils]: 55: Hoare triple {36721#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,108 INFO L290 TraceCheckUtils]: 56: Hoare triple {36721#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {36721#true} is VALID [2022-04-07 16:10:51,108 INFO L290 TraceCheckUtils]: 57: Hoare triple {36721#true} ~skip~0 := 0; {36721#true} is VALID [2022-04-07 16:10:51,108 INFO L290 TraceCheckUtils]: 58: Hoare triple {36721#true} assume !false; {36721#true} is VALID [2022-04-07 16:10:51,108 INFO L290 TraceCheckUtils]: 59: Hoare triple {36721#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,108 INFO L290 TraceCheckUtils]: 60: Hoare triple {36721#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,108 INFO L290 TraceCheckUtils]: 61: Hoare triple {36721#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,108 INFO L290 TraceCheckUtils]: 62: Hoare triple {36721#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,108 INFO L290 TraceCheckUtils]: 63: Hoare triple {36721#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,109 INFO L290 TraceCheckUtils]: 64: Hoare triple {36721#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,109 INFO L290 TraceCheckUtils]: 65: Hoare triple {36721#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,109 INFO L290 TraceCheckUtils]: 66: Hoare triple {36721#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,109 INFO L290 TraceCheckUtils]: 67: Hoare triple {36721#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,109 INFO L290 TraceCheckUtils]: 68: Hoare triple {36721#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,109 INFO L290 TraceCheckUtils]: 69: Hoare triple {36721#true} assume 4400 == #t~mem58;havoc #t~mem58; {36721#true} is VALID [2022-04-07 16:10:51,109 INFO L290 TraceCheckUtils]: 70: Hoare triple {36721#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); {36721#true} is VALID [2022-04-07 16:10:51,109 INFO L290 TraceCheckUtils]: 71: Hoare triple {36721#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; {36721#true} is VALID [2022-04-07 16:10:51,109 INFO L290 TraceCheckUtils]: 72: Hoare triple {36721#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {36721#true} is VALID [2022-04-07 16:10:51,109 INFO L290 TraceCheckUtils]: 73: Hoare triple {36721#true} assume !(~ret~0 <= 0); {36721#true} is VALID [2022-04-07 16:10:51,109 INFO L290 TraceCheckUtils]: 74: Hoare triple {36721#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,109 INFO L290 TraceCheckUtils]: 75: Hoare triple {36721#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,109 INFO L290 TraceCheckUtils]: 76: Hoare triple {36721#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {36721#true} is VALID [2022-04-07 16:10:51,109 INFO L290 TraceCheckUtils]: 77: Hoare triple {36721#true} ~skip~0 := 0; {36721#true} is VALID [2022-04-07 16:10:51,109 INFO L290 TraceCheckUtils]: 78: Hoare triple {36721#true} assume !false; {36721#true} is VALID [2022-04-07 16:10:51,109 INFO L290 TraceCheckUtils]: 79: Hoare triple {36721#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,110 INFO L290 TraceCheckUtils]: 80: Hoare triple {36721#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,110 INFO L290 TraceCheckUtils]: 81: Hoare triple {36721#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,110 INFO L290 TraceCheckUtils]: 82: Hoare triple {36721#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,110 INFO L290 TraceCheckUtils]: 83: Hoare triple {36721#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,110 INFO L290 TraceCheckUtils]: 84: Hoare triple {36721#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,110 INFO L290 TraceCheckUtils]: 85: Hoare triple {36721#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,110 INFO L290 TraceCheckUtils]: 86: Hoare triple {36721#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,110 INFO L290 TraceCheckUtils]: 87: Hoare triple {36721#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,110 INFO L290 TraceCheckUtils]: 88: Hoare triple {36721#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,110 INFO L290 TraceCheckUtils]: 89: Hoare triple {36721#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,110 INFO L290 TraceCheckUtils]: 90: Hoare triple {36721#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {36721#true} is VALID [2022-04-07 16:10:51,110 INFO L290 TraceCheckUtils]: 91: Hoare triple {36721#true} assume 4416 == #t~mem60;havoc #t~mem60; {36721#true} is VALID [2022-04-07 16:10:51,110 INFO L290 TraceCheckUtils]: 92: Hoare triple {36721#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {36721#true} is VALID [2022-04-07 16:10:51,110 INFO L290 TraceCheckUtils]: 93: Hoare triple {36721#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {36721#true} is VALID [2022-04-07 16:10:51,111 INFO L290 TraceCheckUtils]: 94: Hoare triple {36721#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); {36726#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:51,112 INFO L290 TraceCheckUtils]: 95: Hoare triple {36726#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {36726#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:51,112 INFO L290 TraceCheckUtils]: 96: Hoare triple {36726#(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); {36726#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:51,112 INFO L290 TraceCheckUtils]: 97: Hoare triple {36726#(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; {36726#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:51,113 INFO L290 TraceCheckUtils]: 98: Hoare triple {36726#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {36726#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:51,113 INFO L290 TraceCheckUtils]: 99: Hoare triple {36726#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {36726#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:51,113 INFO L290 TraceCheckUtils]: 100: Hoare triple {36726#(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); {36726#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:51,113 INFO L290 TraceCheckUtils]: 101: Hoare triple {36726#(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); {36726#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:51,114 INFO L290 TraceCheckUtils]: 102: Hoare triple {36726#(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); {36726#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:51,114 INFO L290 TraceCheckUtils]: 103: Hoare triple {36726#(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); {36726#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:51,114 INFO L290 TraceCheckUtils]: 104: Hoare triple {36726#(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); {36726#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:51,115 INFO L290 TraceCheckUtils]: 105: Hoare triple {36726#(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); {36727#(not (= |ssl3_connect_#t~mem54| 4368))} is VALID [2022-04-07 16:10:51,115 INFO L290 TraceCheckUtils]: 106: Hoare triple {36727#(not (= |ssl3_connect_#t~mem54| 4368))} assume 4368 == #t~mem54;havoc #t~mem54; {36722#false} is VALID [2022-04-07 16:10:51,115 INFO L290 TraceCheckUtils]: 107: Hoare triple {36722#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; {36722#false} is VALID [2022-04-07 16:10:51,115 INFO L290 TraceCheckUtils]: 108: Hoare triple {36722#false} assume !(0 == ~blastFlag~0); {36722#false} is VALID [2022-04-07 16:10:51,115 INFO L290 TraceCheckUtils]: 109: Hoare triple {36722#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); {36722#false} is VALID [2022-04-07 16:10:51,115 INFO L290 TraceCheckUtils]: 110: Hoare triple {36722#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; {36722#false} is VALID [2022-04-07 16:10:51,115 INFO L290 TraceCheckUtils]: 111: Hoare triple {36722#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); {36722#false} is VALID [2022-04-07 16:10:51,115 INFO L290 TraceCheckUtils]: 112: Hoare triple {36722#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {36722#false} is VALID [2022-04-07 16:10:51,116 INFO L290 TraceCheckUtils]: 113: Hoare triple {36722#false} ~skip~0 := 0; {36722#false} is VALID [2022-04-07 16:10:51,116 INFO L290 TraceCheckUtils]: 114: Hoare triple {36722#false} assume !false; {36722#false} is VALID [2022-04-07 16:10:51,116 INFO L290 TraceCheckUtils]: 115: Hoare triple {36722#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); {36722#false} is VALID [2022-04-07 16:10:51,116 INFO L290 TraceCheckUtils]: 116: Hoare triple {36722#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36722#false} is VALID [2022-04-07 16:10:51,116 INFO L290 TraceCheckUtils]: 117: Hoare triple {36722#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36722#false} is VALID [2022-04-07 16:10:51,116 INFO L290 TraceCheckUtils]: 118: Hoare triple {36722#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36722#false} is VALID [2022-04-07 16:10:51,116 INFO L290 TraceCheckUtils]: 119: Hoare triple {36722#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36722#false} is VALID [2022-04-07 16:10:51,116 INFO L290 TraceCheckUtils]: 120: Hoare triple {36722#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36722#false} is VALID [2022-04-07 16:10:51,116 INFO L290 TraceCheckUtils]: 121: Hoare triple {36722#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36722#false} is VALID [2022-04-07 16:10:51,116 INFO L290 TraceCheckUtils]: 122: Hoare triple {36722#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36722#false} is VALID [2022-04-07 16:10:51,116 INFO L290 TraceCheckUtils]: 123: Hoare triple {36722#false} assume 4384 == #t~mem56;havoc #t~mem56; {36722#false} is VALID [2022-04-07 16:10:51,116 INFO L290 TraceCheckUtils]: 124: Hoare triple {36722#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {36722#false} is VALID [2022-04-07 16:10:51,116 INFO L290 TraceCheckUtils]: 125: Hoare triple {36722#false} assume !(1 == ~blastFlag~0); {36722#false} is VALID [2022-04-07 16:10:51,116 INFO L290 TraceCheckUtils]: 126: Hoare triple {36722#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {36722#false} is VALID [2022-04-07 16:10:51,116 INFO L290 TraceCheckUtils]: 127: Hoare triple {36722#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {36722#false} is VALID [2022-04-07 16:10:51,116 INFO L290 TraceCheckUtils]: 128: Hoare triple {36722#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {36722#false} is VALID [2022-04-07 16:10:51,117 INFO L290 TraceCheckUtils]: 129: Hoare triple {36722#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {36722#false} is VALID [2022-04-07 16:10:51,117 INFO L290 TraceCheckUtils]: 130: Hoare triple {36722#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); {36722#false} is VALID [2022-04-07 16:10:51,117 INFO L290 TraceCheckUtils]: 131: Hoare triple {36722#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {36722#false} is VALID [2022-04-07 16:10:51,117 INFO L290 TraceCheckUtils]: 132: Hoare triple {36722#false} ~skip~0 := 0; {36722#false} is VALID [2022-04-07 16:10:51,117 INFO L290 TraceCheckUtils]: 133: Hoare triple {36722#false} assume !false; {36722#false} is VALID [2022-04-07 16:10:51,117 INFO L290 TraceCheckUtils]: 134: Hoare triple {36722#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); {36722#false} is VALID [2022-04-07 16:10:51,117 INFO L290 TraceCheckUtils]: 135: Hoare triple {36722#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36722#false} is VALID [2022-04-07 16:10:51,117 INFO L290 TraceCheckUtils]: 136: Hoare triple {36722#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36722#false} is VALID [2022-04-07 16:10:51,117 INFO L290 TraceCheckUtils]: 137: Hoare triple {36722#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36722#false} is VALID [2022-04-07 16:10:51,117 INFO L290 TraceCheckUtils]: 138: Hoare triple {36722#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36722#false} is VALID [2022-04-07 16:10:51,117 INFO L290 TraceCheckUtils]: 139: Hoare triple {36722#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36722#false} is VALID [2022-04-07 16:10:51,117 INFO L290 TraceCheckUtils]: 140: Hoare triple {36722#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36722#false} is VALID [2022-04-07 16:10:51,117 INFO L290 TraceCheckUtils]: 141: Hoare triple {36722#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36722#false} is VALID [2022-04-07 16:10:51,117 INFO L290 TraceCheckUtils]: 142: Hoare triple {36722#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36722#false} is VALID [2022-04-07 16:10:51,117 INFO L290 TraceCheckUtils]: 143: Hoare triple {36722#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36722#false} is VALID [2022-04-07 16:10:51,118 INFO L290 TraceCheckUtils]: 144: Hoare triple {36722#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36722#false} is VALID [2022-04-07 16:10:51,118 INFO L290 TraceCheckUtils]: 145: Hoare triple {36722#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {36722#false} is VALID [2022-04-07 16:10:51,118 INFO L290 TraceCheckUtils]: 146: Hoare triple {36722#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {36722#false} is VALID [2022-04-07 16:10:51,118 INFO L290 TraceCheckUtils]: 147: Hoare triple {36722#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {36722#false} is VALID [2022-04-07 16:10:51,118 INFO L290 TraceCheckUtils]: 148: Hoare triple {36722#false} assume 4432 == #t~mem62;havoc #t~mem62; {36722#false} is VALID [2022-04-07 16:10:51,118 INFO L290 TraceCheckUtils]: 149: Hoare triple {36722#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {36722#false} is VALID [2022-04-07 16:10:51,118 INFO L290 TraceCheckUtils]: 150: Hoare triple {36722#false} assume 5 == ~blastFlag~0; {36722#false} is VALID [2022-04-07 16:10:51,118 INFO L290 TraceCheckUtils]: 151: Hoare triple {36722#false} assume !false; {36722#false} is VALID [2022-04-07 16:10:51,118 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-07 16:10:51,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:51,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065228783] [2022-04-07 16:10:51,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065228783] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:51,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:51,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:51,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351626525] [2022-04-07 16:10:51,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:51,120 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-07 16:10:51,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:51,121 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-07 16:10:51,196 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-07 16:10:51,196 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:51,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:51,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:51,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:51,197 INFO L87 Difference]: Start difference. First operand 787 states and 1151 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-07 16:10:53,217 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-07 16:10:54,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:54,502 INFO L93 Difference]: Finished difference Result 1871 states and 2734 transitions. [2022-04-07 16:10:54,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:54,503 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-07 16:10:54,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:54,503 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-07 16:10:54,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-07 16:10:54,505 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-07 16:10:54,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-07 16:10:54,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-07 16:10:54,816 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-07 16:10:54,864 INFO L225 Difference]: With dead ends: 1871 [2022-04-07 16:10:54,864 INFO L226 Difference]: Without dead ends: 1236 [2022-04-07 16:10:54,865 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-07 16:10:54,865 INFO L913 BasicCegarLoop]: 214 mSDtfsCounter, 113 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 31 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:54,865 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 510 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 504 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-07 16:10:54,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2022-04-07 16:10:54,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 867. [2022-04-07 16:10:54,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:54,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1236 states. Second operand has 867 states, 862 states have (on average 1.4535962877030162) internal successors, (1253), 862 states have internal predecessors, (1253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:54,882 INFO L74 IsIncluded]: Start isIncluded. First operand 1236 states. Second operand has 867 states, 862 states have (on average 1.4535962877030162) internal successors, (1253), 862 states have internal predecessors, (1253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:54,883 INFO L87 Difference]: Start difference. First operand 1236 states. Second operand has 867 states, 862 states have (on average 1.4535962877030162) internal successors, (1253), 862 states have internal predecessors, (1253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:54,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:54,924 INFO L93 Difference]: Finished difference Result 1236 states and 1790 transitions. [2022-04-07 16:10:54,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1790 transitions. [2022-04-07 16:10:54,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:54,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:54,926 INFO L74 IsIncluded]: Start isIncluded. First operand has 867 states, 862 states have (on average 1.4535962877030162) internal successors, (1253), 862 states have internal predecessors, (1253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1236 states. [2022-04-07 16:10:54,926 INFO L87 Difference]: Start difference. First operand has 867 states, 862 states have (on average 1.4535962877030162) internal successors, (1253), 862 states have internal predecessors, (1253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1236 states. [2022-04-07 16:10:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:54,969 INFO L93 Difference]: Finished difference Result 1236 states and 1790 transitions. [2022-04-07 16:10:54,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1790 transitions. [2022-04-07 16:10:54,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:54,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:54,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:54,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:54,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 862 states have (on average 1.4535962877030162) internal successors, (1253), 862 states have internal predecessors, (1253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:54,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1257 transitions. [2022-04-07 16:10:54,995 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1257 transitions. Word has length 152 [2022-04-07 16:10:54,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:54,996 INFO L478 AbstractCegarLoop]: Abstraction has 867 states and 1257 transitions. [2022-04-07 16:10:54,996 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-07 16:10:54,996 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1257 transitions. [2022-04-07 16:10:54,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-07 16:10:54,997 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:54,997 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:54,998 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-07 16:10:54,998 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:54,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:54,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1636398631, now seen corresponding path program 1 times [2022-04-07 16:10:54,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:54,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698700525] [2022-04-07 16:10:54,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:54,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:55,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:55,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {42318#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {42311#true} is VALID [2022-04-07 16:10:55,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {42311#true} assume true; {42311#true} is VALID [2022-04-07 16:10:55,161 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42311#true} {42311#true} #593#return; {42311#true} is VALID [2022-04-07 16:10:55,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {42311#true} call ULTIMATE.init(); {42318#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:55,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {42318#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {42311#true} is VALID [2022-04-07 16:10:55,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {42311#true} assume true; {42311#true} is VALID [2022-04-07 16:10:55,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42311#true} {42311#true} #593#return; {42311#true} is VALID [2022-04-07 16:10:55,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {42311#true} call #t~ret158 := main(); {42311#true} is VALID [2022-04-07 16:10:55,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {42311#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; {42311#true} is VALID [2022-04-07 16:10:55,162 INFO L272 TraceCheckUtils]: 6: Hoare triple {42311#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {42311#true} is VALID [2022-04-07 16:10:55,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {42311#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); {42311#true} is VALID [2022-04-07 16:10:55,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {42311#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; {42311#true} is VALID [2022-04-07 16:10:55,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {42311#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; {42311#true} is VALID [2022-04-07 16:10:55,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {42311#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {42311#true} is VALID [2022-04-07 16:10:55,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {42311#true} assume !false; {42311#true} is VALID [2022-04-07 16:10:55,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {42311#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {42311#true} assume 12292 == #t~mem49;havoc #t~mem49; {42311#true} is VALID [2022-04-07 16:10:55,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {42311#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; {42311#true} is VALID [2022-04-07 16:10:55,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {42311#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,162 INFO L290 TraceCheckUtils]: 16: Hoare triple {42311#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {42311#true} is VALID [2022-04-07 16:10:55,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {42311#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {42311#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); {42311#true} is VALID [2022-04-07 16:10:55,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {42311#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {42311#true} is VALID [2022-04-07 16:10:55,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {42311#true} assume !(0 == ~tmp___4~0); {42311#true} is VALID [2022-04-07 16:10:55,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {42311#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); {42311#true} is VALID [2022-04-07 16:10:55,163 INFO L290 TraceCheckUtils]: 22: Hoare triple {42311#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,163 INFO L290 TraceCheckUtils]: 23: Hoare triple {42311#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {42311#true} is VALID [2022-04-07 16:10:55,163 INFO L290 TraceCheckUtils]: 24: Hoare triple {42311#true} ~skip~0 := 0; {42311#true} is VALID [2022-04-07 16:10:55,163 INFO L290 TraceCheckUtils]: 25: Hoare triple {42311#true} assume !false; {42311#true} is VALID [2022-04-07 16:10:55,163 INFO L290 TraceCheckUtils]: 26: Hoare triple {42311#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,163 INFO L290 TraceCheckUtils]: 27: Hoare triple {42311#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,163 INFO L290 TraceCheckUtils]: 28: Hoare triple {42311#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,163 INFO L290 TraceCheckUtils]: 29: Hoare triple {42311#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,163 INFO L290 TraceCheckUtils]: 30: Hoare triple {42311#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,163 INFO L290 TraceCheckUtils]: 31: Hoare triple {42311#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,163 INFO L290 TraceCheckUtils]: 32: Hoare triple {42311#true} assume 4368 == #t~mem54;havoc #t~mem54; {42311#true} is VALID [2022-04-07 16:10:55,164 INFO L290 TraceCheckUtils]: 33: Hoare triple {42311#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; {42311#true} is VALID [2022-04-07 16:10:55,164 INFO L290 TraceCheckUtils]: 34: Hoare triple {42311#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {42311#true} is VALID [2022-04-07 16:10:55,164 INFO L290 TraceCheckUtils]: 35: Hoare triple {42311#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); {42311#true} is VALID [2022-04-07 16:10:55,164 INFO L290 TraceCheckUtils]: 36: Hoare triple {42311#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; {42311#true} is VALID [2022-04-07 16:10:55,164 INFO L290 TraceCheckUtils]: 37: Hoare triple {42311#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,164 INFO L290 TraceCheckUtils]: 38: Hoare triple {42311#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {42311#true} is VALID [2022-04-07 16:10:55,164 INFO L290 TraceCheckUtils]: 39: Hoare triple {42311#true} ~skip~0 := 0; {42311#true} is VALID [2022-04-07 16:10:55,164 INFO L290 TraceCheckUtils]: 40: Hoare triple {42311#true} assume !false; {42311#true} is VALID [2022-04-07 16:10:55,164 INFO L290 TraceCheckUtils]: 41: Hoare triple {42311#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,164 INFO L290 TraceCheckUtils]: 42: Hoare triple {42311#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,164 INFO L290 TraceCheckUtils]: 43: Hoare triple {42311#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,164 INFO L290 TraceCheckUtils]: 44: Hoare triple {42311#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,164 INFO L290 TraceCheckUtils]: 45: Hoare triple {42311#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,164 INFO L290 TraceCheckUtils]: 46: Hoare triple {42311#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,164 INFO L290 TraceCheckUtils]: 47: Hoare triple {42311#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,164 INFO L290 TraceCheckUtils]: 48: Hoare triple {42311#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,165 INFO L290 TraceCheckUtils]: 49: Hoare triple {42311#true} assume 4384 == #t~mem56;havoc #t~mem56; {42311#true} is VALID [2022-04-07 16:10:55,165 INFO L290 TraceCheckUtils]: 50: Hoare triple {42311#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {42311#true} is VALID [2022-04-07 16:10:55,165 INFO L290 TraceCheckUtils]: 51: Hoare triple {42311#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {42311#true} is VALID [2022-04-07 16:10:55,165 INFO L290 TraceCheckUtils]: 52: Hoare triple {42311#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,165 INFO L290 TraceCheckUtils]: 53: Hoare triple {42311#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,165 INFO L290 TraceCheckUtils]: 54: Hoare triple {42311#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,165 INFO L290 TraceCheckUtils]: 55: Hoare triple {42311#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,165 INFO L290 TraceCheckUtils]: 56: Hoare triple {42311#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {42311#true} is VALID [2022-04-07 16:10:55,165 INFO L290 TraceCheckUtils]: 57: Hoare triple {42311#true} ~skip~0 := 0; {42311#true} is VALID [2022-04-07 16:10:55,165 INFO L290 TraceCheckUtils]: 58: Hoare triple {42311#true} assume !false; {42311#true} is VALID [2022-04-07 16:10:55,165 INFO L290 TraceCheckUtils]: 59: Hoare triple {42311#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,165 INFO L290 TraceCheckUtils]: 60: Hoare triple {42311#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,165 INFO L290 TraceCheckUtils]: 61: Hoare triple {42311#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,165 INFO L290 TraceCheckUtils]: 62: Hoare triple {42311#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,165 INFO L290 TraceCheckUtils]: 63: Hoare triple {42311#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,165 INFO L290 TraceCheckUtils]: 64: Hoare triple {42311#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,166 INFO L290 TraceCheckUtils]: 65: Hoare triple {42311#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,166 INFO L290 TraceCheckUtils]: 66: Hoare triple {42311#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,166 INFO L290 TraceCheckUtils]: 67: Hoare triple {42311#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,166 INFO L290 TraceCheckUtils]: 68: Hoare triple {42311#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,166 INFO L290 TraceCheckUtils]: 69: Hoare triple {42311#true} assume 4400 == #t~mem58;havoc #t~mem58; {42311#true} is VALID [2022-04-07 16:10:55,166 INFO L290 TraceCheckUtils]: 70: Hoare triple {42311#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); {42311#true} is VALID [2022-04-07 16:10:55,166 INFO L290 TraceCheckUtils]: 71: Hoare triple {42311#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; {42311#true} is VALID [2022-04-07 16:10:55,166 INFO L290 TraceCheckUtils]: 72: Hoare triple {42311#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {42311#true} is VALID [2022-04-07 16:10:55,166 INFO L290 TraceCheckUtils]: 73: Hoare triple {42311#true} assume !(~ret~0 <= 0); {42311#true} is VALID [2022-04-07 16:10:55,166 INFO L290 TraceCheckUtils]: 74: Hoare triple {42311#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,166 INFO L290 TraceCheckUtils]: 75: Hoare triple {42311#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,166 INFO L290 TraceCheckUtils]: 76: Hoare triple {42311#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {42311#true} is VALID [2022-04-07 16:10:55,166 INFO L290 TraceCheckUtils]: 77: Hoare triple {42311#true} ~skip~0 := 0; {42311#true} is VALID [2022-04-07 16:10:55,166 INFO L290 TraceCheckUtils]: 78: Hoare triple {42311#true} assume !false; {42311#true} is VALID [2022-04-07 16:10:55,166 INFO L290 TraceCheckUtils]: 79: Hoare triple {42311#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,166 INFO L290 TraceCheckUtils]: 80: Hoare triple {42311#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,167 INFO L290 TraceCheckUtils]: 81: Hoare triple {42311#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,167 INFO L290 TraceCheckUtils]: 82: Hoare triple {42311#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,167 INFO L290 TraceCheckUtils]: 83: Hoare triple {42311#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,167 INFO L290 TraceCheckUtils]: 84: Hoare triple {42311#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,167 INFO L290 TraceCheckUtils]: 85: Hoare triple {42311#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,167 INFO L290 TraceCheckUtils]: 86: Hoare triple {42311#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,167 INFO L290 TraceCheckUtils]: 87: Hoare triple {42311#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,167 INFO L290 TraceCheckUtils]: 88: Hoare triple {42311#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,167 INFO L290 TraceCheckUtils]: 89: Hoare triple {42311#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,167 INFO L290 TraceCheckUtils]: 90: Hoare triple {42311#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {42311#true} is VALID [2022-04-07 16:10:55,167 INFO L290 TraceCheckUtils]: 91: Hoare triple {42311#true} assume 4416 == #t~mem60;havoc #t~mem60; {42311#true} is VALID [2022-04-07 16:10:55,167 INFO L290 TraceCheckUtils]: 92: Hoare triple {42311#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {42311#true} is VALID [2022-04-07 16:10:55,167 INFO L290 TraceCheckUtils]: 93: Hoare triple {42311#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {42311#true} is VALID [2022-04-07 16:10:55,168 INFO L290 TraceCheckUtils]: 94: Hoare triple {42311#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); {42316#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:55,169 INFO L290 TraceCheckUtils]: 95: Hoare triple {42316#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {42316#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:55,169 INFO L290 TraceCheckUtils]: 96: Hoare triple {42316#(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); {42316#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:55,169 INFO L290 TraceCheckUtils]: 97: Hoare triple {42316#(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; {42316#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:55,170 INFO L290 TraceCheckUtils]: 98: Hoare triple {42316#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {42316#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:55,170 INFO L290 TraceCheckUtils]: 99: Hoare triple {42316#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {42316#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:55,170 INFO L290 TraceCheckUtils]: 100: Hoare triple {42316#(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); {42316#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:55,170 INFO L290 TraceCheckUtils]: 101: Hoare triple {42316#(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); {42316#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:55,171 INFO L290 TraceCheckUtils]: 102: Hoare triple {42316#(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); {42317#(not (= |ssl3_connect_#t~mem51| 4096))} is VALID [2022-04-07 16:10:55,171 INFO L290 TraceCheckUtils]: 103: Hoare triple {42317#(not (= |ssl3_connect_#t~mem51| 4096))} assume 4096 == #t~mem51;havoc #t~mem51; {42312#false} is VALID [2022-04-07 16:10:55,171 INFO L290 TraceCheckUtils]: 104: Hoare triple {42312#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {42312#false} is VALID [2022-04-07 16:10:55,171 INFO L290 TraceCheckUtils]: 105: Hoare triple {42312#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {42312#false} is VALID [2022-04-07 16:10:55,171 INFO L290 TraceCheckUtils]: 106: Hoare triple {42312#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {42312#false} is VALID [2022-04-07 16:10:55,171 INFO L290 TraceCheckUtils]: 107: Hoare triple {42312#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); {42312#false} is VALID [2022-04-07 16:10:55,171 INFO L290 TraceCheckUtils]: 108: Hoare triple {42312#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {42312#false} is VALID [2022-04-07 16:10:55,171 INFO L290 TraceCheckUtils]: 109: Hoare triple {42312#false} assume !(0 == ~tmp___4~0); {42312#false} is VALID [2022-04-07 16:10:55,172 INFO L290 TraceCheckUtils]: 110: Hoare triple {42312#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); {42312#false} is VALID [2022-04-07 16:10:55,172 INFO L290 TraceCheckUtils]: 111: Hoare triple {42312#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); {42312#false} is VALID [2022-04-07 16:10:55,172 INFO L290 TraceCheckUtils]: 112: Hoare triple {42312#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {42312#false} is VALID [2022-04-07 16:10:55,172 INFO L290 TraceCheckUtils]: 113: Hoare triple {42312#false} ~skip~0 := 0; {42312#false} is VALID [2022-04-07 16:10:55,172 INFO L290 TraceCheckUtils]: 114: Hoare triple {42312#false} assume !false; {42312#false} is VALID [2022-04-07 16:10:55,172 INFO L290 TraceCheckUtils]: 115: Hoare triple {42312#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); {42312#false} is VALID [2022-04-07 16:10:55,172 INFO L290 TraceCheckUtils]: 116: Hoare triple {42312#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42312#false} is VALID [2022-04-07 16:10:55,172 INFO L290 TraceCheckUtils]: 117: Hoare triple {42312#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42312#false} is VALID [2022-04-07 16:10:55,172 INFO L290 TraceCheckUtils]: 118: Hoare triple {42312#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42312#false} is VALID [2022-04-07 16:10:55,172 INFO L290 TraceCheckUtils]: 119: Hoare triple {42312#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42312#false} is VALID [2022-04-07 16:10:55,172 INFO L290 TraceCheckUtils]: 120: Hoare triple {42312#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42312#false} is VALID [2022-04-07 16:10:55,172 INFO L290 TraceCheckUtils]: 121: Hoare triple {42312#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42312#false} is VALID [2022-04-07 16:10:55,172 INFO L290 TraceCheckUtils]: 122: Hoare triple {42312#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {42312#false} is VALID [2022-04-07 16:10:55,172 INFO L290 TraceCheckUtils]: 123: Hoare triple {42312#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {42312#false} is VALID [2022-04-07 16:10:55,173 INFO L290 TraceCheckUtils]: 124: Hoare triple {42312#false} assume 4385 == #t~mem57;havoc #t~mem57; {42312#false} is VALID [2022-04-07 16:10:55,173 INFO L290 TraceCheckUtils]: 125: Hoare triple {42312#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {42312#false} is VALID [2022-04-07 16:10:55,173 INFO L290 TraceCheckUtils]: 126: Hoare triple {42312#false} assume !(1 == ~blastFlag~0); {42312#false} is VALID [2022-04-07 16:10:55,173 INFO L290 TraceCheckUtils]: 127: Hoare triple {42312#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {42312#false} is VALID [2022-04-07 16:10:55,173 INFO L290 TraceCheckUtils]: 128: Hoare triple {42312#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {42312#false} is VALID [2022-04-07 16:10:55,173 INFO L290 TraceCheckUtils]: 129: Hoare triple {42312#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {42312#false} is VALID [2022-04-07 16:10:55,173 INFO L290 TraceCheckUtils]: 130: Hoare triple {42312#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {42312#false} is VALID [2022-04-07 16:10:55,173 INFO L290 TraceCheckUtils]: 131: Hoare triple {42312#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); {42312#false} is VALID [2022-04-07 16:10:55,173 INFO L290 TraceCheckUtils]: 132: Hoare triple {42312#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {42312#false} is VALID [2022-04-07 16:10:55,173 INFO L290 TraceCheckUtils]: 133: Hoare triple {42312#false} ~skip~0 := 0; {42312#false} is VALID [2022-04-07 16:10:55,173 INFO L290 TraceCheckUtils]: 134: Hoare triple {42312#false} assume !false; {42312#false} is VALID [2022-04-07 16:10:55,174 INFO L290 TraceCheckUtils]: 135: Hoare triple {42312#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); {42312#false} is VALID [2022-04-07 16:10:55,174 INFO L290 TraceCheckUtils]: 136: Hoare triple {42312#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42312#false} is VALID [2022-04-07 16:10:55,174 INFO L290 TraceCheckUtils]: 137: Hoare triple {42312#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42312#false} is VALID [2022-04-07 16:10:55,174 INFO L290 TraceCheckUtils]: 138: Hoare triple {42312#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42312#false} is VALID [2022-04-07 16:10:55,174 INFO L290 TraceCheckUtils]: 139: Hoare triple {42312#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42312#false} is VALID [2022-04-07 16:10:55,174 INFO L290 TraceCheckUtils]: 140: Hoare triple {42312#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42312#false} is VALID [2022-04-07 16:10:55,174 INFO L290 TraceCheckUtils]: 141: Hoare triple {42312#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42312#false} is VALID [2022-04-07 16:10:55,174 INFO L290 TraceCheckUtils]: 142: Hoare triple {42312#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {42312#false} is VALID [2022-04-07 16:10:55,174 INFO L290 TraceCheckUtils]: 143: Hoare triple {42312#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {42312#false} is VALID [2022-04-07 16:10:55,174 INFO L290 TraceCheckUtils]: 144: Hoare triple {42312#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {42312#false} is VALID [2022-04-07 16:10:55,174 INFO L290 TraceCheckUtils]: 145: Hoare triple {42312#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {42312#false} is VALID [2022-04-07 16:10:55,174 INFO L290 TraceCheckUtils]: 146: Hoare triple {42312#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {42312#false} is VALID [2022-04-07 16:10:55,174 INFO L290 TraceCheckUtils]: 147: Hoare triple {42312#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {42312#false} is VALID [2022-04-07 16:10:55,174 INFO L290 TraceCheckUtils]: 148: Hoare triple {42312#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {42312#false} is VALID [2022-04-07 16:10:55,174 INFO L290 TraceCheckUtils]: 149: Hoare triple {42312#false} assume 4432 == #t~mem62;havoc #t~mem62; {42312#false} is VALID [2022-04-07 16:10:55,175 INFO L290 TraceCheckUtils]: 150: Hoare triple {42312#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {42312#false} is VALID [2022-04-07 16:10:55,175 INFO L290 TraceCheckUtils]: 151: Hoare triple {42312#false} assume 5 == ~blastFlag~0; {42312#false} is VALID [2022-04-07 16:10:55,175 INFO L290 TraceCheckUtils]: 152: Hoare triple {42312#false} assume !false; {42312#false} is VALID [2022-04-07 16:10:55,175 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-07 16:10:55,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:55,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698700525] [2022-04-07 16:10:55,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698700525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:55,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:55,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:55,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675674145] [2022-04-07 16:10:55,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:55,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 153 [2022-04-07 16:10:55,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:55,177 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-07 16:10:55,253 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-07 16:10:55,253 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:55,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:55,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:55,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:55,254 INFO L87 Difference]: Start difference. First operand 867 states and 1257 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-07 16:10:57,275 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-07 16:10:58,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:58,319 INFO L93 Difference]: Finished difference Result 2077 states and 3012 transitions. [2022-04-07 16:10:58,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:58,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 153 [2022-04-07 16:10:58,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:58,320 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-07 16:10:58,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-07 16:10:58,322 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-07 16:10:58,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-07 16:10:58,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-07 16:10:58,616 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-07 16:10:58,671 INFO L225 Difference]: With dead ends: 2077 [2022-04-07 16:10:58,671 INFO L226 Difference]: Without dead ends: 1226 [2022-04-07 16:10:58,672 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-07 16:10:58,673 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 116 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 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-07 16:10:58,673 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 300 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 394 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:10:58,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2022-04-07 16:10:58,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 867. [2022-04-07 16:10:58,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:58,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1226 states. Second operand has 867 states, 862 states have (on average 1.437354988399072) internal successors, (1239), 862 states have internal predecessors, (1239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:58,689 INFO L74 IsIncluded]: Start isIncluded. First operand 1226 states. Second operand has 867 states, 862 states have (on average 1.437354988399072) internal successors, (1239), 862 states have internal predecessors, (1239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:58,690 INFO L87 Difference]: Start difference. First operand 1226 states. Second operand has 867 states, 862 states have (on average 1.437354988399072) internal successors, (1239), 862 states have internal predecessors, (1239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:58,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:58,729 INFO L93 Difference]: Finished difference Result 1226 states and 1761 transitions. [2022-04-07 16:10:58,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1761 transitions. [2022-04-07 16:10:58,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:58,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:58,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 867 states, 862 states have (on average 1.437354988399072) internal successors, (1239), 862 states have internal predecessors, (1239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1226 states. [2022-04-07 16:10:58,732 INFO L87 Difference]: Start difference. First operand has 867 states, 862 states have (on average 1.437354988399072) internal successors, (1239), 862 states have internal predecessors, (1239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1226 states. [2022-04-07 16:10:58,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:58,773 INFO L93 Difference]: Finished difference Result 1226 states and 1761 transitions. [2022-04-07 16:10:58,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1761 transitions. [2022-04-07 16:10:58,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:58,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:58,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:58,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:58,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 862 states have (on average 1.437354988399072) internal successors, (1239), 862 states have internal predecessors, (1239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:58,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1243 transitions. [2022-04-07 16:10:58,800 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1243 transitions. Word has length 153 [2022-04-07 16:10:58,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:58,800 INFO L478 AbstractCegarLoop]: Abstraction has 867 states and 1243 transitions. [2022-04-07 16:10:58,800 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-07 16:10:58,800 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1243 transitions. [2022-04-07 16:10:58,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-07 16:10:58,801 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:58,801 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-07 16:10:58,802 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-07 16:10:58,802 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:58,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:58,802 INFO L85 PathProgramCache]: Analyzing trace with hash -374709224, now seen corresponding path program 1 times [2022-04-07 16:10:58,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:58,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709968396] [2022-04-07 16:10:58,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:58,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:58,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:58,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {48116#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {48109#true} is VALID [2022-04-07 16:10:58,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {48109#true} assume true; {48109#true} is VALID [2022-04-07 16:10:58,953 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48109#true} {48109#true} #593#return; {48109#true} is VALID [2022-04-07 16:10:58,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {48109#true} call ULTIMATE.init(); {48116#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:58,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {48116#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {48109#true} is VALID [2022-04-07 16:10:58,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {48109#true} assume true; {48109#true} is VALID [2022-04-07 16:10:58,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48109#true} {48109#true} #593#return; {48109#true} is VALID [2022-04-07 16:10:58,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {48109#true} call #t~ret158 := main(); {48109#true} is VALID [2022-04-07 16:10:58,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {48109#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; {48109#true} is VALID [2022-04-07 16:10:58,954 INFO L272 TraceCheckUtils]: 6: Hoare triple {48109#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {48109#true} is VALID [2022-04-07 16:10:58,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {48109#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); {48109#true} is VALID [2022-04-07 16:10:58,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {48109#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; {48109#true} is VALID [2022-04-07 16:10:58,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {48109#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; {48109#true} is VALID [2022-04-07 16:10:58,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {48109#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {48109#true} is VALID [2022-04-07 16:10:58,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {48109#true} assume !false; {48109#true} is VALID [2022-04-07 16:10:58,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {48109#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {48109#true} assume 12292 == #t~mem49;havoc #t~mem49; {48109#true} is VALID [2022-04-07 16:10:58,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {48109#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; {48109#true} is VALID [2022-04-07 16:10:58,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {48109#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {48109#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {48109#true} is VALID [2022-04-07 16:10:58,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {48109#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {48109#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); {48109#true} is VALID [2022-04-07 16:10:58,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {48109#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {48109#true} is VALID [2022-04-07 16:10:58,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {48109#true} assume !(0 == ~tmp___4~0); {48109#true} is VALID [2022-04-07 16:10:58,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {48109#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); {48109#true} is VALID [2022-04-07 16:10:58,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {48109#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {48109#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {48109#true} is VALID [2022-04-07 16:10:58,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {48109#true} ~skip~0 := 0; {48109#true} is VALID [2022-04-07 16:10:58,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {48109#true} assume !false; {48109#true} is VALID [2022-04-07 16:10:58,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {48109#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {48109#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {48109#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {48109#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,956 INFO L290 TraceCheckUtils]: 30: Hoare triple {48109#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,956 INFO L290 TraceCheckUtils]: 31: Hoare triple {48109#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,956 INFO L290 TraceCheckUtils]: 32: Hoare triple {48109#true} assume 4368 == #t~mem54;havoc #t~mem54; {48109#true} is VALID [2022-04-07 16:10:58,956 INFO L290 TraceCheckUtils]: 33: Hoare triple {48109#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; {48109#true} is VALID [2022-04-07 16:10:58,956 INFO L290 TraceCheckUtils]: 34: Hoare triple {48109#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {48109#true} is VALID [2022-04-07 16:10:58,956 INFO L290 TraceCheckUtils]: 35: Hoare triple {48109#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); {48109#true} is VALID [2022-04-07 16:10:58,956 INFO L290 TraceCheckUtils]: 36: Hoare triple {48109#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; {48109#true} is VALID [2022-04-07 16:10:58,956 INFO L290 TraceCheckUtils]: 37: Hoare triple {48109#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,956 INFO L290 TraceCheckUtils]: 38: Hoare triple {48109#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {48109#true} is VALID [2022-04-07 16:10:58,956 INFO L290 TraceCheckUtils]: 39: Hoare triple {48109#true} ~skip~0 := 0; {48109#true} is VALID [2022-04-07 16:10:58,956 INFO L290 TraceCheckUtils]: 40: Hoare triple {48109#true} assume !false; {48109#true} is VALID [2022-04-07 16:10:58,956 INFO L290 TraceCheckUtils]: 41: Hoare triple {48109#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,957 INFO L290 TraceCheckUtils]: 42: Hoare triple {48109#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,957 INFO L290 TraceCheckUtils]: 43: Hoare triple {48109#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,957 INFO L290 TraceCheckUtils]: 44: Hoare triple {48109#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,957 INFO L290 TraceCheckUtils]: 45: Hoare triple {48109#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,957 INFO L290 TraceCheckUtils]: 46: Hoare triple {48109#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,957 INFO L290 TraceCheckUtils]: 47: Hoare triple {48109#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,957 INFO L290 TraceCheckUtils]: 48: Hoare triple {48109#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,957 INFO L290 TraceCheckUtils]: 49: Hoare triple {48109#true} assume 4384 == #t~mem56;havoc #t~mem56; {48109#true} is VALID [2022-04-07 16:10:58,957 INFO L290 TraceCheckUtils]: 50: Hoare triple {48109#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {48109#true} is VALID [2022-04-07 16:10:58,957 INFO L290 TraceCheckUtils]: 51: Hoare triple {48109#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {48109#true} is VALID [2022-04-07 16:10:58,957 INFO L290 TraceCheckUtils]: 52: Hoare triple {48109#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,957 INFO L290 TraceCheckUtils]: 53: Hoare triple {48109#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,958 INFO L290 TraceCheckUtils]: 54: Hoare triple {48109#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,958 INFO L290 TraceCheckUtils]: 55: Hoare triple {48109#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,958 INFO L290 TraceCheckUtils]: 56: Hoare triple {48109#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {48109#true} is VALID [2022-04-07 16:10:58,958 INFO L290 TraceCheckUtils]: 57: Hoare triple {48109#true} ~skip~0 := 0; {48109#true} is VALID [2022-04-07 16:10:58,958 INFO L290 TraceCheckUtils]: 58: Hoare triple {48109#true} assume !false; {48109#true} is VALID [2022-04-07 16:10:58,958 INFO L290 TraceCheckUtils]: 59: Hoare triple {48109#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,958 INFO L290 TraceCheckUtils]: 60: Hoare triple {48109#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,958 INFO L290 TraceCheckUtils]: 61: Hoare triple {48109#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,958 INFO L290 TraceCheckUtils]: 62: Hoare triple {48109#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,958 INFO L290 TraceCheckUtils]: 63: Hoare triple {48109#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,959 INFO L290 TraceCheckUtils]: 64: Hoare triple {48109#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,959 INFO L290 TraceCheckUtils]: 65: Hoare triple {48109#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,959 INFO L290 TraceCheckUtils]: 66: Hoare triple {48109#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,959 INFO L290 TraceCheckUtils]: 67: Hoare triple {48109#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,959 INFO L290 TraceCheckUtils]: 68: Hoare triple {48109#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,959 INFO L290 TraceCheckUtils]: 69: Hoare triple {48109#true} assume 4400 == #t~mem58;havoc #t~mem58; {48109#true} is VALID [2022-04-07 16:10:58,959 INFO L290 TraceCheckUtils]: 70: Hoare triple {48109#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); {48109#true} is VALID [2022-04-07 16:10:58,959 INFO L290 TraceCheckUtils]: 71: Hoare triple {48109#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; {48109#true} is VALID [2022-04-07 16:10:58,959 INFO L290 TraceCheckUtils]: 72: Hoare triple {48109#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {48109#true} is VALID [2022-04-07 16:10:58,959 INFO L290 TraceCheckUtils]: 73: Hoare triple {48109#true} assume !(~ret~0 <= 0); {48109#true} is VALID [2022-04-07 16:10:58,959 INFO L290 TraceCheckUtils]: 74: Hoare triple {48109#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,959 INFO L290 TraceCheckUtils]: 75: Hoare triple {48109#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,959 INFO L290 TraceCheckUtils]: 76: Hoare triple {48109#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {48109#true} is VALID [2022-04-07 16:10:58,959 INFO L290 TraceCheckUtils]: 77: Hoare triple {48109#true} ~skip~0 := 0; {48109#true} is VALID [2022-04-07 16:10:58,959 INFO L290 TraceCheckUtils]: 78: Hoare triple {48109#true} assume !false; {48109#true} is VALID [2022-04-07 16:10:58,960 INFO L290 TraceCheckUtils]: 79: Hoare triple {48109#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,960 INFO L290 TraceCheckUtils]: 80: Hoare triple {48109#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,960 INFO L290 TraceCheckUtils]: 81: Hoare triple {48109#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,960 INFO L290 TraceCheckUtils]: 82: Hoare triple {48109#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,960 INFO L290 TraceCheckUtils]: 83: Hoare triple {48109#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,960 INFO L290 TraceCheckUtils]: 84: Hoare triple {48109#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,960 INFO L290 TraceCheckUtils]: 85: Hoare triple {48109#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,960 INFO L290 TraceCheckUtils]: 86: Hoare triple {48109#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,960 INFO L290 TraceCheckUtils]: 87: Hoare triple {48109#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,960 INFO L290 TraceCheckUtils]: 88: Hoare triple {48109#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,960 INFO L290 TraceCheckUtils]: 89: Hoare triple {48109#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,960 INFO L290 TraceCheckUtils]: 90: Hoare triple {48109#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {48109#true} is VALID [2022-04-07 16:10:58,960 INFO L290 TraceCheckUtils]: 91: Hoare triple {48109#true} assume 4416 == #t~mem60;havoc #t~mem60; {48109#true} is VALID [2022-04-07 16:10:58,960 INFO L290 TraceCheckUtils]: 92: Hoare triple {48109#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {48109#true} is VALID [2022-04-07 16:10:58,960 INFO L290 TraceCheckUtils]: 93: Hoare triple {48109#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {48109#true} is VALID [2022-04-07 16:10:58,961 INFO L290 TraceCheckUtils]: 94: Hoare triple {48109#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); {48114#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:58,962 INFO L290 TraceCheckUtils]: 95: Hoare triple {48114#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {48114#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:58,962 INFO L290 TraceCheckUtils]: 96: Hoare triple {48114#(= 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); {48114#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:58,962 INFO L290 TraceCheckUtils]: 97: Hoare triple {48114#(= 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; {48114#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:58,962 INFO L290 TraceCheckUtils]: 98: Hoare triple {48114#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {48114#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:58,963 INFO L290 TraceCheckUtils]: 99: Hoare triple {48114#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {48114#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:58,963 INFO L290 TraceCheckUtils]: 100: Hoare triple {48114#(= 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); {48114#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:58,963 INFO L290 TraceCheckUtils]: 101: Hoare triple {48114#(= 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); {48114#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:58,963 INFO L290 TraceCheckUtils]: 102: Hoare triple {48114#(= 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); {48114#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:58,964 INFO L290 TraceCheckUtils]: 103: Hoare triple {48114#(= 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); {48114#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:58,964 INFO L290 TraceCheckUtils]: 104: Hoare triple {48114#(= 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); {48114#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:58,964 INFO L290 TraceCheckUtils]: 105: Hoare triple {48114#(= 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); {48114#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:58,964 INFO L290 TraceCheckUtils]: 106: Hoare triple {48114#(= 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); {48115#(= |ssl3_connect_#t~mem55| 4432)} is VALID [2022-04-07 16:10:58,965 INFO L290 TraceCheckUtils]: 107: Hoare triple {48115#(= |ssl3_connect_#t~mem55| 4432)} assume 4369 == #t~mem55;havoc #t~mem55; {48110#false} is VALID [2022-04-07 16:10:58,965 INFO L290 TraceCheckUtils]: 108: Hoare triple {48110#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; {48110#false} is VALID [2022-04-07 16:10:58,965 INFO L290 TraceCheckUtils]: 109: Hoare triple {48110#false} assume !(0 == ~blastFlag~0); {48110#false} is VALID [2022-04-07 16:10:58,965 INFO L290 TraceCheckUtils]: 110: Hoare triple {48110#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); {48110#false} is VALID [2022-04-07 16:10:58,965 INFO L290 TraceCheckUtils]: 111: Hoare triple {48110#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; {48110#false} is VALID [2022-04-07 16:10:58,965 INFO L290 TraceCheckUtils]: 112: Hoare triple {48110#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); {48110#false} is VALID [2022-04-07 16:10:58,965 INFO L290 TraceCheckUtils]: 113: Hoare triple {48110#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {48110#false} is VALID [2022-04-07 16:10:58,965 INFO L290 TraceCheckUtils]: 114: Hoare triple {48110#false} ~skip~0 := 0; {48110#false} is VALID [2022-04-07 16:10:58,965 INFO L290 TraceCheckUtils]: 115: Hoare triple {48110#false} assume !false; {48110#false} is VALID [2022-04-07 16:10:58,965 INFO L290 TraceCheckUtils]: 116: Hoare triple {48110#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); {48110#false} is VALID [2022-04-07 16:10:58,965 INFO L290 TraceCheckUtils]: 117: Hoare triple {48110#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48110#false} is VALID [2022-04-07 16:10:58,965 INFO L290 TraceCheckUtils]: 118: Hoare triple {48110#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48110#false} is VALID [2022-04-07 16:10:58,966 INFO L290 TraceCheckUtils]: 119: Hoare triple {48110#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48110#false} is VALID [2022-04-07 16:10:58,966 INFO L290 TraceCheckUtils]: 120: Hoare triple {48110#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48110#false} is VALID [2022-04-07 16:10:58,966 INFO L290 TraceCheckUtils]: 121: Hoare triple {48110#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48110#false} is VALID [2022-04-07 16:10:58,966 INFO L290 TraceCheckUtils]: 122: Hoare triple {48110#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48110#false} is VALID [2022-04-07 16:10:58,966 INFO L290 TraceCheckUtils]: 123: Hoare triple {48110#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {48110#false} is VALID [2022-04-07 16:10:58,966 INFO L290 TraceCheckUtils]: 124: Hoare triple {48110#false} assume 4384 == #t~mem56;havoc #t~mem56; {48110#false} is VALID [2022-04-07 16:10:58,966 INFO L290 TraceCheckUtils]: 125: Hoare triple {48110#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {48110#false} is VALID [2022-04-07 16:10:58,966 INFO L290 TraceCheckUtils]: 126: Hoare triple {48110#false} assume !(1 == ~blastFlag~0); {48110#false} is VALID [2022-04-07 16:10:58,966 INFO L290 TraceCheckUtils]: 127: Hoare triple {48110#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {48110#false} is VALID [2022-04-07 16:10:58,966 INFO L290 TraceCheckUtils]: 128: Hoare triple {48110#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {48110#false} is VALID [2022-04-07 16:10:58,966 INFO L290 TraceCheckUtils]: 129: Hoare triple {48110#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {48110#false} is VALID [2022-04-07 16:10:58,966 INFO L290 TraceCheckUtils]: 130: Hoare triple {48110#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {48110#false} is VALID [2022-04-07 16:10:58,966 INFO L290 TraceCheckUtils]: 131: Hoare triple {48110#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); {48110#false} is VALID [2022-04-07 16:10:58,966 INFO L290 TraceCheckUtils]: 132: Hoare triple {48110#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {48110#false} is VALID [2022-04-07 16:10:58,966 INFO L290 TraceCheckUtils]: 133: Hoare triple {48110#false} ~skip~0 := 0; {48110#false} is VALID [2022-04-07 16:10:58,966 INFO L290 TraceCheckUtils]: 134: Hoare triple {48110#false} assume !false; {48110#false} is VALID [2022-04-07 16:10:58,967 INFO L290 TraceCheckUtils]: 135: Hoare triple {48110#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); {48110#false} is VALID [2022-04-07 16:10:58,967 INFO L290 TraceCheckUtils]: 136: Hoare triple {48110#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48110#false} is VALID [2022-04-07 16:10:58,967 INFO L290 TraceCheckUtils]: 137: Hoare triple {48110#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48110#false} is VALID [2022-04-07 16:10:58,967 INFO L290 TraceCheckUtils]: 138: Hoare triple {48110#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48110#false} is VALID [2022-04-07 16:10:58,967 INFO L290 TraceCheckUtils]: 139: Hoare triple {48110#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48110#false} is VALID [2022-04-07 16:10:58,967 INFO L290 TraceCheckUtils]: 140: Hoare triple {48110#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48110#false} is VALID [2022-04-07 16:10:58,967 INFO L290 TraceCheckUtils]: 141: Hoare triple {48110#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48110#false} is VALID [2022-04-07 16:10:58,967 INFO L290 TraceCheckUtils]: 142: Hoare triple {48110#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {48110#false} is VALID [2022-04-07 16:10:58,967 INFO L290 TraceCheckUtils]: 143: Hoare triple {48110#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {48110#false} is VALID [2022-04-07 16:10:58,967 INFO L290 TraceCheckUtils]: 144: Hoare triple {48110#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {48110#false} is VALID [2022-04-07 16:10:58,967 INFO L290 TraceCheckUtils]: 145: Hoare triple {48110#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {48110#false} is VALID [2022-04-07 16:10:58,967 INFO L290 TraceCheckUtils]: 146: Hoare triple {48110#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {48110#false} is VALID [2022-04-07 16:10:58,967 INFO L290 TraceCheckUtils]: 147: Hoare triple {48110#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {48110#false} is VALID [2022-04-07 16:10:58,967 INFO L290 TraceCheckUtils]: 148: Hoare triple {48110#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {48110#false} is VALID [2022-04-07 16:10:58,967 INFO L290 TraceCheckUtils]: 149: Hoare triple {48110#false} assume 4432 == #t~mem62;havoc #t~mem62; {48110#false} is VALID [2022-04-07 16:10:58,967 INFO L290 TraceCheckUtils]: 150: Hoare triple {48110#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {48110#false} is VALID [2022-04-07 16:10:58,968 INFO L290 TraceCheckUtils]: 151: Hoare triple {48110#false} assume 5 == ~blastFlag~0; {48110#false} is VALID [2022-04-07 16:10:58,968 INFO L290 TraceCheckUtils]: 152: Hoare triple {48110#false} assume !false; {48110#false} is VALID [2022-04-07 16:10:58,968 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-07 16:10:58,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:58,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709968396] [2022-04-07 16:10:58,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709968396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:58,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:58,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:58,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674079564] [2022-04-07 16:10:58,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:58,969 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-07 16:10:58,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:58,969 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-07 16:10:59,041 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-07 16:10:59,041 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:59,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:59,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:59,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:59,042 INFO L87 Difference]: Start difference. First operand 867 states and 1243 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-07 16:11:01,062 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-07 16:11:02,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:02,293 INFO L93 Difference]: Finished difference Result 1821 states and 2619 transitions. [2022-04-07 16:11:02,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:11:02,294 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-07 16:11:02,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:02,294 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-07 16:11:02,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2022-04-07 16:11:02,296 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-07 16:11:02,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2022-04-07 16:11:02,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 455 transitions. [2022-04-07 16:11:02,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 455 edges. 455 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:02,621 INFO L225 Difference]: With dead ends: 1821 [2022-04-07 16:11:02,621 INFO L226 Difference]: Without dead ends: 1122 [2022-04-07 16:11:02,622 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-07 16:11:02,632 INFO L913 BasicCegarLoop]: 232 mSDtfsCounter, 89 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:02,632 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 553 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 514 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:11:02,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2022-04-07 16:11:02,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 867. [2022-04-07 16:11:02,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:02,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1122 states. Second operand has 867 states, 862 states have (on average 1.4327146171693736) internal successors, (1235), 862 states have internal predecessors, (1235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:02,646 INFO L74 IsIncluded]: Start isIncluded. First operand 1122 states. Second operand has 867 states, 862 states have (on average 1.4327146171693736) internal successors, (1235), 862 states have internal predecessors, (1235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:02,647 INFO L87 Difference]: Start difference. First operand 1122 states. Second operand has 867 states, 862 states have (on average 1.4327146171693736) internal successors, (1235), 862 states have internal predecessors, (1235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:02,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:02,681 INFO L93 Difference]: Finished difference Result 1122 states and 1612 transitions. [2022-04-07 16:11:02,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1612 transitions. [2022-04-07 16:11:02,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:02,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:02,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 867 states, 862 states have (on average 1.4327146171693736) internal successors, (1235), 862 states have internal predecessors, (1235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1122 states. [2022-04-07 16:11:02,684 INFO L87 Difference]: Start difference. First operand has 867 states, 862 states have (on average 1.4327146171693736) internal successors, (1235), 862 states have internal predecessors, (1235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1122 states. [2022-04-07 16:11:02,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:02,719 INFO L93 Difference]: Finished difference Result 1122 states and 1612 transitions. [2022-04-07 16:11:02,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1612 transitions. [2022-04-07 16:11:02,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:02,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:02,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:02,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:02,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 862 states have (on average 1.4327146171693736) internal successors, (1235), 862 states have internal predecessors, (1235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:02,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1239 transitions. [2022-04-07 16:11:02,746 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1239 transitions. Word has length 153 [2022-04-07 16:11:02,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:02,746 INFO L478 AbstractCegarLoop]: Abstraction has 867 states and 1239 transitions. [2022-04-07 16:11:02,746 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-07 16:11:02,746 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1239 transitions. [2022-04-07 16:11:02,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-04-07 16:11:02,748 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:02,748 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:11:02,748 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-07 16:11:02,748 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:02,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:02,748 INFO L85 PathProgramCache]: Analyzing trace with hash -719726875, now seen corresponding path program 1 times [2022-04-07 16:11:02,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:02,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712933197] [2022-04-07 16:11:02,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:02,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:02,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:02,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {53409#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {53402#true} is VALID [2022-04-07 16:11:02,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {53402#true} assume true; {53402#true} is VALID [2022-04-07 16:11:02,891 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53402#true} {53402#true} #593#return; {53402#true} is VALID [2022-04-07 16:11:02,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {53402#true} call ULTIMATE.init(); {53409#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:11:02,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {53409#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {53402#true} is VALID [2022-04-07 16:11:02,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {53402#true} assume true; {53402#true} is VALID [2022-04-07 16:11:02,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53402#true} {53402#true} #593#return; {53402#true} is VALID [2022-04-07 16:11:02,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {53402#true} call #t~ret158 := main(); {53402#true} is VALID [2022-04-07 16:11:02,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {53402#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; {53402#true} is VALID [2022-04-07 16:11:02,892 INFO L272 TraceCheckUtils]: 6: Hoare triple {53402#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {53402#true} is VALID [2022-04-07 16:11:02,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {53402#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); {53402#true} is VALID [2022-04-07 16:11:02,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {53402#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; {53402#true} is VALID [2022-04-07 16:11:02,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {53402#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; {53402#true} is VALID [2022-04-07 16:11:02,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {53402#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {53402#true} is VALID [2022-04-07 16:11:02,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {53402#true} assume !false; {53402#true} is VALID [2022-04-07 16:11:02,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {53402#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {53402#true} assume 12292 == #t~mem49;havoc #t~mem49; {53402#true} is VALID [2022-04-07 16:11:02,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {53402#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; {53402#true} is VALID [2022-04-07 16:11:02,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {53402#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {53402#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {53402#true} is VALID [2022-04-07 16:11:02,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {53402#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {53402#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); {53402#true} is VALID [2022-04-07 16:11:02,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {53402#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {53402#true} is VALID [2022-04-07 16:11:02,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {53402#true} assume !(0 == ~tmp___4~0); {53402#true} is VALID [2022-04-07 16:11:02,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {53402#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); {53402#true} is VALID [2022-04-07 16:11:02,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {53402#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {53402#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {53402#true} is VALID [2022-04-07 16:11:02,893 INFO L290 TraceCheckUtils]: 24: Hoare triple {53402#true} ~skip~0 := 0; {53402#true} is VALID [2022-04-07 16:11:02,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {53402#true} assume !false; {53402#true} is VALID [2022-04-07 16:11:02,894 INFO L290 TraceCheckUtils]: 26: Hoare triple {53402#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,894 INFO L290 TraceCheckUtils]: 27: Hoare triple {53402#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,894 INFO L290 TraceCheckUtils]: 28: Hoare triple {53402#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,894 INFO L290 TraceCheckUtils]: 29: Hoare triple {53402#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,894 INFO L290 TraceCheckUtils]: 30: Hoare triple {53402#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {53402#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {53402#true} assume 4368 == #t~mem54;havoc #t~mem54; {53402#true} is VALID [2022-04-07 16:11:02,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {53402#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; {53402#true} is VALID [2022-04-07 16:11:02,894 INFO L290 TraceCheckUtils]: 34: Hoare triple {53402#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {53402#true} is VALID [2022-04-07 16:11:02,894 INFO L290 TraceCheckUtils]: 35: Hoare triple {53402#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); {53402#true} is VALID [2022-04-07 16:11:02,894 INFO L290 TraceCheckUtils]: 36: Hoare triple {53402#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; {53402#true} is VALID [2022-04-07 16:11:02,894 INFO L290 TraceCheckUtils]: 37: Hoare triple {53402#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,894 INFO L290 TraceCheckUtils]: 38: Hoare triple {53402#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {53402#true} is VALID [2022-04-07 16:11:02,894 INFO L290 TraceCheckUtils]: 39: Hoare triple {53402#true} ~skip~0 := 0; {53402#true} is VALID [2022-04-07 16:11:02,894 INFO L290 TraceCheckUtils]: 40: Hoare triple {53402#true} assume !false; {53402#true} is VALID [2022-04-07 16:11:02,895 INFO L290 TraceCheckUtils]: 41: Hoare triple {53402#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,895 INFO L290 TraceCheckUtils]: 42: Hoare triple {53402#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,895 INFO L290 TraceCheckUtils]: 43: Hoare triple {53402#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,895 INFO L290 TraceCheckUtils]: 44: Hoare triple {53402#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,895 INFO L290 TraceCheckUtils]: 45: Hoare triple {53402#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,895 INFO L290 TraceCheckUtils]: 46: Hoare triple {53402#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,895 INFO L290 TraceCheckUtils]: 47: Hoare triple {53402#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,895 INFO L290 TraceCheckUtils]: 48: Hoare triple {53402#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,895 INFO L290 TraceCheckUtils]: 49: Hoare triple {53402#true} assume 4384 == #t~mem56;havoc #t~mem56; {53402#true} is VALID [2022-04-07 16:11:02,895 INFO L290 TraceCheckUtils]: 50: Hoare triple {53402#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {53402#true} is VALID [2022-04-07 16:11:02,895 INFO L290 TraceCheckUtils]: 51: Hoare triple {53402#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {53402#true} is VALID [2022-04-07 16:11:02,895 INFO L290 TraceCheckUtils]: 52: Hoare triple {53402#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,895 INFO L290 TraceCheckUtils]: 53: Hoare triple {53402#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,895 INFO L290 TraceCheckUtils]: 54: Hoare triple {53402#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,895 INFO L290 TraceCheckUtils]: 55: Hoare triple {53402#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,895 INFO L290 TraceCheckUtils]: 56: Hoare triple {53402#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {53402#true} is VALID [2022-04-07 16:11:02,896 INFO L290 TraceCheckUtils]: 57: Hoare triple {53402#true} ~skip~0 := 0; {53402#true} is VALID [2022-04-07 16:11:02,896 INFO L290 TraceCheckUtils]: 58: Hoare triple {53402#true} assume !false; {53402#true} is VALID [2022-04-07 16:11:02,896 INFO L290 TraceCheckUtils]: 59: Hoare triple {53402#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,896 INFO L290 TraceCheckUtils]: 60: Hoare triple {53402#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,896 INFO L290 TraceCheckUtils]: 61: Hoare triple {53402#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,896 INFO L290 TraceCheckUtils]: 62: Hoare triple {53402#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,896 INFO L290 TraceCheckUtils]: 63: Hoare triple {53402#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,896 INFO L290 TraceCheckUtils]: 64: Hoare triple {53402#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,896 INFO L290 TraceCheckUtils]: 65: Hoare triple {53402#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,896 INFO L290 TraceCheckUtils]: 66: Hoare triple {53402#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,896 INFO L290 TraceCheckUtils]: 67: Hoare triple {53402#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,896 INFO L290 TraceCheckUtils]: 68: Hoare triple {53402#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,896 INFO L290 TraceCheckUtils]: 69: Hoare triple {53402#true} assume 4400 == #t~mem58;havoc #t~mem58; {53402#true} is VALID [2022-04-07 16:11:02,896 INFO L290 TraceCheckUtils]: 70: Hoare triple {53402#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); {53402#true} is VALID [2022-04-07 16:11:02,896 INFO L290 TraceCheckUtils]: 71: Hoare triple {53402#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; {53402#true} is VALID [2022-04-07 16:11:02,897 INFO L290 TraceCheckUtils]: 72: Hoare triple {53402#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {53402#true} is VALID [2022-04-07 16:11:02,897 INFO L290 TraceCheckUtils]: 73: Hoare triple {53402#true} assume !(~ret~0 <= 0); {53402#true} is VALID [2022-04-07 16:11:02,897 INFO L290 TraceCheckUtils]: 74: Hoare triple {53402#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,897 INFO L290 TraceCheckUtils]: 75: Hoare triple {53402#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,897 INFO L290 TraceCheckUtils]: 76: Hoare triple {53402#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {53402#true} is VALID [2022-04-07 16:11:02,897 INFO L290 TraceCheckUtils]: 77: Hoare triple {53402#true} ~skip~0 := 0; {53402#true} is VALID [2022-04-07 16:11:02,897 INFO L290 TraceCheckUtils]: 78: Hoare triple {53402#true} assume !false; {53402#true} is VALID [2022-04-07 16:11:02,897 INFO L290 TraceCheckUtils]: 79: Hoare triple {53402#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,897 INFO L290 TraceCheckUtils]: 80: Hoare triple {53402#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,897 INFO L290 TraceCheckUtils]: 81: Hoare triple {53402#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,897 INFO L290 TraceCheckUtils]: 82: Hoare triple {53402#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,897 INFO L290 TraceCheckUtils]: 83: Hoare triple {53402#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,897 INFO L290 TraceCheckUtils]: 84: Hoare triple {53402#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,897 INFO L290 TraceCheckUtils]: 85: Hoare triple {53402#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,897 INFO L290 TraceCheckUtils]: 86: Hoare triple {53402#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,897 INFO L290 TraceCheckUtils]: 87: Hoare triple {53402#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,898 INFO L290 TraceCheckUtils]: 88: Hoare triple {53402#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,898 INFO L290 TraceCheckUtils]: 89: Hoare triple {53402#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,898 INFO L290 TraceCheckUtils]: 90: Hoare triple {53402#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {53402#true} is VALID [2022-04-07 16:11:02,898 INFO L290 TraceCheckUtils]: 91: Hoare triple {53402#true} assume 4416 == #t~mem60;havoc #t~mem60; {53402#true} is VALID [2022-04-07 16:11:02,898 INFO L290 TraceCheckUtils]: 92: Hoare triple {53402#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {53402#true} is VALID [2022-04-07 16:11:02,898 INFO L290 TraceCheckUtils]: 93: Hoare triple {53402#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {53402#true} is VALID [2022-04-07 16:11:02,899 INFO L290 TraceCheckUtils]: 94: Hoare triple {53402#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); {53407#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:02,899 INFO L290 TraceCheckUtils]: 95: Hoare triple {53407#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {53407#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:02,899 INFO L290 TraceCheckUtils]: 96: Hoare triple {53407#(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); {53407#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:02,900 INFO L290 TraceCheckUtils]: 97: Hoare triple {53407#(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; {53407#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:02,900 INFO L290 TraceCheckUtils]: 98: Hoare triple {53407#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {53407#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:02,900 INFO L290 TraceCheckUtils]: 99: Hoare triple {53407#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {53407#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:02,900 INFO L290 TraceCheckUtils]: 100: Hoare triple {53407#(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); {53407#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:02,901 INFO L290 TraceCheckUtils]: 101: Hoare triple {53407#(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); {53407#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:02,901 INFO L290 TraceCheckUtils]: 102: Hoare triple {53407#(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); {53407#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:02,901 INFO L290 TraceCheckUtils]: 103: Hoare triple {53407#(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); {53408#(not (= |ssl3_connect_#t~mem52| 20480))} is VALID [2022-04-07 16:11:02,902 INFO L290 TraceCheckUtils]: 104: Hoare triple {53408#(not (= |ssl3_connect_#t~mem52| 20480))} assume 20480 == #t~mem52;havoc #t~mem52; {53403#false} is VALID [2022-04-07 16:11:02,902 INFO L290 TraceCheckUtils]: 105: Hoare triple {53403#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {53403#false} is VALID [2022-04-07 16:11:02,902 INFO L290 TraceCheckUtils]: 106: Hoare triple {53403#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {53403#false} is VALID [2022-04-07 16:11:02,902 INFO L290 TraceCheckUtils]: 107: Hoare triple {53403#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {53403#false} is VALID [2022-04-07 16:11:02,902 INFO L290 TraceCheckUtils]: 108: Hoare triple {53403#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); {53403#false} is VALID [2022-04-07 16:11:02,902 INFO L290 TraceCheckUtils]: 109: Hoare triple {53403#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {53403#false} is VALID [2022-04-07 16:11:02,902 INFO L290 TraceCheckUtils]: 110: Hoare triple {53403#false} assume !(0 == ~tmp___4~0); {53403#false} is VALID [2022-04-07 16:11:02,902 INFO L290 TraceCheckUtils]: 111: Hoare triple {53403#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); {53403#false} is VALID [2022-04-07 16:11:02,902 INFO L290 TraceCheckUtils]: 112: Hoare triple {53403#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); {53403#false} is VALID [2022-04-07 16:11:02,902 INFO L290 TraceCheckUtils]: 113: Hoare triple {53403#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {53403#false} is VALID [2022-04-07 16:11:02,902 INFO L290 TraceCheckUtils]: 114: Hoare triple {53403#false} ~skip~0 := 0; {53403#false} is VALID [2022-04-07 16:11:02,902 INFO L290 TraceCheckUtils]: 115: Hoare triple {53403#false} assume !false; {53403#false} is VALID [2022-04-07 16:11:02,902 INFO L290 TraceCheckUtils]: 116: Hoare triple {53403#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); {53403#false} is VALID [2022-04-07 16:11:02,902 INFO L290 TraceCheckUtils]: 117: Hoare triple {53403#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {53403#false} is VALID [2022-04-07 16:11:02,903 INFO L290 TraceCheckUtils]: 118: Hoare triple {53403#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {53403#false} is VALID [2022-04-07 16:11:02,903 INFO L290 TraceCheckUtils]: 119: Hoare triple {53403#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {53403#false} is VALID [2022-04-07 16:11:02,903 INFO L290 TraceCheckUtils]: 120: Hoare triple {53403#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {53403#false} is VALID [2022-04-07 16:11:02,903 INFO L290 TraceCheckUtils]: 121: Hoare triple {53403#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {53403#false} is VALID [2022-04-07 16:11:02,903 INFO L290 TraceCheckUtils]: 122: Hoare triple {53403#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {53403#false} is VALID [2022-04-07 16:11:02,903 INFO L290 TraceCheckUtils]: 123: Hoare triple {53403#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {53403#false} is VALID [2022-04-07 16:11:02,903 INFO L290 TraceCheckUtils]: 124: Hoare triple {53403#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {53403#false} is VALID [2022-04-07 16:11:02,903 INFO L290 TraceCheckUtils]: 125: Hoare triple {53403#false} assume 4385 == #t~mem57;havoc #t~mem57; {53403#false} is VALID [2022-04-07 16:11:02,903 INFO L290 TraceCheckUtils]: 126: Hoare triple {53403#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {53403#false} is VALID [2022-04-07 16:11:02,903 INFO L290 TraceCheckUtils]: 127: Hoare triple {53403#false} assume !(1 == ~blastFlag~0); {53403#false} is VALID [2022-04-07 16:11:02,903 INFO L290 TraceCheckUtils]: 128: Hoare triple {53403#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {53403#false} is VALID [2022-04-07 16:11:02,903 INFO L290 TraceCheckUtils]: 129: Hoare triple {53403#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {53403#false} is VALID [2022-04-07 16:11:02,903 INFO L290 TraceCheckUtils]: 130: Hoare triple {53403#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {53403#false} is VALID [2022-04-07 16:11:02,903 INFO L290 TraceCheckUtils]: 131: Hoare triple {53403#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {53403#false} is VALID [2022-04-07 16:11:02,903 INFO L290 TraceCheckUtils]: 132: Hoare triple {53403#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); {53403#false} is VALID [2022-04-07 16:11:02,903 INFO L290 TraceCheckUtils]: 133: Hoare triple {53403#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {53403#false} is VALID [2022-04-07 16:11:02,904 INFO L290 TraceCheckUtils]: 134: Hoare triple {53403#false} ~skip~0 := 0; {53403#false} is VALID [2022-04-07 16:11:02,904 INFO L290 TraceCheckUtils]: 135: Hoare triple {53403#false} assume !false; {53403#false} is VALID [2022-04-07 16:11:02,904 INFO L290 TraceCheckUtils]: 136: Hoare triple {53403#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); {53403#false} is VALID [2022-04-07 16:11:02,904 INFO L290 TraceCheckUtils]: 137: Hoare triple {53403#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {53403#false} is VALID [2022-04-07 16:11:02,904 INFO L290 TraceCheckUtils]: 138: Hoare triple {53403#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {53403#false} is VALID [2022-04-07 16:11:02,904 INFO L290 TraceCheckUtils]: 139: Hoare triple {53403#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {53403#false} is VALID [2022-04-07 16:11:02,904 INFO L290 TraceCheckUtils]: 140: Hoare triple {53403#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {53403#false} is VALID [2022-04-07 16:11:02,904 INFO L290 TraceCheckUtils]: 141: Hoare triple {53403#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {53403#false} is VALID [2022-04-07 16:11:02,904 INFO L290 TraceCheckUtils]: 142: Hoare triple {53403#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {53403#false} is VALID [2022-04-07 16:11:02,904 INFO L290 TraceCheckUtils]: 143: Hoare triple {53403#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {53403#false} is VALID [2022-04-07 16:11:02,904 INFO L290 TraceCheckUtils]: 144: Hoare triple {53403#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {53403#false} is VALID [2022-04-07 16:11:02,904 INFO L290 TraceCheckUtils]: 145: Hoare triple {53403#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {53403#false} is VALID [2022-04-07 16:11:02,904 INFO L290 TraceCheckUtils]: 146: Hoare triple {53403#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {53403#false} is VALID [2022-04-07 16:11:02,904 INFO L290 TraceCheckUtils]: 147: Hoare triple {53403#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {53403#false} is VALID [2022-04-07 16:11:02,904 INFO L290 TraceCheckUtils]: 148: Hoare triple {53403#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {53403#false} is VALID [2022-04-07 16:11:02,904 INFO L290 TraceCheckUtils]: 149: Hoare triple {53403#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {53403#false} is VALID [2022-04-07 16:11:02,905 INFO L290 TraceCheckUtils]: 150: Hoare triple {53403#false} assume 4432 == #t~mem62;havoc #t~mem62; {53403#false} is VALID [2022-04-07 16:11:02,905 INFO L290 TraceCheckUtils]: 151: Hoare triple {53403#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {53403#false} is VALID [2022-04-07 16:11:02,905 INFO L290 TraceCheckUtils]: 152: Hoare triple {53403#false} assume 5 == ~blastFlag~0; {53403#false} is VALID [2022-04-07 16:11:02,905 INFO L290 TraceCheckUtils]: 153: Hoare triple {53403#false} assume !false; {53403#false} is VALID [2022-04-07 16:11:02,905 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-07 16:11:02,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:02,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712933197] [2022-04-07 16:11:02,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712933197] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:02,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:02,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:11:02,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902900932] [2022-04-07 16:11:02,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:02,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 154 [2022-04-07 16:11:02,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:02,907 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-07 16:11:02,971 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-07 16:11:02,972 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:11:02,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:02,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:11:02,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:11:02,972 INFO L87 Difference]: Start difference. First operand 867 states and 1239 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-07 16:11:04,992 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-07 16:11:05,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:05,988 INFO L93 Difference]: Finished difference Result 2077 states and 2976 transitions. [2022-04-07 16:11:05,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:11:05,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 154 [2022-04-07 16:11:05,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:05,989 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-07 16:11:05,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-07 16:11:05,991 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-07 16:11:05,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-07 16:11:05,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-07 16:11:06,319 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-07 16:11:06,375 INFO L225 Difference]: With dead ends: 2077 [2022-04-07 16:11:06,375 INFO L226 Difference]: Without dead ends: 1226 [2022-04-07 16:11:06,376 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-07 16:11:06,376 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 114 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:06,377 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.3s Time] [2022-04-07 16:11:06,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2022-04-07 16:11:06,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 867. [2022-04-07 16:11:06,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:06,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1226 states. Second operand has 867 states, 862 states have (on average 1.4164733178654292) internal successors, (1221), 862 states have internal predecessors, (1221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:06,393 INFO L74 IsIncluded]: Start isIncluded. First operand 1226 states. Second operand has 867 states, 862 states have (on average 1.4164733178654292) internal successors, (1221), 862 states have internal predecessors, (1221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:06,393 INFO L87 Difference]: Start difference. First operand 1226 states. Second operand has 867 states, 862 states have (on average 1.4164733178654292) internal successors, (1221), 862 states have internal predecessors, (1221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:06,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:06,444 INFO L93 Difference]: Finished difference Result 1226 states and 1743 transitions. [2022-04-07 16:11:06,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1743 transitions. [2022-04-07 16:11:06,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:06,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:06,446 INFO L74 IsIncluded]: Start isIncluded. First operand has 867 states, 862 states have (on average 1.4164733178654292) internal successors, (1221), 862 states have internal predecessors, (1221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1226 states. [2022-04-07 16:11:06,446 INFO L87 Difference]: Start difference. First operand has 867 states, 862 states have (on average 1.4164733178654292) internal successors, (1221), 862 states have internal predecessors, (1221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1226 states. [2022-04-07 16:11:06,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:06,485 INFO L93 Difference]: Finished difference Result 1226 states and 1743 transitions. [2022-04-07 16:11:06,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1743 transitions. [2022-04-07 16:11:06,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:06,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:06,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:06,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:06,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 862 states have (on average 1.4164733178654292) internal successors, (1221), 862 states have internal predecessors, (1221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:06,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1225 transitions. [2022-04-07 16:11:06,513 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1225 transitions. Word has length 154 [2022-04-07 16:11:06,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:06,513 INFO L478 AbstractCegarLoop]: Abstraction has 867 states and 1225 transitions. [2022-04-07 16:11:06,514 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-07 16:11:06,514 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1225 transitions. [2022-04-07 16:11:06,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-07 16:11:06,515 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:06,515 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:11:06,515 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-07 16:11:06,515 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:06,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:06,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1227152319, now seen corresponding path program 1 times [2022-04-07 16:11:06,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:06,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322690952] [2022-04-07 16:11:06,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:06,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:06,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:06,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {59207#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {59200#true} is VALID [2022-04-07 16:11:06,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {59200#true} assume true; {59200#true} is VALID [2022-04-07 16:11:06,675 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59200#true} {59200#true} #593#return; {59200#true} is VALID [2022-04-07 16:11:06,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {59200#true} call ULTIMATE.init(); {59207#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:11:06,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {59207#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {59200#true} is VALID [2022-04-07 16:11:06,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {59200#true} assume true; {59200#true} is VALID [2022-04-07 16:11:06,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59200#true} {59200#true} #593#return; {59200#true} is VALID [2022-04-07 16:11:06,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {59200#true} call #t~ret158 := main(); {59200#true} is VALID [2022-04-07 16:11:06,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {59200#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; {59200#true} is VALID [2022-04-07 16:11:06,678 INFO L272 TraceCheckUtils]: 6: Hoare triple {59200#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {59200#true} is VALID [2022-04-07 16:11:06,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {59200#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); {59200#true} is VALID [2022-04-07 16:11:06,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {59200#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; {59200#true} is VALID [2022-04-07 16:11:06,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {59200#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; {59200#true} is VALID [2022-04-07 16:11:06,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {59200#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {59200#true} is VALID [2022-04-07 16:11:06,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {59200#true} assume !false; {59200#true} is VALID [2022-04-07 16:11:06,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {59200#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {59200#true} assume 12292 == #t~mem49;havoc #t~mem49; {59200#true} is VALID [2022-04-07 16:11:06,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {59200#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; {59200#true} is VALID [2022-04-07 16:11:06,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {59200#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {59200#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {59200#true} is VALID [2022-04-07 16:11:06,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {59200#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {59200#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); {59200#true} is VALID [2022-04-07 16:11:06,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {59200#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {59200#true} is VALID [2022-04-07 16:11:06,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {59200#true} assume !(0 == ~tmp___4~0); {59200#true} is VALID [2022-04-07 16:11:06,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {59200#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); {59200#true} is VALID [2022-04-07 16:11:06,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {59200#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {59200#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {59200#true} is VALID [2022-04-07 16:11:06,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {59200#true} ~skip~0 := 0; {59200#true} is VALID [2022-04-07 16:11:06,679 INFO L290 TraceCheckUtils]: 25: Hoare triple {59200#true} assume !false; {59200#true} is VALID [2022-04-07 16:11:06,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {59200#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,679 INFO L290 TraceCheckUtils]: 27: Hoare triple {59200#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,679 INFO L290 TraceCheckUtils]: 28: Hoare triple {59200#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,679 INFO L290 TraceCheckUtils]: 29: Hoare triple {59200#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {59200#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {59200#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,679 INFO L290 TraceCheckUtils]: 32: Hoare triple {59200#true} assume 4368 == #t~mem54;havoc #t~mem54; {59200#true} is VALID [2022-04-07 16:11:06,680 INFO L290 TraceCheckUtils]: 33: Hoare triple {59200#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; {59200#true} is VALID [2022-04-07 16:11:06,680 INFO L290 TraceCheckUtils]: 34: Hoare triple {59200#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {59200#true} is VALID [2022-04-07 16:11:06,680 INFO L290 TraceCheckUtils]: 35: Hoare triple {59200#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); {59200#true} is VALID [2022-04-07 16:11:06,680 INFO L290 TraceCheckUtils]: 36: Hoare triple {59200#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; {59200#true} is VALID [2022-04-07 16:11:06,680 INFO L290 TraceCheckUtils]: 37: Hoare triple {59200#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,680 INFO L290 TraceCheckUtils]: 38: Hoare triple {59200#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {59200#true} is VALID [2022-04-07 16:11:06,680 INFO L290 TraceCheckUtils]: 39: Hoare triple {59200#true} ~skip~0 := 0; {59200#true} is VALID [2022-04-07 16:11:06,680 INFO L290 TraceCheckUtils]: 40: Hoare triple {59200#true} assume !false; {59200#true} is VALID [2022-04-07 16:11:06,680 INFO L290 TraceCheckUtils]: 41: Hoare triple {59200#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,680 INFO L290 TraceCheckUtils]: 42: Hoare triple {59200#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,680 INFO L290 TraceCheckUtils]: 43: Hoare triple {59200#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,680 INFO L290 TraceCheckUtils]: 44: Hoare triple {59200#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,680 INFO L290 TraceCheckUtils]: 45: Hoare triple {59200#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,680 INFO L290 TraceCheckUtils]: 46: Hoare triple {59200#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,680 INFO L290 TraceCheckUtils]: 47: Hoare triple {59200#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,680 INFO L290 TraceCheckUtils]: 48: Hoare triple {59200#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,680 INFO L290 TraceCheckUtils]: 49: Hoare triple {59200#true} assume 4384 == #t~mem56;havoc #t~mem56; {59200#true} is VALID [2022-04-07 16:11:06,681 INFO L290 TraceCheckUtils]: 50: Hoare triple {59200#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {59200#true} is VALID [2022-04-07 16:11:06,681 INFO L290 TraceCheckUtils]: 51: Hoare triple {59200#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {59200#true} is VALID [2022-04-07 16:11:06,681 INFO L290 TraceCheckUtils]: 52: Hoare triple {59200#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,681 INFO L290 TraceCheckUtils]: 53: Hoare triple {59200#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,681 INFO L290 TraceCheckUtils]: 54: Hoare triple {59200#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,681 INFO L290 TraceCheckUtils]: 55: Hoare triple {59200#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,681 INFO L290 TraceCheckUtils]: 56: Hoare triple {59200#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {59200#true} is VALID [2022-04-07 16:11:06,681 INFO L290 TraceCheckUtils]: 57: Hoare triple {59200#true} ~skip~0 := 0; {59200#true} is VALID [2022-04-07 16:11:06,681 INFO L290 TraceCheckUtils]: 58: Hoare triple {59200#true} assume !false; {59200#true} is VALID [2022-04-07 16:11:06,681 INFO L290 TraceCheckUtils]: 59: Hoare triple {59200#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,681 INFO L290 TraceCheckUtils]: 60: Hoare triple {59200#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,681 INFO L290 TraceCheckUtils]: 61: Hoare triple {59200#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,681 INFO L290 TraceCheckUtils]: 62: Hoare triple {59200#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,681 INFO L290 TraceCheckUtils]: 63: Hoare triple {59200#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,681 INFO L290 TraceCheckUtils]: 64: Hoare triple {59200#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,681 INFO L290 TraceCheckUtils]: 65: Hoare triple {59200#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,682 INFO L290 TraceCheckUtils]: 66: Hoare triple {59200#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,682 INFO L290 TraceCheckUtils]: 67: Hoare triple {59200#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,682 INFO L290 TraceCheckUtils]: 68: Hoare triple {59200#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,682 INFO L290 TraceCheckUtils]: 69: Hoare triple {59200#true} assume 4400 == #t~mem58;havoc #t~mem58; {59200#true} is VALID [2022-04-07 16:11:06,682 INFO L290 TraceCheckUtils]: 70: Hoare triple {59200#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); {59200#true} is VALID [2022-04-07 16:11:06,682 INFO L290 TraceCheckUtils]: 71: Hoare triple {59200#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; {59200#true} is VALID [2022-04-07 16:11:06,682 INFO L290 TraceCheckUtils]: 72: Hoare triple {59200#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {59200#true} is VALID [2022-04-07 16:11:06,682 INFO L290 TraceCheckUtils]: 73: Hoare triple {59200#true} assume !(~ret~0 <= 0); {59200#true} is VALID [2022-04-07 16:11:06,682 INFO L290 TraceCheckUtils]: 74: Hoare triple {59200#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,682 INFO L290 TraceCheckUtils]: 75: Hoare triple {59200#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,682 INFO L290 TraceCheckUtils]: 76: Hoare triple {59200#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {59200#true} is VALID [2022-04-07 16:11:06,682 INFO L290 TraceCheckUtils]: 77: Hoare triple {59200#true} ~skip~0 := 0; {59200#true} is VALID [2022-04-07 16:11:06,682 INFO L290 TraceCheckUtils]: 78: Hoare triple {59200#true} assume !false; {59200#true} is VALID [2022-04-07 16:11:06,682 INFO L290 TraceCheckUtils]: 79: Hoare triple {59200#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,682 INFO L290 TraceCheckUtils]: 80: Hoare triple {59200#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,682 INFO L290 TraceCheckUtils]: 81: Hoare triple {59200#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,683 INFO L290 TraceCheckUtils]: 82: Hoare triple {59200#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,683 INFO L290 TraceCheckUtils]: 83: Hoare triple {59200#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,683 INFO L290 TraceCheckUtils]: 84: Hoare triple {59200#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,683 INFO L290 TraceCheckUtils]: 85: Hoare triple {59200#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,683 INFO L290 TraceCheckUtils]: 86: Hoare triple {59200#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,683 INFO L290 TraceCheckUtils]: 87: Hoare triple {59200#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,683 INFO L290 TraceCheckUtils]: 88: Hoare triple {59200#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,683 INFO L290 TraceCheckUtils]: 89: Hoare triple {59200#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,683 INFO L290 TraceCheckUtils]: 90: Hoare triple {59200#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {59200#true} is VALID [2022-04-07 16:11:06,683 INFO L290 TraceCheckUtils]: 91: Hoare triple {59200#true} assume 4416 == #t~mem60;havoc #t~mem60; {59200#true} is VALID [2022-04-07 16:11:06,683 INFO L290 TraceCheckUtils]: 92: Hoare triple {59200#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {59200#true} is VALID [2022-04-07 16:11:06,683 INFO L290 TraceCheckUtils]: 93: Hoare triple {59200#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {59200#true} is VALID [2022-04-07 16:11:06,684 INFO L290 TraceCheckUtils]: 94: Hoare triple {59200#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); {59205#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:06,684 INFO L290 TraceCheckUtils]: 95: Hoare triple {59205#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {59205#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:06,685 INFO L290 TraceCheckUtils]: 96: Hoare triple {59205#(= 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); {59205#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:06,685 INFO L290 TraceCheckUtils]: 97: Hoare triple {59205#(= 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; {59205#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:06,685 INFO L290 TraceCheckUtils]: 98: Hoare triple {59205#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {59205#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:06,685 INFO L290 TraceCheckUtils]: 99: Hoare triple {59205#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {59205#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:06,686 INFO L290 TraceCheckUtils]: 100: Hoare triple {59205#(= 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); {59205#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:06,686 INFO L290 TraceCheckUtils]: 101: Hoare triple {59205#(= 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); {59205#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:06,686 INFO L290 TraceCheckUtils]: 102: Hoare triple {59205#(= 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); {59205#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:06,686 INFO L290 TraceCheckUtils]: 103: Hoare triple {59205#(= 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); {59205#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:06,687 INFO L290 TraceCheckUtils]: 104: Hoare triple {59205#(= 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); {59205#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:06,687 INFO L290 TraceCheckUtils]: 105: Hoare triple {59205#(= 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); {59205#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:06,687 INFO L290 TraceCheckUtils]: 106: Hoare triple {59205#(= 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); {59205#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:06,687 INFO L290 TraceCheckUtils]: 107: Hoare triple {59205#(= 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); {59205#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:06,688 INFO L290 TraceCheckUtils]: 108: Hoare triple {59205#(= 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); {59205#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:06,688 INFO L290 TraceCheckUtils]: 109: Hoare triple {59205#(= 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); {59206#(= |ssl3_connect_#t~mem58| 4432)} is VALID [2022-04-07 16:11:06,688 INFO L290 TraceCheckUtils]: 110: Hoare triple {59206#(= |ssl3_connect_#t~mem58| 4432)} assume 4400 == #t~mem58;havoc #t~mem58; {59201#false} is VALID [2022-04-07 16:11:06,688 INFO L290 TraceCheckUtils]: 111: Hoare triple {59201#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); {59201#false} is VALID [2022-04-07 16:11:06,688 INFO L290 TraceCheckUtils]: 112: Hoare triple {59201#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; {59201#false} is VALID [2022-04-07 16:11:06,689 INFO L290 TraceCheckUtils]: 113: Hoare triple {59201#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {59201#false} is VALID [2022-04-07 16:11:06,689 INFO L290 TraceCheckUtils]: 114: Hoare triple {59201#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); {59201#false} is VALID [2022-04-07 16:11:06,689 INFO L290 TraceCheckUtils]: 115: Hoare triple {59201#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {59201#false} is VALID [2022-04-07 16:11:06,689 INFO L290 TraceCheckUtils]: 116: Hoare triple {59201#false} ~skip~0 := 0; {59201#false} is VALID [2022-04-07 16:11:06,689 INFO L290 TraceCheckUtils]: 117: Hoare triple {59201#false} assume !false; {59201#false} is VALID [2022-04-07 16:11:06,689 INFO L290 TraceCheckUtils]: 118: Hoare triple {59201#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); {59201#false} is VALID [2022-04-07 16:11:06,689 INFO L290 TraceCheckUtils]: 119: Hoare triple {59201#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59201#false} is VALID [2022-04-07 16:11:06,689 INFO L290 TraceCheckUtils]: 120: Hoare triple {59201#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59201#false} is VALID [2022-04-07 16:11:06,689 INFO L290 TraceCheckUtils]: 121: Hoare triple {59201#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59201#false} is VALID [2022-04-07 16:11:06,689 INFO L290 TraceCheckUtils]: 122: Hoare triple {59201#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59201#false} is VALID [2022-04-07 16:11:06,689 INFO L290 TraceCheckUtils]: 123: Hoare triple {59201#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59201#false} is VALID [2022-04-07 16:11:06,689 INFO L290 TraceCheckUtils]: 124: Hoare triple {59201#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59201#false} is VALID [2022-04-07 16:11:06,689 INFO L290 TraceCheckUtils]: 125: Hoare triple {59201#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59201#false} is VALID [2022-04-07 16:11:06,689 INFO L290 TraceCheckUtils]: 126: Hoare triple {59201#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59201#false} is VALID [2022-04-07 16:11:06,689 INFO L290 TraceCheckUtils]: 127: Hoare triple {59201#false} assume 4385 == #t~mem57;havoc #t~mem57; {59201#false} is VALID [2022-04-07 16:11:06,689 INFO L290 TraceCheckUtils]: 128: Hoare triple {59201#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {59201#false} is VALID [2022-04-07 16:11:06,690 INFO L290 TraceCheckUtils]: 129: Hoare triple {59201#false} assume !(1 == ~blastFlag~0); {59201#false} is VALID [2022-04-07 16:11:06,690 INFO L290 TraceCheckUtils]: 130: Hoare triple {59201#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {59201#false} is VALID [2022-04-07 16:11:06,690 INFO L290 TraceCheckUtils]: 131: Hoare triple {59201#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {59201#false} is VALID [2022-04-07 16:11:06,690 INFO L290 TraceCheckUtils]: 132: Hoare triple {59201#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {59201#false} is VALID [2022-04-07 16:11:06,690 INFO L290 TraceCheckUtils]: 133: Hoare triple {59201#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {59201#false} is VALID [2022-04-07 16:11:06,690 INFO L290 TraceCheckUtils]: 134: Hoare triple {59201#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); {59201#false} is VALID [2022-04-07 16:11:06,690 INFO L290 TraceCheckUtils]: 135: Hoare triple {59201#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {59201#false} is VALID [2022-04-07 16:11:06,690 INFO L290 TraceCheckUtils]: 136: Hoare triple {59201#false} ~skip~0 := 0; {59201#false} is VALID [2022-04-07 16:11:06,690 INFO L290 TraceCheckUtils]: 137: Hoare triple {59201#false} assume !false; {59201#false} is VALID [2022-04-07 16:11:06,690 INFO L290 TraceCheckUtils]: 138: Hoare triple {59201#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); {59201#false} is VALID [2022-04-07 16:11:06,690 INFO L290 TraceCheckUtils]: 139: Hoare triple {59201#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59201#false} is VALID [2022-04-07 16:11:06,690 INFO L290 TraceCheckUtils]: 140: Hoare triple {59201#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59201#false} is VALID [2022-04-07 16:11:06,690 INFO L290 TraceCheckUtils]: 141: Hoare triple {59201#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59201#false} is VALID [2022-04-07 16:11:06,690 INFO L290 TraceCheckUtils]: 142: Hoare triple {59201#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59201#false} is VALID [2022-04-07 16:11:06,690 INFO L290 TraceCheckUtils]: 143: Hoare triple {59201#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59201#false} is VALID [2022-04-07 16:11:06,690 INFO L290 TraceCheckUtils]: 144: Hoare triple {59201#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59201#false} is VALID [2022-04-07 16:11:06,691 INFO L290 TraceCheckUtils]: 145: Hoare triple {59201#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59201#false} is VALID [2022-04-07 16:11:06,691 INFO L290 TraceCheckUtils]: 146: Hoare triple {59201#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59201#false} is VALID [2022-04-07 16:11:06,691 INFO L290 TraceCheckUtils]: 147: Hoare triple {59201#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {59201#false} is VALID [2022-04-07 16:11:06,691 INFO L290 TraceCheckUtils]: 148: Hoare triple {59201#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {59201#false} is VALID [2022-04-07 16:11:06,691 INFO L290 TraceCheckUtils]: 149: Hoare triple {59201#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {59201#false} is VALID [2022-04-07 16:11:06,691 INFO L290 TraceCheckUtils]: 150: Hoare triple {59201#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {59201#false} is VALID [2022-04-07 16:11:06,691 INFO L290 TraceCheckUtils]: 151: Hoare triple {59201#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {59201#false} is VALID [2022-04-07 16:11:06,691 INFO L290 TraceCheckUtils]: 152: Hoare triple {59201#false} assume 4432 == #t~mem62;havoc #t~mem62; {59201#false} is VALID [2022-04-07 16:11:06,691 INFO L290 TraceCheckUtils]: 153: Hoare triple {59201#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {59201#false} is VALID [2022-04-07 16:11:06,691 INFO L290 TraceCheckUtils]: 154: Hoare triple {59201#false} assume 5 == ~blastFlag~0; {59201#false} is VALID [2022-04-07 16:11:06,691 INFO L290 TraceCheckUtils]: 155: Hoare triple {59201#false} assume !false; {59201#false} is VALID [2022-04-07 16:11:06,692 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-07 16:11:06,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:06,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322690952] [2022-04-07 16:11:06,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322690952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:06,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:06,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:11:06,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266109184] [2022-04-07 16:11:06,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:06,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 156 [2022-04-07 16:11:06,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:06,693 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-07 16:11:06,767 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-07 16:11:06,767 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:11:06,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:06,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:11:06,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:11:06,768 INFO L87 Difference]: Start difference. First operand 867 states and 1225 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-07 16:11:08,786 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-07 16:11:09,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:09,949 INFO L93 Difference]: Finished difference Result 1937 states and 2759 transitions. [2022-04-07 16:11:09,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:11:09,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 156 [2022-04-07 16:11:09,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:09,950 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-07 16:11:09,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-07 16:11:09,951 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-07 16:11:09,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-07 16:11:09,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-07 16:11:10,228 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-07 16:11:10,268 INFO L225 Difference]: With dead ends: 1937 [2022-04-07 16:11:10,268 INFO L226 Difference]: Without dead ends: 1086 [2022-04-07 16:11:10,270 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-07 16:11:10,271 INFO L913 BasicCegarLoop]: 224 mSDtfsCounter, 77 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:10,271 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 537 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 490 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:11:10,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2022-04-07 16:11:10,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 871. [2022-04-07 16:11:10,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:10,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1086 states. Second operand has 871 states, 866 states have (on average 1.4145496535796767) internal successors, (1225), 866 states have internal predecessors, (1225), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:10,290 INFO L74 IsIncluded]: Start isIncluded. First operand 1086 states. Second operand has 871 states, 866 states have (on average 1.4145496535796767) internal successors, (1225), 866 states have internal predecessors, (1225), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:10,290 INFO L87 Difference]: Start difference. First operand 1086 states. Second operand has 871 states, 866 states have (on average 1.4145496535796767) internal successors, (1225), 866 states have internal predecessors, (1225), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:10,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:10,321 INFO L93 Difference]: Finished difference Result 1086 states and 1550 transitions. [2022-04-07 16:11:10,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1550 transitions. [2022-04-07 16:11:10,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:10,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:10,333 INFO L74 IsIncluded]: Start isIncluded. First operand has 871 states, 866 states have (on average 1.4145496535796767) internal successors, (1225), 866 states have internal predecessors, (1225), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1086 states. [2022-04-07 16:11:10,334 INFO L87 Difference]: Start difference. First operand has 871 states, 866 states have (on average 1.4145496535796767) internal successors, (1225), 866 states have internal predecessors, (1225), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1086 states. [2022-04-07 16:11:10,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:10,367 INFO L93 Difference]: Finished difference Result 1086 states and 1550 transitions. [2022-04-07 16:11:10,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1550 transitions. [2022-04-07 16:11:10,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:10,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:10,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:10,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:10,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 866 states have (on average 1.4145496535796767) internal successors, (1225), 866 states have internal predecessors, (1225), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:10,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1229 transitions. [2022-04-07 16:11:10,394 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1229 transitions. Word has length 156 [2022-04-07 16:11:10,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:10,395 INFO L478 AbstractCegarLoop]: Abstraction has 871 states and 1229 transitions. [2022-04-07 16:11:10,395 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-07 16:11:10,395 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1229 transitions. [2022-04-07 16:11:10,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-07 16:11:10,396 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:10,396 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:11:10,396 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-07 16:11:10,396 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:10,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:10,397 INFO L85 PathProgramCache]: Analyzing trace with hash -35280706, now seen corresponding path program 1 times [2022-04-07 16:11:10,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:10,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503030524] [2022-04-07 16:11:10,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:10,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:10,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:10,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {64562#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {64555#true} is VALID [2022-04-07 16:11:10,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {64555#true} assume true; {64555#true} is VALID [2022-04-07 16:11:10,566 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64555#true} {64555#true} #593#return; {64555#true} is VALID [2022-04-07 16:11:10,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {64555#true} call ULTIMATE.init(); {64562#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:11:10,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {64562#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {64555#true} is VALID [2022-04-07 16:11:10,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {64555#true} assume true; {64555#true} is VALID [2022-04-07 16:11:10,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64555#true} {64555#true} #593#return; {64555#true} is VALID [2022-04-07 16:11:10,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {64555#true} call #t~ret158 := main(); {64555#true} is VALID [2022-04-07 16:11:10,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {64555#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; {64555#true} is VALID [2022-04-07 16:11:10,567 INFO L272 TraceCheckUtils]: 6: Hoare triple {64555#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {64555#true} is VALID [2022-04-07 16:11:10,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {64555#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); {64555#true} is VALID [2022-04-07 16:11:10,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {64555#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; {64555#true} is VALID [2022-04-07 16:11:10,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {64555#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; {64555#true} is VALID [2022-04-07 16:11:10,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {64555#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {64555#true} is VALID [2022-04-07 16:11:10,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {64555#true} assume !false; {64555#true} is VALID [2022-04-07 16:11:10,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {64555#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {64555#true} assume 12292 == #t~mem49;havoc #t~mem49; {64555#true} is VALID [2022-04-07 16:11:10,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {64555#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; {64555#true} is VALID [2022-04-07 16:11:10,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {64555#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {64555#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {64555#true} is VALID [2022-04-07 16:11:10,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {64555#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {64555#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); {64555#true} is VALID [2022-04-07 16:11:10,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {64555#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {64555#true} is VALID [2022-04-07 16:11:10,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {64555#true} assume !(0 == ~tmp___4~0); {64555#true} is VALID [2022-04-07 16:11:10,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {64555#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); {64555#true} is VALID [2022-04-07 16:11:10,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {64555#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,568 INFO L290 TraceCheckUtils]: 23: Hoare triple {64555#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {64555#true} is VALID [2022-04-07 16:11:10,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {64555#true} ~skip~0 := 0; {64555#true} is VALID [2022-04-07 16:11:10,568 INFO L290 TraceCheckUtils]: 25: Hoare triple {64555#true} assume !false; {64555#true} is VALID [2022-04-07 16:11:10,568 INFO L290 TraceCheckUtils]: 26: Hoare triple {64555#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,568 INFO L290 TraceCheckUtils]: 27: Hoare triple {64555#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,568 INFO L290 TraceCheckUtils]: 28: Hoare triple {64555#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,568 INFO L290 TraceCheckUtils]: 29: Hoare triple {64555#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,569 INFO L290 TraceCheckUtils]: 30: Hoare triple {64555#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,569 INFO L290 TraceCheckUtils]: 31: Hoare triple {64555#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,569 INFO L290 TraceCheckUtils]: 32: Hoare triple {64555#true} assume 4368 == #t~mem54;havoc #t~mem54; {64555#true} is VALID [2022-04-07 16:11:10,569 INFO L290 TraceCheckUtils]: 33: Hoare triple {64555#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; {64555#true} is VALID [2022-04-07 16:11:10,569 INFO L290 TraceCheckUtils]: 34: Hoare triple {64555#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {64555#true} is VALID [2022-04-07 16:11:10,569 INFO L290 TraceCheckUtils]: 35: Hoare triple {64555#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); {64555#true} is VALID [2022-04-07 16:11:10,569 INFO L290 TraceCheckUtils]: 36: Hoare triple {64555#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; {64555#true} is VALID [2022-04-07 16:11:10,569 INFO L290 TraceCheckUtils]: 37: Hoare triple {64555#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,569 INFO L290 TraceCheckUtils]: 38: Hoare triple {64555#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {64555#true} is VALID [2022-04-07 16:11:10,569 INFO L290 TraceCheckUtils]: 39: Hoare triple {64555#true} ~skip~0 := 0; {64555#true} is VALID [2022-04-07 16:11:10,569 INFO L290 TraceCheckUtils]: 40: Hoare triple {64555#true} assume !false; {64555#true} is VALID [2022-04-07 16:11:10,569 INFO L290 TraceCheckUtils]: 41: Hoare triple {64555#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,569 INFO L290 TraceCheckUtils]: 42: Hoare triple {64555#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,569 INFO L290 TraceCheckUtils]: 43: Hoare triple {64555#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,569 INFO L290 TraceCheckUtils]: 44: Hoare triple {64555#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,570 INFO L290 TraceCheckUtils]: 45: Hoare triple {64555#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,570 INFO L290 TraceCheckUtils]: 46: Hoare triple {64555#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,570 INFO L290 TraceCheckUtils]: 47: Hoare triple {64555#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,570 INFO L290 TraceCheckUtils]: 48: Hoare triple {64555#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,570 INFO L290 TraceCheckUtils]: 49: Hoare triple {64555#true} assume 4384 == #t~mem56;havoc #t~mem56; {64555#true} is VALID [2022-04-07 16:11:10,570 INFO L290 TraceCheckUtils]: 50: Hoare triple {64555#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {64555#true} is VALID [2022-04-07 16:11:10,570 INFO L290 TraceCheckUtils]: 51: Hoare triple {64555#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {64555#true} is VALID [2022-04-07 16:11:10,570 INFO L290 TraceCheckUtils]: 52: Hoare triple {64555#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,570 INFO L290 TraceCheckUtils]: 53: Hoare triple {64555#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,570 INFO L290 TraceCheckUtils]: 54: Hoare triple {64555#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,570 INFO L290 TraceCheckUtils]: 55: Hoare triple {64555#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,570 INFO L290 TraceCheckUtils]: 56: Hoare triple {64555#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {64555#true} is VALID [2022-04-07 16:11:10,570 INFO L290 TraceCheckUtils]: 57: Hoare triple {64555#true} ~skip~0 := 0; {64555#true} is VALID [2022-04-07 16:11:10,570 INFO L290 TraceCheckUtils]: 58: Hoare triple {64555#true} assume !false; {64555#true} is VALID [2022-04-07 16:11:10,570 INFO L290 TraceCheckUtils]: 59: Hoare triple {64555#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,570 INFO L290 TraceCheckUtils]: 60: Hoare triple {64555#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,571 INFO L290 TraceCheckUtils]: 61: Hoare triple {64555#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,571 INFO L290 TraceCheckUtils]: 62: Hoare triple {64555#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,571 INFO L290 TraceCheckUtils]: 63: Hoare triple {64555#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,571 INFO L290 TraceCheckUtils]: 64: Hoare triple {64555#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,571 INFO L290 TraceCheckUtils]: 65: Hoare triple {64555#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,571 INFO L290 TraceCheckUtils]: 66: Hoare triple {64555#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,571 INFO L290 TraceCheckUtils]: 67: Hoare triple {64555#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,571 INFO L290 TraceCheckUtils]: 68: Hoare triple {64555#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,571 INFO L290 TraceCheckUtils]: 69: Hoare triple {64555#true} assume 4400 == #t~mem58;havoc #t~mem58; {64555#true} is VALID [2022-04-07 16:11:10,571 INFO L290 TraceCheckUtils]: 70: Hoare triple {64555#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); {64555#true} is VALID [2022-04-07 16:11:10,571 INFO L290 TraceCheckUtils]: 71: Hoare triple {64555#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; {64555#true} is VALID [2022-04-07 16:11:10,571 INFO L290 TraceCheckUtils]: 72: Hoare triple {64555#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {64555#true} is VALID [2022-04-07 16:11:10,571 INFO L290 TraceCheckUtils]: 73: Hoare triple {64555#true} assume !(~ret~0 <= 0); {64555#true} is VALID [2022-04-07 16:11:10,571 INFO L290 TraceCheckUtils]: 74: Hoare triple {64555#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,571 INFO L290 TraceCheckUtils]: 75: Hoare triple {64555#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,572 INFO L290 TraceCheckUtils]: 76: Hoare triple {64555#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {64555#true} is VALID [2022-04-07 16:11:10,572 INFO L290 TraceCheckUtils]: 77: Hoare triple {64555#true} ~skip~0 := 0; {64555#true} is VALID [2022-04-07 16:11:10,572 INFO L290 TraceCheckUtils]: 78: Hoare triple {64555#true} assume !false; {64555#true} is VALID [2022-04-07 16:11:10,572 INFO L290 TraceCheckUtils]: 79: Hoare triple {64555#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,572 INFO L290 TraceCheckUtils]: 80: Hoare triple {64555#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,572 INFO L290 TraceCheckUtils]: 81: Hoare triple {64555#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,572 INFO L290 TraceCheckUtils]: 82: Hoare triple {64555#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,572 INFO L290 TraceCheckUtils]: 83: Hoare triple {64555#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,572 INFO L290 TraceCheckUtils]: 84: Hoare triple {64555#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,572 INFO L290 TraceCheckUtils]: 85: Hoare triple {64555#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,572 INFO L290 TraceCheckUtils]: 86: Hoare triple {64555#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,572 INFO L290 TraceCheckUtils]: 87: Hoare triple {64555#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,572 INFO L290 TraceCheckUtils]: 88: Hoare triple {64555#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,572 INFO L290 TraceCheckUtils]: 89: Hoare triple {64555#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,572 INFO L290 TraceCheckUtils]: 90: Hoare triple {64555#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {64555#true} is VALID [2022-04-07 16:11:10,572 INFO L290 TraceCheckUtils]: 91: Hoare triple {64555#true} assume 4416 == #t~mem60;havoc #t~mem60; {64555#true} is VALID [2022-04-07 16:11:10,573 INFO L290 TraceCheckUtils]: 92: Hoare triple {64555#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {64555#true} is VALID [2022-04-07 16:11:10,573 INFO L290 TraceCheckUtils]: 93: Hoare triple {64555#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {64555#true} is VALID [2022-04-07 16:11:10,573 INFO L290 TraceCheckUtils]: 94: Hoare triple {64555#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); {64560#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:10,574 INFO L290 TraceCheckUtils]: 95: Hoare triple {64560#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {64560#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:10,574 INFO L290 TraceCheckUtils]: 96: Hoare triple {64560#(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); {64560#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:10,575 INFO L290 TraceCheckUtils]: 97: Hoare triple {64560#(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; {64560#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:10,575 INFO L290 TraceCheckUtils]: 98: Hoare triple {64560#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {64560#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:10,575 INFO L290 TraceCheckUtils]: 99: Hoare triple {64560#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {64560#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:10,576 INFO L290 TraceCheckUtils]: 100: Hoare triple {64560#(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); {64560#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:10,576 INFO L290 TraceCheckUtils]: 101: Hoare triple {64560#(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); {64560#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:10,577 INFO L290 TraceCheckUtils]: 102: Hoare triple {64560#(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); {64560#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:10,577 INFO L290 TraceCheckUtils]: 103: Hoare triple {64560#(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); {64560#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:10,577 INFO L290 TraceCheckUtils]: 104: Hoare triple {64560#(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); {64560#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:10,578 INFO L290 TraceCheckUtils]: 105: Hoare triple {64560#(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); {64560#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:10,578 INFO L290 TraceCheckUtils]: 106: Hoare triple {64560#(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); {64560#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:10,578 INFO L290 TraceCheckUtils]: 107: Hoare triple {64560#(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); {64560#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:10,579 INFO L290 TraceCheckUtils]: 108: Hoare triple {64560#(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); {64560#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:10,579 INFO L290 TraceCheckUtils]: 109: Hoare triple {64560#(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); {64560#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:10,579 INFO L290 TraceCheckUtils]: 110: Hoare triple {64560#(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); {64561#(not (= |ssl3_connect_#t~mem59| 4401))} is VALID [2022-04-07 16:11:10,580 INFO L290 TraceCheckUtils]: 111: Hoare triple {64561#(not (= |ssl3_connect_#t~mem59| 4401))} assume 4401 == #t~mem59;havoc #t~mem59; {64556#false} is VALID [2022-04-07 16:11:10,580 INFO L290 TraceCheckUtils]: 112: Hoare triple {64556#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); {64556#false} is VALID [2022-04-07 16:11:10,580 INFO L290 TraceCheckUtils]: 113: Hoare triple {64556#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; {64556#false} is VALID [2022-04-07 16:11:10,580 INFO L290 TraceCheckUtils]: 114: Hoare triple {64556#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {64556#false} is VALID [2022-04-07 16:11:10,580 INFO L290 TraceCheckUtils]: 115: Hoare triple {64556#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); {64556#false} is VALID [2022-04-07 16:11:10,580 INFO L290 TraceCheckUtils]: 116: Hoare triple {64556#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {64556#false} is VALID [2022-04-07 16:11:10,580 INFO L290 TraceCheckUtils]: 117: Hoare triple {64556#false} ~skip~0 := 0; {64556#false} is VALID [2022-04-07 16:11:10,580 INFO L290 TraceCheckUtils]: 118: Hoare triple {64556#false} assume !false; {64556#false} is VALID [2022-04-07 16:11:10,580 INFO L290 TraceCheckUtils]: 119: Hoare triple {64556#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); {64556#false} is VALID [2022-04-07 16:11:10,580 INFO L290 TraceCheckUtils]: 120: Hoare triple {64556#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {64556#false} is VALID [2022-04-07 16:11:10,580 INFO L290 TraceCheckUtils]: 121: Hoare triple {64556#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {64556#false} is VALID [2022-04-07 16:11:10,581 INFO L290 TraceCheckUtils]: 122: Hoare triple {64556#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {64556#false} is VALID [2022-04-07 16:11:10,581 INFO L290 TraceCheckUtils]: 123: Hoare triple {64556#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {64556#false} is VALID [2022-04-07 16:11:10,581 INFO L290 TraceCheckUtils]: 124: Hoare triple {64556#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {64556#false} is VALID [2022-04-07 16:11:10,581 INFO L290 TraceCheckUtils]: 125: Hoare triple {64556#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {64556#false} is VALID [2022-04-07 16:11:10,581 INFO L290 TraceCheckUtils]: 126: Hoare triple {64556#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {64556#false} is VALID [2022-04-07 16:11:10,581 INFO L290 TraceCheckUtils]: 127: Hoare triple {64556#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {64556#false} is VALID [2022-04-07 16:11:10,581 INFO L290 TraceCheckUtils]: 128: Hoare triple {64556#false} assume 4385 == #t~mem57;havoc #t~mem57; {64556#false} is VALID [2022-04-07 16:11:10,581 INFO L290 TraceCheckUtils]: 129: Hoare triple {64556#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {64556#false} is VALID [2022-04-07 16:11:10,581 INFO L290 TraceCheckUtils]: 130: Hoare triple {64556#false} assume !(1 == ~blastFlag~0); {64556#false} is VALID [2022-04-07 16:11:10,581 INFO L290 TraceCheckUtils]: 131: Hoare triple {64556#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {64556#false} is VALID [2022-04-07 16:11:10,581 INFO L290 TraceCheckUtils]: 132: Hoare triple {64556#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {64556#false} is VALID [2022-04-07 16:11:10,581 INFO L290 TraceCheckUtils]: 133: Hoare triple {64556#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {64556#false} is VALID [2022-04-07 16:11:10,581 INFO L290 TraceCheckUtils]: 134: Hoare triple {64556#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {64556#false} is VALID [2022-04-07 16:11:10,581 INFO L290 TraceCheckUtils]: 135: Hoare triple {64556#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); {64556#false} is VALID [2022-04-07 16:11:10,581 INFO L290 TraceCheckUtils]: 136: Hoare triple {64556#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {64556#false} is VALID [2022-04-07 16:11:10,581 INFO L290 TraceCheckUtils]: 137: Hoare triple {64556#false} ~skip~0 := 0; {64556#false} is VALID [2022-04-07 16:11:10,582 INFO L290 TraceCheckUtils]: 138: Hoare triple {64556#false} assume !false; {64556#false} is VALID [2022-04-07 16:11:10,582 INFO L290 TraceCheckUtils]: 139: Hoare triple {64556#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); {64556#false} is VALID [2022-04-07 16:11:10,582 INFO L290 TraceCheckUtils]: 140: Hoare triple {64556#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {64556#false} is VALID [2022-04-07 16:11:10,582 INFO L290 TraceCheckUtils]: 141: Hoare triple {64556#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {64556#false} is VALID [2022-04-07 16:11:10,582 INFO L290 TraceCheckUtils]: 142: Hoare triple {64556#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {64556#false} is VALID [2022-04-07 16:11:10,582 INFO L290 TraceCheckUtils]: 143: Hoare triple {64556#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {64556#false} is VALID [2022-04-07 16:11:10,582 INFO L290 TraceCheckUtils]: 144: Hoare triple {64556#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {64556#false} is VALID [2022-04-07 16:11:10,582 INFO L290 TraceCheckUtils]: 145: Hoare triple {64556#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {64556#false} is VALID [2022-04-07 16:11:10,582 INFO L290 TraceCheckUtils]: 146: Hoare triple {64556#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {64556#false} is VALID [2022-04-07 16:11:10,582 INFO L290 TraceCheckUtils]: 147: Hoare triple {64556#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {64556#false} is VALID [2022-04-07 16:11:10,582 INFO L290 TraceCheckUtils]: 148: Hoare triple {64556#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {64556#false} is VALID [2022-04-07 16:11:10,582 INFO L290 TraceCheckUtils]: 149: Hoare triple {64556#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {64556#false} is VALID [2022-04-07 16:11:10,582 INFO L290 TraceCheckUtils]: 150: Hoare triple {64556#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {64556#false} is VALID [2022-04-07 16:11:10,582 INFO L290 TraceCheckUtils]: 151: Hoare triple {64556#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {64556#false} is VALID [2022-04-07 16:11:10,582 INFO L290 TraceCheckUtils]: 152: Hoare triple {64556#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {64556#false} is VALID [2022-04-07 16:11:10,583 INFO L290 TraceCheckUtils]: 153: Hoare triple {64556#false} assume 4432 == #t~mem62;havoc #t~mem62; {64556#false} is VALID [2022-04-07 16:11:10,583 INFO L290 TraceCheckUtils]: 154: Hoare triple {64556#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {64556#false} is VALID [2022-04-07 16:11:10,583 INFO L290 TraceCheckUtils]: 155: Hoare triple {64556#false} assume 5 == ~blastFlag~0; {64556#false} is VALID [2022-04-07 16:11:10,583 INFO L290 TraceCheckUtils]: 156: Hoare triple {64556#false} assume !false; {64556#false} is VALID [2022-04-07 16:11:10,583 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-07 16:11:10,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:10,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503030524] [2022-04-07 16:11:10,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503030524] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:10,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:10,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:11:10,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734343267] [2022-04-07 16:11:10,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:10,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 157 [2022-04-07 16:11:10,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:10,585 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-07 16:11:10,649 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-07 16:11:10,649 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:11:10,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:10,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:11:10,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:11:10,650 INFO L87 Difference]: Start difference. First operand 871 states and 1229 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-07 16:11:12,667 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-07 16:11:13,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:13,672 INFO L93 Difference]: Finished difference Result 2085 states and 2956 transitions. [2022-04-07 16:11:13,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:11:13,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 157 [2022-04-07 16:11:13,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:13,673 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-07 16:11:13,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-07 16:11:13,674 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-07 16:11:13,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-07 16:11:13,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 471 transitions. [2022-04-07 16:11:13,964 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-07 16:11:14,013 INFO L225 Difference]: With dead ends: 2085 [2022-04-07 16:11:14,013 INFO L226 Difference]: Without dead ends: 1230 [2022-04-07 16:11:14,014 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-07 16:11:14,015 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 106 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:14,015 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:11:14,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2022-04-07 16:11:14,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 886. [2022-04-07 16:11:14,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:14,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1230 states. Second operand has 886 states, 881 states have (on average 1.4188422247446084) internal successors, (1250), 881 states have internal predecessors, (1250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:14,033 INFO L74 IsIncluded]: Start isIncluded. First operand 1230 states. Second operand has 886 states, 881 states have (on average 1.4188422247446084) internal successors, (1250), 881 states have internal predecessors, (1250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:14,034 INFO L87 Difference]: Start difference. First operand 1230 states. Second operand has 886 states, 881 states have (on average 1.4188422247446084) internal successors, (1250), 881 states have internal predecessors, (1250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:14,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:14,074 INFO L93 Difference]: Finished difference Result 1230 states and 1742 transitions. [2022-04-07 16:11:14,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1742 transitions. [2022-04-07 16:11:14,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:14,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:14,076 INFO L74 IsIncluded]: Start isIncluded. First operand has 886 states, 881 states have (on average 1.4188422247446084) internal successors, (1250), 881 states have internal predecessors, (1250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1230 states. [2022-04-07 16:11:14,076 INFO L87 Difference]: Start difference. First operand has 886 states, 881 states have (on average 1.4188422247446084) internal successors, (1250), 881 states have internal predecessors, (1250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1230 states. [2022-04-07 16:11:14,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:14,133 INFO L93 Difference]: Finished difference Result 1230 states and 1742 transitions. [2022-04-07 16:11:14,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1742 transitions. [2022-04-07 16:11:14,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:14,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:14,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:14,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:14,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 881 states have (on average 1.4188422247446084) internal successors, (1250), 881 states have internal predecessors, (1250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:14,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1254 transitions. [2022-04-07 16:11:14,161 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1254 transitions. Word has length 157 [2022-04-07 16:11:14,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:14,162 INFO L478 AbstractCegarLoop]: Abstraction has 886 states and 1254 transitions. [2022-04-07 16:11:14,162 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-07 16:11:14,162 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1254 transitions. [2022-04-07 16:11:14,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-04-07 16:11:14,163 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:14,163 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:11:14,163 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-07 16:11:14,164 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:14,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:14,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1137385555, now seen corresponding path program 1 times [2022-04-07 16:11:14,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:14,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140592175] [2022-04-07 16:11:14,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:14,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:14,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:14,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {70398#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {70388#true} is VALID [2022-04-07 16:11:14,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {70388#true} assume true; {70388#true} is VALID [2022-04-07 16:11:14,357 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70388#true} {70388#true} #593#return; {70388#true} is VALID [2022-04-07 16:11:14,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {70388#true} call ULTIMATE.init(); {70398#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:11:14,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {70398#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {70388#true} is VALID [2022-04-07 16:11:14,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {70388#true} assume true; {70388#true} is VALID [2022-04-07 16:11:14,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70388#true} {70388#true} #593#return; {70388#true} is VALID [2022-04-07 16:11:14,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {70388#true} call #t~ret158 := main(); {70388#true} is VALID [2022-04-07 16:11:14,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {70388#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; {70388#true} is VALID [2022-04-07 16:11:14,358 INFO L272 TraceCheckUtils]: 6: Hoare triple {70388#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {70388#true} is VALID [2022-04-07 16:11:14,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {70388#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); {70388#true} is VALID [2022-04-07 16:11:14,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {70388#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; {70388#true} is VALID [2022-04-07 16:11:14,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {70388#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; {70388#true} is VALID [2022-04-07 16:11:14,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {70388#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {70388#true} is VALID [2022-04-07 16:11:14,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {70388#true} assume !false; {70388#true} is VALID [2022-04-07 16:11:14,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {70388#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {70388#true} assume 12292 == #t~mem49;havoc #t~mem49; {70388#true} is VALID [2022-04-07 16:11:14,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {70388#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; {70388#true} is VALID [2022-04-07 16:11:14,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {70388#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {70388#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {70388#true} is VALID [2022-04-07 16:11:14,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {70388#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {70388#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); {70388#true} is VALID [2022-04-07 16:11:14,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {70388#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {70388#true} is VALID [2022-04-07 16:11:14,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {70388#true} assume !(0 == ~tmp___4~0); {70388#true} is VALID [2022-04-07 16:11:14,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {70388#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); {70388#true} is VALID [2022-04-07 16:11:14,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {70388#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,359 INFO L290 TraceCheckUtils]: 23: Hoare triple {70388#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {70388#true} is VALID [2022-04-07 16:11:14,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {70388#true} ~skip~0 := 0; {70388#true} is VALID [2022-04-07 16:11:14,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {70388#true} assume !false; {70388#true} is VALID [2022-04-07 16:11:14,359 INFO L290 TraceCheckUtils]: 26: Hoare triple {70388#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,359 INFO L290 TraceCheckUtils]: 27: Hoare triple {70388#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {70388#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {70388#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,359 INFO L290 TraceCheckUtils]: 30: Hoare triple {70388#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,359 INFO L290 TraceCheckUtils]: 31: Hoare triple {70388#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,359 INFO L290 TraceCheckUtils]: 32: Hoare triple {70388#true} assume 4368 == #t~mem54;havoc #t~mem54; {70388#true} is VALID [2022-04-07 16:11:14,359 INFO L290 TraceCheckUtils]: 33: Hoare triple {70388#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; {70388#true} is VALID [2022-04-07 16:11:14,359 INFO L290 TraceCheckUtils]: 34: Hoare triple {70388#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {70388#true} is VALID [2022-04-07 16:11:14,360 INFO L290 TraceCheckUtils]: 35: Hoare triple {70388#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); {70388#true} is VALID [2022-04-07 16:11:14,360 INFO L290 TraceCheckUtils]: 36: Hoare triple {70388#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; {70388#true} is VALID [2022-04-07 16:11:14,360 INFO L290 TraceCheckUtils]: 37: Hoare triple {70388#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,360 INFO L290 TraceCheckUtils]: 38: Hoare triple {70388#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {70388#true} is VALID [2022-04-07 16:11:14,360 INFO L290 TraceCheckUtils]: 39: Hoare triple {70388#true} ~skip~0 := 0; {70388#true} is VALID [2022-04-07 16:11:14,360 INFO L290 TraceCheckUtils]: 40: Hoare triple {70388#true} assume !false; {70388#true} is VALID [2022-04-07 16:11:14,360 INFO L290 TraceCheckUtils]: 41: Hoare triple {70388#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,360 INFO L290 TraceCheckUtils]: 42: Hoare triple {70388#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,360 INFO L290 TraceCheckUtils]: 43: Hoare triple {70388#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,360 INFO L290 TraceCheckUtils]: 44: Hoare triple {70388#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,360 INFO L290 TraceCheckUtils]: 45: Hoare triple {70388#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,360 INFO L290 TraceCheckUtils]: 46: Hoare triple {70388#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,360 INFO L290 TraceCheckUtils]: 47: Hoare triple {70388#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,360 INFO L290 TraceCheckUtils]: 48: Hoare triple {70388#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,360 INFO L290 TraceCheckUtils]: 49: Hoare triple {70388#true} assume 4384 == #t~mem56;havoc #t~mem56; {70388#true} is VALID [2022-04-07 16:11:14,360 INFO L290 TraceCheckUtils]: 50: Hoare triple {70388#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {70388#true} is VALID [2022-04-07 16:11:14,360 INFO L290 TraceCheckUtils]: 51: Hoare triple {70388#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {70388#true} is VALID [2022-04-07 16:11:14,361 INFO L290 TraceCheckUtils]: 52: Hoare triple {70388#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,361 INFO L290 TraceCheckUtils]: 53: Hoare triple {70388#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,361 INFO L290 TraceCheckUtils]: 54: Hoare triple {70388#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,361 INFO L290 TraceCheckUtils]: 55: Hoare triple {70388#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,361 INFO L290 TraceCheckUtils]: 56: Hoare triple {70388#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {70388#true} is VALID [2022-04-07 16:11:14,361 INFO L290 TraceCheckUtils]: 57: Hoare triple {70388#true} ~skip~0 := 0; {70388#true} is VALID [2022-04-07 16:11:14,361 INFO L290 TraceCheckUtils]: 58: Hoare triple {70388#true} assume !false; {70388#true} is VALID [2022-04-07 16:11:14,361 INFO L290 TraceCheckUtils]: 59: Hoare triple {70388#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,361 INFO L290 TraceCheckUtils]: 60: Hoare triple {70388#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,361 INFO L290 TraceCheckUtils]: 61: Hoare triple {70388#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,361 INFO L290 TraceCheckUtils]: 62: Hoare triple {70388#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,361 INFO L290 TraceCheckUtils]: 63: Hoare triple {70388#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,361 INFO L290 TraceCheckUtils]: 64: Hoare triple {70388#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,361 INFO L290 TraceCheckUtils]: 65: Hoare triple {70388#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,361 INFO L290 TraceCheckUtils]: 66: Hoare triple {70388#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,361 INFO L290 TraceCheckUtils]: 67: Hoare triple {70388#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,362 INFO L290 TraceCheckUtils]: 68: Hoare triple {70388#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,362 INFO L290 TraceCheckUtils]: 69: Hoare triple {70388#true} assume 4400 == #t~mem58;havoc #t~mem58; {70388#true} is VALID [2022-04-07 16:11:14,362 INFO L290 TraceCheckUtils]: 70: Hoare triple {70388#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); {70388#true} is VALID [2022-04-07 16:11:14,362 INFO L290 TraceCheckUtils]: 71: Hoare triple {70388#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; {70388#true} is VALID [2022-04-07 16:11:14,362 INFO L290 TraceCheckUtils]: 72: Hoare triple {70388#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {70388#true} is VALID [2022-04-07 16:11:14,362 INFO L290 TraceCheckUtils]: 73: Hoare triple {70388#true} assume !(~ret~0 <= 0); {70388#true} is VALID [2022-04-07 16:11:14,362 INFO L290 TraceCheckUtils]: 74: Hoare triple {70388#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,362 INFO L290 TraceCheckUtils]: 75: Hoare triple {70388#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,362 INFO L290 TraceCheckUtils]: 76: Hoare triple {70388#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {70388#true} is VALID [2022-04-07 16:11:14,362 INFO L290 TraceCheckUtils]: 77: Hoare triple {70388#true} ~skip~0 := 0; {70388#true} is VALID [2022-04-07 16:11:14,362 INFO L290 TraceCheckUtils]: 78: Hoare triple {70388#true} assume !false; {70388#true} is VALID [2022-04-07 16:11:14,362 INFO L290 TraceCheckUtils]: 79: Hoare triple {70388#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,362 INFO L290 TraceCheckUtils]: 80: Hoare triple {70388#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,362 INFO L290 TraceCheckUtils]: 81: Hoare triple {70388#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,362 INFO L290 TraceCheckUtils]: 82: Hoare triple {70388#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,362 INFO L290 TraceCheckUtils]: 83: Hoare triple {70388#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,363 INFO L290 TraceCheckUtils]: 84: Hoare triple {70388#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,363 INFO L290 TraceCheckUtils]: 85: Hoare triple {70388#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,363 INFO L290 TraceCheckUtils]: 86: Hoare triple {70388#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,363 INFO L290 TraceCheckUtils]: 87: Hoare triple {70388#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,363 INFO L290 TraceCheckUtils]: 88: Hoare triple {70388#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,363 INFO L290 TraceCheckUtils]: 89: Hoare triple {70388#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,363 INFO L290 TraceCheckUtils]: 90: Hoare triple {70388#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,363 INFO L290 TraceCheckUtils]: 91: Hoare triple {70388#true} assume 4416 == #t~mem60;havoc #t~mem60; {70388#true} is VALID [2022-04-07 16:11:14,363 INFO L290 TraceCheckUtils]: 92: Hoare triple {70388#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {70388#true} is VALID [2022-04-07 16:11:14,363 INFO L290 TraceCheckUtils]: 93: Hoare triple {70388#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {70388#true} is VALID [2022-04-07 16:11:14,363 INFO L290 TraceCheckUtils]: 94: Hoare triple {70388#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); {70388#true} is VALID [2022-04-07 16:11:14,363 INFO L290 TraceCheckUtils]: 95: Hoare triple {70388#true} assume !(0 == ~tmp___6~0); {70388#true} is VALID [2022-04-07 16:11:14,363 INFO L290 TraceCheckUtils]: 96: Hoare triple {70388#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,363 INFO L290 TraceCheckUtils]: 97: Hoare triple {70388#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {70388#true} is VALID [2022-04-07 16:11:14,363 INFO L290 TraceCheckUtils]: 98: Hoare triple {70388#true} ~skip~0 := 0; {70388#true} is VALID [2022-04-07 16:11:14,364 INFO L290 TraceCheckUtils]: 99: Hoare triple {70388#true} assume !false; {70388#true} is VALID [2022-04-07 16:11:14,364 INFO L290 TraceCheckUtils]: 100: Hoare triple {70388#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,364 INFO L290 TraceCheckUtils]: 101: Hoare triple {70388#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,364 INFO L290 TraceCheckUtils]: 102: Hoare triple {70388#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,364 INFO L290 TraceCheckUtils]: 103: Hoare triple {70388#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,364 INFO L290 TraceCheckUtils]: 104: Hoare triple {70388#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,364 INFO L290 TraceCheckUtils]: 105: Hoare triple {70388#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,364 INFO L290 TraceCheckUtils]: 106: Hoare triple {70388#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,364 INFO L290 TraceCheckUtils]: 107: Hoare triple {70388#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,364 INFO L290 TraceCheckUtils]: 108: Hoare triple {70388#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,364 INFO L290 TraceCheckUtils]: 109: Hoare triple {70388#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {70393#(= |ssl3_connect_#t~mem58| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:14,365 INFO L290 TraceCheckUtils]: 110: Hoare triple {70393#(= |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); {70394#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:14,365 INFO L290 TraceCheckUtils]: 111: Hoare triple {70394#(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); {70394#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:14,365 INFO L290 TraceCheckUtils]: 112: Hoare triple {70394#(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); {70394#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:14,365 INFO L290 TraceCheckUtils]: 113: Hoare triple {70394#(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); {70395#(not (= |ssl3_connect_#t~mem62| 4400))} is VALID [2022-04-07 16:11:14,365 INFO L290 TraceCheckUtils]: 114: Hoare triple {70395#(not (= |ssl3_connect_#t~mem62| 4400))} assume 4432 == #t~mem62;havoc #t~mem62; {70388#true} is VALID [2022-04-07 16:11:14,366 INFO L290 TraceCheckUtils]: 115: Hoare triple {70388#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {70388#true} is VALID [2022-04-07 16:11:14,366 INFO L290 TraceCheckUtils]: 116: Hoare triple {70388#true} assume !(5 == ~blastFlag~0); {70388#true} is VALID [2022-04-07 16:11:14,366 INFO L290 TraceCheckUtils]: 117: Hoare triple {70388#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); {70388#true} is VALID [2022-04-07 16:11:14,366 INFO L290 TraceCheckUtils]: 118: Hoare triple {70388#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,366 INFO L290 TraceCheckUtils]: 119: Hoare triple {70388#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {70388#true} is VALID [2022-04-07 16:11:14,366 INFO L290 TraceCheckUtils]: 120: Hoare triple {70388#true} ~skip~0 := 0; {70388#true} is VALID [2022-04-07 16:11:14,366 INFO L290 TraceCheckUtils]: 121: Hoare triple {70388#true} assume !false; {70388#true} is VALID [2022-04-07 16:11:14,366 INFO L290 TraceCheckUtils]: 122: Hoare triple {70388#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,366 INFO L290 TraceCheckUtils]: 123: Hoare triple {70388#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,366 INFO L290 TraceCheckUtils]: 124: Hoare triple {70388#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,366 INFO L290 TraceCheckUtils]: 125: Hoare triple {70388#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,366 INFO L290 TraceCheckUtils]: 126: Hoare triple {70388#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,366 INFO L290 TraceCheckUtils]: 127: Hoare triple {70388#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,366 INFO L290 TraceCheckUtils]: 128: Hoare triple {70388#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,367 INFO L290 TraceCheckUtils]: 129: Hoare triple {70388#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,367 INFO L290 TraceCheckUtils]: 130: Hoare triple {70388#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,367 INFO L290 TraceCheckUtils]: 131: Hoare triple {70388#true} assume 4385 == #t~mem57;havoc #t~mem57; {70388#true} is VALID [2022-04-07 16:11:14,367 INFO L290 TraceCheckUtils]: 132: Hoare triple {70388#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {70388#true} is VALID [2022-04-07 16:11:14,367 INFO L290 TraceCheckUtils]: 133: Hoare triple {70388#true} assume !(1 == ~blastFlag~0); {70388#true} is VALID [2022-04-07 16:11:14,367 INFO L290 TraceCheckUtils]: 134: Hoare triple {70388#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {70388#true} is VALID [2022-04-07 16:11:14,367 INFO L290 TraceCheckUtils]: 135: Hoare triple {70388#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {70388#true} is VALID [2022-04-07 16:11:14,367 INFO L290 TraceCheckUtils]: 136: Hoare triple {70388#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {70396#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:14,368 INFO L290 TraceCheckUtils]: 137: Hoare triple {70396#(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); {70396#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:14,368 INFO L290 TraceCheckUtils]: 138: Hoare triple {70396#(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); {70396#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:14,368 INFO L290 TraceCheckUtils]: 139: Hoare triple {70396#(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; {70396#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:14,369 INFO L290 TraceCheckUtils]: 140: Hoare triple {70396#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {70396#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:14,369 INFO L290 TraceCheckUtils]: 141: Hoare triple {70396#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {70396#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:14,369 INFO L290 TraceCheckUtils]: 142: Hoare triple {70396#(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); {70396#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:14,369 INFO L290 TraceCheckUtils]: 143: Hoare triple {70396#(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); {70396#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:14,370 INFO L290 TraceCheckUtils]: 144: Hoare triple {70396#(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); {70396#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:14,370 INFO L290 TraceCheckUtils]: 145: Hoare triple {70396#(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); {70396#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:14,370 INFO L290 TraceCheckUtils]: 146: Hoare triple {70396#(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); {70396#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:14,370 INFO L290 TraceCheckUtils]: 147: Hoare triple {70396#(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); {70396#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:14,371 INFO L290 TraceCheckUtils]: 148: Hoare triple {70396#(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); {70396#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:14,371 INFO L290 TraceCheckUtils]: 149: Hoare triple {70396#(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); {70396#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:14,371 INFO L290 TraceCheckUtils]: 150: Hoare triple {70396#(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); {70396#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:14,371 INFO L290 TraceCheckUtils]: 151: Hoare triple {70396#(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); {70396#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:14,371 INFO L290 TraceCheckUtils]: 152: Hoare triple {70396#(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); {70396#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:14,372 INFO L290 TraceCheckUtils]: 153: Hoare triple {70396#(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); {70396#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:14,372 INFO L290 TraceCheckUtils]: 154: Hoare triple {70396#(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); {70396#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:14,372 INFO L290 TraceCheckUtils]: 155: Hoare triple {70396#(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); {70397#(not (= |ssl3_connect_#t~mem62| 4432))} is VALID [2022-04-07 16:11:14,372 INFO L290 TraceCheckUtils]: 156: Hoare triple {70397#(not (= |ssl3_connect_#t~mem62| 4432))} assume 4432 == #t~mem62;havoc #t~mem62; {70389#false} is VALID [2022-04-07 16:11:14,373 INFO L290 TraceCheckUtils]: 157: Hoare triple {70389#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {70389#false} is VALID [2022-04-07 16:11:14,373 INFO L290 TraceCheckUtils]: 158: Hoare triple {70389#false} assume 5 == ~blastFlag~0; {70389#false} is VALID [2022-04-07 16:11:14,373 INFO L290 TraceCheckUtils]: 159: Hoare triple {70389#false} assume !false; {70389#false} is VALID [2022-04-07 16:11:14,373 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 94 proven. 5 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2022-04-07 16:11:14,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:14,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140592175] [2022-04-07 16:11:14,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140592175] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:11:14,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185873158] [2022-04-07 16:11:14,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:14,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:11:14,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:11:14,376 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 16:11:14,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 16:11:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:15,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 1465 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-07 16:11:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:15,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:11:15,400 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-07 16:11:15,400 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-07 16:11:15,405 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-07 16:11:15,410 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-07 16:11:15,420 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